DS 1 TO 50

Which of the following is not a type of linear data structure? (CO1)

• Array
• Queue
• Stack
• Tree

Which of the following is the correct abstraction of a data structure? (CO1)

• A real-world object
• A function
• A set of operations and their implementation
• A collection of memory locations

In the context of performance analysis of algorithms, which case is analyzed when an algorithm performs the best possible operation on all inputs? (CO1)

• Best case
• Worst case
• Average case
• Optimal case

Which of the following is a primitive data type in C? (CO1)

• Stack
• Array
• Integer
• Linked List

Which of the following is not a non-primitive data structure? (CO1)

• Linked List
• Tree
• Graph
• Integer

In a stack, which operation removes the element from the top of the stack? (CO2)

• Push
• Pop
• Peek
• Insert

The time complexity of linear search in the worst case is: (CO2)

• O(1)
• O(n)
• O(log n)
• O(n^2)

Which of the following operations is NOT associated with an array? (CO2)

• Insert
• Search
• Delete
• Rotate

Which of the following searching algorithms is faster in a sorted array? (CO2)

• Linear Search
• Binary Search
• Jump Search
• Hash Search

Which of the following is a non-linear data structure? (CO2)

• Array
• Queue
• Stack
• Binary Tree