List of top Data Science Questions on Data Structures and Algorithms asked in CUET (PG)

In a Binary Search Tree, which traversal method produces the elements in non-decreasing order?
Which data structure is used by the system to implement recursion?
What is the time complexity of building a heap from an unsorted array of size \(n\)?

Consider the binary tree given below. What will be the corresponding infix expression to this? 

Consider the following statements about arrays. Which of the following are TRUE? 

A. The index specifies an offset from the beginning of the array to the element being referenced. 
B. Declaring an array means specifying three parameters; data type, name, and its size. 
C. The length of an array is given by the number of elements stored in it. 
D. The name of an array is a symbolic reference to the address of the first byte of the array. 
Choose the correct answer from the options given below:

Match LIST-I with LIST-II

\[\begin{array}{|c|c|}\hline \text{LIST-I} & \text{LIST-II} \\ \hline \text{A. The first index comes after the last index.} & \text{I. Head-tail Linked List} \\ \hline \text{B. More than one queue in the same array of sufficient size} & \text{IV. Multiple Queue} \\ \hline \text{C. Elements can be inserted or deleted at either end.} & \text{III. Circular Queue} \\ \hline \text{D. Each element is assigned a priority.} & \text{II. Priority Queue} \\ \hline \end{array}\] Choose the correct answer from the options given below:

\(\underline{\hspace{1cm}}\) refers to a set of data values and associated operations that are specified accurately, independent of any particular implementation.