UGC NET CS 2021 Question Paper & Answers
The official UGC NET CS 2021 question paper, with the official answer key. Attempt as a real timed exam (with negative marking) or switch to practice mode for instant per-question answers and explanations.
🔓 No sign-in needed to attempt a paper and see your score.
Official PYQ
UGC NET Computer Science and Applications 2021 (December 2020 / June 2021 cycle, Paper 2)
120 Mins 196 Marks
98Questions
196Max Marks
Sample questions from UGC NET Computer Science and Applications 2021 (December 2020 / June 2021 cycle, Paper 2)
1Two balanced binary trees are given with m and n elements, respectively. They can be merged into a balanced binary search tree in time.
- A) O(m*log n)
- B) O(m*log(m+n))
- C) O(m*n)
- D) O(m+n)
Answer: D
2What is the transformation matrix M that transforms a square in the xy-plane defined by (1,1)ᵀ, (-1,1)ᵀ, (-1,-1)ᵀ and (1,-1)ᵀ to a parallelogram whose corresponding vertices are (2,1)ᵀ, (0,-1)ᵀ, (-2,-1)ᵀ and (0,-1)ᵀ?
Option A: M=[[1,1,0],[0,1,0],[0,0,1]]
Option B: M=[[1,0,0],[1,1,0],[0,0,1]]
Option C: M=[[1,1,1],[0,1,0],[0,0,1]]
Option D: M=[[1,1,0],[1,1,0],[0,0,1]]
- A) Option A
- B) Option B
- C) Option C
- D) Option D
Answer: A
3In the following table, the left column contains the names of standard graph algorithms and the right column contains the time complexities of the algorithms. n and m are number of vertices and edges, respectively. Match each algorithm with its time complexity.
List I | List II
A. Bellman-Ford algorithm | I. O(mlog n)
B. Kruskal's algorithm | II. O(n³)
C. Floyd-Warshall algorithm | III. O(nm)
D. Topological sorting | IV. O(n+m)
Choose the correct answer from the options given below:
- A) A-II, B-I, C-III, D-IV
- B) A-II, B-IV, C-III, D-I
- C) A-III, B-I, C-II, D-IV
- D) A-III, B-IV, C-I, D-II
Answer: C
4A transaction may be in one of the following states during its execution life cycle in a concurrent execution environment.
A. FAILED
B. TERMINATED
C. PARTIALLY COMMITTED
D. COMMITTED
E. ACTIVE
Given a transaction in active state during its execution, find its next transitioned state from the options given below:
- A) A only
- B) C only
- C) D only
- D) Either A or C only
Answer: D
5Which of the following languages are not regular?
A. L={(01)ⁿ0ᵏ | n>k, k≥0}
B. L={cⁿbᵏaⁿ⁺ᵏ | n≥0, k≥0}
C. L={0ⁿ1ᵏ | n≠k}
Choose the correct answer from the options given below:
- A) A and C only
- B) A and B only
- C) A, B and C
- D) B and C only
Answer: C
+93 more questions — attempt the full paper to see them all.