SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

FACULTY OF ENGINEERING AND

TECHNOLOGY
SCHOOL OF COMPUTING

COURSE ASSESSMENT PLAN

21CSC201J- DATA STRUCTURES AND ALGORITHMS
JULY TO DECEMBER 2024
Assessments and Mark distribution for the course
SRM Institute of Science and Technology, Kattankulathur

1.0 General Details

Course Code: 21CSC201J

Course Title: DATA STRUCTURES AND ALGORITHMS
Semester: III
Course Time: JULY – DEC 2024
Slot: B

Batch
Day Batch 1 Batch 2
Hour Timing Hour Timing
Day order 1 - - - -
Day order 2 6,7 12.30pm – 2:15pm 1,2 8:00am - 9:40am
Day order 3 5 11:35am - 12:25pm 10 4:00pm - 4:50pm
Day order 4 8 2:20pm - 3:10pm 3 9:45am - 10:35am
Day order 5 - - - -

Location: University Building, Tech Park

Continuous Learning Final

Assessment Examination
(60% weightage) (40%
Bloom’s Level of Thinking weightage)
FJ (45%) LLL (15%)
Theory Practice Theory

Level 1 Remember 25% 10% 25%

Level 2 Understand 25% 20% 25%

Level 3 Apply 20% 30% 20%

Level 4 Analyze 20% 30% 20%

Level 5 Evaluate 10% 10% 10%

Total 100% 100% 100%

Table 1: Learning Assessment Plan

2
SRM Institute of Science and Technology, Kattankulathur

2.0 Reference Books

1. Seymour Lipschutz, Data Structures with C, McGraw Hill, 2014
2. R.F.Gilberg, B.A.Forouzan, Data Structures, 2nd ed., Thomson India, 2005
3. A.V.Aho, J.E Hopcroft , J.D.Ullman, Data structures and Algorithms, Pearson Education, 2003
4. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd ed., Pearson Education,
2015
5. Reema Thareja, Data Structures Using C, 1st ed., Oxford Higher Education, 2011
6. Thomas H Cormen, Charles E Leiserson, Ronald L Revest, Clifford Stein, Introduction to
Algorithms 3rd ed., The MIT Press Cambridge, 2014

3.0 Prerequisites
Principles of Programming Practices

4.0 Instructional Objectives

1. Develop programs using data types like structures, pointers and arrays supported by C
programming language.

2. Analyze the complexity of algorithm and if needed, modify it to improve its efficiency.

3. Identify and use appropriate data structure for devising solution.

4. Describe and use tree structure while developing programs.

5. Implement the Graph structure and use it whenever deemed necessary for providing better
solution

5.0 Overall Assessment Plan

Sl.No Assessment Component Type Marks

Written Test 10

FJ - I (15) Lab Practice

(Weekly 5
Experiment- Unit 1 &2)
Formative /
FJ – I E lab 5
1. FJ – II
Lab Practice
FJ - III
FJ - II (15) (Weekly 5
(45%)
Experiment Unit 3,4 &5)

Lab Assessment 5

FJ - III (15) Written Test 15

3
 SRM Institute of Science and Technology, Kattankulathur

Online Coding Contest

2
(Participation)
LLJ - I
Lifelong Hacker Rank (or)
5
Learning Leet Code
2. / LLJ – I
LLJ - II Presentation on Real
(15%) 5
World Applications
LLJ - II
Portfolio Creation 3

Total Marks 60

Table 2 Overall Internal Assessment Plan

6.0 Tentative Written Assessment Schedule

Tentative
S.NO. Test Marks Portion Duration
date
Unit 1
1 23.08.2024 FJ – I 10 100 minutes
and 2

Unit 3,4
2 04.11.2024 FJ -III 15 100 minutes
and 5

7.0 Detailed Assessment Plan

Tentative Tentative
Test Type
Assessment Marks Mode Academia
Date Entry
Total: 50 Marks
(Converted to 10)
Exam Pattern: 29.08.2024
FJ - I 23.08.2024 Formative MCQs –10 Physic
(10*1=10) al (End of Week
(UNIT- 1 (End of (10marks) Exam 6)
& Week 6)
UNIT-2) Concept Marks:15
Understanding
Questions – 4
(4*5=20)
(20 marks)

Scenario
based / HOTs
Questions – 2
(2*10=20)
(20 marks)

Weekly lab
Experiments
5 Marks

4
 SRM Institute of Science and Technology, Kattankulathur

Lab Experiments:
From the List of
Experiments -6
Experiments to be
completed
(Unit- 1 & 2)

Total: 7 marks

Online Coding 20.09.2024

