You are looking inside
The first answer of every solved paper is open. The rest unlock when you buy.
Already bought it? Sign in and it opens.
F.E. (First Year Engineering) · Semester 2
Important questions
Data Structure: the questions on its modules from 3 papers on munotes, May 2025 (NEP) to May 2026 (NEP), grouped by the syllabus module each belongs to. The count says how many of these papers asked a topic. It is not a forecast of the next paper.
24 topics · 44 questions
Only the three NEP papers are counted: the older R19 first-year course had no Data Structure paper.
Module I: Introduction
3
Asked in 3 of 3 papers
Data structures and their types: linear and non-linear, static and dynamic, with examples
Locked
3 questions
The questions open with the solved papers for this semester.
Asked in 2 of 3 papers
Abstract data type (ADT)
Locked
2 questions
The questions open with the solved papers for this semester.
Asked in 2 of 3 papers
Operations on data structures
Locked
2 questions
The questions open with the solved papers for this semester.
Module II: Stack
2
Asked in 2 of 3 papers
Stack operations (push, pop, display) and the array implementation of a stack
Locked
3 questions
The questions open with the solved papers for this semester.
Asked in 1 of 3 papers
Evaluating a postfix expression with a stack
Locked
1 question
The questions open with the solved papers for this semester.
Module III: Queue
5
Asked in 2 of 3 papers
Double ended queue
Locked
2 questions
The questions open with the solved papers for this semester.
Asked in 2 of 3 papers
Queue operations (enqueue, dequeue) and the array implementation of a queue
Locked
2 questions
The questions open with the solved papers for this semester.
Asked in 1 of 3 papers
Applications of the queue
Locked
1 question
The questions open with the solved papers for this semester.
Asked in 1 of 3 papers
Circular queue
Locked
1 question
The questions open with the solved papers for this semester.
Asked in 1 of 3 papers
Priority queue
Locked
1 question
The questions open with the solved papers for this semester.
Module IV: Linked List
5
Asked in 3 of 3 papers
Linked list v/s array
Locked
3 questions
The questions open with the solved papers for this semester.
Asked in 3 of 3 papers
Singly linked list: inserting, deleting and displaying nodes
Locked
3 questions
The questions open with the solved papers for this semester.
Asked in 2 of 3 papers
Reversing a singly linked list
Locked
2 questions
The questions open with the solved papers for this semester.
Asked in 2 of 3 papers
Stack using a linked list
Locked
2 questions
The questions open with the solved papers for this semester.
Asked in 1 of 3 papers
Doubly linked list
Locked
1 question
The questions open with the solved papers for this semester.
Module V: Tree
4
Asked in 3 of 3 papers
Binary search tree: building one from given numbers
Locked
3 questions
The questions open with the solved papers for this semester.
Asked in 2 of 3 papers
Binary tree traversals: preorder, inorder and postorder
Locked
2 questions
The questions open with the solved papers for this semester.
Asked in 1 of 3 papers
Trees and tree terminology
Locked
1 question
The questions open with the solved papers for this semester.
Asked in 1 of 3 papers
Types of binary tree
Locked
1 question
The questions open with the solved papers for this semester.
Module VI: Applications of Data Structures
5
Asked in 3 of 3 papers
Converting an infix expression to postfix
Locked
3 questions
The questions open with the solved papers for this semester.
Asked in 3 of 3 papers
Huffman encoding: Huffman tree and codes for a word
Locked
3 questions
The questions open with the solved papers for this semester.
Asked in 2 of 3 papers
Applications of the stack
Locked
2 questions
The questions open with the solved papers for this semester.
Asked in 1 of 3 papers
Expression tree
Locked
1 question
The questions open with the solved papers for this semester.
Asked in 1 of 3 papers
Reversing a string with a stack
Locked
1 question
The questions open with the solved papers for this semester.