Data structures: Chapter 2| 1

Which data structure is defined as a collection of similar data elements?

• Arrays

• Trees

• Linked List

• Graphs

The data structure used in a hierarchical data model is

• Array

• Linked List

• Tree

• Graph

In a stack, insertion is done at

• Top

• Front

• Rear

• Mid

The position in a queue from which an element is deleted is called as

• Top

• Front

• Rear

• Mid

Which data structure has fixed size?

• Arrays

• Linked lists

• Trees

• Graphs

If Top = Max-1, then that the stack is

• Empty

• Full

• Contains some data

• None of the above

Which among the following is a LIFO (Last in, First out) data structure?

• Stacks

• Linked Lists

• Queues

• Graphs

Which data structure is used to represent complex relationships between the nodes?

• Arrays

• Linked Lists

• Trees

• Graphs

Examples of linear data structures include

• Arrays

• Stacks

• Queues

• All of the above

The running time complexity of a linear time algorithm is given as

• O(1)

• O(n)

• O(nlogn)

• O(n^2)