LLJ - I Before Lifelong Competition Virtual
20.09.2024 learning (Participation) – mode (End of Week
2 Marks 9)
(End of Week
9) Hacker Rank (or) Marks:07
Leet Code –
5 marks

Total: 15 marks

E-lab – 5 Marks
15.10.24
Before Weekly lab
FJ - II 15.10.2024 Experiments (End of Week
Formative 5 Marks Physical 12)
(End of Week From the List of mode
12) Experiments -6 Marks:15
Experiments to be
completed
(Unit- 3 & 4)

Lab Assessment -5
Marks
From the List of
Experiments -12
Experiments to be
assessed
(Unit 1.2,3 & 4)

5
 SRM Institute of Science and Technology, Kattankulathur

FJ – III Total: 50 Marks

04.11.2024 (Converted to 15) Physical 11.11.24
(UNIT - 3 mode
UNIT - 4 (End of Week Formative Exam Pattern: – (End of
& 16) MCQs 8 (8*1=8) Week 16)
UNIT-5) (8 marks)
Marks:15
Concept
Understanding
Questions – 3
(3*5=15)
(15 marks)

Scenario based /
HOTs Questions – 3
(3*9=27)
(27 marks)

Total: 08 Marks

Before 13.11.24
13.11.2024 Lifelong Presentation on Real
LLJ - II World Applications -
learning (End of
(End of Week 5 Marks Physical Week 16)
16) Exam
Marks:08
Portfolio – 3 Marks

Table 3 Detailed Assessment Plan

8.0 Formative Assessment – Practical

8.1 E Lab Plan
TEST LIST OF Sessions Mode of
Completion
E lab Session
Total Marks – 5
1. Searching
2. Sorting
E-lab Sessions:
3. Arrays
4. Linked List
FJ – II 3 Programs per session
5. Stack
(5 marks) Total- 30 Programs
6. Queue
Total Marks for E lab: 5 Marks
7. Tree1
8. Tree2
9. Graph
10. Hashing

6
SRM Institute of Science and Technology, Kattankulathur

8.2 Weekly Lab Experiments

TEST LIST OF EXPERIMENTS RUBRICS

Weekly Experiments: Total Marks -10

1. Implementation of Structures Weekly Experiments:

2. Implementation of Structures using
Pointers ❖ Viva to be conducted for every
FJ – I 3. Implementation of Matrix lab session with respect to the
(5 marks) Multiplication – Dynamic Memory e-lab practice questions and
Allocation lab practice questions assigned
4. Array implementation of List for each unit.
5. Implementation of Linked List
6. Implementation of Doubly linked ❖ Observation notebooks for lab
list practice questions should be
maintained.

Weekly Experiments: ❖ Each experiment in the

observation should have the
7. Implementation of Stack using following components:
Array and Linked List Program implementation (10
FJ – II 8. Implementation of Queue using Marks)
Array and Linked List ⮚ Basic Solution (2 Marks)
(5
9. Applications of Stack, Queue
marks) ⮚ Modularity (2.5 Marks)
10. Implementation of Tree using
Array ⮚ Readability (2.5 Marks)
11. Implementation of BST using ⮚ Validation (2 Marks)
Linked List ⮚ Scalability (1 Marks)
12. Implementation of B-Trees ⮚ Viva – (10 Marks)
Total Marks – 20 (converted to 1
Marks) for each experiment

8.3 Lab Assessment

Tentative
Test Total Marks Mode of Evalauation
date of
Evaluation

Simple applications problems

can be given based on lab
FJ - II 15.10.2024 5
experiments done and adhere
with Programming Ethics

7
SRM Institute of Science and Technology, Kattankulathur

9.0 Lifelong Learning

9.1 Hacker Rank/ Leet Code Split-up Plan

Tentative
Test date of Marks Split-up
evaluation

Medium / hard questions from Data

structure Module either using C /
C++/Java

No. of Medium and Difficult Questions

LLJ - I 20/09/2024 5 marks Solved from Data structure Module
either using C / C++ /Java (5 Marks)
> 20 – 5 Marks
16 to 20 – 4 Marks
11 to 15 – 3 Marks
06 to 10 – 2 Marks
01 to 05 – 1

Mark Tutorial hours to be conducted to

evaluate students solving the questions

9.2 Presentation on Real World Applications

Tentative Date
Total
Test of final Artifacts Split-up
Marks
evaluation
Final marks to be evaluated
based on presentation and
LLJ - II 06.11.2024 PPT/ Demo 5 demo
Problem selection – 2 Marks
Demo and Presentation – 2
Marks
Questionnaires – 1 Mark

