Scribd
Upload
225 views

CB19241-Data Structures and Algorithms-Syllabus

This document outlines a course on data structures and algorithms. The course objectives are to learn linear and non-linear data structures, recognize applications of various data structures, analyze tree and graph structures, and apply searching and sorting techniques. The course is divided into 5 units covering basic terminology, linear data structures like arrays and linked lists, non-linear structures like trees and graphs, searching and sorting algorithms applied to different data structures, and file organization. Students will complete experiments involving data structures and algorithms. Upon completing the course, students will be able to analyze data structure concepts, apply structures to problems, analyze sorting algorithms, and understand file operations.

Uploaded by

bhuvangates
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
225 views

CB19241-Data Structures and Algorithms-Syllabus

This document outlines a course on data structures and algorithms. The course objectives are to learn linear and non-linear data structures, recognize applications of various data structures, analyze tree and graph structures, and apply searching and sorting techniques. The course is divided into 5 units covering basic terminology, linear data structures like arrays and linked lists, non-linear structures like trees and graphs, searching and sorting algorithms applied to different data structures, and file organization. Students will complete experiments involving data structures and algorithms. Upon completing the course, students will be able to analyze data structure concepts, apply structures to problems, analyze sorting algorithms, and understand file operations.

Uploaded by

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

Subject Code Subject Name ( Lab oriented Theory Courses) Category L T P C

CB19241 DATA STRUCTURES AND ALGORITHMS CS 2 1 4 5

Objectives:
 To learn linear and non-linear data structures.
 To recognize and distinguish the applications of various linear and non-linear data structures.
 To analyse the concepts of tree and graph data structures.
 To be able to incorporate various searching and sorting techniques in real time scenarios.
 To understand the concept of files and its operations.

UNIT-I BASIC TERMINOLOGIES & INTRODUCTION TO ALGORITHM AND DATA 9


ORGANISATION
Algorithm specification, Recursion, Performance analysis, Asymptotic Notation - The Big-O, Omega and Theta
notation, Programming Style, Refinement of Coding - Time-Space Trade Off, Testing, Data Abstraction.
UNIT-II LINEAR DATA STRUCTURE 9
Array, Stack, Queue, Linked-list and its types, Various Representations, Operations & Applications of Linear Data
Structures.
UNIT-III NON-LINEAR DATA STRUCTURE 9
Trees (Binary Tree, Threaded Binary Tree, Binary Search Tree, B & B+ Tree, AVL Tree, Splay Tree) and Graphs
(Directed, Undirected), Various Representations, Operations (search and traversal algorithms and complexity analysis)
& Applications of Non-Linear Data Structures.
UNIT-IV SEARCHING AND SORTING ON VARIOUS DATA STRUCTURES 9
Sequential Search, Binary Search, Breadth First Search, Depth First Search, Insertion Sort, Selection Sort, Shell Sort,
Divide and Conquer Sort, Merge Sort, Quick Sort, Heap Sort, Introduction to Hashing.
UNIT-V FILE 9
Organisation (Sequential, Direct, Indexed Sequential, Hashed) and various types of accessing schemes.
Contact Hours : 45

List of Experiments
1 Towers of Hanoi using user defined stacks.
2 Reading, writing, and addition of polynomials.
3 Line editors with line count, word count showing on the screen.
4 Trees with all operations.
5 All graph algorithms.
6 Saving / retrieving non-linear data structure in / from a file.
Contact Hours : 60
Total Contact Hours : 105

Course Outcomes:
 Analyse the various data structure concepts.
 Apply the different linear and non-linear data structures to problem solutions.
 Critically analyse the various sorting algorithms.
 Exemplify the concept of files and its operations.

Text Book (s):


1 Fundamentals of Data Structures, E. Horowitz and S. Sahni, 1977.
2 Data Structures and Algorithms, Alfred V. Aho, John E. Hopperoft, Jeffrey D. UIlman.

Reference Books(s) / Web links:


1 The Art of Computer Programming: Volume 1: Fundamental Algorithms, Donald E. Knuth.
2 Introduction to Algorithms, Thomas, H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
3 Open Data Structures: An Introduction (Open Paths to Enriched Learning), 31st ed. Edition, Pat Morin.

You might also like