The Data Structures Lab Manual for the Computer Science and Engineering program outlines the course objectives, outcomes, and practical experiments for first-year students. It aims to provide hands-on experience in implementing various data structures using C programming, including arrays, linked lists, stacks, queues, trees, and sorting algorithms. The manual emphasizes the importance of understanding data structures through conceptualization, explanation, and implementation.
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
0 ratings0% found this document useful (0 votes)
2 views6 pages
r Programming
The Data Structures Lab Manual for the Computer Science and Engineering program outlines the course objectives, outcomes, and practical experiments for first-year students. It aims to provide hands-on experience in implementing various data structures using C programming, including arrays, linked lists, stacks, queues, trees, and sorting algorithms. The manual emphasizes the importance of understanding data structures through conceptualization, explanation, and implementation.
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1/ 6
DEPARTMENT OF COMPUTER SCIENCE AND
ENGINEERING DATA STRUCTURES LAB MANUAL
Class: I Year I Semester (CSE)
Branch: Computer Science and Engineering
PreparedBy: DOPPALA SUDHARANI
Academic Year: 2022-23
Regulation: R20 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
VISION
To become a prominent knowledge hub for learners, strive for education
excellent with innovative and industrial techniques so as to meet the global needs.
MISSON
To provide hands-on-experience and problem-solving skills by
DM1 imparting quality education.
To impart quality education with professional and personal ethics,
DM2 so as to meet the challenging global needs of the industry and
society. To provide academic infrastructure and develop linkage with the
DM3 world class organizations to strengthen industry-academia
relationship for learners.
To impart project management skills with an attitude for life-long
DM4 learning with ethical values. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
LIST OF PEOs
Engage in designing, implementing, operating and maintain systems
PE01 in the field of computer science and engineering and allied engineering industries. Solve the problems of social relevance applying the knowledge of PE02 computer science and engineering and pursue higher education and research Work effectively as individuals and as team members in PE03 multidisciplinary projects Engage in lifelong learning, career enhancement and adopt to PE04 changing professional and societal needs
List of PSOs
Analyze and develop computer programs in the areas related to
system software, multimedia, web design and networking for efficient PSO1 design of computer based system of varying complexity basic engineering sciences and Computer fundamentals.
To apply standard practices and strategies in software project
PSO2 development using open ended programming environments to deliver a quality product for business success.
Implement and design various models in real time systems.
PSO3 Course Objectives: This course will enable students to learn and understand and demonstrate the different data structures implementation. To write and execute programs in C to solve problems using data structures such as arrays, linked lists, stacks, queues. To write and execute programs in C to solve problems using data structures such as trees, graphs, hash tables and search trees. To write and execute write programs in C to implement various sorting and searching methods. Course Outcomes (Cos): At the end of the course, student will be able to Use basic data structures such as arrays and linked list. Programs to demonstrate fundamental algorithmic problems including Tree Traversals, Graph traversals, and shortest paths. Use various searching and sorting algorithms Minimum System requirements: Processors: Intel Atom® processor or Intel® Core™ i3 processor. Disk space: 1 GB. Operating systems: Windows* 7 or later Turbo c/c++ About lab: The Data Structure lab class intends to provide the students a practical knowledge of data structures so that the abstractions discussed in lecture classes are made concrete. For all the data structures, the course follows a three step procedure - conceptualization, explanation and implementation using the C programming language . CONTENTS
S.No Experiment Page Nos
1 a)Write C program that use both recursive and non recursive functions to perform Linear search for a Key value in a given list. b) Write C program that use both recursive and non recursive functions to perform Binary search for a Key value in a given list. 2 a) Write C program that implement Bubble sort, to sort a given list of integers in ascending order b) Write C program that implement Quick sort, to sort a given list of integers in ascending order c) Write C program that implement Insertion sort, to sort a given list of integers in ascending order 3 a) Write C program that implement radix sort, to sort a given list of integers in ascending order b) Write C program that implement merge sort, to sort a given list of integers in ascending order 4 a) Write a C program that uses functions to create a singly linked list b) Write a C program that uses functions to perform insertion operation on a singly linked list c) Write a C program that uses functions to perform deletion operation on a singly linked list d) Write a C program to reverse elements of a single linked list. 5 a) Write C program that implement Queue (its operations) using arrays. b) Write C program that implement Queue (its operations) using linked lists 6 a) Write C program that implement stack (its operations) using arrays b) Write C program that implement stack (its operations) using Linked list c) Write a C program that uses Stack operations to evaluate postfix expression 7 d) Write a recursive C program for traversing a binary tree in preorder, inorder and postorder. 8 a) Write a C program to Create a BST b) Write a C program to insert a node into a BST. c) Write a C program to delete a node from a BST.