MARWADI EDUCATIO

E ON FOUND
DATION GR
ROUP OF INSTITUTI
I IONS
FACULTY OF
O ENGINE
EERING
CE & IT DEPARTM
MENT

SEM: 3rd
r
IT/CE                
                        
          Date: 9/08/10 
Subject:: DFS                      

A
Assign
nmen
nt - 1
1. Define
D data structure. List
L the variious linear and non-lin
near data sttructures an
nd
explain them
m in brief.

2. What
W is recu
ursion? Exp
plain recurssion with exxample.

3. Define
D follow
wing terms:
(i) Time and
d space com
mplexity of an algorithm
m
(ii) Sparse
e matrix
4. Write
W an algorithm for primitive
p op
perations off stack

5. Write
W an algorithm to co
onvert infixx expression
n to postfix expression
n

6. Write
W an algorithm to evaluate posstfix expresssion.

7. Explain
E appllications of stack in de
etail.

Preparred by: Prrof. Jayanaa C. Kaneeriya

Subject Incharge
I

Page 1 of 2
 MARWADI EDUCATIO
E ON FOUND
DATION GR
ROUP OF INSTITUTI
I IONS
FACULTY OF
O ENGINE
EERING
CE & IT DEPARTM
MENT

SEM: 3rd
r
IT/CE                
                        
          Date: 23/08/10 
Subject:: DFS     

A
Assign
nmen
nt - 2

1. Discuss
D the basic operrations perfo
ormed with linear struccture.

2. Write
W an algorithm for primitive
p op
perations off queue.

3. Write
W an algorithm for primitive
p op
perations off circular qu
ueue.

4. Explain
E Diffe
erence betw
ween Stackk and Queue.

5. Explain follo
E owing termss in detail:
(i)DQUEUE
(ii) Priority Queue
Q
(iii) Circular Queue.

6. What
W are the
e advantages and disa a queue implemente
advantagess of stack and ed
using linked list over arrray?

7. Write
W an algorithm for primitive
p op
perations off singly linke
ed list.

8. Write
W an algorithm for primitive
p op
perations off doubly linkked list.

9. Write
W an algorithm for primitive
p op
perations off circular linked list.

10. Discuss
D adv
vantages an
nd disadvan
ntages of lin
nked list ovver array.

Preparred by: Prrof. Jayanaa C. Kaneeriya

Subject Incharge
I

Page 2 of 2