Scribd
Upload
7 views

Fundamentals of Data Structures

This document outlines a course on fundamentals of data structures. It provides the course code, name, outcomes, syllabus topics which include lists, stacks, queues, trees, searching and sorting algorithms. It also lists learning resources like textbooks and reference books.

Uploaded by

Jana S
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

Fundamentals of Data Structures

This document outlines a course on fundamentals of data structures. It provides the course code, name, outcomes, syllabus topics which include lists, stacks, queues, trees, searching and sorting algorithms. It also lists learning resources like textbooks and reference books.

Uploaded by

Jana S
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Course Code Course Name L T P C

MCS101 FUNDAMENTALS OF DATA STRUCTURES 3 0 0 3


Category: Open Elective (Minor Degree)
a. Preamble
This course focuses on fundamental concepts and techniques for designing and
implementing various Abstract Data Types (ADT) and algorithms. This course enables the
students to solve complex problems, which are essential for developing robust and efficient
software applications.
b. Course Outcome
After successful completion of the course, the students will be able to

CO. No. Course Outcome Knowledge


Level
CO1 Explain the fundamentals of Data Structures and Algorithms K2

CO2 Organize data using Linked lists K3


CO3 Make use of Stack and Queue ADT for real-time applications K3

CO4 Experiment with Tree ADT operations and applications K3


Apply appropriate Sorting and Searching techniques for
CO5 K3
applications

c. Course Syllabus Total: 45 Periods


INTRODUCTION TO DATA STRUCTURES 9
Control Structures – Arrays – Pointers – Data Structures - Classification of Data Structures
– Abstract Data Type.
LISTS 9

List ADT - Singly Linked List - Doubly Linked List.

STACK AND QUEUE 9


Stack ADT: Array Implementation, Linked list Implementation - Queue ADT: Array
Implementation, Linked list Implementation.

113
TREES 9
Tree Terminologies – Types – Binary Tree – Operations – Binary Tree Traversals - Binary
Search Tree.
SEARCHING AND SORTING 9
Searching: Linear Search – Binary Search – Sorting: Selection Sort - Insertion Sort – Merge
Sort.
d. Activities
Students shall able to develop applications using Linear and Non-linear Data Structures and
solve computational problems efficiently.
e. Learning Resources
Text Books
1. Amol M Jagtap and Ajit S Mali, Data Structures using C: A Practical Approach
for Beginners, CRC Press, Taylor & Francis Group, 2022.
2. Bose, Data Structures and Program Design in C, 1st Edition, Evincepub
Publishing, 2022.
Reference Books
1. Hemant Jain, Problem Solving in Data Structures & Algorithms Using C, 3rd
Edition, Taran Technologies Private Limited, 2022.
2. William Smith, Everyday Data Structures, Packt Publishing Limited, 2017.
3. Reema Thareja, Data Structures Using C, 2nd Edition, Oxford University Press,
2014.

114

You might also like