Scribd
Upload
55 views2 pages

10 ECSDCDSA001P Data Structures & Algorithms Lab Updated

1. This document outlines the details of a course on Data Structures and Algorithms at SAGE University, Indore. 2. The course aims to teach students how to choose appropriate data structures to solve problems and implement operations like searching, insertion, deletion on various data structures like arrays, stacks, queues, linked lists. 3. Over 15 programs involving different data structures and sorting/searching algorithms are listed as part of the course content.

Uploaded by

Barwani Fotball Club
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
55 views2 pages

10 ECSDCDSA001P Data Structures & Algorithms Lab Updated

1. This document outlines the details of a course on Data Structures and Algorithms at SAGE University, Indore. 2. The course aims to teach students how to choose appropriate data structures to solve problems and implement operations like searching, insertion, deletion on various data structures like arrays, stacks, queues, linked lists. 3. Over 15 programs involving different data structures and sorting/searching algorithms are listed as part of the course content.

Uploaded by

Barwani Fotball Club
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

Department Name: Computer Science and


Institute Name: Institute of Advance Computing
Engineering
Recommended Programs :
1. B. Tech. in Computer Science and Engineering (Hons.)
Semester: II
2. B. Tech. in Computer Science and Engineering with specialization in Virtual
Reality and Game Development
Data Structures & Algorithms
Course Name Course Code ECSDCDSA001P
Lab
L T P N Total
Credit Hours 1
0 0 2 0 Credits
Prerequisites Programming Using C Lab (ECSDSPUC001P)
The course objectives are as follows:
Course 1. To assess how the choice of data structures and algorithm design methods impacts
Objectives the performance of programs and solve problems using data structures such as linear
lists, stacks, queues, binary trees, heaps binary search trees, and graphs and writing
programs for these solutions.
1. Program to input marks of 5 subjects and print the total and percentage using arrays.
2. Program to find highest and lowest element in an array.
3. Program to find the sum of even and odd elements in an array.
4. Program to read two 3x3 matrices and add them.
5. Program to multiply two matrices.
6. Program to find the factorial of a number using recursion.
7. Program to generate the Fibonacci series using recursion.
8. Program to perform the following string operations:
a) Find length of entered string
b) Concatenate two strings
c) Copy one string to another
Course Content d) Compare two strings
9. Program to create a stack using array and implement push and pop operations on it.
10. Program to create a queue using array and implement insertion and deletion
operations on it.
11. Program to create a singly linked list and implement insertion and deletion
operations on it.
12. Program to create circular linked list with its operations.
13. Program to create doubly linked list with its operations.
14. Program to implement Linear Search. 
15. Program to implement Binary Search.
16. Program to Implement Bubble sort.
17. Program to Implement Insertion sort.
18. Program to Implement Selection sort.
T1. Data Structures A Psedocode Approach with C, Richard F. Gilberg & Behrouz A.
Forouzan, second edition, CENGAGE Learning.
Text Books T2. Data Structures using C, Reema Thareja, Oxford University press.
T3. Introduction to Data Structure and its Applications Jean-Paul Tremblay, P. G.
Sorenson
R1. Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education.
R2. N. Wirth, “Algorithms + Data Structure = Programs”, Prentice Hall.
References R3. Jean – Paul Trembly, Paul Sorenson, “An Introduction to Structure with
application”.
R4. Richard, GilbergBehrouz, Forouzan, “Data structure – A Pseudocode Approach
with C”, Thomson press.
After reading this course students will able
CO1. To choose appropriate data structure as applied to specified problem definition.
CO2. To use linear and non-linear data structures like stacks, queue, Linked list etc.
Course
CO3. To handle operations like searching, insertion, deletion, traversing on various data
Outcomes structures
CO4. To perform various operations on linked list data structure.
CO5. To learn various techniques for representation of the data in the real world.

Mapping of Course outcome with Program Outcomes, PSO’s, and Knowledge Levels (As per Blooms
Taxonomy)
CO/ P P P P P P P P P P P P PS PS PSO PSO4 Knowledge
PO O O O O O O O O O O O O O1 O2 3 Levels (K1, K2,
1 2 3 4 5 6 7 8 9 10 11 12 …, K6)
CO1 2 1 2 1 3 1 3 K1,K2
CO2 1 2 1 2 2 3 K1,K2
CO3 1 2 1 2 2 3 K3
CO4 1 2 1 1 2 2 3 K3.K4
CO5 1 2 3 1 3 1 3 2 1 3 K2,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:


Dr. Harish Patidar Dr. M. K. Rawat Dr. Hare Ram Shah

You might also like