SCHEME OF COURSEWORK

Course Details:

COURSE TITLE DATA STRUCTURES

COURSE CODE 15CT1105 L T P C 3104
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):

CO - 1Apply concepts of stacks and queues

CO - 2Apply concepts of linked lists

CO - 3 Develop programs for searching and sorting

CO - 4 Develop programs using concepts of trees

CO - 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
 SCHEME OF COURSEWORK

PO-11 A ility to u dersta d e gi eeri g a d a age e t pri iples a d apply these to o e’s ow
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

Assessment Methods Assignment / Quiz / Mid-Test

Teaching-Learning and Evaluation

Teaching Assessment
Course
Week Topic/Contents Sample Questions Learning Method &
Outcomes
Strategy Schedule
Stacks: Introduction, Stack 1. Explain the stack
Lecture Assignment-1,
1. Operations, Applications of CO1 operations with
Programming Test- 1 Quiz-1
stacks, Examples examples.
1. Explain the operation
of DEQUEUE with
suitable example.
2. Suppose a Stack
implementation
supports, in addition to
PUSH and POP, an
operation REVERSE.
Queues: Introduction,
To implement a queue
Operations on queues,
using the above stack Lecture Assignment-1,
2. Circular Queues, Priority CO1
implementation, show Programming Test- 1 Quiz-1
queues, Applications of
how to implement
queues
ENQUEUE using a
single operation and
DEQUEUE using a
sequence of 3
operations. Write
functions for
ENQUEUE and
DEQUEUE
LINKED LISTS: Introduction, 1. Perform insertion Lecture Assignment-1,
3. CO2
Singly linked lists, circular and deletion operations Programming Test- 1 Quiz-1
 SCHEME OF COURSEWORK

linked lists, doubly linked lists on doubly linked lists.

Multiple linked lists, 1. Implement stacks
applications. LINKED using linked list in C Lecture Assignment-1,
4. CO2
STACKS AND LINKED and explain with Programming Test- 1 Quiz-1
QUEUES: Introduction suitable example.
1. Write a procedure to
Operations on linked stacks insert an element into
and linked queue Dynamic stack using linked list. Lecture Assignment-1,
5. CO2
memory management and 2. Differentiate Programming Test- 1 Quiz-1
linked stacks malloc() and calloc()
functions.
Implementation of linked
representations, applications 1. Write a procedure to
Lecture Assignment-1,
6. SEARCHING: Introduction, CO2, CO3 implement linear
Programming Test- 1 Quiz-1
linear search, transpose search.
sequential search
7. Test-1
1. With a suitable
Interpolation search, binary
example, explain
search, Fibonacci search.
8. Fibonacci search. Lecture Assignment-2
INTERNAL SORTING: CO3
2.Explain the procedure Programming Test- 2 Quiz-2
Introduction, bubble sort,
for sorting a list using
insertion sort
Bubble sort
1. Explain selection sort
Selection sort, merge sort,
with suitable example
quick sort TREES AND
and discuss the time
9. BINARY TREES: Lecture Assignment-2
CO3, CO4 and space complexity
Introduction, Trees: definition Programming Test- 2 Quiz-2
for selection sort. 2.
and basic terminologies,
Explain about binary
representation of trees
tree traversals.
1.Write a routine to list
out the nodes of a
binary tree in level
Binary trees: basic
order. List the root, then
10. terminologies and types, Lecture Assignment-2
CO4 nodes at depth 1,
representation of binary trees, Programming Test- 2 Quiz-2
followed by nodes at
binary tree traversals
depth 2, and so on. You
must do this in linear
time
1. Explain Binary
Applications. BINARY
Search trees, write the
SEARCH TREES AND AVL
11. algorithms and C++ Lecture Assignment-2
TREES: Introduction, binary CO4
implementation for Programming Test- 2 Quiz-2
search trees: definition and
insertion, deletion, and
operation, Example programs
search operations
1. Show the result of
AVL Trees: definition and inserting elements
12. Lecture Assignment-2
operations, applications, CO4 2,1,4,5,9,3,6 and 7 into
Programming Test- 2 Quiz-2
Example programs an initially empty AVL-
tree.
13. GRAPHS: Introduction, 1.Explain different Lecture Assignment-2
CO5
definitions and basic graph representations Programming Test- 2 Quiz-2
 SCHEME OF COURSEWORK

terminologies with neat diagrams.

Representations of graphs,
1.Define an algorithm
14. Depth first traversal, Example. Lecture Assignment-2
CO5 for DFS and verify with
Breadth first traversal, Programming Test- 2 Quiz-2
an example
Example
15.
Test - 2