data structures & algorithms set 2 Detailed Explanation And More Example

Question : 1

The elements of an array are stored successively in memory cells because

a) by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

b) the architecture of computer memory does not allow arrays to store other than serially

c) A and B both false

d) A and B both true

Question : 2

The time factor when determining the efficiency of algorithm is measured by

a) Counting the number of key operations

b) Counting the number of statements

c) Counting the kilobytes of algorithm

d) None of the above

Question : 3

The memory address of the first element of an array is called

a) base address

b) floor address

c) foundation address

d) first address

Question : 4

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 : 5

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 : 6

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

a) Traversal

b) Search

c) Sort

d) All of the above