PCC-PEC-OEC (3 Credits) template

BMS INSTITUTE OF TECHNOLOGY & MANAGEMENT

(An Autonomous Institution affiliated to VTU, Belagavi)
Yelahanka, Bengaluru- 560 119
Data Structure and Applications ([Link]) 3 Semester 3
Course Code BCS304 CIE Marks 50
Teaching Hours/Week (L:T:P: S) [Link] SEE Marks 50
Total Hours of Pedagogy hhhhh Total Marks 100
Credits 3 Exam Hours 3
Scheme 2025 Academic Year 2025-26
Examination type (SEE) Theory
Course outcome (Course Skill Set)
At the end of the course, the student will be able to:
1. Illustrate different types of data structures, its operations and algorithms to solve a
given problem.
2. Apply various data structures, its operations and algorithms to solve a given problem.
3. Analyze a given problem to derive a solution using suitable data structures.
4. Develop applications using suitable data structures

Module-1
Introduction: Significance and scope of Data Structures, Data Structures and Algorithms in
Economic growth of Nation, Impact of Data Structures and Algorithms on societal problems,
sustainable solutions, Career perspective of Data Structures and Algorithms, current
innovations in Data Structures.
Data Structures: Definition, Classification and Operations, Dynamic memory allocation,
Dynamic Arrays, Self-referential structures.
Stacks: Definition, Stack Operations, Array Representation of Stacks, Stacks using Dynamic
Arrays. Stack Applications: Polish notation, Infix to postfix conversion, evaluation of postfix
expression, Multiple Stacks and Queues. Programming Examples.

Text Book1: Chapter-1:1.2, Chapter-2:2.2,2.3.4, Chapter-3:3.1,3.2,3.6,3.7

Text Book2: Chapter - 1: 1.2,1.3

Number of Hours:8
Module-2

Queues: Definition, Array Representation, Queue Operations, Circular Queues, Circular Queues
using Dynamic arrays, De-Queues, Priority Queues.
Recursion: Factorial, GCD, Fibonacci Sequence, Tower of Hanoi, Ackerman’s function

Text Book1 : Chapter-3 : 3.3, 3.4,

Text Book2 : Chapter-6 : 6.3, 6.7,6.8,6.10,6.1.2,6.1.3

Number of Hours:8
Module-3
Linked Lists: Definition, Representation of linked lists in Memory, Memory allocation;
Garbage Collection.
Linked list operations: Traversing, Searching, Insertion, and Deletion. Doubly Linked lists,
Circular linked lists, and header linked lists. Linked Stacks and Queues. Applications of
 PCC-PEC-OEC (3 Credits) template

Linked lists – Polynomials, Sparse matrix representation. Programming Examples.

Text Book1: Chapter-4: 4.1,4.2,4.3, 4.4.1,4.4.2 ,4.7.1,4.8

Text Book2: Chapter-5
Number of Hours:8
Module-4
Trees: Terminology, Binary Trees, Properties of Binary trees, Array and linked
Representation of Tree.
Binary Trees: Binary Tree Insert Operation, Binary Tree Traversals - Inorder, Postorder,
Preorder, Level Order; Additional Binary tree operations.
Binary Search Trees: BST Insert and Delete operations, Application of Trees - Evaluation
of Expression, Programming Examples.

Text Book1: Chapter-5: 5.1 to 5.4,5.7.1,5.7.2,5.7.3,5.7.4

Number of Hours:8
Module-5

Graphs: Definitions, Terminologies, Matrix and Adjacency List Representation of Graphs,

Warshal’s Algorithm, Floyds Algorithm, Breadth First Search, Depth First Search.
Hashing: Definition, Hashing Functions, Hash Table, Separate chaining, Collision resolution
techniques: Linear Probing, Quadratic Probing, Double Hashing, Rehashing and Applications
of Hashing.
Recap: Summary of the Course.

Text Book1: Chapter-6: 6.1,6.2.1,6.2.2,

