| C and Data Structures | |||
| Easy | Medium | Difficult | |
| 2020 | — | 1. Inorder successor
2. AVL Tree 3. Strings 4. Prefix to Infix conversion 5. Post order to preorder traversal 6. BFS 7. Code Segment 8. Code Segment-Pointer |
1. Recursive function calls
2. Stack operations 3. Data types 4. Code segment 5. Row and Column major order |
| 2018 | 1.BFS
2.Linked list 3.Code segment |
1.Tree Traversals
2.Strings 3.Functions 4.Heap 5.Code segment(2) 6.Unions |
1.Code segment(2)
2.Linked list |
| 2017(Dec) | 1.Stack
2.BST 3.pointers 4.Queue 5.BT(3) 6.DMA |
1.Mis
2.Tree traversals 3.Balanced BST 4.Code segment 5.Functions 6.Pointers |
— |
| 2017(May) | 1.Balance BST
2.Linked List(2) 3.BFS 4.Code segment 5.Pointers 6.Stack 7.DMA |
1.Tree Traversals
2.code segment 3.operators 4.storage classes 5.Tree Traversals |
— |
| 2016 | 1.Searching
2.BT |
1.Code Segment
2.Pointers 3.Postfix evaluation |
— |
| 2015 | 1.Queue
2.Code segment(2) 3.Operators 4.Pointers 5.Error Types |
1.Operators
2.Storage classes(3) 3.Code segment (2) 4.Stack |
— |
| 2014 | 1.Pointers
2.Storage classes 3.BST 4.Linked list |
1.Code Segment
2.Searching Techniques 3.Queues 4.Code segment 5.Stack |
1.Operators |
| 2013 | 1.Linked list
2.Binary Tree |
1.Storage classes
2.Arrays |
1.Arrays
2.Tree Traversals 3.Code Segment |
| 2011 | 1.BST | 1.BST
2.Tree Traversals 3.Code Segment 4.Searching |
— |
| 2009 | 1.Notations | 1.Tree Traversals(2)
2.BST |
1.BST
2.Arrays |
| 2008 | 1.Linked list(2)
2.Binary Tree |
1.Array
2.Functions 3. Linked list(2) 4.Mis |
1.Code Segment
2.Stack |
| 2007 | 1.Mis
2.BST |
1.Program O/p
2.Stack |
— |
