Scribd
Upload
14 views2 pages

Data Structure and Algorithms Lab

Uploaded by

Yash Shah
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
14 views2 pages

Data Structure and Algorithms Lab

Uploaded by

Yash Shah
Copyright
© © All Rights Reserved
Available Formats
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/ 2

SAGE University, Indore

Institute Name: Institute of Advance computing Department Name: Advance computing

Program : B.Tech. Computer Technology (Cloud Computing)


Program Code: B.Tech. CT (CC)
Semester : II
Course Name Data Structure Using C Lab Course Code ACTDCDSS006P
L T P N Total
Credit Hours 1
0 0 2 0 Credits
Prerequisites Programming (C or C++) , Data and file structure
The purpose of offering this course are:
1. A data structure is a particular way of storing and organizing data in a
computer so that it can be used efficiently.
Course
Objectives
2. Different kinds of data structures are suited to different kinds of
applications and some are highly specialized to specific tasks.
3. This course covers the basic concepts of different data structures which
are the basic building blocks of Programming and problem solving.

List of Experiments:

Part A
1. Use a recursive function to find GCD of two numbers.
2. Use a recursive function to find the Fibonacci series.
3. Use pointers to find the length of a string and to concatenate two strings.
4. Use pointers to copy a string and to extract a substring from a given a string.
5. Use a recursive function for the towers of Hanoi with three discs.
6. Insert an integer into a given position in an array.
7. Deleting an integer from an array.
Course Content 8. Write a program to create a linked list and to display it.
9. Write a program to sort N numbers using insertion sort.
10. Write a program to sort N numbers using selection sort.

Part B
1. Inserting a node into a singly linked list.
2. Deleting a node from a singly linked list.
3. Pointer implementation of stacks.
4. Pointer implementation of queues.
5. Creating a binary search tree and traversing it using in order, preorder and post
order.
6. Sort N numbers using merge sort.
T1: Weiss, Data Structures and Algorithm Analysis in C, II Edition, Pearson
Education, 2001
Text Books
T2: Lipschutz: Schaum’s outline series Data structures Tata McGraw-Hill
T3: Robert Kruse Data Structures and program designing using ‘C’
References R1:Bandyopadhyay, Data Structures Using C Pearson Education, 1999
R2:Tenenbaum, Data Structures Using C. Pearson Education, 2000
R3:Kamthane: Introduction to Data Structures in C. Pearson Education 2005.
R4:Hanumanthappa M., Practical approach to Data Structures, Laxmi
Publications, Fire Wall media 2006
R5:Langsam, Ausenstein Maoshe & M. Tanenbaum Aaron Data Structures
using C and C++ Pearson Education
After reading this course the students will learn
CO1: Students will benefit from the knowledge of Data Structures and different
operating one can perform on these like searching, sorting, stacking and etc.
CO2: This forms a very strong foundation for programming in different languages that
Course the students will take up in subsequent semesters or in any other course.
Outcomes CO3: Describe how arrays, records, linked structures, stacks, queues, trees, and graphs
are represented in memory and used by algorithms.
CO4: Understand the concept of Dynamic memory management, data types,
algorithms
CO5: Understand about tree graphs and their applications

Mapping of Course outcome with Program Outcomes, PSO’s, and Knowledge Levels (As per
Blooms Taxonomy)
P P P P P P P P P
CO/ PO PO PO PS PS PS PS Knowledge Levels (K1,
O O O O O O O O O K2, …, K6)
PO 10 11 12 O1 O2 O3 O4
1 2 3 4 5 6 7 8 9
CO1 3 2 1 1 1 2 2 1 2 K2
CO2 3 2 3 1 1 1 2 2 1 2 K3
CO3 3 2 3 3 1 1 1 2 2 1 1 2 K3
CO4 3 2 3 2 1 1 1 2 2 2 1 2 K5
CO5 3 2 3 3 3 1 1 1 2 2 2 1 2 K6

High-3 Medium-2 Low-1


K1 => Remember K2 => Understand K3 => Apply K4 => Analyze K5 => Evaluate K6 =>
Create

Designed By: Checked By: Approved By:


Mr. Yugansh Garg Dr. Neeraj Chandnani Dr. Hemang Shrivastava
(Name with Sign.) (Name with Sign.) (Name with Sign.)

You might also like