data structure1

Almost all programming languages start arrays at ___

• index 0

• index 1

• index 2

• the null character

int nums[ ] =

{2, 3, 5, 8, 9, 11};

How would you access the fourth element in nums

• nums[8]

• nums[3]

• nums(4)

• nums(3)

Example of linear data structure except

• array

• tree

• queue

• stack

The number of edges from the node to the deepest leaf is called ___ of the tree.

• Height

• Depth

• Length

• Width

What is the maximum number of children that a node can have in a binary tree?

• 3

• 1

• 4

• 2

To perform level-order traversal on a binary tree, which of the

following data structure will be required?

• Hash table

• Queue

• Binary search tree

• Stack

To represent hierarchical relationship between elements, which data structure is suitable?

• Dequeue

• Priority

• Tree

• Graph

A Binary Tree can have

• Can have 2 children

• Can have 1 children

• Can have 0 children

• All of the above

Process of inserting an element in stack is called ____________

• Create

• Push

• Evaluation

• Pop

Efficiency of an algorithm is measured by

• Time and Capacity complexity

• Time and Space complexity

• Speed and Space complexity

• Speed and Capacity complexity