UGC NET PAPER 2 COMPUTER SCIENCE – SET 44

By Atul Sahu • UGC NET PAPER 2 COMPUTER SCIENCE

UGC NET PAPER 2 COMPUTER SCIENCE – SET 44

Period: JUNE 2014

861. In universal hashing with n keys and m table slots (n

Data Structures and Algorithms • Hashing • JUNE 2014

A. <1 B. C. >1 D. >log n
Answer: A. <1
Explanation: Load factor α=n/m<1 gives expected α collisions per key, so <1.

862. Quicksort splits subproblems of size (1–a)n and a n (0

Data Structures and Algorithms • Quicksort Analysis • JUNE 2014

A. –log n / log(1–a) B. –log(1–a) / log n C. –log n / log a D. –log a / log n
Answer: A. –log n / log(1–a)
Explanation: Height ≈ log₁/(1–a) n = –log n / log(1–a).

863. Solve T(n)=3T(⌊n/4⌋)+n. Then T(n)= ___.

Data Structures and Algorithms • Recurrence Relations • JUNE 2014

A. O(n²) B. O(n log n) C. O(n) D. O(log n)
Answer: C. O(n)
Explanation: By Master theorem a=3,b=4, n^{log₄3}=n^{0.79}

864. After mergesort’s two recurses but before merge: ___.

Data Structures and Algorithms • Sorting • JUNE 2014

A. array is a heap B. each half is sorted C. all in first half ≤ second half D. all of the above
Answer: B. each half is sorted
Explanation: Each recursive call sorts its subarray, but they are not yet merged or compared across halves.

865. Max parentheses on stack for ((()(() )(() ))) is ___.

Data Structures and Algorithms • Stacks • JUNE 2014

A. 2 B. 3 C. 4 D. 5
Answer: C. 4
Explanation: Maximum nesting depth = 4 (count of consecutive unmatched '(' ).

866. Which scheduling algorithm ensures both serializability and freedom from deadlock in s?

Databases • Concurrency Control • JUNE 2014

A. 2PL B. Timestamp ordering C. 2PL only D. Neither
Answer: B. Timestamp ordering
Explanation: Timestamp ordering enforces serial order by timestamps and inherently prevents deadlocks.

867. Hiding manager’s salary from employee is ___.

Databases • DB Architecture • JUNE 2014

A. Conceptual level B. Physical level C. External level D. Local level
Answer: C. External level
Explanation: External schema defines what each user view sees, hiding certain data fields.

868. SET stands for ___.

Databases • E-Commerce • JUNE 2014

A. Secure Electronic Transaction B. Secular Enterprise for Transaction C. Security Electronic Transmission D. Secured Electronic Termination
Answer: A. Secure Electronic Transaction
Explanation: SET is the standard for secure credit-card transactions online.

869. In ER modeling, a specialization lattice allows an entity to participate in:

Databases • ER Modeling: Specialization • JUNE 2014

A. Only one specialization B. More than one specialization C. Exactly one specialization D. Only one generalization
Answer: B. More than one specialization
Explanation: A lattice (overlapping) specialization lets entities belong to multiple subtypes.

870. A clustering index is created when ___.

Databases • Indexing • JUNE 2014

A. primary key declared & ordered B. no key ordered C. foreign key ordered D. no key & no order
Answer: A. primary key is declared & ordered
Explanation: Clustering index uses primary key order to store rows physically sorted on disk.

871. For R={A,B,C,D,E,F} with C→F,E→A,EC→D,A→B, a key is ___.

Databases • Keys • JUNE 2014

A. CD B. EC C. AE D. AC
Answer: D. AC
Explanation: AC+→A,B,C,D,F and includes E via E→A? Actually C and A determine all, so {A,C} is key.

872. Which statement is false?

Databases • Normalization • JUNE 2014

A. Any 2-attr relation is in BCNF. B. Relation with single-attr key is in 2NF. C. Prime attr can be transitively dependent in 3NF. D. Prime attr can be transitively dependent in BCNF.
Answer: D. Prime attr can be transitively dependent in BCNF.
Explanation: BCNF prohibits any non-trivial FD with non-superkey on LHS, so no transitive dependencies.

873. Given Book(Title,Author,Cno,Pub,Year,Price) and Collection(Title,Author,Cno) with FDs Title,Author→Cno; Cno→Title,Author,Pub,Year; Pub,Title,Year→Price and key=(Author,Title), these schemas are in:

Databases • Normalization: 3NF vs BCNF • JUNE 2014

A. BCNF B. 3NF C. 2NF only D. 2NF and 3NF
Answer: B. 3NF
Explanation: All FDs have a key on the LHS or meet 3NF conditions, but Cno→… violates BCNF.

874. R={S,T,U,V} with S→T, T→U, U→V, V→S (cycle). Any nontrivial decomposition R₁∩R₂=∅ yields a schema in:

Databases • Normalization: Cyclic FDs • JUNE 2014

A. 2NF only B. 3NF only C. Both 2NF & 3NF D. Neither
Answer: C. Both 2NF & 3NF
Explanation: All attributes in a single cycle imply no partial or transitive dependencies breach 2NF/3NF.

875. Match SQL: a=DDL,b=DML,c=TCL,d=Binary Op codes below.

Databases • SQL • JUNE 2014

A. ii i iii iv B. i ii iv iii C. iii ii i iv D. iv i ii iii
Answer: B. i ii iv iii
Explanation: DDL(i), DML(ii), TCL(iv), Binary Op(iii).

876. To convert a max-assignment problem to a min-assignment, you ___.

Discrete Structures and Optimization • Assignment Problem • JUNE 2014

A. Subtract column max from each column B. Subtract table max from each entry C. Add column max to each entry D. Add table max to each entry
Answer: B. Subtract table max from each entry
Explanation: Transformation: c'ᵢⱼ = C_max – Cᵢⱼ converts maximization to minimization.

877. Big-O of n! and log(n!) is ___.

Discrete Structures and Optimization • Asymptotic Analysis • JUNE 2014

A. O(n!) and O(n log n) B. O(nⁿ) and O(n log n) C. O(n!) and O(log n!) D. O(nⁿ) and O(log n!)
Answer: A. O(n!) and O(n log n)
Explanation: n! grows factorially; Stirling’s approximation gives log(n!)=Θ(n log n).

878. How many distinct truth-tables exist for compound propositions in p and q?

Discrete Structures and Optimization • Boolean Functions • JUNE 2014

A. 2 B. 4 C. 8 D. 16
Answer: D. 16
Explanation: There are 4 possible input rows; each can map to 0/1, giving 2⁴=16 distinct tables.

879. Which of Graphs A–D is isomorphic to the given graph?

Discrete Structures and Optimization • Graph Isomorphism • JUNE 2014

A. Graph A B. Graph B C. Graph C D. Graph D
Answer: B. Graph B
Explanation: Graph B shares identical adjacency and degree sequence with the given graph under vertex relabeling.

880. K_{m,n} has a Hamiltonian circuit when ___.

Discrete Structures and Optimization • Graph Theory • JUNE 2014

A. m=3,n=2 B. m=2,n=3 C. m=n>2 D. m=n>3
Answer: C. m=n>2
Explanation: A bipartite graph has a Hamilton cycle only if both partitions equal and size ≥2.

Disclaimer for MCQ Quiz
This quiz is for educational purposes only…

0 0 votes

Article Rating

Subscribe

0 Comments

Oldest
Newest Most Voted

Inline Feedbacks

View all comments

UGC NET PAPER 2 COMPUTER SCIENCE – SET 44

Related Posts