Friday 30 April 2021

Doubts and Assignment Questions Discussion





File Handling in C++ Qus - 3

 #include<fstream.h>

#include<iostream.h>

#include<conio.h>

int main()

{

clrscr();

int id;

float salary;

ofstream fout;

fout.open("29AP1.txt",ios::app);

char c='y';

while(c=='y' || c=='Y')

{

cout<<"Enter Your ID"<<endl;

cin>>id;

cout<<"Enter Your Salary"<<endl;

cin>>salary;

fout<<id<<"\t"<<salary<<endl;

cout<<"Continue...."<<endl;

cin>>c;

}

cout<<"File Created"<<endl;

fout.close();

ifstream fin;

fin.open("29AP1.txt",ios::in);

char ch;

cout<<"Content of File"<<endl;

while(!fin.eof())

{

fin.get(ch);

cout<<ch;

}

fin.close();

getch();

}

File Handling in C++ Qus - 2

 #include<fstream.h>

#include<iostream.h>

#include<conio.h>

int main()

{

clrscr();

ofstream fout;

fout.open("29AP1.txt",ios::noreplace);

cout<<"Enter Your ID"<<endl;

int id;

cin>>id;

fout<<id<<endl;

cout<<"File Created"<<endl;

fout.close();

ifstream fin;

fin.open("29AP1.txt",ios::in);

char ch;

cout<<"Content of File"<<endl;

while(!fin.eof())

{

fin.get(ch);

cout<<ch;

}

fin.close();

getch();

}

Thursday 29 April 2021

C++ Programs List - 2



C++ Programs List - 2


Assigning Multiple values to a variable at a time  in C and C++

Dynamic Object and Destructor Calling in C++ Qus - 1

Dynamic Object and Destructor Calling in C++ Qus - 2

Dynamic Memory Allocation in C++ Qus

Dynamic Array in C++

Function Parameter Matching and Function Overloading in C and C++ Qus - 1

Function Parameter Matching and Function Overloading in C and C++ Qus - 2

Function Parameter Matching and Function Overloading in C and C++ Qus - 3

Function Parameter Matching and Function Overloading in C and C++ Qus - 4

Function Parameter Matching and Function Overloading in C and C++ Qus - 5

Function Parameter Matching and Function Overloading in C and C++ Qus - 6

Function Parameter Matching and Function Overloading in C and C++ Qus - 7

Function Parameter Matching and Function Overloading in C and C++ Qus - 8

Function Parameter Matching and Function Overloading in C and C++ Qus - 9

Function Overriding in  C++

Referencing Subclass objects with Subclass and Superclass reference

Virtual Function in C++ Qus - 1

Virtual Function in C++ Qus - 2

Virtual Function in C++ Qus - 3

Virtual with data members, constructor and destructor in C++

Inherit a Class virtually

Virtual Destructor

Pure Virtual Function in C++

Friend Function in C++ Qus - 1

Friend Function in C++ Qus - 2

Friend Function in C++ Qus - 3

Friend Class in C++

main() function as a friend in C++

Aggregation in C++

Inline Function in C++ Qus - 1

Inline Function in C++ Qus - 2

File Handling in C++ Qus - 1

File Handling in C++ Qus - 2

File Handling in C++ Qus - 3

String in C++ Qus - 1

String in C++ Qus - 2

String in C++ Qus - 3

String in C++ Qus - 4

Preprocessor in C++ Qus - 1

Preprocessor in C++ Qus - 2

Preprocessor in C++ Qus - 3


Previous (C and C++ Programs List - 1)







File Handling in C++ Qus - 1

 #include<iostream.h>

#include<fstream.h>

#include<conio.h>

int main()

{

clrscr();

ofstream fout;

fout.open("28AP.txt",ios::out);

fout<<"Hello from File Handling";

fout.close();

cout<<"File Created Successfully"<<endl;

ifstream fin;

fin.open("28AP.txt",ios::in);

char ch;

cout<<"Data of File"<<endl;

while(!fin.eof())

{

//fin>>ch;

fin.get(ch);

cout<<ch;

}

fin.close();

getch();

}

