Skip to main content

DS - UNIT-1 QUESTIONS

 

UNIT-1: Introduction to Linear Data Structures:

Q. no Question Description
1 Define Data structure? Elaborate different types of data structures with suitable examples.
2 What is meant by ADT? Explain it with an example? List different types of operations performed on ADT?
3 Discuss different types of Asymptotic Notations with suitable examples.
4 Define time and space complexity of an algorithm with an example.
5 Perform selection sort on the following list of elements 40, 80, 35, 90, 45, 50, 70, 15, 12, 9, 1, 14.
6 After two passes of a sorting algorithm, the array becomes: 3, 47, 66, 32, 56, 92. Identify the algorithm.
7 Write recursive and non-recursive algorithm to search an element using binary search.
8 Develop a C program to implement List ADT using arrays.
9 Perform Bubble sort and write pseudocode.
10 Arrange elements using Insertion Sort.
11 What is binary search? Differentiate between linear and binary search.

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