{"id":4859,"date":"2018-01-17T11:57:56","date_gmt":"2018-01-17T11:57:56","guid":{"rendered":"http:\/\/www.inspirenignite.com\/jntuh\/?p=4859"},"modified":"2019-07-15T07:56:27","modified_gmt":"2019-07-15T07:56:27","slug":"jntuh-b-tech-2016-2017-r16-detailed-syllabus-data-structures","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuh\/jntuh-b-tech-2016-2017-r16-detailed-syllabus-data-structures\/","title":{"rendered":"JNTUH B.Tech 2016-2017 (R16) Detailed Syllabus Data Structures"},"content":{"rendered":"<p>Data Structures Detailed Syllabus for B.Tech third year second sem is covered here. This gives the details about credits, number of hours and other details along with reference books for the course.<\/p>\n<p>The detailed syllabus for Data Structures B.Tech 2016-2017 (R16) third year second sem is as follows.<\/p>\n<p>B.Tech. III Year II Sem. \u00a0 L\/T\/P\/C<br \/>\nCourse Code:MT621OE \u00a0 \u00a03\/0\/0\/3<\/p>\n<p><strong>Course Objectives:<\/strong><\/p>\n<ul>\n<li>To understand the basic concepts such as Abstract Data Types, Linear, and Non\u00a0Linear Data structures.<\/li>\n<li>To understand the notations used to analyze the Performance of algorithms.<\/li>\n<li>To understand the behavior of data structures such as stacks, queues, trees, hash\u00a0tables, search trees, Graphs and their representations.<\/li>\n<li>To choose the appropriate data structure for a specified application.<\/li>\n<li>To understand and analyze various searching and sorting algorithms.<\/li>\n<li>To write programs in C to solve problems using data structures such as arrays, linked\u00a0lists, stacks, queues, trees, graphs, hash tables, search trees.<\/li>\n<\/ul>\n<p><strong>Course Outcomes:<\/strong><\/p>\n<ul>\n<li>Learn how to use data structure concepts for realistic problems.<\/li>\n<li>Ability to identify appropriate data structure for solving computing problems in\u00a0respective language.<\/li>\n<li>Ability to solve problems independently and think critically.<\/li>\n<\/ul>\n<p><strong>UNIT &#8211; I<\/strong>\u00a0 \u00a0Basic concepts- Algorithm Specification-Introduction, Recursive algorithms, Data\u00a0Abstraction Performance analysis- time complexity and space complexity, Asymptotic\u00a0Notation-Big O, Omega, and Theta notations, Introduction to Linear and Non Linear data\u00a0structures.\u00a0Singly Linked Lists-Operations-Insertion, Deletion, Concatenating singly linked lists,\u00a0circularly linked lists-Operations for Circularly linked lists, Doubly Linked Lists- Operations Insertion,\u00a0Deletion.\u00a0Representation of single, two dimensional arrays, sparse matrices-array and linked\u00a0representations.<\/p>\n<p><strong>UNIT &#8211; II \u00a0\u00a0<\/strong>Stack ADT, definition, operations, array and linked implementations in C, applications-infix\u00a0to postfix conversion, Postfix expression evaluation, recursion implementation, Queue ADT,\u00a0definition and operations ,array and linked Implementations in C, Circular queues-Insertion\u00a0and deletion operations, Deque (Double ended queue)ADT, array and linked implementations\u00a0in C.<\/p>\n<p><strong>UNIT &#8211; III<\/strong> \u00a0Trees \u2013 Terminology, Representation of Trees, Binary tree ADT, Properties of Binary Trees,\u00a0Binary Tree Representations-array and linked representations, Binary Tree traversals,\u00a0threaded binary trees, Max Priority Queue ADT-implementation-Max Heap-Definition,\u00a0Insertion into a Max Heap, Deletion from a Max Heap.\u00a0Graphs \u2013 Introduction, Definition, Terminology, Graph ADT, Graph Representations Adjacency\u00a0matrix, Adjacency lists, Graph traversals &#8211; DFS and BFS.<\/p>\n<p style=\"text-align: center\"><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\"><strong><span style=\"color: #ff0000\">Download iStudy Android App for complete JNTUH syllabus, results, timetables and all other updates. There are no ads and no pdfs and will make your life way easier<\/span>.<\/strong><\/a><\/p>\n<p><strong>TEXT BOOKS:<\/strong><\/p>\n<ul>\n<li>Fundamentals of Data structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan\u00a0Anderson-Freed, Universities Press.<\/li>\n<li>Data structures A Programming Approach with C, D. S. Kushwaha and A.K. Misra,\u00a0PHI.<\/li>\n<\/ul>\n<p><strong>REFERENCE BOOKS:<\/strong><\/p>\n<ul>\n<li>Data structures: A Pseudo code Approach with C, 2nd edition, R. F. Gilberg And B. A.\u00a0Forouzan, Cengage Learning.<\/li>\n<li>Data structures and Algorithm Analysis in C, 2nd edition, M. A. Weiss, Pearson.<\/li>\n<li>Data Structures using C, A.M. Tanenbaum, Y. Langsam, M. J. Augenstein, Pearson.<\/li>\n<li>Data structures and Program Design in C, 2nd edition, R. Kruse, C. L. Tondo and B.\u00a0Leung, Pearson.<\/li>\n<li>Data Structures and Algorithms made easy in JAVA, 2nd Edition, Narsimha\u00a0Karumanchi, Career Monk Publications.<\/li>\n<li>Data Structures using C, R. Thareja, Oxford University Press.<\/li>\n<li>Data Structures, S. Lipscutz, Schaum\u2019s Outlines, TMH.<\/li>\n<li>Data structures using C, A. K. Sharma, 2nd edition, Pearson..<\/li>\n<li>Data Structures using C &amp; C++, R. Shukla, Wiley India.<\/li>\n<li>Classic Data Structures, D. Samanta, 2nd edition, PHI.<\/li>\n<li>Advanced Data structures, Peter Brass, Cambridge.<\/li>\n<\/ul>\n<p>For all other B.Tech 3rd Year 2nd Sem syllabus go to <a href=\"https:\/\/www.inspirenignite.com\/jntuh\/jntuh-third-year-second-sem-mechanical-engineering-mechatronics-course-structure-2016-2017-r16-batch\/\">JNTUH B.Tech\u00a0Mechanical Engineering (Mechatronics) 3rd\u00a0Year 2nd Sem Course Structure for (R16) Batch.<\/a><\/p>\n<p>All details and yearly new syllabus will be updated here time to time. Subscribe, like us on facebook and follow us on google plus for all updates.<\/p>\n<p>Do share with friends and in case of questions please feel free drop a comment.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Data Structures Detailed Syllabus for B.Tech third year second sem is covered here. This gives the details about credits, number of hours and other details along with reference books for [&hellip;]<\/p>\n","protected":false},"author":2259,"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":[62],"tags":[],"class_list":["post-4859","post","type-post","status-publish","format-standard","hentry","category-syllabus"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/4859","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/users\/2259"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/comments?post=4859"}],"version-history":[{"count":4,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/4859\/revisions"}],"predecessor-version":[{"id":18382,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/4859\/revisions\/18382"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/media?parent=4859"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/categories?post=4859"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/tags?post=4859"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}