data structures & algorithms set 2 Detailed Explanation And More Example

Question : 1

Finding the location of the element with a given value is called

a) Traversal

b) Search

c) Sort

d) All of the above

Question : 2

In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in tree for efficiency. These special pointers are called

a) Leaf

b) Branch

c) Path

d) Thread

Question : 3

Which of the following statement is false ?

a) Arrays are dense lists and static data structure

b) Data elements in linked list need not be stored in adjacent space in memory

c) Pointers store the next data element of a list

d) Linked lists are collection of the nodes that contain information part and next pointer

Question : 4

In a Heap tree values in a node is greater than

a) every value in left sub tree and smaller than right sub tree

b) every value in children of it

c) Both of above conditions are true

d) None of above conditions are true

Question : 5

Linked lists are best suited for

a) relatively permanent collections of data

b) the size of the structure and the data in the structure are constantly changing

c) both of above situation

d) none of above situation

Question : 6

The indirect change of the values of a variable in one module by another module is called

a) internal change

b) inter-module change

c) side effect

d) all the above