UGC NET JUNE 2013 SYLLABUS, MODEL PAPER/ PREVIOUS YEARS SOLVED QUESTION PAPERS.
UGC NET (NATIONAL ELIGIBILITY TEST) : OLD SOLVED/PREVIOUS EXAM QUESTION PAPERS WITH SOLUTIONS AND EXPLANATIONS AND FREE STUDY MATERIALS.
COMPUTER MEMORY BASED PREVIOUS YEARS SOLVED PAPERS I, II AND III TO PREPARE AND PASS THE UGC NET/SLET ENTRANCE EXAMINATION WITH HIGH PERCENTAGE.
COMPUTER BASIC QUESTIONS FOR BANK EXAM, HTAT, CTAT, TAT, UGC-NET, INTERVIEW AND OTHER EXAM'S, WHERE BASIC QUESTION'S ARE REQUIRED.
1. Which of the following strings is in the language defined by grammar
(A) 01100
(B) 00101
(C) 10011
(D) 11111
2.For a complete graph with N vertices, the total number of spanning trees is given by :
(A) 2N21
(B) NN21
(C) NN22
(D) 2N11
3.The preposition (p q) (~ q p) is equivalent to :
4.The logic of pumping lemma is a good example of :
(A) pigeon hole principle
(B) recursion
(C) divide and conquer technique
(D) iteration
6.The number of 1s present in the binary representation of (3351217364153813)10 is :
(A) 8
(B) 9
(C) 10
(D) 11
7.Which of the following expression removes static hazard from a two level AND - OR
gate implementation of x y1z x
(A) x y1z x
(B) x y1z x 1wyz
(C) x y1z x 1 yz
(D) x y1z x 1wz
8.Which of the following logic has the maximum fan out ?
(A) RTL
(B) ECL
(C) NMOS
(D) CMOS
9.In a weighted code with weight 6, 4, 2, 23 the decimal 5 is represented by :
(A) 0101
(B) 0111
(C) 1011
(D) 1000
10.Upto how many variables, can the Karnaugh map be used ?
(A) 3
(B) 4
C) 5
(D) 6
11.What is the output of the following program segment ?
main ( )
{
int count, digit50;
count51;
while (digit <59) {
printf (%d/n, 11count); 11digit;}
}
(A) 10
(B) 9
(C) 12
(D) 11
12.A static variable is one :
(A) Which cannot be initialized
(B) Which is initialized once at the commencement of execution and cannot be changed at runtime
(C) Which retains its value throughout the life of the program
(D) Which is the same as an automatic variable but is placed at the head of a program
13.If the following loop is implemented
{
int num50;
do
{ - - num; printf (%d, num); num11;}
while (num >50)
}
(A) the loop will run infinitely many times
(B) the program will not enter the loop
(C) there will be compilation error reported
(D) a run time error will be reported
14.# define max (x, y) x5(x > y) ? x : y is a macro definition, which can find the maximum
of two numbers x and y if :
(A)x and y are both integers only
(B)x and y are both declared as float only
(C)x and y are both declared as double only
(D)x and y are both integers, float or double
15.The function sprintf ( ) works like printf ( ), but operates on :
(A) Data in a file
(B) stdrr
(C) stdin
(D) string
16.A relation R5{A, B, C, D, E, F} is given with following set of functional dependencies :
(A) A
(B) AC
(C) AD
(D) None of these
17.Immediate updates as a recovery protocol is preferable, when :
(A) Database reads more than writes
(B) Writes are more than reads
(C) It does not matter as it is good in both the situations
(D) There are only writes
18.Which of the following statement is wrong ?
(A) 2 - phase locking protocol suffers from dead locks
(B) Time - Stamp protocol suffers from more abort
(C) Time stamp protocol suffers from cascading rollbacks where as 2 - phase locking protocol do not
(D) None of these
19.Which data management language component enabled the DBA to define the schema components ?
(A) DML
(B) Subschema DLL
(C) Schema DLL
(D) All of these
20.A subclass having more than one super class is called __________ .
(A) Category
(B) Classification
(C) Combination
(D) Partial participation
21.In the balanced binary tree given below, how many nodes will become unbalanced
when a node is inserted as a child of the node g.
(A) 1
(B) 3
(C) 7
(D) 8
22.Preorder is also known as :
(A) Depth first order
(B) Breadth first order
(C) Topological order
(D) Linear order
23.Which of the following statement is false ?
(A) Every tree is a bipartite graph
(B) A tree contains a cycle
(C) A tree with n nodes contains (n21) edges
(D) A tree is connected graph
24.If the post fix form of a string is ABC12D*, The actual string is :
(A) (A2(B1C))*D
(B) ((A2B)1C)*D
(C) ((A1B)2C)*D
(D) (A1(B2C)*D)
25.Application of data structure queue is :
(A) Levelwise printing of tree
(B) Implementation of priority queues
(C) Function call implementation
(D) Depth first search in a graph
IF YOU FIND ANY ANSWER WRONG,COMMENT ME,SO THAT I RIGHT THAT ANSWER
THANKS
UGC NET (NATIONAL ELIGIBILITY TEST) : OLD SOLVED/PREVIOUS EXAM QUESTION PAPERS WITH SOLUTIONS AND EXPLANATIONS AND FREE STUDY MATERIALS.
COMPUTER MEMORY BASED PREVIOUS YEARS SOLVED PAPERS I, II AND III TO PREPARE AND PASS THE UGC NET/SLET ENTRANCE EXAMINATION WITH HIGH PERCENTAGE.
COMPUTER BASIC QUESTIONS FOR BANK EXAM, HTAT, CTAT, TAT, UGC-NET, INTERVIEW AND OTHER EXAM'S, WHERE BASIC QUESTION'S ARE REQUIRED.
1. Which of the following strings is in the language defined by grammar
S OA, A 1A/0A/1
(A) 01100
(B) 00101
(C) 10011
(D) 11111
2.For a complete graph with N vertices, the total number of spanning trees is given by :
(A) 2N21
(B) NN21
(C) NN22
(D) 2N11
3.The preposition (p q) (~ q p) is equivalent to :
(A) q p
(B) p q
(C) (q p) (p q)
(D) (p q) (q p)
4.The logic of pumping lemma is a good example of :
(A) pigeon hole principle
(B) recursion
(C) divide and conquer technique
(D) iteration
6.The number of 1s present in the binary representation of (3351217364153813)10 is :
(A) 8
(B) 9
(C) 10
(D) 11
7.Which of the following expression removes static hazard from a two level AND - OR
gate implementation of x y1z x
(A) x y1z x
(B) x y1z x 1wyz
(C) x y1z x 1 yz
(D) x y1z x 1wz
8.Which of the following logic has the maximum fan out ?
(A) RTL
(B) ECL
(C) NMOS
(D) CMOS
9.In a weighted code with weight 6, 4, 2, 23 the decimal 5 is represented by :
(A) 0101
(B) 0111
(C) 1011
(D) 1000
10.Upto how many variables, can the Karnaugh map be used ?
(A) 3
(B) 4
C) 5
(D) 6
11.What is the output of the following program segment ?
main ( )
{
int count, digit50;
count51;
while (digit <59) {
printf (%d/n, 11count); 11digit;}
}
(A) 10
(B) 9
(C) 12
(D) 11
12.A static variable is one :
(A) Which cannot be initialized
(B) Which is initialized once at the commencement of execution and cannot be changed at runtime
(C) Which retains its value throughout the life of the program
(D) Which is the same as an automatic variable but is placed at the head of a program
13.If the following loop is implemented
{
int num50;
do
{ - - num; printf (%d, num); num11;}
while (num >50)
}
(A) the loop will run infinitely many times
(B) the program will not enter the loop
(C) there will be compilation error reported
(D) a run time error will be reported
14.# define max (x, y) x5(x > y) ? x : y is a macro definition, which can find the maximum
of two numbers x and y if :
(A)x and y are both integers only
(B)x and y are both declared as float only
(C)x and y are both declared as double only
(D)x and y are both integers, float or double
15.The function sprintf ( ) works like printf ( ), but operates on :
(A) Data in a file
(B) stdrr
(C) stdin
(D) string
16.A relation R5{A, B, C, D, E, F} is given with following set of functional dependencies :
F5{A B, AD C, B F, A E}
Which of the following is candidate key ? (A) A
(B) AC
(C) AD
(D) None of these
17.Immediate updates as a recovery protocol is preferable, when :
(A) Database reads more than writes
(B) Writes are more than reads
(C) It does not matter as it is good in both the situations
(D) There are only writes
18.Which of the following statement is wrong ?
(A) 2 - phase locking protocol suffers from dead locks
(B) Time - Stamp protocol suffers from more abort
(C) Time stamp protocol suffers from cascading rollbacks where as 2 - phase locking protocol do not
(D) None of these
19.Which data management language component enabled the DBA to define the schema components ?
(A) DML
(B) Subschema DLL
(C) Schema DLL
(D) All of these
20.A subclass having more than one super class is called __________ .
(A) Category
(B) Classification
(C) Combination
(D) Partial participation
21.In the balanced binary tree given below, how many nodes will become unbalanced
when a node is inserted as a child of the node g.
(A) 1
(B) 3
(C) 7
(D) 8
22.Preorder is also known as :
(A) Depth first order
(B) Breadth first order
(C) Topological order
(D) Linear order
23.Which of the following statement is false ?
(A) Every tree is a bipartite graph
(B) A tree contains a cycle
(C) A tree with n nodes contains (n21) edges
(D) A tree is connected graph
24.If the post fix form of a string is ABC12D*, The actual string is :
(A) (A2(B1C))*D
(B) ((A2B)1C)*D
(C) ((A1B)2C)*D
(D) (A1(B2C)*D)
25.Application of data structure queue is :
(A) Levelwise printing of tree
(B) Implementation of priority queues
(C) Function call implementation
(D) Depth first search in a graph
IF YOU FIND ANY ANSWER WRONG,COMMENT ME,SO THAT I RIGHT THAT ANSWER
THANKS
0 comments:
Post a Comment