BTech CE Batch 2

Which best defines a data structure?

• A method to store and organize data

• A software development tool

• A programming loop

• An algorithm for sorting

Which is a primary goal of using data structures?

• To increase program size

• To optimize data storage and retrieval

• To avoid using memory

• To eliminate the need for algorithms

Which of the following is NOT a linear data structure?

• Queue

• Stack

• Linked list

• Graph

Abstract Data Type (ADT) focuses on:

• Implementation details

• Hardware storage

• Operations and behavior of data structures

• Memory addresses only

Space complexity measures:

• CPU cycles used

• Amount of memory consumed by an algorithm

• Time required to execute

• Number of variables declared

Which asymptotic notation indicates the tight bound?

• Big O

• Big Theta

• Big Omega

• Little o

An example of a non-linear data structure is:

• Stack

• Array

• Binary tree

• Queue

Which operation is NOT common for arrays?

• Traversal

• Deletion

• Dynamic resizing automatically

• Searching

Which statement about stacks is correct?

• Elements are inserted and deleted from both ends

• It follows FIFO

• It uses push and pop operations

• It does not support recursion

Infix to postfix conversion uses:

• Queue

• Stack

• Array only

• Linked list only