CS3353 Syllabus - C Programming And Data Structures - 2021 Regulation Anna University

CS3353 Syllabus - C Programming And Data Structures - 2021 Regulation Anna University

CS3353

C PROGRAMMING AND DATA STRUCTURES

 LTPC
3003

COURSE OBJECTIVES:
• To introduce the basics of C programming language.
• To learn the concepts of advanced features of C.
• To learn the concepts of advanced features of C.
• 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.

TOTAL: 45 PERIODS

SKILL DEVELOPMENT ACTIVITIES (Group Seminar/Mini Project/Assignment/Content Preparation / Quiz/ Surprise Test / Solving GATE questions/ etc)
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.

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.
Previous
Next

Comments

Post a Comment

Popular posts from this blog

CS3491 Syllabus - Artificial Intelligence And Machine Learning - 2021 Regulation Anna University

CS3491 Syllabus - Artificial Intelligence And Machine Learning - 2021 Regulation Anna University CS3491 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING  LTPC 3024 COURSE OBJECTIVES: • The main objectives of this course are to: • Study about uninformed and Heuristic search techniques. • Learn techniques for reasoning under uncertainty • Introduce Machine Learning and supervised learning algorithms • Study about ensembling and unsupervised learning algorithms • Learn the basics of deep learning using neural networks We're excited to announce the launch of our new website! Visit NameWheelSpinner.com to explore its features and benefits. UNIT I PROBLEM SOLVING 9 Introduction to AI - AI Applications - Problem solving agents – search algorithms – uninformed
Read more

BE3251 - Basic Electrical and Electronics Engineering (Syllabus) 2021-regulation Anna University

BE3251 - Basic Electrical and Electronics Engineering (Syllabus) 2021-regulation Anna University BE3251 Basic Electrical and Electronics Engineering  LPTC 3003 COURSE OBJECTIVES: • To introduce the basics of electric circuits and analysis • To impart knowledge in the basics of working principles and application of electrical machines • To introduce analog devices and their characteristics • To educate on the fundamental concepts of digital electronics • To introduce the functional elements and working of measuring instruments We're excited to announce the launch of our new website! Visit NameWheelSpinner.com to explore its features and benefits. UNIT I ELECTRICAL CIRCUITS 9 DC Circuits: Circuit Components: Conductor, Resistor, Inductor, Capacitor – Ohm’s Law - Kirchhoff’s Laws –Independent and Dependent Sources – Simple problems- Nodal Analysis, Mesh analysis with Independent sources only (Steady state) Introd
Read more

CS3401 Syllabus - Algorithms - 2021 Regulation Anna University

CS3401 Syllabus - Algorithms - 2021 Regulation Anna University CS3401 ALGORITHMS  LTPC 3024 COURSE OBJECTIVES: • To understand and apply the algorithm analysis techniques on searching and sorting algorithms • To critically analyze the efficiency of graph algorithms • To understand different algorithm design techniques • To solve programming problems using state space tree • To understand the concepts behind NP Completeness, Approximation algorithms and randomized algorithms. We're excited to announce the launch of our new website! Visit NameWheelSpinner.com to explore its features and benefits. UNIT I INTRODUCTION 9 Algorithm analysis: Time and space complexity - Asymptotic Notations and its properties Best case, Worst case and average case analys
Read more