CSE2135 - Data Structure¶

Linked List¶

Q3(a) [10]: Define linear list. Explain the process of inserting an element in a linear linked list.
Q3(b) [4]: Define doubly linked list. Mention the application of linked list.

Q2(a) [1+3]: Define linear linked list. Write down the steps of inserting an element into a linked list with example.
Q2(b) [1+4]: Define doubly linked list. Write down the steps of deleting an element from a linear linked list with example.
Q2(c) [2]: Write the definition of header linked list with example.
Q2(d) [3]: What are garbage collection, overflow and underflow?

Q3(b) [2+2]: How do you insert and delete an item in a linked list? Explain it with proper example.
Q3(c) [2+2]: Write the definition of header linked list and two-way link list with example.
Q3(d) [2]: Define Garbage Collection.

Q3(a) [1+3]: Define linear linked list. Write down the steps of inserting an element into a linked list with example.
Q3(b) [1+3]: Define doubly linked list. Write down the steps of deleting an element from a linear linked list with example.
Q3(c) [3]: Write down the applications of linked list.
Q3(d) [3]: What are garbage collection, overflow and underflow?

Q3(a) [2+4]: What is the advantage of using the linked list implementation of queues, as opposed to the array implementation? Suppose, you have a doubly linked list with the following elements: 10 <-> 20 <-> 30 <-> 50 <-> NULL. Now, write a procedure to insert an element after a value x. Also, show the steps of your procedure to insert an element with value 40 after 30. After inserting 40 the list should be changed to: 10 <-> 20 <-> 30 <-> 40 <-> 50 <-> NULL.
Q3(b) [3]: Write down an algorithm if we want to insert ITEM as the first node in a linked list.

Q4(a) [4]: A queue can be implemented using linked list in two ways. Which implementations among two is efficient and why?
Q4(b) [2+2]: What is linear linked list? Why we need pointers in linked list?
Q4(c) [3x2]: Write functions to implement the following operations of linear linked list:
To insert an element at the beginning of the list.
To delete an element at the end of the list.
To traverse the list.