{"id":3067,"date":"2021-06-20T03:37:48","date_gmt":"2021-06-20T03:37:48","guid":{"rendered":"https:\/\/www.inspirenignite.com\/kl\/3261-foundations-of-computer-software-kl-diploma-syllabus-for-it-3rd-sem-2015-revision-sitttr\/"},"modified":"2021-06-20T03:37:48","modified_gmt":"2021-06-20T03:37:48","slug":"3261-foundations-of-computer-software-kl-diploma-syllabus-for-it-3rd-sem-2015-revision-sitttr","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/kl\/3261-foundations-of-computer-software-kl-diploma-syllabus-for-it-3rd-sem-2015-revision-sitttr\/","title":{"rendered":"3261: Foundations of Computer Software KL Diploma Syllabus for IT 3rd Sem 2015 Revision SITTTR"},"content":{"rendered":"<p align=\"justify\">Foundations of Computer Software detailed syllabus for Information Technology (IT) for 2015 revision curriculum has been taken from the <a class=\"rank-math-link\" href=\"http:\/\/www.sitttrkerala.ac.in\/\" style=\"color: inherit\" target=\"_blank\" rel=\"noopener\">SITTTRs<\/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-kl-diploma-syllabus-for-3rd-sem-2015-revision-sitttr\">IT 3rd Sem 2015 revision scheme<\/a>. The detailed syllabus of foundations of computer software is as follows. <\/p>\n<p>  <title>Foundations of Computer Software<\/title><\/p>\n<h4>Course 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&#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>Specific Outcomes:<\/h4>\n<p align=\"justify\">\n  MODULE &#8211; I: Introduction to Data Structures<\/p>\n<ol>\n<li>Understand the concepts of data structures\n<ol type=\"i\">\n<li>Define Data Structures<\/li>\n<li>Explain basic data structures<\/li>\n<li>Recall the concept of Arrays<\/li>\n<\/ol>\n<\/li>\n<li>Discuss linear data structures\n<ol type=\"i\">\n<li>Discuss stacks and its operations.<\/li>\n<li>Describe Queue and its operations.<\/li>\n<li>Explain a circular queue<\/li>\n<li>Describe a priority queue<\/li>\n<li>Explain about de-queue<\/li>\n<li>Define a linked list.<\/li>\n<li>Discuss the Linked List operations- Insertion, deletion and searching.<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<p>  MODULE &#8211; II: Searching, Sorting, Tree and Graph<\/p>\n<ol>\n<li>Analyze standard algorithms for searching and sorting.\n<ol type=\"i\">\n<li>Differentiate between various searching methods.<\/li>\n<li>Explain linear search.<\/li>\n<li>Illustrate binary search.<\/li>\n<li>Define Sorting.<\/li>\n<li>Explain Selection sort.<\/li>\n<li>Describe bubble sort.<\/li>\n<li>Discuss insertion sort.<\/li>\n<li>Explain quick sort<\/li>\n<li>Describe merge sort<\/li>\n<li>Differentiate between the sorting methods Bubble Sort, Selection Sort and Insert Sort<\/li>\n<\/ol>\n<\/li>\n<li>To understand the non-linear data structures\n<ol type=\"i\">\n<li>Define Tree and Binary tree.<\/li>\n<li>Differentiate between the various tree traversal methods<\/li>\n<li>Define Graph<\/li>\n<li>Explain Depth First searching in Graph<\/li>\n<li>Explain Breadth first searching in Graph<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<p>  MODULE &#8211; III: Basics of System Software and Operating Systems<\/p>\n<ol>\n<li>Discuss different system software\n<ol type=\"i\">\n<li>Define Software<\/li>\n<li>Differentiate between Application software and System Software<\/li>\n<li>Compare various system software.<\/li>\n<li>Discuss fundamentals of system software.<\/li>\n<li>Explain about language translator.<\/li>\n<\/ol>\n<\/li>\n<li>Discuss about operating systems\n<ol type=\"i\">\n<li>Define Operating System<\/li>\n<li>Recognize usage of operating systems.<\/li>\n<li>List different types of operating systems.<\/li>\n<li>Explain batch processing system.<\/li>\n<li>Discuss multi programmed system.<\/li>\n<li>Describe a time sharing system.<\/li>\n<\/ol>\n<\/li>\n<li>Discuss process management concepts\n<ol type=\"i\">\n<li>Define Process<\/li>\n<li>Explain the process states<\/li>\n<li>Define Process Control Block.<\/li>\n<li>Discuss process scheduling algorithms- FCFS, SJF, Round Robin, Priority Scheduling.<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<p>  MODULE &#8211; IV: Memory management, I\/O Systems, File System 4.1Understand the concepts of memory management<\/p>\n<ol>\n<ol type=\"i\">\n<li>Discuss the need for memory management<\/li>\n<li>Explain dynamic loading.<\/li>\n<li>Describe swapping.<\/li>\n<li>Discuss the concept and need of paging<\/li>\n<li>Describe segmentation.<\/li>\n<li>Explain virtual memory concept.<\/li>\n<li>Compare the various page replacement algorithms.<\/li>\n<\/ol>\n<li>Discuss File System and I\/O system concepts\n<ol type=\"i\">\n<li>Explain the file concept<\/li>\n<li>Discuss the File Access methods<\/li>\n<li>Compare the various Directory Structures.<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<h4>MODULE &#8211; I:<\/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>MODULE &#8211; II:<\/h4>\n<p align=\"justify\">\n  Searching, Sorting, Tree and Graph Searching &amp; Sorting- linear search, binary search; Selection sort, Insertion sort, Bubble sort, Merge sort, Quick sort, Comparison of different sorting methods(based on applications); Trees &amp; Graphs &#8211; Trees &#8211; Binary Trees &#8211; Tree Traversal &#8211; In order &#8211; Pre order and Post order. Graphs: &#8211; Depth first and breadth first search.\n<\/p>\n<h4>MODULE &#8211; III:<\/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>MODULE &#8211; IV:<\/h4>\n<p align=\"justify\">\n  Memory management, I\/O Systems, File System Memory management:Dynamic loading, swapping, Paging- basics, Segmentation, Virtual memory-page replacement algorithms; I\/O systems- basics, File-System- File Concept, Access Methods, Directory Structure.\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&#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>Reference Books:<\/h4>\n<p align=\"justify\">\n<ol>\n<li>R Krishnamoorthy&amp; G IndiraniKumaravel, Data Structures using C, McGraw Hill , New Delhi, 2008<\/li>\n<li>Brijendra Kumar Joshi, Data Structures and Algorithms in C, McGraw Hill , New Delhi, 2010<\/li>\n<li>Achyut S Godbole, Operating Systems, Tata McGraw Hill , New Delhi, 2nd Edition, 2009<\/li>\n<li>D M Dhamdhere, Operating Systems A Concept-based Approach, Tata McGraw Hill, New Delhi, 2nd Edition, 2010<\/li>\n<li>V Raghavan, Priniples of Compiler Design,Tata McGraw Hill, India, 2010<\/li>\n<\/ol>\n<p align=\"justify\">For detailed syllabus of all other subjects of Information Technology, 2015 revision curriculum do visit <a class=\"rank-math-link\" href=\"..\/category\/it+3rd-sem\">IT 3rd 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>Foundations of Computer Software detailed syllabus for Information Technology (IT) for 2015 revision curriculum has been taken from the SITTTRs official website and presented for the IT students. For course [&hellip;]<\/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":[34,52],"tags":[],"class_list":["post-3067","post","type-post","status-publish","format-standard","hentry","category-3rd-sem","category-it"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/kl\/wp-json\/wp\/v2\/posts\/3067","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=3067"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/kl\/wp-json\/wp\/v2\/posts\/3067\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/kl\/wp-json\/wp\/v2\/media?parent=3067"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/kl\/wp-json\/wp\/v2\/categories?post=3067"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/kl\/wp-json\/wp\/v2\/tags?post=3067"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}