ViewTube

Session By Abhishek Sharma Sir Boost your GATE 2026 preparation with this focused Data Structure session covering the most ...

Session Abhishek Sharma Sir Boost your GATE 2026 preparation with this Data Structure Super 20 MSQ Series specially curated ...

Trees are one of the most important and scoring topics in Data Structures for the GATE exam. In this video, we present a complete ...

Faster access to non-local variables is achieved using an array of pointers to activation records called a stack heap display ...

In a binary tree with n nodes, every node has an odd number of descendants. Every node is considered to be its own descendant.

In the C language At most one activation record exists between the current activation record and the activation record for the main ...

Consider the following declaration of a two dimensional array in C:Assuming that the main memory is byte-addressable and that ...

An Abstract Data Type (ADT) is: Same as an abstract class A data type that cannot be instantiated A data type for which only the ...

Consider the following statements: i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing ...

In a heap with n elements with the smallest element at the root, the 7th smallest element can be found in time Θ(n log n) Θ(n) ...

An advantage of chained hash table (external hashing) over the open addressing scheme is Worst case complexity of search ...

Match the following: List-I (P) static char var; (Q) m = malloc(10); m = NULL; (R) char *ptr[10]; (S) register int varl; List-II (i) ...

Which of the following is essential for converting an infix expression to the postfix form efficiently ? An operator stack An operand ...

Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the ...

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is log2 n n/2 ...

The following sequence of operations is performed on a stack: PUSH(10),PUSH(20),POP,PUSH(10),PUSH(20),POP,POP,POP ...

Which one of the following sequences when stored in an array at locations A[1], A[2].....A[10] forms a max heap? 23,17,10,6,13,14 ...

Let H, I, L, and N represent height, number of internal nodes, number of leaf nodes, and the total number of nodes respectively ...

In a binary max heap containing n numbers, the smallest element can be found in time O(n) O(log⁡n) O(log⁡log⁡n) O(1)

Let be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly ...

In this video, you will get Short Notes of Data Structures for GATE 2026 with clear and fast revision of all important topics required ...

DATA STRUCTURES GATE DA PYQ 2024.

Let F(n) denote the maximum number of comparisons made while searching for an entry in a sorted array of size n using binary ...

Database Management Systems (DBMS) is a high-weightage and scoring subject for GATE CSE and GATE DA aspirants, and a ...

GATE DA 2024 DATA STRUCTURES PYQ Consider performing depth-first search (DFS) on an undirected and unweighted graph ...