Scribd
Upload
6 views

Fundamentals of Data Structures- Syllabus

The document outlines the course 'Fundamentals of Data Structures' for B.Sc Computer Science with Data Analytics, detailing its objectives, syllabus, and assessment methods. Students will learn about data structures, algorithms, stacks, queues, linked lists, and trees, with a focus on complexity analysis and practical applications. The course includes various teaching methods and resources, aiming to equip students with essential skills in data structure management.

Uploaded by

vishakstud24
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Fundamentals of Data Structures- Syllabus

The document outlines the course 'Fundamentals of Data Structures' for B.Sc Computer Science with Data Analytics, detailing its objectives, syllabus, and assessment methods. Students will learn about data structures, algorithms, stacks, queues, linked lists, and trees, with a focus on complexity analysis and practical applications. The course includes various teaching methods and resources, aiming to equip students with essential skills in data structure management.

Uploaded by

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

Course Code & FUNDAMENTALS OF DATA L T P C

22DAU207
Title STRUCTURES 3 0 0 3
Major Course
Academic 2022-23
Pre-requisite None
year &Onwards
Class I-B.Sc Computer Science with Data Analytics Semester II
K
On completion of this course, student will be able to
level
CO1:Define the basic concepts of data structures and Analyze the complexity K1&
of algorithms. K4
CO2: Solve sorting and searching problems by choosing appropriate
K3
algorithms.
Course CO3: Differentiate stacks and queues and design applications using stacks and K2&
Outcomes queues. K6
CO4: Define linked lists and examine all its operations. K1
K2
CO5: Differentiate various trees and choose suitable trees for organization of
&
data. K3
SYLLABUS
Contents No. of
Module
Hours
INTRODUCTION AND OVERVIEW:Introduction – Basic Terminology;
Elementary Data Organization - Data Structures - Data Structures Operations –
Abstract Data Type (ADT).
PRELIMINARIES: Complexity of Algorithms – Other Asymptotic Notations for
I
Complexity of Algorithms. 8
ARRAYS, RECORDS AND POINTERS: Introduction – Arrays as ADT
Representation of Linear Arrays in Memory – Traversing Linear Arrays – Inserting
and Deleting - Sparse Matrices
SORTING AND SEARCHING: Bubble sort - Insertion sort - Selection sort -
II Merge Sort - Radix Sort - Quick Sort. –Searching and Data Modification - Hashing. 7

STACKS , QUEUES , RECURSION: Stacks – Linked representation of Stacks –


III Arithmetic Expressions ; Polish Notations - Queues– LinkedRepresentaion of
Queues- Circular Queues – Deques - Priority Queues– Application of Queues. 7

LINKED LISTS: Linked Lists– Representation of Linked Lists in Memory -


Traversing a Linked List–Searching a Linked List – Insertion into a Linked List - 7
IV
Deletion from Linked List –Two - way Lists (or Doubly Linked Lists).

TREES: Binary Trees-Traversing Binary Trees - Binary Search Trees –Searching


V and Inserting in Binary Search Trees - AVL Search Trees– Heap Sort - Application 7
of Trees.
Total Hours 36
Essential: [ Text Book]
1. Seymour Lipschutz – Schaum Series: “Data Structures with C”, McGraw Hill education
private limited, New Delhi, Special Edition, 2016.
Suggestive:
References 1. Horowitz, Sahini, Anderson-Freed, “Fundamentals of Data Structures in C”,
Orient Blackswan, 2008.
2. A.K.Sharma, “Data structures using C”, Pearson Education, Second Edition, 2013.
Online Resources:
1. https://www.tutorialspoint.com/dsa_using_c/index.htm
2. https://www.geeksforgeeks.org/data-structures/
3. https://www.javatpoint.com/data-structure-tutorial
Teaching- 1. Chalk & Talk
Learning 2. Power point presentation
Process 3. E-Content
4. Seminars
5. Class Discussions
Assessment 1. Library work
Methods 2. Student Presentation
3. Group Discussion
4. Case studies
5. Quiz

Designed by Verified Signature of


by HoD
Dr.C.Sivamathi Dr.V.Usharani Dr.R.Sridevi

Mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 3 2 2 3 3 3 1 2 3 1 2 1 3 2 3

CO2 3 3 2 3 3 3 1 2 3 1 2 1 3 3 3

CO3 3 3 2 2 2 2 1 1 3 1 2 1 3 3 2

CO4 3 3 2 3 3 2 1 2 3 1 2 1 3 3 3

CO5 3 3 2 2 2 2 1 1 3 1 2 1 3 3 2

* 1 = Low ; 2 = Medium ; 3 = Strong

You might also like