Scribd
Upload
52 views

C Programming and Data Structures

Uploaded by

anna arasu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
52 views

C Programming and Data Structures

Uploaded by

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

REVISED SYLLABUS OF COURSES UNDER PROGRAMMES

B.E.EEE, B.E.EIE, B.E.ICE, B.E.ECE AND B.E.ETE

CS3353 C PROGRAMMING AND DATA STRUCTURES L T PC


3 0 0 3
COURSE OBJECTIVES:
 To introduce the basics of C programming language.
 To learn the concepts of advanced features of C.
 To understand the concepts of ADTs and linear data structures.
 To know the concepts of non-linear data structure and hashing.
 To familiarize the concepts of sorting and searching techniques.

UNIT I C PROGRAMMING FUNDAMENTALS (8+1 SKILL) 9


Data Types – Variables – Operations – Expressions and Statements – Conditional Statements
– Functions – Recursive Functions – Arrays – Single and Multi-Dimensional Arrays.

UNIT II C PROGRAMMING - ADVANCED FEATURES (8+1 SKILL) 9


Structures – Union – Enumerated Data Types – Pointers: Pointers to Variables, Arrays and
Functions – File Handling – Preprocessor Directives.

UNIT III LINEAR DATA STRUCTURES (8+1 SKILL) 9


Abstract Data Types (ADTs) – List ADT – Array-Based Implementation – Linked List – Doubly-
Linked Lists – Circular Linked List – Stack ADT – Implementation of Stack – Applications –
Queue ADT – Priority Queues – Queue Implementation – Applications.

UNIT IV NON-LINEAR DATA STRUCTURES (8+1 SKILL) 9


Trees – Binary Trees – Tree Traversals – Expression Trees – Binary Search Tree – Hashing
- Hash Functions – Separate Chaining – Open Addressing – Linear Probing– Quadratic
Probing – Double Hashing – Rehashing.

UNIT V SORTING AND SEARCHING TECHNIQUES (8+1 SKILL) 9


Insertion Sort – Quick Sort – Heap Sort – Merge Sort –Linear Search – Binary Search.

TOTAL45 PERIODS
SKILL DEVELOPMENT ACTIVITIES (Group Seminar/Mini Project/Assignment/Content
Preparation / Quiz/ Surprise Test / Solving GATE questions/ etc) 5

COURSE OUTCOMES:
CO1:Develop C programs for any real world/technical application.
CO2:Apply advanced features of C in solving problems.
CO3:Write functions to implement linear and non–linear data structure operations.
CO4:Suggest and use appropriate linear/non–linear data structure operations for solving a
given problem.
CO5:Appropriately use sort and search algorithms for a given application.
CO6:Apply appropriate hash functions that result in a collision free scenario for data storage
and retrieval.

TEXT BOOKS:
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition,
Pearson Education, 1997.
2. ReemaThareja, “Programming in C”, Second Edition, Oxford University Press, 2016.
REVISED SYLLABUS OF COURSES UNDER PROGRAMMES
B.E.EEE, B.E.EIE, B.E.ICE, B.E.ECE AND B.E.ETE

REFERENCES:
1. Brian W. Kernighan, Rob Pike, “The Practice of Programming”, Pearson Education,
1999.
2. Paul J. Deitel, Harvey Deitel, “C How to Program”, Seventh Edition, Pearson
Education, 2013.
3. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and Algorithms”,
Pearson Education,1983.
4. Ellis Horowitz, SartajSahni and Susan Anderson, “Fundamentals of Data Structures”,
Galgotia, 2008.
List of Open Source Software/ Learning website:
https://www.coursera.org/specializations/data-structures-algorithms
https://nptel.ac.in/courses/112107243
https://nptel.ac.in/courses/112105598

CS3362 C PROGRAMMING AND DATA STRUCTURES LABORATORY LT P C


0 0 3 1.5
COURSE OBJECTIVES:
 To develop applications in C
 To implement linear and non-linear data structures
 To understand the different operations of search trees
 To get familiarized to sorting and searching algorithms
LIST OF EXPERIMENTS
1. Practice of C programming using statements, expressions, decision making and
iterative statements
2. Practice of C programming using Functions and Arrays
3. Implement C programs using Pointers and Structures
4. Implement C programs using Files
5. Development of real time C applications
6. Array implementation of List ADT
7. Array implementation of Stack and Queue ADTs
8. Linked list implementation of List, Stack and Queue ADTs
9. Applications of List, Stack and Queue ADTs
10. 10.Implementation of Binary Trees and operations of Binary Trees
11. Implementation of Binary Search Trees
12. Implementation of searching techniques
13. Implementation of Sorting algorithms : Insertion Sort, Quick Sort, Merge Sort
14. Implementation of Hashing – any two collision techniques
TOTAL: 45 PERIODS
COURSE OUTCOMES:
At the end of the course, the students will be able to:
CO1:Use different constructs of C and develop applications
CO2:Write functions to implement linear and non-linear data structure operations
CO3:Suggest and use the appropriate linear / non-linear data structure operations for a given
problem
CO4:Apply appropriate hash functions that result in a collision free scenario for data storage
and Retrieval
CO5:Implement Sorting and searching algorithms for a given application

You might also like