REVISION QUESTIONS ON

DATASTRUCTURES AND ALGORITHMS

1.2 Review Questions
1. What would be the carrier set and some operations of the Character ADT?
2. How might the Bit String ADT carrier set be represented on a computer in
some high level language? What would this have to do with data structures
and algorithms?
3. How might the concatenation operation of the Bit String ADT be realized
using the carrier set representation you devised for question two above?
What would this have to do with data structures and algorithms?

OTHER QUESTIONS

Qu. 1. (Pg 2)

i) Define data structure.

ii) Why are data structures necessary in computing?
iii) Distinguish between primitive and non-premitive data structures.
Give illustration in each case.
iv) Write short notes on each of the following operations performed on
linear structures.
a) Transversal
b) Search
c) Insersion
d) Deletion
e) Sorting
f) Merging

Qu. 2. (Pg 4-5)

i) Define abstract data structure (ADT).

ii) Outline ADT uses.
iii) Define algorithm.
iv) Outline conditions that an algorithm must saatisfy.
v) Define array. Outline basic operations in array.
vi) What are the advantages and disadvantages of using array (Pg 9).

Qu. 3. (Pg 9 etc)

i) How is struct differnet from array data structure.

ii) Illustrate how struct is declared.
iii) What is a stack. Write short notes on the following terminologies
associated with stack
a) Pop
b) Push
c) Peek
d) FILO
e) LIFO

iv) Write an algorithm for adding an element into a stack (Pg 16)
v) Using array, transform the algorithm into a C program.
1
 vi) Write an algorithm for deleting an element into a stack (Pg 17)
vii) Using array, transform the algorithm into a C program.

Qu. 4. (Pg 19-22)

i) Outline some 10 applications of stack.

ii) Discuss prefix, infix and postfix expression evaluation in stack
iii) Write an algorithm for evaluatinga postfix expression.
iv) Illustrate the evaluation of 623+-382/+*2$3+ using postfix
operation.
v) Write an algorithm for infix to postfix conversion without
paranthesis (pg 23).

Qu. 5. (Pg 24)

i) Define queue.
ii) Write an algorithm for adding an item to a queue.
iii) Write an algorithm for deleting an item from a queue.
iv) Define linked list. (pgs 26-27).
v) What are the advantages and shortfalls of single linked list.

Qu. 6. (See also questions and answers pages 33-37)