Scribd
Upload
27 views1 page

Dsa Unit-3 Question Bank

The document is a question bank for the Data Structures and Algorithms course at Muffakham Jah College of Engineering & Technology for B.E. III Semester CSE (Section-B) 2024-25. It includes short answer questions on arrays, linked lists, and hashing, as well as long answer questions covering algorithms and implementations for various data structures. The content focuses on fundamental concepts and practical applications related to linked lists, stacks, queues, and hashing techniques.

Uploaded by

aaa692431m
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
27 views1 page

Dsa Unit-3 Question Bank

The document is a question bank for the Data Structures and Algorithms course at Muffakham Jah College of Engineering & Technology for B.E. III Semester CSE (Section-B) 2024-25. It includes short answer questions on arrays, linked lists, and hashing, as well as long answer questions covering algorithms and implementations for various data structures. The content focuses on fundamental concepts and practical applications related to linked lists, stacks, queues, and hashing techniques.

Uploaded by

aaa692431m
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/ 1

MUFFAKHAM JAH COLLEGE OF ENGINEERING & TECHNOLOGY

(SULTAN-UL-ULOOM EDUCATION SOCIETY)


COMPUTER SCIENCE AND ENGINEERING DEPARTMENT

B.E. III SEMESTER CSE (SECTION-B) 2024-25

(Data Structures and Algorithms-PC 301 CS)

QUESTION BANK UNIT-3

SHORT ANSWER QUESTIONS

1) List out the differences between the usage of Arrays and Linked list.
2) Differentiate between Singly Linked List and Doubly Linked List.
3) Write an algorithm to print the elements of singly linked list in reverse.
4) Represent the given polynomial: 6x4+2x2+6x-10 by a linked list.
5) How sparse matrices are represented using linked lists?
6) Specify the conditions for a circular linked list to be full and empty.
7) Define Equivalence class.
8) Define Hashing. What do you mean by collision in hashing?

LONG ANSWER QUESTIONS

1) Define a Singly Linked list. Write down its algorithms for traversing , searching,
insertion and deletion.
2) Explain the ADT of a Doubly linked list. Write the implementation of Doubly
Linked List.
3) Write a program for the following operations using linked list.
(i) Insert at last node (ii) Delete the first node (iii) Search for an element
(iv)Display the elements
4) Write the algorithm/ implementation of Stacks represented as Linked
lists.(operations on Stacks).
5) Write the algorithm/implementation of Queues represented as Linked
lists.(operations on Queues).
6) Define a Circular Linked list. Write a program to implement a Circular Linked
list.
7) Define static Hashing. Demonstrate Hashing using chaining technique to resolve
collisions.
8) Consider the hash function H(i)=(2i+5)%11. Insert keys 3, 8, 102, 23, 4, 10, 9, 12,
44, 15 and construct the 11 item hash table by using open addressing.
9) Define collision? Summarize different collision resolution techniques with
examples?

You might also like