DSA Term Test 1
DSA Term Test 1
20’
Term Test - 1
INSTRUCTIONS TO STUDENTS:
1. Answer all the questions
2. Use only SI units
3. Use of non-programmable scientific calculator is permitted
4. Use of data handbook permitted wherever applicable
5. Missing data may be appropriately assumed
6. Notations used have usual meaning
7. Mail the scanned answer sheets in pdf format within the stipulated time to
[email protected] and [email protected]
Maximum Duration: 1 Hour 15 minutes Maximum Marks: 25
IMPORTANT:
You may retain the question paper for future reference
19CSC203A Page 1 of 3
Effective from: 09.11.20’
a. Hello World
b. hello
c. llo
d. ll
viii. Suppose list1 is [3, 4, 5, 20, 5, 25, 1, 3], list1 after the
operation list1.pop(1) is _________ .
a. [3,4,5,20,5,25,1]
b. [1, 3, 3, 4, 5, 5, 20, 25]
c. [3, 5, 20, 5, 25, 1, 3]
d. [1, 3, 4, 5, 20, 5, 25]
a. 7
b. 5
c. 3
d. 9
19CSC203A Page 2 of 3
Effective from: 09.11.20’
1. Describe Linear and Non- Linear data structures such as Stacks, Queues, Linked Lists
and Trees
2. Explain the approaches used to implement the data structures
3. Discuss the working of standard data access and manipulation algorithms
4. Implement Stacks, Queues, Linked Lists and Trees
5. Recommend a suitable data structure and algorithm for modelling a given scenario
6. Develop computer programs using data structures to solve moderately complex
problems
19CSC203A Page 3 of 3