{"id":2773,"date":"2021-06-20T03:26:22","date_gmt":"2021-06-20T03:26:22","guid":{"rendered":"https:\/\/www.inspirenignite.com\/kl\/4133-data-structures-kl-diploma-syllabus-for-computer-engg-4th-sem-2015-revision-sitttr\/"},"modified":"2021-06-20T03:26:22","modified_gmt":"2021-06-20T03:26:22","slug":"4133-data-structures-kl-diploma-syllabus-for-computer-engg-4th-sem-2015-revision-sitttr","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/kl\/4133-data-structures-kl-diploma-syllabus-for-computer-engg-4th-sem-2015-revision-sitttr\/","title":{"rendered":"4133: Data Structures KL Diploma Syllabus for Computer Engg 4th Sem 2015 Revision SITTTR"},"content":{"rendered":"

Data Structures detailed syllabus for Computer Engineering (Computer Engg) for 2015 revision curriculum has been taken from the SITTTRs<\/a> official website and presented for the Computer Engg 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

For Computer Engineering 4th Sem scheme and its subjects, do visit Computer Engg 4th Sem 2015 revision scheme<\/a>. The detailed syllabus of data structures is as follows. <\/p>\n

Data Structures<\/title><\/p>\n<h4>Course General Outcomes:<\/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’s lives easier.<\/b><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&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>Specific outcomes:<\/h4>\n<p align=\"justify\">\n MODULE I STACK AND QUEUE<\/p>\n<ol>\n<li>Introduction to different Data Structures\n<ol type=\"i\">\n<li>Explain efficiency of algorithms, complexity and big O notation.<\/li>\n<li>Describe different data structures-linear and non linear<\/li>\n<li>Describe basic data structure operations – insertion, deletion, search, traverse<\/li>\n<li>Explain about Abstract Data Types (ADTs) and C++ classes<\/li>\n<li>Explain the use of iterators<\/li>\n<li>Describe the Array as an ADT with printArray() operation.<\/li>\n<\/ol>\n<\/li>\n<li>Understanding Stack and its operations\n<ol type=\"i\">\n<li>Describe Stack and its operations – Push and Pop.<\/li>\n<li>Explain about array representation of stacks<\/li>\n<li>Describe Stack ADT with push(), pop(), stackfull() and stackempty()<\/li>\n<li>Describe infix, prefix and postfix Expressions<\/li>\n<li>Explain infix to postfix conversion using Stack ADT<\/li>\n<li>Explain evaluation of postfox expression using stack ADT<\/li>\n<\/ol>\n<\/li>\n<li>Understanding Queues and its operations\n<ol type=\"i\">\n<li>Describe Queue and its operations – Insert and Delete.<\/li>\n<li>Describe circular queue and its array representation<\/li>\n<li>Describe Queue ADT (for circular queue) with insert(), delete(), QEmpty() and QFull().<\/li>\n<li>Describe Priority Queue and Dequeue<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<p> MODULE II LIST AND LINKED LIST<\/p>\n<ol>\n<li>Understanding list and its operations\n<ol type=\"i\">\n<li>Describe list (using array) and its operations – Find, MakeEmpty, PrintList etc.<\/li>\n<li>Describe List ADT with find(), makeEmpty(), printList(), findKth() etc.<\/li>\n<\/ol>\n<\/li>\n<li>Understanding linked list and its operations\n<ol type=\"i\">\n<li>Explain linked list and its operations – Find, MakeEmpty, PrintList, FindKth, Insert, Delete, Successor, Predecessor etc.<\/li>\n<li>Describe the methods of memory allocation and deallocation for nodes.<\/li>\n<li>Describe LinkedList ADT with find(), makeEmpty(), printList(), findKth(), insert(), delete() etc.<\/li>\n<li>Describe algorithm for implementing stack with LinkedList ADT.<\/li>\n<li>Describe algorithm for implementing queue with LinkedList ADT.<\/li>\n<li>Discribe about doubly linked lists and circular linked lists.<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<p> MODULE III TREES<\/p>\n<ol>\n<li>Understanding Trees and its operations\n<ol type=\"i\">\n<li>Explain binary tree, key terms related to trees and traversal methods.<\/li>\n<li>Explain Linked representation of binary trees<\/li>\n<li>Explain binary search trees (BST) and its operations – traversals, insertion, deletion and find.<\/li>\n<li>Describe BST ADT with inOrder(), preOrder(), postOrder(), insert(), delete(), find() etc.<\/li>\n<li>Describe Expression trees and Threaded binary trees.<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<p> MODULE IV GRAPH<\/p>\n<ol>\n<li>Understanding Graph and its operations\n<ol type=\"i\">\n<li>Explain graph and key terms related to graphs<\/li>\n<li>Explain graph representations – adjacency matrix mehod and adjacency list method.<\/li>\n<li>Describe graph traversals – DFS and BFS<\/li>\n<li>Describe Graph ADT with dfs() and bfs() methods.<\/li>\n<li>Describe and implement Warshall’s algorithm for all-pairs shortest path<\/li>\n<\/ol>\n<\/li>\n<li>Understanding Searching and Sorting\n<ol type=\"i\">\n<li>Explain and implement linear search and binary search algorithms<\/li>\n<li>Explain and implement bubble sort and quick sort algorithms<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<h4>MODULE I : STACK AND QUEUE<\/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’s lives easier.<\/b><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&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>MODULE II : LIST AND LINKED LIST<\/h4>\n<p align=\"justify\">\n List using array – List ADT – find(), makeEmpty(), printList() and findKth() operations. Linked List -Memory allocation and de-allocation – LinkedList ADT – find(), makeEmpty(), printList(), findKth(), insert() operations – stack with LinkedList, queue with LinkedList – doubly linked list and circular list\n<\/p>\n<h4>MODULE III : TREES<\/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’s lives easier.<\/b><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&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>MODULE IV : GRAPH<\/h4>\n<p align=\"justify\">\n Graph Definition- Key terms – Representations – Traversal Algorithms – BFS,DFS – Graph ADT – All-pairs Shortest Path Algorithm. Searching and Sorting Algorithms-Linear search and Binary search – Bubble sort and Quick sort algorithms.\n<\/p>\n<h4>Text Books:<\/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’s lives easier.<\/b><br \/><a class=\"rank-math-link\" href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&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>Reference Books:<\/h4>\n<p align=\"justify\">\n<ol>\n<li>Data Structures, Algorithms and Applications in C++, Sartaj Sahni, University Press<\/li>\n<li>Data Structures using C and C++ by Yedidyah Langsam, Moshe J. Augenstein and Aron M. Tananbaum, PHI.2002<\/li>\n<\/ol>\n<p align=\"justify\">For detailed syllabus of all other subjects of Computer Engineering, 2015 revision curriculum do visit <a class=\"rank-math-link\" href=\"..\/category\/computer-engg+4th-sem\">Computer Engg 4th Sem subject syllabuses for 2015 revision<\/a>. <\/p>\n<p align=\"justify\">To see the syllabus of all other branches of diploma 2015 revision curriculum do visit <a class=\"rank-math-link\" href=\"https:\/\/www.inspirenignite.com\/kl\/kerala-diploma-syllabus\/\">all branches of SITTTR diploma 2015 revision<\/a>. <\/p>\n","protected":false},"excerpt":{"rendered":"<p>Data Structures detailed syllabus for Computer Engineering (Computer Engg) for 2015 revision curriculum has been taken from the SITTTRs official website and presented for the Computer Engg students. For course […]<\/p>\n","protected":false},"author":2462,"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":[35,47],"tags":[],"class_list":["post-2773","post","type-post","status-publish","format-standard","hentry","category-4th-sem","category-computer"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/kl\/wp-json\/wp\/v2\/posts\/2773","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/kl\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/kl\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/kl\/wp-json\/wp\/v2\/users\/2462"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/kl\/wp-json\/wp\/v2\/comments?post=2773"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/kl\/wp-json\/wp\/v2\/posts\/2773\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/kl\/wp-json\/wp\/v2\/media?parent=2773"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/kl\/wp-json\/wp\/v2\/categories?post=2773"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/kl\/wp-json\/wp\/v2\/tags?post=2773"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}