Text Book2: Chapter-8:8.2,8.3,8.4
Reference Book3: Chapter-15

Number of Hours:8

Suggested Learning Resources: (Text Book/ Reference Book/ Manuals):

Text books:
1. Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures in C, Universities Press,
2nd edition, 2019
2. Seymour Lipschutz, Data Structures, Schaum's Outline Series, 1st Edition, 2014.
Reference books / Manuals:

1. Gilberg & Forouzan, Data Structures: A Pseudo-code approach with C, Cengage Learning,
2nd edition, 2014
2. Jean-Paul Tremblay & Paul G. Sorenson, An Introduction to Data Structures with
Applications, McGraw Hill, 2nd Edition, 2013
3. Reema Thareja, Data Structures using C, 3 rd Ed, Oxford press, 2012.

Web links and Video Lectures (e-Resources):

1. [Link]
 PCC-PEC-OEC (3 Credits) template

2. [Link]
3. [Link]

Teaching-Learning Process (Innovative Delivery Methods):

The following are sample strategies that educators may adopt to enhance the effectiveness of the teaching-
learning process and facilitate the achievement of course outcomes.
1. Demonstration
2. Case studies

Assessment Structure:
The assessment for each course is equally divided between Continuous Internal Evaluation (CIE) and the
Semester End Examination (SEE), with each component carrying 50% weightage (i.e., 50 marks each). The CIE
component consists of IA tests for 30 marks and Continuous Comprehensive Assessments (CCA) for 20 marks.

 To pass the CIE, a student must secure a minimum of 40% of 50 marks, i.e., 20 marks.
 To pass the SEE, a student must secure a minimum of 35% of 50 marks, i.e., 18 marks.
 A student is deemed to have successfully completed the course if the combined total of CIE and SEE
is at least 40 out of 100 marks.

Continuous Comprehensive Assessments (CCA):

CCA will be conducted for a total of 20 marks. It is recommended to include a maximum of two learning activities
aimed at enhancing the holistic development of students. These activities should align with course objectives
and promote higher-order thinking and application-based learning.
Programming Assignment -1: (Marks - 20)
Programming Assignment -2 (optional): (Marks- 20)

Rubrics for Learning Activity (Based on the nature of learning activity, design the rubrics for each
activity):

Para Allocated
LOW MEDIUM HIGH
meter Marks
Solving 30 10 Below 15 questions 15-20 questions are All 30 Questions was coded,
Questions was coded with few coded, debugged and debugged and executed with all
test cases executed with more passed test cases in the Leetcode /
than 70% passed test Hackerearth platform.
cases in the Leetcode /
Hackerearth platform.
0-3 Marks 4-7 Marks 10 Marks
Report 5 Soft Copy Report Soft Copy Report Soft Copy Report should be
not submitted/Late submitted with submitted with correct Format for
submission incorrect Format for all all 30 Questions on time
30 Questions on time.

0-1 Marks 2-3 Marks 5 Marks

Viva 5 The student did not The student answered The student answered all viva
answer any viva few viva questions questions asked
questions asked asked questions asked.
0 Marks 1-3 Marks 5 Marks
 PCC-PEC-OEC (3 Credits) template

Suggested Learning Activities may include (but are not limited to):

- Course Project

- Case Study Presentation

- Programming Assignment

- Tool/Software Exploration

- Literature Review

- Open Book Test (preferably at RBL4 and RBL5 levels)

- GATE-based Aptitude Test

- Assignment (at RBL3, RBL4, or RBL5 levels)

- Industry integrated learning

- Analysis of Industry / Technical / Business reports

- Group discussions

- Use of MOOCs and Online Platforms

- Any other relevant and innovative academic activity

Suggested Innovative Delivery Methods may include (but are not limited to):
- Flipped Classroom
- Problem-Based Learning (PBL)
- Case-Based Teaching
- Simulation and Virtual Labs
- Partial Delivery of course by Industry expert/ industrial visits
- ICT-Enabled Teaching
- Role Play