TWO MARKS QUESTIONS AND ANSWERS

DATA STRUCTURES

Previous Next

31 Define HEAD pointer and NULL pointer?
HEAD It contains the address of the first node in that list. NULL It indicates the end of the list structure.

32 What is meant by dummy header?
It is ahead node in the linked list before the actual data nodes.

33 Define Circular linked list?
It is a list structure in which last node points to the first node there is no null value.

34 Write operations that can be done on stack?
PUSH and POP

35 Mention applications of stack?
a. Expression Parsing
b. Evaluation of Postfix
c. Balancing parenthesis
d. Tower of Hanoi
e. Reversing a string

36 Define Infix, prefix and postfix notations?
Infix operators are placed in between the operands
Prefix operators are placed before the operands
Postfix Operators are placed after the operands.

37 What are the conditions that followed in the array implementation of queue?
Condition Situation
REAR

38 What are the conditions that could be followed in a linked list implementations of
queue?
Condition Situation
REAR==HEAD EMPTY QUEUE
REAR==LINK(HEAD) ONE ENTRY QUEUE
NO FREE SPACE TO INSERT FULL QUEUE

39 What are the conditions that could be followed in a linked list implementations of
queue?
Condition Situation
(REAR MOD ARRAY SIZE +1
)==FRONT
EMPTY QUEUE
(REAR MOD ARRAY SIZE +2
)==FRONT
FULL QUEUE
FRONT==REAR ONE ENTRY QUEUE

40 Define Circular queue?
A circular queue allows the queue to wrap around upon reaching the end of the array.

40. a) Define double linked list?

It is linear data structure which consists of two links or pointer fieldsNext pointer points to the address of the next(successor) node.Previous pointer points to the address of the previous(predecessor) node.

Previous Next