Scribd
Upload
48 views

Cap282:Data Structures-Laboratory: Course Outcomes

This document outlines the course outcomes, practical experiments, and references for a data structures laboratory course. The course aims to help students understand how data structures are represented in memory, analyze algorithms for searching and sorting, interpret various data structures using sequential and linked representations, and apply data structures to solve problems efficiently. Practical experiments cover arrays, linked lists, stacks, queues, trees, and searching and sorting algorithms. Textbooks and references on data structures using C programming are also listed.

Uploaded by

sami ahmadi
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
48 views

Cap282:Data Structures-Laboratory: Course Outcomes

This document outlines the course outcomes, practical experiments, and references for a data structures laboratory course. The course aims to help students understand how data structures are represented in memory, analyze algorithms for searching and sorting, interpret various data structures using sequential and linked representations, and apply data structures to solve problems efficiently. Practical experiments cover arrays, linked lists, stacks, queues, trees, and searching and sorting algorithms. Textbooks and references on data structures using C programming are also listed.

Uploaded by

sami ahmadi
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/ 2

CAP282:DATA STRUCTURES-LABORATORY

Course Outcomes: Through this course students should be able to

CO1 :: understand how basic data structures are represented in memory

CO2 :: describe the computational efficiency of the principle algorithms for searching and sorting

CO3 :: interpret various data structures using sequential and linked representations

CO4 :: apply appropriate data structures to solve real world problems efficiently

CO5 :: analyze the alternate implementations of data structures to enhance performance

CO6 :: demonstrate different methods for traversing binary trees

List of Practicals / Experiments:

Basic concepts
• Implement different control statements

• Implement basic pointer concepts

• Implement the concept of dynamic memory allocation

• Implement the concept of self-referential structures

Arrays
• Traversal of linear arrays

• Insertion in array

• Deletion in array

• Reverse of array

• Concatenation of two arrays

• Merging of two arrays

Linked Lists
• Traversal of one way linked list

• Insertion in one way linked list

• Deletion in one way linked list

• Operations on two way linked list

• Operations on circular linked list

Stacks and Queues


• Implementation of stack using sequential representation

• Implementation of stack using linked representation

• Implementation of queue using sequential representation

• Implementation of queue using linked representation

• Insertion in circular queues

• Deletion in circular queues

Trees
• Creating binary search tree

• Searching in binary search trees

• Recursive and non-recursive traversals

• Preorder traversal

• Inorder traversal

• Postorder traversal

Session 2021-22 Page:1/2


Searching and sorting
• Linear search

• Binary search

• Bubble sort

• Shell sort

• Selection sort

• Insertion sort

• Radix sort

• Merge sort

Text Books:
1. DATA STRUCTURES by SEYMOUR LIPSCHUTZ, MCGRAW HILL EDUCATION

References:
1. DATA STRUCTURES USING C by REEMA THAREJA, OXFORD UNIVERSITY PRESS

2. DATA STRUCTURE USING C by MANOJ KUMAR, EAGLE PRAKASHAN

3. DATA STRUCTURES USING C by E BALAGURUSAMY, Tata McGraw Hill, India

4. DATA STRUCTURE AND ALGORITHM USING C by RS SALARIA, KHANNA PUBLISHERS

Session 2021-22 Page:2/2

You might also like