main() function as a friend in C++

 #include<iostream.h>

#include<conio.h>

class A

{

int a, b;

void display()

{

cout<<"Display"<<endl;

}

public:

void display1()

{

cout<<"Display-1"<<endl;

}

friend int main();

};


main()

{

clrscr();

A ob;

ob.display();

ob.a=5;

ob.b=10;

cout<<ob.a+ob.b<<endl;

ob.display1();

getch();

return 0;

}

Aggregation in C++

#include<iostream.h>

#include<conio.h>

class A

{

public:

int a, b;

A()

{

a=5;

b=10;

}

void display()

{

cout<<"Display"<<endl;

}


};


class B

{

public:

int c;

A ob;     //If a class has an object of another class as a Data Member

//It called has-a relationship or aggregation.

void show()

{

//A ob;

cout<<ob.a+ob.b<<endl;

c=11;

cout<<c<<endl;

ob.display();

}

};

main()

{

clrscr();

B ob;

ob.show();

getch();

return 0;

}

Friend Class in C++

 #include<iostream.h>

#include<conio.h>

class A

{

int a, b;

void display()

{

cout<<"Display"<<endl;

}

public:

void display1()

{

cout<<"Display-1"<<endl;

}

friend class B;

};


class B

{

public:

void show()

{

cout<<"Show of B:"<<endl;

A ob;

ob.display();

ob.display1();

ob.a=5;

ob.b=10;

cout<<ob.a+ob.b<<endl;


}

};

main()

{

clrscr();

B ob;

ob.show();

getch();

return 0;

}

Friend Function in C++ Qus - 3

 #include<iostream.h>

#include<conio.h>

class A

{

int a, b;

void display()

{

cout<<"Display"<<endl;

}

public:

void display1()

{

cout<<"Display-1"<<endl;

}

friend void show();


};


void show()

{

A ob;

ob.display();

ob.display1();

ob.a=5;

ob.b=10;

cout<<ob.a+ob.b<<endl;

}


main()

{

clrscr();

show();

getch();

return 0;

}

Practice and Doubts Set - 1

1.)          Which of these expressions will make the rightmost set bit zero in an input integer x?

A).    x = x | (x-1)

B).    x = x & (x-1)

C).    x = x | (x+1)

D).   x = x & (x+2)

2.)          Which of these expressions will isolate the rightmost set bit?

A).    x = x & (~x)

B).    x = x ^ (~x)

C).    x = x & (-x)

D).   x = x ^ (-x)

3.)          Applications like Banking and reservations require which type of OS?

A).    Real Time

B).    Hard Real Time

C).    Soft Real Time

D).   None of the above

4.)          Throughput of a multiprogramming OS that processes n programs over the period of time that starts t0 and ends at tf is

A).    (tf-t0)/n

B).    tf*n/t0 

C).    n/(tf-t0)

D).   n*tf*t0 

E).    None of these

5.)          What in multiprogramming OS provides a foolproof method of implementing memory protection to avoid program interference?

A).    Privileged mode

B).    Memory Protection

C).    Both of Them

D).   None of These

6.)          Restricting the child process to a subset of the parent’s resources prevents any process from __________

A).    Overloading the system by using a lot of secondary storage

B).    Under-loading the system by very less CPU utilization

C).    Overloading the system by creating a lot of sub-processes

D).   Crashing the system by utilizing multiple resources

7.)          Which of the following need not necessarily be saved on a context switch between processes?

A).    General purpose registers

B).    Translation Look-Aside buffer

C).    Program counter

D).   All of the mentioned

8.)          Bounded capacity and Unbounded capacity queues are referred to as __________

A).    Programmed buffering

B).    Automatic buffering

C).    User defined buffering

D).   No buffering

 

 







Answer and Explanation:

Qus : 1

(B)

Qus : 2

(C)

Qus : 3

(C)

Types of Real Time OS

Hard Real Time System (HRTS) and Soft Real Time System (SRTS)

