NIELIT Technical Assistant Recruitment Sample Paper on Data Structures

Shivaji University Kolhapur M.Sc Semester-I Computer Science Paper March 2019

What are the advantages of arrays?
(a) Easier to store elements of same data type
(b) Used to implement other data structures like stack and queue
(c) Convenient way to represent matrices as a 2D array
(d) All of the mentioned

What is the value of the postfix expression 6 3 2 4 + – * ;
(a) Something between -5 to -15
(b) Something between 5 and – 5
(c) Something between 5 and 15
(d) Something between 15 and 100

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
(a) ABCD
(b) DCBA
(c) DCAB
(d) ABDC

What differentiates a circular linked list from a normal linked list?
(a) You cannot have the ‘next’ pointer to null in a circular linked list
(b) It is faster to traverse the circular linked list
(c) You may or may not have the ‘next’ pointer point to null in a circular linked list
(d) All of the mentioned

What is the parent for a node’w’ of a complete binary tree in an array representation when w is not 0?
(a) floor (w-1/2)
(b) cell (w-1/2)
(c) w-1/2
(d) w/2

What is threaded binary tree traversal?
(a) a binary tree traversal using stacks
(b) a binary tree traversal using queues
(c) a binary tree traversal using stacks and queues
(d) a binary tree traversal without using stacks and queues

What is an in-place sorting algorithm?
(a) It needs O(1) or O(logn) memory to create auxiliary locations
(b) The input is already sorted and in-place
(c) It requires additional storage
(d) None of the mentioned

What is an external sorting alogrithm?
(a) Algorithm that uses tape or disk during the sort
(b) Algorithm that uses main memory during the sort
(c) Algorithm that involves swapping
(d) Algorithm that are considered ‘in place’

QuickSort can be categorized into which of the following?
(a) Brute Force technique
(b) Divide and conquer
(c) Greedy algorithm
(d) Dynamic programming

Which of the following statements for a simple graph is correct?
(a) Every path is a trail
(b) Every trail is a path
(c) Every trail is a path as well as every path is a trail
(d) None of the mentioned

Depth First Search is equivalent to which of the traversal in the Binary Trees?
(a) Pre-Order Traversal
(b) Post-Order Traversal
(c) Level-Order Traversal
(d) In-Order Traversal

What is the order of a matrix?
(a) number of rows x number of columns
(b) number of columns x number of rows
(c) number of rows x number of rows
(d) number of columns x number of columns