SCHEME OF COURSE WORK

Course Details:
COURSE TITLE DATA STRUCTURES LAB
COURSE CODE 15CT1106 LTPC 0032
PROGRAM B.TECH
SPECIALIZATION CSE
SEMESTER III
PRE REQUISITES COMPUTER PROGRAMMING THROUGH C
COURSES TO WHICH IT IS A PRE
REQUISITE N/A

Course Outcomes (COs):

1 Develop programs using recursive functions.
2 Implement stacks and queues using arrays
3 Develop Programs for searching and sorting algorithms
4 Develop programs using concepts of trees.
5 Apply concepts of graphs

Program Outcomes (POs):

A graduate of Information Technology will be able to

PO-1 Ability to apply the knowledge of mathematics, science,engineering fundamentals and principles of
Information Technology to solve problems in different domains.
PO-2 Ability to analyze a problem, identify and formulate the computing requirements appropriate to its
solution.
PO-3 Ability to design & develop software applications that meet the desired specifications within the
realistic constraints to serve the needs of the society.
PO-4 Ability to design and conduct experiments, as well as to analyze and interpret data

PO-5 Ability to use appropriate techniques & tools to solve engineering problems.

PO-6 Ability to apply the knowledge to analyze and understand societal, health, safety, legal, and cultural
issues relevant to the Information Technology practices.
PO-7 Ability to analyze the local and global impact of computing on individual as well as on society.

PO-8 Ability to demonstrate professional ethical practices and social responsibilities in global and societal
contexts.
PO-9 Ability to function effectively as an individual, and as a member or leader in diverse and
multidisciplinary teams.
PO-10 Ability to communicate effectively with the engineering community and with society at large

PO-11 Ability to understand engineering and management principles and apply these to one’s own work, as a
member and leader in a team, to manage projects.
PO-12 Ability to recognize the need for updating the knowledge in the chosen field and imbibing learning to
learn skills.

Course Outcome versus Program Outcomes

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 S M S S S M
CO2 S M S S S M
CO3 S M S S S M
CO4 S M S S S M
CO5 S M S S S M

S - Strongly correlated, M - Moderately correlated, Blank - No correlation

 Internal Lab : 25 Marks
Assessment Daily Performance & Evaluation : 25
Methods Marks

Teaching- Learning & Evaluation

Teaching Assessment
Sample
Week Topic/ Contents Course Outcomes Programs learning method &
strategy schedule
1. C program to
find factorial
Write C programs that uses recursive using
Viva-1
function to: i) Compute factorial recursion.
1 CO1 Programming Lab
of a given number ii) Solve the 2. C program to
Internal-1
towers of Hanoi problem find towers of
Hanoi problem
Write C programs
that implement a
Write C programs that implement the data structure Viva-2
2 following data structures using CO2 using arrays: Programming Lab
arrays: i) Stack ii) Queue Stack and queue. Internal-1

Write C programs
to implement the
Write C programs to implement the following Stack
Viva-3
following Stack applications i) applications
3 Factorial ii) Evaluations of postfix CO2 i)Factorial ii) Programming Lab
expression Evaluations of Internal-1
postfix
expression
Write C program
to implement the
Write C program to implement the following types of Viva-4
4 following types of queues i)Priority CO2 queues i)Priority Programming Lab
Queue ii) Circular Queue. Queue ii) Circular Internal-1
Queue

Write C programs
Write C programs to implementthe to implement
Viva-5
following types of Lists i) Singly i)Singlylinkedlist
5 CO3 Programming Lab
linked list ii) Circularly Linked list ii)circularlyLinke
Internal-1
iii) Doubly linked list. d list

Write C programs
to implement th
Write C programs to implement th following data Viva-6
6 following data structures using CO3 structures using Programming Lab
Lists i) Stack ii) Queue. Lists i) Stack ii) Internal-1
Queue.
 Write C program
Write C programs to implementthe to implement
Viva-7
following search algorithms: i)Linear search
7 CO2 Programming Lab
i)Linear Search ii) Binary Search ii)Binary search
Internal-1
iii) Fibonacci Search iii)Fibonacci
search
Write C programs
Write C programs to implementthe to implementthe Viva-8
following sorting algorithms following sorting
8 CO2 Programming Lab
i)Bubble Sort ii) Insertion Sort algorithms Internal-1
iii) Selection Sort. i)Bubble Sort ii)

Insertion Sort
iii) Selection Sort.

TEST-I
Write C programs
to implement the
Viva-10
following sorting
9 CO2 Programming Lab
Write C programs to implement the algorithms
Internal-2
following sorting algorithms i)Merge Sort
i)Merge Sort ii) Quick Sort. ii) Quick Sort.
C program to
Write a C program to implement perform binary Viva-
11
binary tree using arrays and to tree traversals
10 CO3 Programming Lab
perform binary tree traversals i) in- i) in-Order
Internal-2
Order ii) post-order iii) preorder. ii) post-order
iii) preorder.
Write a C
program to
perform the
Write a C program to perform the
following
following operations using linked
Viva-
lists: i)insert an element into a binary operations using 12
11 CO3 linked Programming Lab
search tree. ii) Delete an element from a
lists:Search for a Internal-2
binary search tree. iii) Search for a key
key element in a
element in a binary search tree binary search tr

Write a C
program to
perform the
Write a C program to perform the following
Viva-
following operations using linked operations using 13
12 lists :i) Insert an element into an CO3 linked Programming Lab
AVL tree. ii) Delete an element from an lists :i) Insert an Internal-2
 AVL tree element into an
AVL tree. ii)
Delete an element
from an AVL tree
Viva-
Write C programs for the 14
13 implementation of DFS and BFSfor a CO4,CO5 Programming Lab
given graph. Internal-2

Viva-
Write a C program for the
15
implementation of Prim’s algorithm to
14 CO4 Programming Lab
obtain the minimum cost spanning tree
Internal-2
from aconnected undirected graph.

Write a C program to implement Viva-16

15 Dijkstra’s algorithm for the single CO5 Programming Lab
source shortest path problem Internal-2

16 Program practice & Doubts --- Programming

17 TEST-2