Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
138 views

Data Structures Syllabus

This document outlines a course on data structures. The course is offered in semester 3 of year 2 and covers various data structures and algorithms. It aims to introduce fundamental data structures like stacks, queues, linked lists, trees, and graphs. The course is divided into 5 modules that cover these topics over 39 hours across 3 lecture hours per week. The course objectives are to teach various data structure concepts and applications. The outcomes include designing basic C programs for data structures and implementing common data structures and applications. Recommended textbooks and references are also provided.

Uploaded by

Kousthub K.A
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
138 views

Data Structures Syllabus

This document outlines a course on data structures. The course is offered in semester 3 of year 2 and covers various data structures and algorithms. It aims to introduce fundamental data structures like stacks, queues, linked lists, trees, and graphs. The course is divided into 5 modules that cover these topics over 39 hours across 3 lecture hours per week. The course objectives are to teach various data structure concepts and applications. The outcomes include designing basic C programs for data structures and implementing common data structures and applications. Recommended textbooks and references are also provided.

Uploaded by

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

SEMESTER III

YEAR II
COURSE CODE
TITLE OF THE COURSE DATA STRUCTURES
Lecture Tutorial Practical Seminar/Projects Total Credits
SCHEME OF Hours Hours Hours Hours Hours
INSTRUCTION 3 - - - 39 3

Perquisite Courses (if any)


# Sem/Year Course Code Title of the Course
* ** *** ***

COURSE OBJECTIVES:
• To introduce the concept of data structure and its applications
• To introduce C language concepts required for data structures
• To design data structure operations to solve problems
• To introduce applications of data structures
• To introduce non-primitive data structures
• To analyse the complexity of a data structure
• To introduce static and dynamic memory allocation using C language
• To explain linear data structures – stack, queue, linked list
• To explain non-linear data structures – trees and graphs

COURSE OUTCOMES:
CO Bloom’s Taxonomy
No. Outcomes Level

CO1 Outline basic C program design for data structures L2


CO2 Implement stack & queue data structure and their applications L3
CO3 Apply concepts of dynamic memory allocation to real-time L3
Problems
CO4 Implement tree data structure and its applications L3
CO5 Implement graph data structure and its applications L3
CO6 Outline the concepts of file structures L2
COURSE CONTENT:

MODULE 1 7Hrs
INTRODUCTION TO DATA STRUCTURES:
Definition, Types, C Pointers, C Structure, Arrays, Representation of Linear Array in Memory,
Array Operations (Insertion, Deletion, Search and Traversal), Single Dimensional Arrays, Two
Dimensional Arrays, Function Associated with Arrays, Arrays as Parameters, Recursive
Functions.
MODULE 2 9Hrs
INTRODUCTION TO STACK AND QUEUE:
Stack: Definition, Array Representation of Stack, Operations Associated with Stacks- Push & Pop,
Applications of Stack: Recursion, Polish expressions, Conversion of Infix to Postfix, Infix to
Prefix, Postfix Expression Evaluation, Tower of Hanoi.
Queue: Definition, Representation of Queues, Operations of Queues, Priority Queues, Circular
Queue.
MODULE 3 9Hrs
DYNAMIC DATA STRUCTURE:
Linked List: Types, Introduction to Singly Linked lists: Representation of Linked Lists in
Memory, Traversing, Searching, Insertion & Deletion from Linked List. Doubly Linked List,
Operations on Doubly Linked List (Insertion, Deletion, Traversal). Applications: Polynomial
Representation & Basic Operations, Stack & Queue Implementation using Linked Lists.
MODULE 4 8 Hrs
TREES & GRAPHS:
Trees: Basic Terminology, Binary Trees and their Representation, Complete Binary Trees, Binary
Search Trees, Operations on Binary Trees (Insertion, Deletion, Search & Traversal), Application:
Expression Evaluation.
Graphs: Terminology and Representations, Graphs & Multigraphs, Directed Graphs, Sequential
Representation of Graphs, Adjacency Matrices, Graph Transversal
MODULE 5 6 Hrs
FILE STRUCTURES:
Physical storage media, File Organization, Linked Organization of File, Inverted File, Organization
Records into Blocks, Sequential Blocks, Indexing & Hashing

TEXT BOOKS:
1. A M Tannenbaum, Y Langsam, M J Augentien “Data Structures using C”, Pearson,
2013
2. R.L. Kruse, B.P. Leary, C.L. Tondo, “Data Structure and Program Design in C” PHI

REFERENCES:
1. Horowitz Anderson-Freed, and Sahni, “Fundamentals of Data structures in
C”, 2nd Edition, Orient Longman, 2008
2. Data Structures and Algorithm analysis in C by Mark Allen Weiss,
Published by Addison Wesley (3rd Indian Reprint 2000).
3. D E Knuth, The Art of Computer Programming, Volume 1, Addison-Wesley
Publishing, 2013

You might also like