When deadlines are absolute, Real Time Systems are called Hard Real Time Systems. The tasks in HRTS are governed by rigid time constraints. When the deadlines are relaxed, Real Time System is called Soft Real Time System. Tasks in SRTS do not have rigid time constraints.

Hard Real Time Operating Systems necessarily perform the task within the given specified deadline. A formal guarantee of always meeting the hard deadline is required. Examples include air traffic control, vehicle subsystems control and Nuclear power plant control.

Soft Real Time Operating Systems are the RTOS that perform task almost in the specified deadline. They do not guarantee a hard deadline. Task can be performed even after the time has elapsed. Examples of Soft Time Operating Systems include multimedia transmission and reception, networking, telecom (cellular) networks, web sites and services and computer games.

Qus : 4

(C)

Throughput of multiprogramming OS is the ratio of the no. of programs/processes processed and total time taken to process them. Throughput = n / (tf-t0)

Turnaround time is the time taken to complete a process i.e. TAT= (tf-t0) / n

Qus : 5

(C)

Privileged and Non-Privileged Mode in OS

Privileged or kernel mode is the processing mode that allows code to have direct access to all hardware and memory in the system. Kernel mode means when any process or program wants to use any functionality controlled by Operating System, so in that case, we make a system call to execute any particular set of instructions stored in O.S. So these set of instructions are executed in Kernel mode.

The Instructions that can run only in Kernel Mode are called Privileged Instructions.

Super user mode means a root user or administrative user who has all the permissions to run or execute any program in the O.S.

The Instructions that can run only in User Mode are called Non-Privileged Instructions.

Qus : 6

(C)

A process creates a child process; child process requires certain resources to complete its task. A child process can demand required resources directly from the system, but by doing this system will be overloaded. So to avoid overloading of the system, the parent process shares its resources among children.

Qus – 7

(B)

Translation Look-aside Buffer (TLB) need not necessarily be saved on a context switch between processes. A special, small, fast-lookup hardware cache is called Translation Look-aside Buffer. TLB used to reduce memory access time.

Qus – 8

(B)

Bounded capacity and Unbounded capacity queues are referred to as Automatic buffering. Buffer capacity of the Bounded capacity queue is finite length and buffer capacity of the Unbounded queue is infinite.

Buffer is a region of memory used to temporarily hold data while it is being moved from one place to another. A buffer is used when moving data between processes within a computer.

 

What is Buffering?

In Buffering, whether the communication is direct or indirect, message exchanged by communicating processes reside in a temporary queue.

Types of Buffering:

Zero Capacity –

This queue cannot keep any message waiting in it. Thus it has maximum length 0. For this, a sending process must be blocked until the receiving process receives the message. It is also known as no buffering.

Bounded Capacity –

This queue has finite length n. Thus it can have n messages waiting in it. If the queue is not full, new message can be placed in the queue, and a sending process is not blocked. It is also known as automatic buffering.

Unbounded Capacity –

This queue has infinite length. Thus any number of messages can wait in it. In such a system, a sending process is never blocked.


Monday 26 April 2021

Virtual Destructor in C++

 #include<iostream.h>

#include<conio.h>

class A

{

public:

A()

{

 cout<<"C-A"<<endl;

}

virtual ~A()

{

cout<<"D-A"<<endl;

}

};

class B:public A

{

public:

B()

{

cout<<"C-B"<<endl;

}

~B()

{

cout<<"D-B"<<endl;

}


};

int main()

{

clrscr();

{

A *a=new B;

/*

A *a;

B b;

a=&b;

*/

delete a;

}

getch();


}

Inherit a class virtually in C++

 #include<iostream.h>

#include<conio.h>

class A

{

public:

 A()

 {

 cout<<"C-A"<<endl;

 }


};

class B

{

public:

B()

{

cout<<"C-B"<<endl;

}


};


class C:  A, virtual B

{

public:

C()

{

cout<<"C-C"<<endl;

}


};



int main()

{

clrscr();

C ob;


getch();

return 0;


}


