Sie sind auf Seite 1von 1

Test: Data Structure (Linked List & Stack) BCA 3rd Sem

Five marks Questions

Q1: Write a Short note on Linked List? Discuss its advantages over array? [5]

Q2: What is a circular linked list? What are its uses? Discuss how is it represented in memory? [5]

Q3: Write an algorithm to add a new node at the end of Circular linked list? [5]

Q4: Write an algorithm to delete the first node from circular linked lists? [5]

Q5: Write a short note on doubly linked list? How is it represented in memory? [5]

Q6: Write an algorithm to insert a node before a given node in doubly linked lists? [5]

Ten marks Questions

Q7: Write a short note on Stack? Also discuss how push and peek operation is performed in stack?

Q8: Write an algorithm (in case of doubly linked list)

(a) To delete a node before a given node.

(b) To insert a new node at the end.