UGCNET Computer Science December 2014 Paper II
(A) 533
(B) 599
(C) 467
(D) 66
View Answer
Ans .
(C) 467
Explanation :
(A) 5
(B) n – 3
(C) 20
(D) 11
View Answer
Ans .
(D) 11
Explanation :
(A) Complete Graph
(B) Bipartite Graph
(C) Hamiltonian Graph
(D) All of the above
View Answer
Ans .
(C) Hamiltonian Graph
Explanation :
(A) 0.5
(B) 0.704
(C) 0.632121
(D) 0.68
View Answer
Ans .
(C) 0.632121
Explanation :
(A) x8 – 71 and x8 – 71
(B) x8 – 73 and x8 – 73
(C) x8 + 71 and x8 + 71
(D) x8 + 73 and x8 + 73
View Answer
Ans .
(D) x8 + 73 and x8 + 73
Explanation :
(A) 6 full adders and 2 half adders
(B) 5 full adders and 3 half adders
(C) 4 full adders and 3 half adders
(D) 5 full adders and 2 half adders
View Answer
Ans .
(D) 5 full adders and 2 half adders
Explanation :
(A) The binary sum of a code and its 9’s complement is equal to 9.
(B) It is a weighted code.
(C) Complement can be generated by inverting each bit pattern.
(D) The binary sum of a code and its 10’s complement is equal to 9.
View Answer
(A) 4 PUSH and 3 POP instructions
(B) 5 PUSH and 4 POP instructions
(C) 6 PUSH and 2 POP instructions
(D) 5 PUSH and 3 POP instructions
View Answer
Ans .
(B) 5 PUSH and 4 POP instructions
Explanation :
(A) 2–128 to (1 – 2–23) × 2127
(B) (1 – 2–23) × 2–127 to 2128
(C) (1 – 2–23) × 2–127 to 223
(D) 2–129 to (1 – 2–23) × 2127
View Answer
Ans .
(D) 2–129 to (1 – 2–23) × 2127
Explanation :
(A) 216 × 8
(B) 218 × 10
(C) 216 × 10
(D) 218 × 8
View Answer
Ans .
(B) 218 × 10
Explanation :
(A) 128
(B) 129
(C) 130
(D) 131
View Answer
Ans .
(B) 129
Explanation :
(A) a pointer to a function returning array of n pointers to function returning character pointers.
(B) a function return array of N pointers to functions returning pointers to characters.
(C) an array of n pointers to function returning pointers to characters
(D) an array of n pointers to function returning pointers to functions returning pointers to characters.
View Answer
Ans .
All Of the Above
Explanation :
(A) Static function
(B) Friend function
(C) Const function
(D) Virtual function
View Answer
Ans .
(B) Friend function
Explanation :
(A) The function can change values in the original array.
(B) In C, parameters are passed by value, the function cannot change the original value in the array.
(C) It results in compilation error when the function tries to access the elements in the array.
(D) Results in a run time error when the function tries to access the elements in the array.
View Answer
Ans .
(A) The function can change values in the original array.
Explanation :
(A) Overloading is a dynamic or runtime binding and overridden is a static or compile time binding.
(B) Overloading is a static or compile time binding and overriding is dynamic or runtime binding.
(C) Redefining a function in a friend class is called overloading, while redefining a function in a derived class is called as overridden function.
(D) Redefining a function in a derived class is called function overloading, while redefining a function in a friend class is called function overriding.
View Answer
Ans .
(B) Overloading is a static or compile time binding and overriding is dynamic or runtime binding.
Explanation :
(A) customers who have no account in any of the branches in Delhi.
(B) customers who have an account at all branches in Delhi.
(C) customers who have an account in atleast one branch in Delhi.
(D) customers who have only joint account in any one branch in Delhi
View Answer
Ans .
(B) customers who have an account at all branches in Delhi.
Explanation :
(A) I and II are correct.
(B) II and III are correct.
(C) Only III is correct.
(D) Only I is correct.
View Answer
Ans .
(D) Only I is correct.
Explanation :
(A) Generalization
(B) Aggregation
(C) Specialization
(D) Adding suitable attributes
View Answer
Ans .
(D) Adding suitable attributes
Explanation :
(A) Boyce-Codd Normal form
(B) Third Normal form
(C) Second Normal form
(D) First Normal form
View Answer
Ans .
(B) Third Normal form
Explanation :
(A) A
(B) AE
(C) BE
(D) CE
View Answer
Ans .
(A) A
Explanation :
(A) ABD^ + EF – / G+
(B) ABD + ^EF – / G+
(C) ABD + ^EF / – G+
(D) ABD^ + EF / – G+
View Answer
Ans .
(A) ABD^ + EF – / G+
Explanation :
(A) Bubble sort
(B) Selection sort
(C) Quick sort
(D) Insertion sort
View Answer
Ans .
(D) Insertion sort
Explanation :
(A) Symbol table
(B) Partition
(C) Swap space
(D) Cache
View Answer
Ans .
(A) Symbol table
Explanation :
(A) 560
(B) 565
(C) 570
(D) 575
View Answer
Ans .
(A) 560
Explanation :
(A) n nodes
(B) log2 n nodes
(C) 2n –1 nodes
(D) 2n nodes
View Answer
Ans .
(C) 2n –1 nodes
Explanation :
(A) 10
(B) 100
(C) 1000
(D) 10000
View Answer
Ans .
(B) 100
Explanation :
(A) 1010
(B) 1100
(C) 1011
(D) 1110
View Answer
Ans .
All of the above
Explanation :
(A) Flooding
(B) Multidestination routing
(C) Reverse path forwarding
(D) All of the above
View Answer
Ans .
(D) All of the above
Explanation :
(A) 0.336 bits/baud
(B) 3 bits/baud
(C) 120,00,000 bits/baud
(D) None of the above
View Answer
Ans .
(B) 3 bits/baud
Explanation :
(A) 16
(B) 17
(C) 18
(D) 19
View Answer
Ans .
(D) 19
Explanation :
(A) Shift step that advances in the input stream by K(K>1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol.
(B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol.
(C) Shift step that advances in the input stream by K(K = 2) symbols and Reduce step that applies a completed grammar rule to form a single tree.
(D) Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree.
View Answer
Ans .
(B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol.
Explanation :
(A) Canonical LR parser is LR (1) parser with single look ahead terminal
(B) All LR(K) parsers with K > 1 can be transformed into LR(1) parsers.
(C) Both (A) and (B)
(D) None of the above
View Answer
Ans .
(C) Both (A) and (B)
Explanation :
(A) Generated in first pass
(B) Generated in second pass
(C) Not generated at all
(D) Generated and used only in second pass
View Answer
Ans .
(A) Generated in first pass
Explanation :
(A) allows to examine and modify the contents of registers
(B) does not allow execution of a segment of program
(C) allows to set breakpoints, execute a segment of program and display contents of register
(D) All of the above
View Answer
Ans .
(C) allows to set breakpoints, execute a segment of program and display contents of register
Explanation :
(A) odd numbers of a’s and odd numbers of b’s
(B) even numbers of a’s and even numbers of b’s
(C) equal numbers of a’s and b’s
(D) different numbers of a’s and b’s
View Answer
Ans .
All of the above
Explanation :
(A) I, III and IV
(B) I and II
(C) III and IV
(D) I and III
View Answer
Ans .
(D) I and III
Explanation :
(A) 1135 K
(B) 335 K
(C) 1065 K
(D) 320 K
View Answer
Ans .
(B) 335 K
Explanation :
(A) No assumptions may be made about speeds or the number of CPUs.
(B) No two processes may be simultaneously inside their critical sections.
(C) Processes running outside its critical section may block other processes.
(D) Processes do not wait forever to enter its critical section.
View Answer
Ans .
(C) Processes running outside its critical section may block other processes.
Explanation :
(A) x/2
(B) xz/2
(C) √2xz
(D) (√xz)/2
View Answer
Ans .
(C) √2xz
Explanation :
(A) 11.6 m.sec.
(B) 16.4 m.sec.
(C) 28 m.sec.
(D) 14 m.sec.
View Answer
Ans .
(B) 16.4 m.sec.
Explanation :
(A) Framework activities
(B) Umbrella activities
(C) Planning activities
(D) Construction activities
View Answer
Ans .
(B) Umbrella activities
Explanation :
(A) Performed
(B) Managed
(C) Defined
(D) Optimized
View Answer
Ans .
(C) Defined
Explanation :
(A) Design
(B) Architecture
(C) Process
(D) Requirement
View Answer
Ans .
(B) Architecture
Explanation :
(A) Simple and computable
(B) Consistent and objective
(C) Consistent in the use of units and dimensions
(D) Programming language dependent
View Answer
Ans .
(D) Programming language dependent
Explanation :
(A) The number of regions – 1
(B) E – N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes.
(C) P – 1, where P is the number of predicate nodes in the flow graph G.
(D) P + 1, where P is the number of predicate nodes in the flow graph G.
View Answer
Ans .
(D) P + 1, where P is the number of predicate nodes in the flow graph G.
Explanation :
(A) S1 is true and S2 is not true.
(B) S1 is not true and S2 is true.
(C) Both S1 and S2 are true.
(D) Both S1 and S2 are not true.
View Answer
Ans .
(D) Both S1 and S2 are not true.
Explanation :
(A) only measures
(B) only dimensions
(C) keys and measures
(D) only surrogate keys
View Answer
Ans .
(D) only surrogate keys
Explanation :
(A) B2 B
(B) B2 G
(C) C2 C
(D) C2 B
View Answer
Ans .
(D) C2 B
Explanation :
(A) Economic Order Quantity
(B) Inventory
(C) Data Mining
(D) Demand-Sensitive Pricing
View Answer
Ans .
(D) Demand-Sensitive Pricing
Explanation :
(A) iii iv i ii
(B) iii i iv ii
(C) i ii iii iv
(D) iv iii ii i
View Answer
Ans .
(B) iii i iv ii
Explanation :