List of top Computer Science & Information Technology Questions on Data Structures asked in AP PGECET

The time complexity to compute the 15\(^\text{th}\) Fibonacci number using dynamic programming is _______ .
One way to build a heap is to start at the end of the array (the leaves) and push each new value up to the root. Its time complexity is _______ .
If the recursive call keeps calculating the same things over and over again, we can use _______ which stores partial results already calculated and to be used again.
The _______ process updates the costs of all the vertices \(V\), connected to a vertex \(U\), if we could improve the best estimate of the shortest path to \(V\) by including \((U,V)\) in the path to \(V\).
A threaded binary tree is a binary tree in which every node that does not have right child has a thread to its _______.
Which notation represents the tightest upper bound of an algorithm’s running time?
The minimum possible time complexity to sort \(n\) integers in the range [1, \(n^2\)] is _______ .
The greedy approach is optimal for _______ .
Best case complexity of insertion sorting is _______ .
If one wants to add and delete elements quickly without reshuffling the rest, then which data structure suits the best?
The height of a binary tree with 31 nodes (assuming no single-child nodes) is _______.
In a max-heap, the largest element is always located at the _______.
The recurrence T(n) = 2T(n/2) + n has a solution of _______.
What is the time complexity to insert an element at the beginning of a dynamic array?
The inorder traversal of a BST gives elements in _______.
Which one of the following statements is true?
How much memory is required to store the elements of the array defined as float items[4][5][6];
What is the maximum number of binary trees possible with 4 nodes?
A one-dimensional array has n elements stored from 0th position to (n-1)th position. How many elements need to be moved to insert an element at pth position of the array?
What is the data structure used for converting a recursive program into the non-recursive version of the same?