Scribd
Upload
76 views3 pages

CS3353 C Programming and Data Structures - Anna Un

The document outlines the syllabus for the CS3353 C Programming and Data Structures course at Anna University, including course objectives, unit topics, and course outcomes. Key topics covered include advanced C programming features, linear and non-linear data structures, sorting and searching techniques, and file handling. The syllabus is aligned with the university's regulations for 2021 and includes references for further reading.

Uploaded by

soundhuk1806
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
76 views3 pages

CS3353 C Programming and Data Structures - Anna Un

The document outlines the syllabus for the CS3353 C Programming and Data Structures course at Anna University, including course objectives, unit topics, and course outcomes. Key topics covered include advanced C programming features, linear and non-linear data structures, sorting and searching techniques, and file handling. The syllabus is aligned with the university's regulations for 2021 and includes references for further reading.

Uploaded by

soundhuk1806
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

 Recursive Functions

 Arrays (Single and Multi-Dimensional)[4][5][1][2][3]


CS3353 C Programming and Data Structures – Anna
University Syllabus (Regulation 2021)

Course Code: CS3353


Course Title: C Programming and Data Structures UNIT II: C Programming – Advanced Features
Credits: 3 (L-T-P: 3-0-0)  Structures

 Union

Course Objectives:  Enumerated Data Types

 Pointers: Pointers to Variables, Arrays, and Functions


 Introduce the basics of C programming language.
 File Handling
 Learn the advanced features of C.
 Preprocessor Directives[4][5][1][2][3]
 Understand the concepts of Abstract Data Types (ADTs) and
linear data structures.

 Know the concepts of non-linear data structures and hashing.

 Familiarize with sorting and searching techniques[1][2][3]. UNIT III: Linear Data Structures

 Abstract Data Types (ADTs)

 List ADT

UNIT I: C Programming Fundamentals  Array-Based Implementation

 Data Types  Linked List

 Variables  Doubly-Linked Lists

 Operations  Circular Linked List

 Expressions and Statements  Stack ADT and Implementation

 Conditional Statements  Stack Applications

 Functions  Queue ADT and Implementation


 Priority Queues  Heap Sort

 Queue Applications[4][5][1][2][3]  Merge Sort

 Linear Search

 Binary Search[1][2][3]

UNIT IV: Non-Linear Data Structures

 Trees Total Periods: 45

 Binary Trees

 Tree Traversals

 Expression Trees Text Books


 Binary Search Tree 1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”,
 Hashing Second Edition, Pearson Education, 1997.

o Hash Functions 2. Reema Thareja, “Programming in C”, Second Edition, Oxford


University Press, 2016[2][3].
o Separate Chaining
References
o Open Addressing

o Linear Probing  Brian W. Kernighan, Rob Pike, “The Practice of Programming”,


Pearson Education, 1999.
o Quadratic Probing
 Paul J. Deitel, Harvey Deitel, “C How to Program”, Seventh
o Double Hashing Edition, Pearson Education, 2013.
[1][2][3]
o Rehashing  Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data
Structures and Algorithms”, Pearson Education, 1983.

 Ellis Horowitz, Sartaj Sahni, Susan Anderson, “Fundamentals of


Data Structures”, Galgotia, 2008[2][3].
UNIT V: Sorting and Searching Techniques

 Insertion Sort
Course Outcomes:
 Quick Sort
At the end of the course, students will be able to:
 Use different constructs of C and develop applications.

 Write functions to implement linear and non-linear data structure


operations.

 Suggest and use appropriate linear/non-linear data structure


operations for a given problem.

 Apply appropriate hash functions for data storage and retrieval.

 Implement sorting and searching algorithms for given


applications[3].

This syllabus is current as per Anna University Regulation 2021 for


CS3353 – C Programming and Data Structures[4][5][1][2][3].

1. https://www.studocu.com/in/document/anna-university/c-programming-and-
data-structures/cs3353-c-programming-and-data-structures-syllabus/99836615

2. https://padeepz.net/cs3353-c-programming-and-data-structures/

3. https://www.scribd.com/document/784554789/CS3353-C-PROGRAMMING-AND-
DATA-STRUCTURES-SYLLABUS

4. https://stucor.in/syllabus/s-cs3353/

5. https://www.poriyaan.in/paper/c-programming-and-data-structures-28/

You might also like