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. T is a graph with n vertices. T is connected and has exactly n-1 edges, then :
(A) T is a tree
(B) T contains no cycles
(C) Every pairs of vertices in T is connected by exactly one path
(D) All of these
2. If the proposition 7P ? Q is true, then the truth value of the proportion 7 PV (P ? Q) is :
(A) True
(B) Multi - Valued
(C) Flase
(D) Can not determined
3. Let A and B be two arbitrary events, then :
(A) P(A n B) = P(A) P (B)
(B) P(P ? B) = P(A) + P (B)
(C) P(A ? B)<=P(A) + P (B)
(D) P(A/B) = P(A n B) + P (B)
4. Which sentence can be generated by S ? d/bA, A ? d/ccA :
(A) bccddd
(B) aabccd
(C) ababccd
(D) abbbd
5. Regular expression a+b denotes the set :
(A) {a}
(B) {e, a, b}
(C) {a, b}
(D) None of these
6. Which of the following is divisible by 4 ?
(A) 100101100
(B)1110001110001
(C)11110011
(D) 10101010101010
7. A half-adder is also known as :
(A)AND Circuit
(B) NAND Circuit
(C) NOR Circuit
(D) EX-OR Circuit
8. Consider the following sequence of instructions :
a=a?b, b=a ? b, a=b ? a This Sequence
(A) retains the value of the a and b
(B) complements the value of a and b
(C) swap a and b
(D) negates values of a and b
9. Consider the following circuit :
to make it a Tautology the "?" should be :
(A) NAND gate
(B) AND gate
(C) OR gate
(D) EX-OR gate
10. When an inventor is placed between both inputs of an S-R flip flop, the resulting flip flop is :
(A) JK flip-flop
(B) D-flip-flop
(C) T flip-flop
(D) None of these
11. What is the output of the following C-program
main () :
{printf(''%d%d%d'', size of (3.14f), size of (3.14), size of (3.141));}
(A) 444
(B) 4 8 10
(C) 848
(D) 888
12. The bitwise OR of 35 with 7 in C will be :
(A) 35
(B) 7
(C) 42
(D) 39
13. Data members and member function of a class by default is respectively :
(A) private and public
(B) public (
(C) public and private
(D) private
14. Function over loading done at :
(A) Runtime
(B) Compile time
(C) Linking time
(D) Switching from function to function
15. What will be the value of i for the following expression :
int f=11, i=3 ;
i+=(f >3) ? i & 2:5 ;
(A) 2
(B) 5
(C) 13
(D) 12
16. A schema describes :
(A) data elements
(B) records and files
(C) record relationship
(D) all of the above
17. One approach to standarolizing storing of data :
(A) MIS
(B) CODASYL
(C) Structured Programing
(D) None of the above
18. In a relational schema, each tuple is divided in fields called :
(A) Relations
(B) Domains
(C) Queries
(D) All the above
19. An embedded printer provides :
(A) Physical record key
(B) An inserted Index
(C) A secondary access path
(D) All the above
20. A locked file can be :
(A) accessed by only one user
(B) modified by users with the correct password
(C) is used to hide sensitive information
(D) both (B) and (C)
21. In what tree, for every node the height of its left subtree and right subtree differ at least by one :
(A) Binary search tree
(B) AVL - tree
(C) Threaded binary tree
(D) Complete tree
22. A hash function f defined as f(key)=key mod 7, with linear probing it is used to insert the key 37,38,72,48,98,11,56 into a table index from 0 to 6. What will be the locations of 11 :
(A) 3
(B) 4
(C) 5
(D) 6
23. Consider the graph, which of the following is a valid topological sorting ?
(A) ABCD
(B) BACD
(C) BADC
(D) ABDC
24. The initial configuration of quaue is a, b, c, d. 'a' is at the front. To get the configuration
d, c, b, a how many deletions and additions required :
(A) 2 deletions, 3 additions
(B) 3 deletions, 2 additions
(C) 3 deletions, 4 additions
(D) 3 deletions, 3 additions
25. Which traversal techniques lists the nodes of a binary search tree in ascending order ?
(A) post - order
(B) in – order
(C) pre - order
(D) linear – order
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. T is a graph with n vertices. T is connected and has exactly n-1 edges, then :
(A) T is a tree
(B) T contains no cycles
(C) Every pairs of vertices in T is connected by exactly one path
(D) All of these
2. If the proposition 7P ? Q is true, then the truth value of the proportion 7 PV (P ? Q) is :
(A) True
(B) Multi - Valued
(C) Flase
(D) Can not determined
3. Let A and B be two arbitrary events, then :
(A) P(A n B) = P(A) P (B)
(B) P(P ? B) = P(A) + P (B)
(C) P(A ? B)<=P(A) + P (B)
(D) P(A/B) = P(A n B) + P (B)
4. Which sentence can be generated by S ? d/bA, A ? d/ccA :
(A) bccddd
(B) aabccd
(C) ababccd
(D) abbbd
5. Regular expression a+b denotes the set :
(A) {a}
(B) {e, a, b}
(C) {a, b}
(D) None of these
6. Which of the following is divisible by 4 ?
(A) 100101100
(B)1110001110001
(C)11110011
(D) 10101010101010
7. A half-adder is also known as :
(A)AND Circuit
(B) NAND Circuit
(C) NOR Circuit
(D) EX-OR Circuit
8. Consider the following sequence of instructions :
a=a?b, b=a ? b, a=b ? a This Sequence
(A) retains the value of the a and b
(B) complements the value of a and b
(C) swap a and b
(D) negates values of a and b
9. Consider the following circuit :
to make it a Tautology the "?" should be :
(A) NAND gate
(B) AND gate
(C) OR gate
(D) EX-OR gate
10. When an inventor is placed between both inputs of an S-R flip flop, the resulting flip flop is :
(A) JK flip-flop
(B) D-flip-flop
(C) T flip-flop
(D) None of these
11. What is the output of the following C-program
main () :
{printf(''%d%d%d'', size of (3.14f), size of (3.14), size of (3.141));}
(A) 444
(B) 4 8 10
(C) 848
(D) 888
12. The bitwise OR of 35 with 7 in C will be :
(A) 35
(B) 7
(C) 42
(D) 39
13. Data members and member function of a class by default is respectively :
(A) private and public
(B) public (
(C) public and private
(D) private
14. Function over loading done at :
(A) Runtime
(B) Compile time
(C) Linking time
(D) Switching from function to function
15. What will be the value of i for the following expression :
int f=11, i=3 ;
i+=(f >3) ? i & 2:5 ;
(A) 2
(B) 5
(C) 13
(D) 12
16. A schema describes :
(A) data elements
(B) records and files
(C) record relationship
(D) all of the above
17. One approach to standarolizing storing of data :
(A) MIS
(B) CODASYL
(C) Structured Programing
(D) None of the above
18. In a relational schema, each tuple is divided in fields called :
(A) Relations
(B) Domains
(C) Queries
(D) All the above
19. An embedded printer provides :
(A) Physical record key
(B) An inserted Index
(C) A secondary access path
(D) All the above
20. A locked file can be :
(A) accessed by only one user
(B) modified by users with the correct password
(C) is used to hide sensitive information
(D) both (B) and (C)
21. In what tree, for every node the height of its left subtree and right subtree differ at least by one :
(A) Binary search tree
(B) AVL - tree
(C) Threaded binary tree
(D) Complete tree
22. A hash function f defined as f(key)=key mod 7, with linear probing it is used to insert the key 37,38,72,48,98,11,56 into a table index from 0 to 6. What will be the locations of 11 :
(A) 3
(B) 4
(C) 5
(D) 6
23. Consider the graph, which of the following is a valid topological sorting ?
(A) ABCD
(B) BACD
(C) BADC
(D) ABDC
24. The initial configuration of quaue is a, b, c, d. 'a' is at the front. To get the configuration
d, c, b, a how many deletions and additions required :
(A) 2 deletions, 3 additions
(B) 3 deletions, 2 additions
(C) 3 deletions, 4 additions
(D) 3 deletions, 3 additions
25. Which traversal techniques lists the nodes of a binary search tree in ascending order ?
(A) post - order
(B) in – order
(C) pre - order
(D) linear – order
THANKS
0 comments:
Post a Comment