Skip to main content

DS - UNIT-2 QUESTIONS

 

UNIT-2: Linked List:

Q. no Question Description
1 List the difference between Linked list and array. Write the C Function to implement the following operations on Singly Linked List (i) Insert at Ending (ii) Deletion at specified position (iii) Count Number of nodes.
2 With neat diagram explain the following operations in double linked list. (i) Insert element at the beginning (ii) Insert element at the end (iii) Delete the specified element (iv) Search the given element.
3 Give the difference between Single linked list and Double linked list.
4 Define circular linked list. Write algorithms to delete a node at the beginning, ending and at a given position.
5 How is a singly linked list represented in memory?
6 Draw/represent a doubly linked list structure.
7 How does a circular linked list differ in representation?
8 Develop a C program to implement List ADT using arrays.
9 Compare Array and Linked List. What are the advantages of linked list over array?
10 What are the limitations of linked list?

Comments

Post a Comment

Popular posts from this blog

23CS02 - DATA STRUCTURES (Theory)

Data Structures is a fundamental subject in computer science that deals with organizing, storing, and managing data efficiently. It helps in performing operations such as insertion, deletion, searching, and sorting in an optimized way.
Post a Comment
Read more

23CS52 - DATA STRUCTURES (Lab)

Data Structures Lab is designed to provide hands-on experience in implementing and analyzing various data structures using the C programming language. Through a series of practical exercises, students learn to implement both linear and non-linear data structures such as arrays, linked lists, stacks, queues, trees, and hashing techniques.
Post a Comment
Read more

Operating Systems - 20CS11 Lecture Notes

  COURSE OUTCOMES (COs): At the end of the course, students will be able to CO1 Demonstrate the underlying principles and techniques of the operating system     (Understand-l2) CO2 Interpret scheduling and communication methods of processes handled by operating systems (Understand-L2) CO3 Distinguish the process synchronization methods and deadlock handling approaches employed in operating systems (Understand-L2) CO4 Classify memory management techniques and virtual memory mechanisms     (Understand-L2) CO5 Interpret the strategies of disk scheduling algorithms and file system architecture(Understand-L2) Unit-Wise Lecture Notes:
Post a Comment
Read more