| Year/Subject | C and Data Structures | ||
| Easy | Medium | Difficult | |
| 2015 MARCH-CS Scientist-C | 1.Storage Classes(2) 2.Data Types 3.Operators 4.BT 5.Circular linked list | 1.Operators 2.Tree Traversals | — |
| 2016 MARCH-CS/IT/EC-STA | 1.Queue | 1.Code segment 2.Code Segment(File system) | — |
| 2016 MARCH-CS/IT-Scientist-B | 1.Operators 2.Pointers 3.Control Structures 4.Binary tree | 1.BT | — |
| 2016 DEC-IT-Scientist-B | 1.Operators 2.Operators/traversals 3.Control Structures 4.LL 5.DFS 6.Traversals | — | — |
| 2016 DEC-CS-Scientist-B | 1.Code segment(2) 2.BInary tree 3.BT | 1.Code segment(4) 2.DFS | — |
| 2017 JULY-IT-Scientist-B | 1.Code segment 2.DFS | 1.linked list 2.Stack 3.Tree notations 4.Priority queue 5.Queue | 1.Code segment(2) |
| 2017 JULY-CS-Scientist-B | 1.AVL tree | 1.Code segment 2.BST | 1.Code Segment 2.Double Linked List |
| 2017 OCT-CS-SA | 1.Code segment | 1.Code segment(2) | 1.Code segment |
| 2017 OCT-IT-SA | 1.Code segment 2.Binary tree(2) 3.Enqueue/Dequeue | 1.Self balancing data | 1.Code segment |
| 2017 DEC-CS/IT-STA | 1.code segment 2.Evaluation Procedure 3.BST 4.FUll Binary tree 5.Linked list | 1.0-D array 2.BST 3.Complete BT | — |
| 2017 DEC-CS/IT-Scientist-B | 1.Stack | 1.C concept 2.Code segment | — |
| 2018 DEC-CS/IT-STA | 1.linked list 2.parameter passing method 4.Pointers 5.Number of binary tree formula 6.Data types range 7.BSt(Post order) 8.Complete binary tree | — | — |
| 2018 DEC-CS/IT-Scientist-B | 1.Stack(3) 2.Postfix expression 3.Binary tree | — | — |
