{"id":33041,"date":"2021-05-21T08:08:50","date_gmt":"2021-05-21T08:08:50","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/it5352-programming-and-data-structures-syllabus-for-it-3rd-sem-2019-regulation-anna-university\/"},"modified":"2021-05-21T08:08:50","modified_gmt":"2021-05-21T08:08:50","slug":"it5352-programming-and-data-structures-syllabus-for-it-3rd-sem-2019-regulation-anna-university","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/it5352-programming-and-data-structures-syllabus-for-it-3rd-sem-2019-regulation-anna-university\/","title":{"rendered":"IT5352: Programming and Data Structures Syllabus for IT 3rd Sem 2019 Regulation Anna University"},"content":{"rendered":"<p align=\"justify\">Programming and Data Structures detailed syllabus for Information Technology (IT) for 2019 regulation curriculum has been taken from the <a class=\"rank-math-link\" href=\"https:\/\/cac.annauniv.edu\/\" style=\"color: inherit\" target=\"_blank\" rel=\"noopener\">Anna Universities<\/a> 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. <\/p>\n<p align=\"justify\">For Information Technology 3rd Sem scheme and its subjects, do visit <a class=\"rank-math-link\" href=\"..\/information-technology-it-syllabus-for-3rd-sem-2019-regulation-anna-university\">IT 3rd Sem 2019 regulation scheme<\/a>. The detailed syllabus of programming and data structures is as follows. <\/p>\n<p>  <title>Programming and Data Structures<\/title><\/p>\n<h4>Course Objective:<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdfs platform to make students&#8217;s lives easier.<\/b><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>.   <\/p>\n<h4>Unit I<\/h4>\n<p align=\"justify\">\n  <strong>C Programming Fundamentals<\/strong><br \/>\n  Data Types &#8211; Variables &#8211; Operations &#8211; Expressions and Statements &#8211; Conditional Statements &#8211; Functions &#8211; Recursive Functions &#8211; Arrays &#8211; Single and Multi-Dimensional Arrays.<\/p>\n<p><i>Suggested Activities:<\/i>\n  <\/p>\n<ul>\n<li>Implementing programs using data types, arithmetic operators and basic input\/output operations.<\/li>\n<li>Developing programs using if-else, do-while, while, for, switch, break, continue, enum.<\/li>\n<li>Write an application to perform operations like finding the maximum, minimum, average values using single dimensional integer and float arrays.<\/li>\n<li>Develop an application to perform matrix operations using multi-dimensional arrays.<\/li>\n<li>Create an application that performs operations like concatenation, finding a substring from a given string, etc. using character arrays.<\/li>\n<li>Develop any application (student&#8221;s choice) using User-defined functions and Recursive functions.<\/li>\n<\/ul>\n<p><i>Suggested Evaluation Methods:<\/i>\n  <\/p>\n<ul>\n<li>Tutorials on conditionals and loops.<\/li>\n<li>Evaluation of the programs implemented.<\/li>\n<\/ul>\n<h4>Unit II<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdfs platform to make students&#8217;s lives easier.<\/b><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>.   <\/p>\n<h4>Unit III<\/h4>\n<p align=\"justify\">\n  <strong>Linear Data Structures<\/strong><br \/>\n  Abstract Data Types (ADTs) &#8211; List ADT &#8211; Array-Based Implementation &#8211; Linked List -Doubly-Linked Lists &#8211; Circular Linked List &#8211; Stack ADT &#8211; Implementation of Stack -Applications &#8211; Queue ADT &#8211; Priority Queues &#8211; Queue Implementation &#8211; Applications.<\/p>\n<p><i>Suggested Activities:<\/i>\n  <\/p>\n<ul>\n<li>Converting an algorithm from recursive to non-recursive using stack.<\/li>\n<li>Demonstrating stack for Towers of Hanoi application.<\/li>\n<li>Developing any application (student&#8221;s choice) using all the linear data structures.<\/li>\n<\/ul>\n<p><i>Suggested Evaluation Methods:<\/i>\n  <\/p>\n<ul>\n<li>Tutorials on applications of linear data structures.<\/li>\n<li>Checking output of programs implemented.<\/li>\n<\/ul>\n<h4>Unit IV<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdfs platform to make students&#8217;s lives easier.<\/b><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>.   <\/p>\n<h4>Unit V<\/h4>\n<p align=\"justify\">\n  <strong>Sorting and Searching Techniques<\/strong><br \/>\n  Insertion Sort &#8211; Quick Sort &#8211; Heap Sort &#8211; Merge Sort -Linear Search &#8211; Binary Search.<\/p>\n<p><i>Suggested Activities:<\/i>\n  <\/p>\n<ul>\n<li>External learning &#8211; External sorting implementation.<\/li>\n<li>Implementation of all sorting techniques in C language.<\/li>\n<li>Demonstration of searching techniques under best and worst case inputs.<\/li>\n<\/ul>\n<p><i>Suggested Evaluation Methods:<\/i>\n  <\/p>\n<ul>\n<li>Tutorials on external sorting.<\/li>\n<li>Checking output of programs implemented.<\/li>\n<\/ul>\n<h4>Course Outcome:<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete syllabus, results, class timetable, and many other features kindly download the <a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdfs platform to make students&#8217;s lives easier.<\/b><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>.   <\/p>\n<h4>Text Books:<\/h4>\n<p align=\"justify\">\n<ol>\n<li>Mark Allen Weiss, &#8220;Data Structures and Algorithm Analysis in C&#8221;, Second Edition, Pearson Education, 1997.<\/li>\n<li>Reema Thareja, &#8220;Programming in C&#8221;, Second Edition, Oxford University Press, 2016.<\/li>\n<\/ol>\n<h4>References:<\/h4>\n<p align=\"justify\">\n<ol>\n<li>Brian W. Kernighan, Rob Pike, &#8220;The Practice of Programming&#8221;, Pearson Education, 1999.<\/li>\n<li>Paul J. Deitel, Harvey Deitel, &#8220;C How to Program&#8221;, Seventh Edition, Pearson Education, 2013.<\/li>\n<li>Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, &#8220;Data Structures and Algorithms&#8221;, Pearson Education,1983.<\/li>\n<li>Ellis Horowitz, Sartaj Sahni and Susan Anderson, &#8220;Fundamentals of Data Structures&#8221;, Galgotia, 2008.<\/li>\n<\/ol>\n<p align=\"justify\">For detailed syllabus of all other subjects of Information Technology, 2019 regulation curriculum do visit <a class=\"rank-math-link\" href=\"..\/category\/it+3rd-sem\">IT 3rd Sem subject syllabuses for 2019 regulation<\/a>. <\/p>\n<p align=\"justify\">For all Information Technology results, visit <a class=\"rank-math-link\" href=\"https:\/\/www.inspirenignite.com\/anna-university\/anna-university-results\/\">Anna University IT all semester results<\/a> direct link. <\/p>\n","protected":false},"excerpt":{"rendered":"<p>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 [&hellip;]<\/p>\n","protected":false},"author":2297,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"categories":[46,72],"tags":[],"class_list":["post-33041","post","type-post","status-publish","format-standard","hentry","category-3rd-sem","category-it"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/33041","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/users\/2297"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/comments?post=33041"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/33041\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=33041"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=33041"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=33041"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}