Output:

C-B

C-A

C-C

Virtual with data members, constructor and destructor in C++

 #include<iostream.h>

#include<conio.h>

class A

{

 public:

 int a;  //Virtual can not be used with data members

 A()      //constructor can not be virtual

 {

 a=10;

 }

virtual ~A(){}     //Desct can be virtual

};

class B : public A

{

 public:

 int a;

 B()

 {

  a=5;

 }


};

int main()

{

clrscr();

B b;

cout<<b.a<<endl;


A *a1=new B();

cout<<a1->a<<endl;

B *b1=new B();

cout<<b1->a<<endl;

getch();

return 0;

}

Virtual Function in C++ Qus - 3

 #include<iostream.h>

#include<conio.h>

class A

{

public:


virtual void show()

{

cout<<"Hello"<<endl;

}

void show1()

{

cout<<"show-1"<<endl;

}

};

class B:public A  //public visibility mode of inhe.

{

public:

  void show()

  {

  cout<<"India"<<endl;

  }

  void display()

  {

  cout<<"Display"<<endl;

  }

};

int main()

{

clrscr();

A *a1=new B;    //Super class or base class pointer can point subclass object

a1->show();


A *a;

B b;

a=&b;

a->show();

//a->display();

a->show1();

B *b1=new B;

b1->show();

b1->show1();

b1->display();

getch();

return 0;


}

Inline Function of a class in C++ Qus: 2

 Inline function and classes in C++:


All the functions defined inside the class are implicitly inline. 



class A

{

public:

    inline int square(int a) 

    {

       return a*a;

    }

};

int main() {

    A ob;

   cout<<ob.square(6);

}



Explicitly Defined:


class A

{

public:

    int square(int a) ;

    

};


inline int A:: square(int a)

{

     return a*a;

}

int main() {

    A ob;

   cout<<ob.square(6);

}

Inline Function in C++ Qus - 1

 C++ provides an inline functions to reduce the function call overhead. Inline function is a function that is expanded in line when it is called. When the inline function is called whole code of the inline function gets inserted or substituted at the point of inline function call. This substitution is performed by the C++ compiler at compile time. 

inline return-type function-name(parameters)

{

    // function code

}  

Inlining is only a request to the compiler, not a command. Compiler can ignore the request for inlining. Compiler may not perform inlining in following conditions:

1) If a function contains a loop. (for, while, do-while)

2) If a function contains static variables.

3) If a function is recursive.

4) If a function return type is other than void, and the return statement doesn’t exist in function body.

5) If a function contains switch or goto statement.

Inline function may increase compile time overhead if someone changes the code inside the inline function then all the calling location has to be recompiled because compiler would require to replace all the code once again to reflect the changes, otherwise it will continue with old functionality.


inline int square(int a)

{

  return a*a;

}

int main() {

  clrscr();

cout<<square(5)<<endl;

cout<<square(6)<<endl;

getch();

}




Referencing Subclass objects with Subclass and Superclass reference in C++ Qus - 1

  class A


{


public:

  

  void show()


  {


      cout<<"Hello"<<endl;


  }


};

class B: public A           //Inheritance Visibility Mode must be public for this qus


{


    public:


     void show()


  {


      cout<<"India"<<endl;


  }


   };


int main() {


    B *b=new B;


    b->show();


    A *b1=new B;


     b1->show();


   //  B *b1=new A;

 //Error -  Derived class pointer object cannot point to a base class object, Derived class pointer cannot point to base class.


}




Output:


India


Hello


Note:

//Super class or base class pointer can point subclass object

//Subclass dynamic or pointer object can not point to the base class object. Subclass pointer can not point to base class


Friend Function in C++ Qus - 2

  class A

{

  private:

  int a;

  void display()

  {

      a=10;

      cout<<"Display"<<endl;

  }

  friend void show();

};


void show()

{

    A ob;

    cout<<ob.a<<endl;

    ob.display();

     cout<<ob.a<<endl;

}

int main() {

   show();

}



Output


Garbage Value

Display

10

