3rd Sem, IT

IT5352: Programming and Data Structures Syllabus for IT 3rd Sem 2019 Regulation Anna University

Programming and Data Structures detailed syllabus for Information Technology (IT) for 2019 regulation curriculum has been taken from the Anna Universities official website and presented for the IT students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below.

For Information Technology 3rd Sem scheme and its subjects, do visit IT 3rd Sem 2019 regulation scheme. The detailed syllabus of programming and data structures is as follows.

Programming and Data Structures

Course Objective:

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
Get it on Google Play.

Unit I

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

Suggested Activities:

  • Implementing programs using data types, arithmetic operators and basic input/output operations.
  • Developing programs using if-else, do-while, while, for, switch, break, continue, enum.
  • Write an application to perform operations like finding the maximum, minimum, average values using single dimensional integer and float arrays.
  • Develop an application to perform matrix operations using multi-dimensional arrays.
  • Create an application that performs operations like concatenation, finding a substring from a given string, etc. using character arrays.
  • Develop any application (student”s choice) using User-defined functions and Recursive functions.

Suggested Evaluation Methods:

  • Tutorials on conditionals and loops.
  • Evaluation of the programs implemented.

Unit II

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
Get it on Google Play.

Unit III

Linear Data Structures
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.

Suggested Activities:

  • Converting an algorithm from recursive to non-recursive using stack.
  • Demonstrating stack for Towers of Hanoi application.
  • Developing any application (student”s choice) using all the linear data structures.

Suggested Evaluation Methods:

  • Tutorials on applications of linear data structures.
  • Checking output of programs implemented.

Unit IV

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
Get it on Google Play.

Unit V

Sorting and Searching Techniques
Insertion Sort – Quick Sort – Heap Sort – Merge Sort -Linear Search – Binary Search.

Suggested Activities:

  • External learning – External sorting implementation.
  • Implementation of all sorting techniques in C language.
  • Demonstration of searching techniques under best and worst case inputs.

Suggested Evaluation Methods:

  • Tutorials on external sorting.
  • Checking output of programs implemented.

Course Outcome:

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
Get it on Google Play.

Text Books:

  1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Second Edition, Pearson Education, 1997.
  2. Reema Thareja, “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, Sartaj Sahni and Susan Anderson, “Fundamentals of Data Structures”, Galgotia, 2008.

For detailed syllabus of all other subjects of Information Technology, 2019 regulation curriculum do visit IT 3rd Sem subject syllabuses for 2019 regulation.

For all Information Technology results, visit Anna University IT all semester results direct link.

Leave a Reply

Your email address will not be published. Required fields are marked *

*