data structures & algorithms set 1 Detailed Explanation And More Example

Question : 1

Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called

a) Elementary items

b) Atoms

c) Scalars

d) All of above

Question : 2

To represent hierarchical relationship between elements, the following data structure is not suitable

a) Deque

b) Priority

c) Tree

d) All of above

Question : 3

An algorithm that calls itself directly or indirectly is known as

a) Recursion

b) Polish notation

c) raversal algorithm

d) None of the above

Question : 4

Which of the following data structure is linear data structure?

a) Trees

b) Graphs

c) Arrays

d) None of the above

Question : 5

The following data structure can’t store the non-homogeneous data elements

a) Arrays

b) Records

c) Pointers

d) None of the above

Question : 6

Two main measures for the efficiency of an algorithm are

a) Time and space

b) Processor and memory

c) Complexity and capacity

d) Data and space