DS-Mech-Quiz

Find the correct answer from the following statement.

A-THETA NOTATION represents the upper and the lower bound of the running time of an algorithm, it is used for analyzing the average-case complexity of an algorithm.

B-Big-O notation represents the upper bound of the running time of an algorithm. Therefore, it gives the worst-case complexity of an algorithm.

C-Omega notation represents the upper bound of the running time of an algorithm. Thus, it provides the best case complexity of an algorithm.

• All statements are correct

• A and C are correct

• A and B are correct

• None of the statements are correct

Which among the following is a user-defined data type?

• int

• float

• double

• Structure

Which among the statements is false about dynamic memory allocation

• It used to provide memory spaces during runtime of a program

• We have to explicitly use <stdlib.h> to use dynamic memory allocation

• Dynamic memory allocation cannot be used with arrays

• calloc() function comes under dynamic memory allocation

Which one is true among the following about arrays?

• Arrays are user-defined data types

• There is no proper way how memory for arrays is allocated

• Memory once allocated for array cannot be increased or decreased

• Arrays contain dissimilar data types

Which one among the following is false about stacks?

• Stack is a linear data structure

• The operation on a stack can be performed in FIFO order

• An element from a stack can be removed in any order

• All the options are false

Which one among the following is true about queues?

• Queues allow elements to be inserted or removed from both ends.
• Queues follow the Last-In-First-Out (LIFO) principle.
• Queues follow the First-In-First-Out (FIFO) principle.
• Queues do not have a fixed size and can grow dynamically.

Find the postfix form of the expression "a-b+c*d/e"

• ab-cde*/+

• ab-cd*e+/

• ab-cd*e/+

• +ab-cd*e/

Which among the following is not true about linked lists?

• A liked list is a linear data structure

• Data in a linked list are stored in contiguous memory location

• Elements of a linked list are linked using pointers

• All of the given options

Which of the following traversal outputs the data in sorted order in a BST?

• pre-order

• post-order

• in-order

• level-order

The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?

• 2

• 3

• 4

• 6