Friend Function in C++ Qus - 1

 

class A

{

  private:

  int a;

  A():a(10)

  {

      

  }

  friend void show();

};


void show()

{

    A ob;

    cout<<ob.a;

}

int main() {

   show();

}



Pure Virtual Function in C++

  • A class containing the pure virtual function cannot be used to declare the objects of its own, such classes are known as abstract base classes.
  • Pure virtual function can be defined as:
  • virtual void show() = 0;   

 

#include <iostream>


using namespace std;

class A

{

public:

   

 virtual void show()=0;

 

  

};


class B: public A

{

    public:

   

   void show()

  {

    

      cout<<"India"<<endl;

  }

    

 

};

int main() {

 

    A *a;  

    B b;  

    a = &b;  

   a->show();  

//   A a1;   Error

//A *a2=new A;  Error

    return 0;  

 

 

}

Virtual Function in C++ Qus - 2

Consider the situation when we don't use the virtual keyword.

 


class A

{

public:

   

void show()

  {

    

      cout<<"Hello"<<endl;

  }

  

};


class B: public A

{

    public:

   

   void show()

  {

    

      cout<<"India"<<endl;

  }

    

 

};

int main() {

 

    A *a;  

    B b;  

    a = &b;  

   a->show();  

    return 0;  

 

 

}


Output:

Hello


Now, when we  use the virtual keyword.


class A

{

public:

   

 virtual void show()

  {

    

      cout<<"Hello"<<endl;

  }

  

};


class B: public A

{

    public:

   

   void show()

  {

    

      cout<<"India"<<endl;

  }

    

 

};

int main() {

 

    A *a;  

    B b;  

    a = &b;  

   a->show();  

    return 0;  

 

 

}


Output:

India

Virtual Function in C++ Qus - 1

 class A

{

public:

   

 virtual void show()

  {

    

      cout<<"Hello"<<endl;

  }

  

};


class B: public A

{

    public:

   

   void show()

  {

    

      cout<<"India"<<endl;

  }

    

 

};

int main() {

    B *b=new B;

    b->show();

    A *b1=new B;

     b1->show();

 

}



Output:


India

Hello

सत्यनिष्ट बनिए

 इमानदारी अपने आप में एक ब्रांड होती है | आज के समय में 90% इमानदार नहीं है , जिसको जहा  लाभ  के लिए जिसको भी धोखा देने लूटने का मौका मिलता है वो लूटता है |

पर एक बात समझनी चाहिए कोई कितना भी बड़ा नीच, धोकेबाज, बईमान क्यों न हो , वो भी अपना लेन देन किसी इमानदार व्यक्ति के साथ ही करना चाहता है |

अगर आप बेईमान है तो आप हर कदम पर अपने दुश्मन बढाते जाते है, अगर इमानदार है तो दोस्त बनाते है |

बेईमानी शोर्ट टर्म तो फायदा देती है पर लॉन्ग टर्म में हमेशा नुक्सान | इमानदारी शोर्ट टर्म में नुक्सान दे सकती है पर लॉन्ग टर्म में हमेशा लाभ ही देती है |

अगर आप व्यापारी है, तो इमानदारी ही आपकी सबसे बड़ी पूंजी होती है | आपका व्यापर कितना लम्बा चलेगा वो इसी पूंजी पर निर्भर करता है |

सत्यनिष्ट बनिए 

बड़ी विडम्बना है

 हर व्यक्ति चाहता है की उसके पास जो जमीन, प्लाट, प्रॉपर्टी, सोना है उसकी कीमत बढती ही जाए |


किसान चाहता है की उसके उगाये हुए फल सब्जी अनाज की कीमत बढे |


डॉक्टर, वकील  चाहते है की उनकी फीस बढे 


गाडिया बनाने वाले चाहते है गाडियों की कीमत बढे 


कपडे बेचने वाले चाहते है कपडे महगे बिके |


चाहे कोई भी उत्पाद हो, कोई भी सेवा हो , उससे जुड़ा हुआ हर व्यक्ति येही चाहता  है की कीमत बढती रहे |