9.3 Portfolio Creation

Tentative Date
Total
Test of final Artifacts Mode of Evaluation
Marks
evaluation

Final marks to be evaluated

Portfolio based on the student’s
LLJ -II 13.11.2024 3
Creation performance projected on the
portfolio web page.

8
SRM Institute of Science and Technology, Kattankulathur

9.4 Online Coding Contest

Tentative Date
Total
Test of final Artifacts Mode of Evaluation
Marks
evaluation

Participation in any online

Any Coding
LLJ -I 20.09.2024 2 coding contest based on
Platform
ranking criteria

10.0 Detailed Session Plan

Sl. No Topics to be covered Hours Teaching Method Testing Method

UNIT-1
Programming in C, Primitive data Illustration using
1 1 PPT, BB
types example
Structures, Self- referential Illustration using
2 1 PPT, BB
Structures example
Illustration using
3 Pointers and structures 1 PPT, BB
example
Illustration using
4 Dynamic memory allocation 1 PPT, BB
example
Illustration using
5 Matrix multiplication 1 PPT, BB
example
Illustration using
Data Structure-Definition, Types,
6 1 PPT, BB example, Group
ADT, Operations
Discussion

Mathematical notations: Big O, Illustration using

7 1 PPT, BB
Omega and Theta example
Illustration using
8 Complexity- Time space trade off 1 PPT, BB
example

9
SRM Institute of Science and Technology, Kattankulathur

UNIT-2
Operations on List ADT – Create, Illustration using
9 1 PPT, BB
Insert, example
Operations on List ADT – Search, Illustration using
10 1 PPT, BB
Delete, Display elements example
Implementation of List ADT– Illustration using
11 1 PPT, BB
Array example
Illustration using
12 Cursor based and Linked 1 PPT, BB
example
Illustration using
13 Types – Singly Linked List 1 PPT, BB
example
Illustration using
14 Doubly Linked List 1 PPT, BB example, Group
Discussion
Illustration using
15 Circular Linked List 1 PPT, BB example, Group
Discussion
Illustration using
16 Applications - Sparse Matrix 1 PPT, BB
example
Illustration using
Polynomial Arithmetic, Joseph
17 1 PPT, BB example,
Problem
Activity

UNIT- 3

Operations on Stack ADT – Illustration using

18 1 PPT, BB
Create, Push, Pop, Top; example

Implementation of Stack ADT – Illustration using

19 1 PPT, BB
Array and Linked; example

Applications - Infix to Postfix Illustration using

20 1 PPT, BB
Conversion, Postfix Evaluation, example

Illustration using
Balancing symbols, Function
21 1 PPT, BB example,
Calls, Tower of Hanoi;
Activity

Operations on Queue ADT - Illustration using

22 1 PPT, BB
Create, Enqueue and Dequeue; example, Quiz

Implementation of Queue ADT – Illustration using

23 1 PPT, BB
Array and Linked; example
Illustration using
24 Types of Queue - Circular 1 PPT, BB
example
Illustration using
25 Double ended and Priority Queue 1 PPT, BB
example
Illustration using
26 Applications - Scheduling 1 PPT, BB
example

10
SRM Institute of Science and Technology, Kattankulathur

UNIT-4

Introduction to Trees, Tree Illustration using

27 1 PPT, BB
traversals example
Complete Binary Tree and its Illustration using
28 1 PPT, BB
height example
Illustration using
29 Binary Search Trees 1 PPT, BB example, Group
Discussions
Illustration using
30 Need for Balance- Rotation 1 PPT, BB
example
Illustration using
31 AVL trees 1 PPT, BB example,
Activity
Illustration using
32 B Trees 1 PPT, BB
example
Illustration using
33 Heaps 1 PPT, BB
example
Trees and array implementations Illustration using
34 1 PPT, BB
and applications example

Hash functions - Introduction, Illustration using

35 functions, Collision avoidance, 1 PPT, BB example,
Separate chaining, Activity

Open Addressing, Linear Probing, Illustration using

36 1 PPT, BB
Quadratic probing example

UNIT 5

Illustration using
37 Introduction to Graph 1 PPT, BB
example
Illustration using
38 Graph Traversal 1 PPT, BB
example
Illustration using
39 Topological sorting 1 PPT, BB
example
Minimum spanning tree: Prims Illustration using
40 2 PPT, BB
Algorithm example
Illustration using
41 Kruskal’s Algorithm 1 PPT, BB
example
Illustration using
42 Shortest Path Algorithm 1 PPT, BB
example
Illustration using
43 Dijkstra’s Algorithm 2 PPT, BB
example

11