VVP ENGINEERING COLLEGE

DEPARTMENT OF COMPUTER ENGINEERING

___________________________________________________________________________

Subject Name & Code :- Data Structure – 3130702

Mid-Semester-1 Exam Syllabus

Sr. No Unit No. Topics

1 Unit-1 Introduction to data structure,
Types of Data Structure
– Linear & Non Linear
– Primitive & Non Primitive data Structure
Analysis of an Algorithm & Asymptotic
notations
– Average, best and worst case analysis
2 Unit-2 LINEAR DATA STRUCTURE
Array:
Representation of arrays, Applications of
arrays, sparse matrix and its representation
Stack:
Stack-Definitions & Concepts, Operations On
Stacks(Push, pop, Peep, Modify, Display)
Applications of Stacks, Recognize Algorithm
Polish Expression, Reverse Polish Expression And
Their Compilation, Recursion, Tower of Hanoi
Queue:
Representation Of Queue, Operations On
Queue, Circular Queue, Priority Queue, Double
Ended Queue, Applications of Queue
3 Unit-5 Sorting and Searching
Searching:
Linear Search
Binary Search
 VVP ENGINEERING COLLEGE

DEPARTMENT OF COMPUTER ENGINEERING

___________________________________________________________________________
Subject Name & Code :- Data Structure – 3130702

Mid-Semester 1 Question Bank

Sr. Question Marks

No
UNIT-1 INTRODUCTION TO DATA STRUCTURE:
1 Discuss various types of data structures with example. 4
2 What is time and space analysis? State and explain time analysis for 7
linear search and binary search method.
3 Define primitive and non-primitive data types with example 3
4 Differentiate linear and non-linear data structures 3
5 Explain asymptotic notation for time and space complexity 4
6 Write Matrix multiplication algorithm and show its worst case time 7
analysis.
UNIT-2 LINEAR DATA STRUCTURE
1 Compare Array and Link list. 4
2 State at least one efficient representation of a sparse matrix. 3
3 Write applications of array. 4
4 Write an algorithms for Insert and delete operation of array 4
5 Write an algorithms to convert Infix Expression(without parenthesis) into 7
Postfix Expression
6 Write algorithms for PUSH and POP stack operations. 4
7 "Write an algorithm which will check that the given string belongs to 7
following grammar or not.
L= {wcwR | w Є {a,b}*} (Where wR is the reverse of w)"
8 Write an algorithm to determine if an input character string is of the
form aibi where i>=1 (i.e. number of a should be equal to no of b)
9 write an algorithm for tower of hanoi problem. 4
10 Enlist applications of stack and queue 7
11 "Evaluate the following postfix expression using stack. Show each step. 7
5 3 + 6 2 / * 3 5 * +"
12 Convert Infix Expression A ^ B * C - D + E / F / (G + H) into Postfix 7
expression using stack.
13 Evaluate the Postfix Expression 6 2 3 + - 3 8 2 / + * 2 $ 3 + using Stack. 7
14 State disadvantages of simple queue. How to overcome it? 3
15 Write an algorithm for INSERT, DELETE and DISPLAY function of Simple 7
Queue.
16 Write an algorithm for INSERT, DELETE and DISPLAY function of Circular 7
Queue.
UNIT-5 SORTING AND SEARCHING
1 Write an algorithm for binary search method. 7
2 Write an algorithm for Linear search method. 7