पर सब महगाई पर रोते भी  है |


येही माया है , सब चाहते है और इसी प्रयास में लगे रहते है उनसे जुडी हुई हर चीज महगी होती रहे और बाकी सब सस्ता |


बड़ी विडम्बना है 

Function overriding in C++

 #include<iostream.h>

#include<conio.h>

class A

{

public:

void show()

{

cout<<"Show-A"<<endl;

}

void display()

{

cout<<"Display"<<endl;

}

};

class B : public A

{

public:

void show()

{

cout<<"Show-B"<<endl;

}

};

int main()

{

clrscr();

B b;

b.show();

A a;

a.show();


b.display();

getch();

return 0;

}

Function Parameter Matching and Overloading Qus - 9

 #include<iostream.h>

#include<conio.h>

void show(char a)

{

cout<<"char - "<<a<<endl;

}

void show(float a)

{

cout<<"float - "<<a<<endl;

}

int main()

{

clrscr();

show('k');

//show(5);      //ambiguity

//show(6.5);    //ambiguity

show((float)6.5);

getch();

return 0;


}

Function Parameter Matching and Overloading Qus - 8

 #include<iostream.h>

#include<conio.h>

void show(float a)

{

cout<<"float - "<<a<<endl;

}

void show(double a)

{

cout<<"double - "<<a<<endl;

}

int main()

{

clrscr();

//show(5);     //coversion - abmiguity(float,double)

//show('k');  // ""

show(6.7);  //double

show((float)6.7);

show((double)5);

show((float)5);

float f=8.5;

show(f);

double f1=9.6;

show(f1);

//show();      //No Match - Error

getch();

return 0;


}

Function Parameter Matching and Overloading Qus - 7

 #include<iostream.h>

#include<conio.h>

void show(int a)

{

cout<<"int - "<<a<<endl;

}

void show(double a)

{

cout<<"double - "<<a<<endl;

}

int main()

{

clrscr();

show(5);     //Exact Match

show('k');  //promotion

show(6.7);  //promotion

//show();      //No Match - Error

getch();

return 0;


}

Function Parameter Matching and Overloading Qus - 6

 #include<iostream.h>

#include<conio.h>

void show(int a)

{

cout<<"int - "<<a<<endl;

}

void show(float a)

{

cout<<"float - "<<a<<endl;

}

int main()

{

clrscr();

show(5);     //Exact Match

show('k');  //promotion

//show(6.7);  //coversion - abmiguity (int, float)

show((float)6.7);

show((int)6.7);

//show();      //No Match - Error

getch();

return 0;


}

Function Parameter Matching and Overloading Qus - 5

 #include<iostream.h>

#include<conio.h>

void show(int a)

{

cout<<"int - "<<a<<endl;

}

void show(char a)

{

cout<<"char - "<<a<<endl;

}

int main()

{

clrscr();

show(5);     //Exact Match

show('k');  //Exact

//show(6.7);  //coversion   - Ambiguity

//show();      //No Match - Error

getch();

return 0;


}

Function Parameter Matching and Overloading Qus - 4

 #include<iostream.h>

#include<conio.h>

void show(double a)

{

cout<<"double - "<<a<<endl;

}

int main()

{

clrscr();

show(5);     //conversion

show('k');  //coversion

show(6.7);  //promotion

//show();      //No Match - Error

getch();

return 0;


}

Function Parameter Matching and Overloading Qus - 3

 #include<iostream.h>

#include<conio.h>

void show(float a)

{

cout<<"float - "<<a<<endl;

}

int main()

{

clrscr();

show(5);     //conversion

show('k');  //conversion

show(6.7);  //Exact Match

//show();      //No Match - Error

getch();

return 0;


}

Function Parameter Matching and Overloading Qus - 2

 #include<iostream.h>

#include<conio.h>

void show(char a)

{

cout<<"char - "<<a<<endl;

}

int main()

{

clrscr();

show(65);     //Conversion

show('k');  //Exact Match

show(66.7);  //coversion

//show();      //No Match - Error

getch();

return 0;


}

