Scribd
Upload
28 views3 pages

Assignment No 3 DS July24

Dsgt module 3 assignment questions

Uploaded by

swatimulik83
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
28 views3 pages

Assignment No 3 DS July24

Dsgt module 3 assignment questions

Uploaded by

swatimulik83
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Mahatma Gandhi Mission’s College of Engineering and Technology

Kamothe, Navi Mumbai


Assignment -III
Subject-Data Structure Div-A and B Sem-III Class –SE
Date of Issue: 12.09.24 Date of Submission: 27.09.24
Q. No Question Module

Q1.select correct answer


1) A linear collection of data elements where the linear node is given by means of 3
pointer is called?
a) Linked list b) Node list
c) Primitive list d) Unordered list
2) In Linked List implementation, a node carries information regarding ___________ 3
a) Data b) Link
c) Data and Link d) Node

3) Linked list is considered as an example of ___________ type of memory 3


allocation.
a) Dynamic b) Static
c) Compile time d) Heap
4) What differentiates a circular linked list from a normal linked list? 3
a) You cannot have the ‘next’ pointer point to null in a circular linked list
b) It is faster to traverse the circular linked list
c) You may or may not have the ‘next’ pointer point to null in a circular linked list
d) Head node is known in circular linked list
5) Which of the following is false about a doubly linked list? 3
a) We can navigate in both the directions
b) It requires more space than a singly linked list
c) The insertion and deletion of a node take a bit longer
d) Implementing a doubly linked list is easier than singly linked list
Q2. Choose Correct Options
1) Which of the following operations is performed more efficiently by doubly linked 3
list than by singly linked list?
a. Deleting a node whose location in given
b. Searching of an unsorted list for a given item
c. Inverting a node after the node with given location
d. Traversing a list to process each node
2) A variant of linked list in which last node of the list points to the first node of the list 3
is?
a. Singly linked list b. Doubly linked list
c. Circular linked list d. Multiply linked list
3) In doubly linked lists, traversal can be performed? 3
a. Only in forward direction b. Only in reverse direction
c. In both directions d. None of the above
4) A variant of the linked list in which none of the node contains NULL pointer is? 3
a .Singly linked list b. Doubly linked list
c. Circular linked list d. None of the above
5) In circular linked list, insertion of node requires modification of? 3
a. One pointer b. Two pointer
c. Three pointer d. Requires no modification
6) A collection of data items of similar type arranged in a sequence is termed as? 3
a. Memory space b. Static data structure
c. Data structure d. List
7) A linked list is a linear collection of homogeneous elements called______. 3
a. Runtime b. Nodes
c. Pointers d. None of the above
8) Depending on what on what can a linked list be classified into various other types? 3
a. The number of pointers in a node
b. The purpose for which the pointers are maintained
c. Both (a) and (b)
d. None of the above

9) In a singly-linked list (linear linked list), how many fields does each node consists 3
of?
a. One b. Three
c. Two d. Zero
10) To implement Sparse matrix dynamically, the following data structure is used 3
a. Trees b. Graphs
c. Priority Queues d. Linked List
Q3. Answer the following questions in brief
1) Write a ‘C’ program to implement a single Linked List which supports the 3
following operations;
a) Insert a node in the beginning
b) Insert a node in the end
c) Insert a node specific node
d) Deleting a specific node
e) Display the list
2) Write a ‘C’ program to implement a Double Linked List which supports the 3
following operations;
a) Insert a node in the beginning
b) Insert a node in the end
c) Insert a node specific node
d) Deleting a specific node
e) Display the list
3) Write a program to implement a double ended queue (DEQUE) using a linked list 3

4) Explain applications of Linked List. 3


5) Differentiate between 3
1. linked list and Arrays
2. Singly linked list (SSL) and Doubly linked list (DLL)
6) How can a singly linked list be used to represent a polynomial? 3
7) Write an algorithm to add two polynomials represented using singly linked lists. 3

8) What is a linked list, and how is it different from an array? 3

You might also like