UGC NET Sample Paper 2 (Data Structure)

JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.

Computer Science and Engineering

Q.1. Stack is LIFO and which is not application of Stack?

1 point

Implementation of Recursion

Evaluations of Post fix expression

Reverse of String

All of the above

Clear selection

Q.2. which of the following has same Best, Average and Worst complexity?

1 point

BST

AVL Tree

Heap Tree

Bubble Sort

Clear selection

Q.3. Linked is not suitable data structure for which one of the following data structure?

1 point

Insertion Sort

Radix Sort

Binary Search

Polynomial Manipulation

Clear selection

Q.4. Time Complexity of Counting Sort is ?

1 point

O(n+k)

O(k)

O(n)

O(n*n)

Clear selection

Q.5. Application of Fibonacci Series is/are?

1 point

Graph Problems

Computing Minimum Spanning Tree

Single Source Shortest Path

All of the Above

Clear selection

Q.6. Minimax Algorithm is a kind of ________ algorithm that is used in decision making and game theory to find optimal move for a player.

1 point

Forwarding

Backtracking

Insertion Sort

Bubble Sort

Clear selection

Q.7. MLE stands for?

1 point

Maximum Likelihood Estimation

Minimum Likelihood Estimation

Most Likelihood Estimation

None of these

Clear selection

Q.8. PCA stands for?

1 point

Parallel Computing Analysis

Parallel Component Analysis

Principal Component Analysis

All of the above

Clear selection

Q.9. No need to swap here just find appropriate place and join the link in

1 point

Insertion Sort

Radix Sort

Bubble Sort

Heap Sort

Clear selection

Q.10. Finding with element itself takes O(n) time in

1 point

Radix Sort

AVL Tree

Bubble Sort

Binary Search

Clear selection

Submit

Clear form

This content is neither created nor endorsed by Google. - Terms of Service - Privacy Policy

Does this form look suspicious? Report

Forms