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 regular expressions corresponds to this grammar ?
S → AB/AS, A → a/aA, B → b
(A) aa*b+
(B) aa*b
(C) (ab)*
(D) a(ab)*
2. The proposition ~ q ∨ p is equivalent to :
(A) (B) (C) (D)
3. The number of edges in a complete graph with N vertices is equal to :
(A) N (N−1)
(B) 2N−1
(C) N−1
(D) N(N−1)/2
5. If (a**2−b**2) is a prime number where a and b belongs to N, then :
(A) a **2−b**2=3
(B) a**2−b**2=a−b
(C) a**2−b**2=a+b
(D) a**2−b**2=5
6. The hexadecimal equivalent of (10111)2×(1110)2 is :
(A) 150
(B) 241
(C) 142
(D) 101011110
7. An example of a self complementing code is :
(A) 8421 code
(B) Gray code
(C) Excess-3 code
(D) 7421 code
8. A sum of products expression can be implemented with __________ logic gates.
(A) AND − OR
(B) NAND − OR
(C) AND − NOT
(D) OR − AND
9. The characteristic equation of the D flip-flop is :
(A)
(B) Q=D
(C) Q=1
(D) Q=0
10. Which of the following logic is the fastest ?
(A) RTL
(B) ECL
(C) HTL
(D) HCL
11. When a function is recursively called, all automatic variables :
(A) are initialized during each execution of the function
(B) are retained from the last execution
(C) are maintained in a stack
(D) are ignored
12. Enumeration variables can be used in :
(A) search statement like an integer variable
(B) break statement
(C) preprocessor commands
(D) function statement
13. int arr[ ]={1, 2, 3, 4}
int count;
incr( ) {return ++count;}
main( )
{
arr[count ++]=incr( );
printf(“arr[count]=%d\n”, arr[count]);
}
The value printed by the above program is :
(A) 1
(B) 2
(C) 3
(D) 4
14. When one-dimensional character array of unspecified length is assigned an initial value :
(A) an arbitrary character is automatically added to the end of the string
(B) ‘o’ is added to the end of the string
(C) length of the string is added to the end of the string
(D) ‘end’ is added to the end of the string
15. The declaration “unsigned u” indicates :
(A) u is an unsigned character
(B) u is an unsigned integer
(C) u is a character
(D) u is a string
16. Which possibility among the following is invalid in case of a Data Flow Diagram ?
(A) A process having in-bound data flows more than out-bound data flows
(B) A data flow between two processes
(C) A data flow between two data stores
(D) A data store having more than one in-bound data flows
NOTE: Move mouse over your answer to see your answer is right or wrong.
17. In DBMS, deferred update means :
(A) All the updates are done first but the entries are made in the log file later
(B) All the log files entries are made first but the actual updates are done later
(C) Every update is done first followed by a writing on the log file
(D) Changes in the views are deferred till a query asks for a view
18. Which statement is false regarding data independence ?
(A) Hierarchical data model suffers from data independence
(B) Network model suffers from data independence
(C) Relational model suffers only from logical data independence
(D) Relational model suffers only from physical data independence
ANS TELL ME.
19. Which of the following tools is not required during system analysis phase of system development life cycle ?
(A) Case tool
(B) RAD tool
(C) Reverse engineering
(D) None of these
ANS TELL ME.
20. Two phase protocol in a database management system is :
(A) a concurrency mechanism that is not deadlock free
(B) a recovery protocol used for restoring a database after a crash
(C) Any update to the system log done in 2-phases
(D) not effective in Database
21. Which algorithm has same average, worst case and best case time ?
(A) Binary search
(B) Maximum of n number
(C) Quick sort
(D) Fibonacci search
22. Binary search tree is an example of :
(A) Divide and conquer technique
(B) Greedy algorithm
(C) Back tracking
(D) Dynamic Programming
23. What is the time required to insert an element in a stack with linked implementation ?
(A) O (log2n)
(B) O (n)
(C) O (n log2n)
(D) O (1)
The equivalent postfix expression for d/(e+f) +b*c :
(A) defbc/++*
(B) def+/bc+*
(C) def+/bc *+
(D) None of these
25. Which one of the following is a physical data structure ?
(A) Array
(B) Linked lists
(C) Stacks
(D) Tables
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 regular expressions corresponds to this grammar ?
S → AB/AS, A → a/aA, B → b
(A) aa*b+
(B) aa*b
(C) (ab)*
(D) a(ab)*
2. The proposition ~ q ∨ p is equivalent to :
(A) (B) (C) (D)
3. The number of edges in a complete graph with N vertices is equal to :
(A) N (N−1)
(B) 2N−1
(C) N−1
(D) N(N−1)/2
5. If (a**2−b**2) is a prime number where a and b belongs to N, then :
(A) a **2−b**2=3
(B) a**2−b**2=a−b
(C) a**2−b**2=a+b
(D) a**2−b**2=5
6. The hexadecimal equivalent of (10111)2×(1110)2 is :
(A) 150
(B) 241
(C) 142
(D) 101011110
7. An example of a self complementing code is :
(A) 8421 code
(B) Gray code
(C) Excess-3 code
(D) 7421 code
8. A sum of products expression can be implemented with __________ logic gates.
(A) AND − OR
(B) NAND − OR
(C) AND − NOT
(D) OR − AND
9. The characteristic equation of the D flip-flop is :
(A)
(B) Q=D
(C) Q=1
(D) Q=0
10. Which of the following logic is the fastest ?
(A) RTL
(B) ECL
(C) HTL
(D) HCL
11. When a function is recursively called, all automatic variables :
(A) are initialized during each execution of the function
(B) are retained from the last execution
(C) are maintained in a stack
(D) are ignored
12. Enumeration variables can be used in :
(A) search statement like an integer variable
(B) break statement
(C) preprocessor commands
(D) function statement
13. int arr[ ]={1, 2, 3, 4}
int count;
incr( ) {return ++count;}
main( )
{
arr[count ++]=incr( );
printf(“arr[count]=%d\n”, arr[count]);
}
The value printed by the above program is :
(A) 1
(B) 2
(C) 3
(D) 4
14. When one-dimensional character array of unspecified length is assigned an initial value :
(A) an arbitrary character is automatically added to the end of the string
(B) ‘o’ is added to the end of the string
(C) length of the string is added to the end of the string
(D) ‘end’ is added to the end of the string
15. The declaration “unsigned u” indicates :
(A) u is an unsigned character
(B) u is an unsigned integer
(C) u is a character
(D) u is a string
16. Which possibility among the following is invalid in case of a Data Flow Diagram ?
(A) A process having in-bound data flows more than out-bound data flows
(B) A data flow between two processes
(C) A data flow between two data stores
(D) A data store having more than one in-bound data flows
NOTE: Move mouse over your answer to see your answer is right or wrong.
17. In DBMS, deferred update means :
(A) All the updates are done first but the entries are made in the log file later
(B) All the log files entries are made first but the actual updates are done later
(C) Every update is done first followed by a writing on the log file
(D) Changes in the views are deferred till a query asks for a view
18. Which statement is false regarding data independence ?
(A) Hierarchical data model suffers from data independence
(B) Network model suffers from data independence
(C) Relational model suffers only from logical data independence
(D) Relational model suffers only from physical data independence
ANS TELL ME.
19. Which of the following tools is not required during system analysis phase of system development life cycle ?
(A) Case tool
(B) RAD tool
(C) Reverse engineering
(D) None of these
ANS TELL ME.
20. Two phase protocol in a database management system is :
(A) a concurrency mechanism that is not deadlock free
(B) a recovery protocol used for restoring a database after a crash
(C) Any update to the system log done in 2-phases
(D) not effective in Database
21. Which algorithm has same average, worst case and best case time ?
(A) Binary search
(B) Maximum of n number
(C) Quick sort
(D) Fibonacci search
22. Binary search tree is an example of :
(A) Divide and conquer technique
(B) Greedy algorithm
(C) Back tracking
(D) Dynamic Programming
23. What is the time required to insert an element in a stack with linked implementation ?
(A) O (log2n)
(B) O (n)
(C) O (n log2n)
(D) O (1)
The equivalent postfix expression for d/(e+f) +b*c :
(A) defbc/++*
(B) def+/bc+*
(C) def+/bc *+
(D) None of these
25. Which one of the following is a physical data structure ?
(A) Array
(B) Linked lists
(C) Stacks
(D) Tables
IF YOU FIND ANY ANSWER WRONG,COMMENT ME,SO THAT I RIGHT THAT ANSWER
THANKS
THANKS
0 comments:
Post a Comment