NALANDA INSTITUTE OF TECHNOLOGY [NIT]

BRANCH: B. Tech CSE

SUB- Data Structure
INTERNAL –I SEMESTER-3 rd
FULL MARKS–30 TIME-1 HOUR

1. Answer the following

questions. [2x5]
a) What are the operations of a data structure?
b) Differentiate between space complexity and time complexity of an algorithm?
c) Define Asymptotic Notation?
d) Differentiate between Stack and Queue.
e) Define Tree?

2. Answer any two. [5x2]

1) Give a basic algorithm for searching operation using binary searching
technique. Find out its time complexity.
2) Convert following Infix expression into Postfix expression using Tabular
method.
a–b/c*d+e*f/g
3) State the rules to be followed during infix to postfix conversions
3. Answer any one [10x1]
1) What is Data Structure? Explain various types of Data Structure in detail.

2) What is stack? Why it is known as LIFO? Write algorithm of PUSH and POP
operation on stack.