Scribd
Upload
213 views

Data Structures With C

This document outlines a course on data structures using C. The course aims to explain fundamental data structures, analyze linear structures like stacks and queues, analyze non-linear structures like trees and graphs, and teach students to select the appropriate data structure for problem solving. The course outcomes include discussing data structure types, understanding time/space efficiency, applying properties to store data efficiently, and analyzing and implementing various structures. Students will learn about stacks, queues, linked lists, trees, and searching/sorting techniques. Assessment includes continuous internal tests, assignments, and a semester exam evaluating concepts from remember to create.

Uploaded by

Surya Nag
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
213 views

Data Structures With C

This document outlines a course on data structures using C. The course aims to explain fundamental data structures, analyze linear structures like stacks and queues, analyze non-linear structures like trees and graphs, and teach students to select the appropriate data structure for problem solving. The course outcomes include discussing data structure types, understanding time/space efficiency, applying properties to store data efficiently, and analyzing and implementing various structures. Students will learn about stacks, queues, linked lists, trees, and searching/sorting techniques. Assessment includes continuous internal tests, assignments, and a semester exam evaluating concepts from remember to create.

Uploaded by

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

DATA STRUCTURES WITH C

Course code: IECS761 Credits: 03


L: P: T: S: 3:0:0: 0 CIE Marks: 50
Exam Hours: 03 SEE Marks: 50
Total Hours: 40

Course objectives:
1. Explain fundamentals of data structures and their applications essential for programming / problem solving
2. Analyze Linear Data Structures: Stack, Queues, Lists
3. Analyze Non-Linear Data Structures: Trees, Graphs
4. Assess appropriate data structure during program development / problem solving

Course Outcomes: At the end of the course, student will be able to:

Discuss types of data structures, operations and algorithms. -Sorting and searching
CO1
operations.
CO2 Understandtime and space efficiency of algorithms
CO3 Apply various data structures and its properties to illustrate storage of data efficiently.
Analyze the performance of - Stack, Queue, Lists, Trees, Graphs, Searching and
CO4
Sorting Techniques.
CO5 Design and apply appropriate data structures for solving computing problems.
CO6 Implement programs using Data structures in a high-level language.

Mapping of Course outcomes to Program outcomes:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 0 0 0 0 2 0 0 0 3
CO2 3 3 2 2 0 0 0 2 0 0 0 3
CO3 3 1 3 0 0 0 0 2 0 0 0 3
CO4 3 1 3 3 0 0 0 2 0 0 0 3
CO5 3 2 3 3 0 0 0 2 3 0 0 3
CO6 3 3 3 2 1 2 0 2 3 1 0 3

Unit Contents of the Unit Hours COs


1. BASIC CONCEPTS: Review of C programming
fundamentals, Introduction to Data Structure and its
classification, the need for Data structure 8 CO1
Algorithm Concepts:Specification, performance analysis &
measurements, Sparse Matrices.
2. STACKS:Introduction to Stacks, Stacks Using Dynamic
Arrays, Evaluation of Expressions and conversion of 8 CO2,CO3,CO4
expressions.
3. QUEUES: Introduction to Queues, Types of Queue:
Ordinary queue, Circular Queues & Double ended queue, 6 CO3, CO4
Application of stacks and Queues.
4. LINKED LISTS:
Definition of Linked lists and Chains, Representing Chains
CO4,CO5,
in C, Types of Linked List: Singly Linked List, Circular 10
CO6
Singly Linked List, Doubly Linked Lists & Circular doubly
linked list, Application of Linked List.
5. TREES: Introduction to Binary Search Trees (BST),
Properties of Binary Tree, Operation on BST, Traversals in 8 CO4,CO5,CO6
Binary Trees, Heaps.

Self-study component:

Note: 1.Questions for CIE and SEE not to be set from self-study component.
2. Assignment Questions should be from self-study component only.
UNIT 1: Dynamic Memory Allocation
UNIT 2:Multiple Stacks
UNIT 3:Multiple Queues
UNIT 4:Operation on Linked list using Stacks, Queues, Polynomials
UNIT 5:Introduction to Graph, properties of graph, Representation of graph in memory
Text Book:
1. Horowitz, Sahni, Anderson-Freed: Fundamentals of Data Structures in C, 2nd Edition, Universities Press, 2007.

Reference Books:
1 Yedidyah, Augenstein, Tannenbaum: Data Structures Using C and C++, 2nd Edition, Pearson Education, 2003.
2 Richard F. Gilberg and Behrouz A. Forouzan: Data Structures A Pseudocode Approach with C, Cengage Learning, 2005.
3 A.M Padma Reddy,” Approach of Data Structures”, Person Publication, 5th Edition, 2015
4 ReemaTheraja “ Data Structure using C. 1st Edition , 2014
Assessment Pattern:
CIE –Continuous Internal Evaluation Theory (50 Marks)
Bloom’s Category Tests Assignments AAT1 AAT2
Marks (Out of 50) 30 10 05 05
Remember 10 01
Understand 10 05 01 01
Apply 10 05 02 01
Analyze 02
Evaluate
Create 02
*AAT 1– Alternate Assessment Tool 1: Quiz
AAT 2 - Alternate Assessment Tool 2: Surprise Test
SEE –Semester End Examination Theory (50 Marks)

Bloom’s Category Marks Theory(50)


Remember 05
Understand 10
Apply 10
Analyze 10
Evaluate 10
Create 05

You might also like