The article contains the subject code CS3353, which deals with the Anna University B.E Electrical and Electronics Engineering Semester – III Electron Devices and Circuits Syllabus. Unit wise detailed syllabus of this subject CS3353 is included in this article. You can get assistance for note preparation or can understand the chapters contain topics in one place.
Effective results need effective preparation and having the required knowledge of the topics included in the subject. If you want to perform well in academics proper guidance and the subject syllabus in mind are necessary, this article CS3353 – C Programming and Data Structures Syllabus will fulfill the details regarding your preparation.
If you want to know more about the syllabus of B.E Electrical and Electronics Engineering connected to an affiliated institution’s four-year undergraduate degree program. We provide you with a detailed Year-wise, semester-wise, and Subject-wise syllabus in the following link B.E Electrical and Electronics Engineering Syllabus Anna University, Regulation 2021.
Aim Of 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.
CS3353 – C Programming and Data Structures Syllabus
Unit I: C Programming Fundamentals (8+1 Skill)
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)
Structures – Union – Enumerated Data Types – Pointers: Pointers to Variables, Arrays and Functions – File Handling – Preprocessor Directives.
Unit III: Linear Data Structures (8+1 Skill)
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)
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)
Insertion Sort – Quick Sort – Heap Sort – Merge Sort -Linear Search – Binary Search.
Text Books:
- Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition, Pearson Education, 1997.
- ReemaThareja, “Programming in C”, Second Edition, Oxford University Press, 2016.
References:
- Brian W. Kernighan, Rob Pike, “The Practice of Programming”, Pearson Education, 1999.
- Paul J. Deitel, Harvey Deitel, “C How to Program”, Seventh Edition, Pearson Education, 2013.
- Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson Education, 1983.
- Ellis Horowitz, SartajSahni and Susan Anderson, “Fundamentals of Data Structures”, Galgotia, 2008.
Related Posts Of Semester – III:
- MA3303 – Probability and Complex Functions
- EE3301 – Electromagnetic Fields
- EE3302 – Digital Logic Circuits