Function Parameter Matching and Overloading Qus - 1

 #include<iostream.h>

#include<conio.h>

void show(int a)

{

cout<<"int - "<<a<<endl;

}

int main()

{

clrscr();

show(5);     //Exact Match

show('k');  //promotion

show(6.7);  //coversion

//show();      //No Match - Error

getch();

return 0;


}

Sunday 25 April 2021

25 April 2021 OS Test Result

 

S.No.

Name

Marks

1

Pooja Chaudhary

47

2

Ankur Bhardwaj

44

3

Meera Yadav

43

4

Pritam Kumari

42

5

Priyanka Arora

42

6

Sushmita Singh

41

7

Deepali Dhankar

40

8

Karan Kumar

40

9

Niharika Singh

40

10

Pinki Rani

40

11

Suruchi Sethi

40

12

Jyoti Antil

39

13

Mamta Mourya

39

14

Manish Garg

39

15

Priyanka Yadav

39

16

Salvi Vatsa

39

17

Sandeep Kumar

39

18

Artee Sikarwar

38

19

Aaaaa Aaaaa

37

20

Sameer Kumar

37

21

Ashish Swami

36

22

Anjali Kadian

35

23

Lovely Verma

35

24

Manasi Adhikary

35

25

Sagar Yadav

35

26

Vikas Patel

35

27

Aarti Choudhary

34

28

Priya Chaurasia

34

29

Vibha Sharma

34

30

Bhagwana Meghwal

33

31

Rakesh Dhankhar

33

32

Shivani Singh

33

33

Govind Yadav

32

34

Jyoti Satija

32

35

Kavita Devi

32

36

Poonam Yadav

32

37

Sonika Beniwal

32

38

Harshita Kaushik

31

39

Mittu Sharma

31

40

Rahul Singhal

31

41

Shubham Bhardwaj

31

42

Annu Maan

30

43

Piyush Kumar

30

44

Richa Dubey

30

45

Sandeep Kumar

30

46

Anuj Kashyap

29

47

Chirag Kashyap

29

48

Gopal Sharma

29

49

Mukesh Roy

29

50

Poonam Yadav

29

51

Priyanka Soni

29

52

Ravi Kumar

29

53

Rohit Sharma

29

54

Amrik Goswamy

28

55

Jyoti Lamba

28

56

Jyoti Malik

28

57

Manoj Kumar

28

58

Pragati Jakhar

28

59

Ankur Gahlawat

27

60

Divya .. ..

27

61

Himanshu

27

62

Md Tehran

27

63

Pratiksha Shendge

27

64

Suhail Malik

27

65

Monika Bhabla

26

66

Monika Yadav

26

67

Rajesh Kumar

26

68

Rohit Kumar

26

69

Divya Mishra

25

70

Nisha Duhan

25

71

Ranjeet Yadav

25

72

Sandeep Bhadu

24

73

Shahib

24

74

Vinay Sharma

24

75

Gaurav Gahlot

23

76

Shalu Pal

23

77

Vipin Kumar

23

78

Yash Sharma

23

79

Hemant Kumar Singh

22

80

Jitender

22

81

Preeti Kataria

22

82

Manu Raghav

21

83

Pragati Singh

21

84

Anil Yadav

20

85

Chandan

20

86

Jagjeet Singh

20

87

Jeevan

20

88

Pragya Sharma

20

89

Preeti Bankura

20

90

Akshay Sharma

19

91

Dilip Gupta

19

92

Janisar Akhter

19

93

Monika Malik

19

94

Ajay Kumar

18

95

Sunny Giri

18

96

Anjali Maan

17

97

Lalit Gupta

17

98

Satyam

17

99

Vijay Kharb

17

100

Ankit Pandey

16

101

Sanjay

16

102

Sanjeev

16

103

Shehbaz

16

104

Ajay Gupta

15

105

Sandhya Sandhya

15

106

Jeet Meena Meena

14

107

Anupama Jena

10