RPSC Assistant Professor (College Education) Data Structures and Algorithms Previous Year Questions
Try the preview and open any solution for a worked explanation.
RPSC Assistant Professor (College Education) practice pack
The practice pack for RPSC Assistant Professor (College Education) is coming soon to LawMint.
Question 1
The worst case time complexity of AVL tree is better in comparison to binary search tree for
Question 2
A node of rooted binary tree is said to have preorder number I, if the node occurs in the I^th position in the preorder traversal sequence. The notions of postorder number and inorder number are defined in a similar manner. We use the notations PRE(X), POST(X) and IN(X) to denote the preorder number, postorder number and Inorder number of a node X respectively.
Consider the following tree:
For the tree given above, which of the following is TRUE.
Question 3
Choose an invalid property of a minimum spanning tree T, extracted from a connected graph G of n vertices:-
Question 4
For positive n and f(n), choose time complexity of f(n), if f(n) = a_0 + a_1 n + a_2 n^2 + ...... + a_m n^m, and a_m > 0.
Question 5
Choose a false statement :-
Question 6
Which of the following algorithm design technique is used in designing quick sort algorithm :-
Question 7
Consider the tree T given below. If post order traversal of T gives BCEAD, the labels of nodes 1,2,3,4,5, respectively are :-
Question 8
Which of the following is a valid topological ordering of graph G given below ?
Question 9
Which of the following is an all pair shortest path algorithm of graphs ?
Question 10
Which of the following is not a method of obtaining hash function ?
Previous papers with Data Structures and Algorithms questions
RPSC Assistant Professor (College Education) practice pack
The practice pack for RPSC Assistant Professor (College Education) is coming soon to LawMint.