{"id":3424,"date":"2017-12-08T13:42:01","date_gmt":"2017-12-08T13:42:01","guid":{"rendered":"http:\/\/www.inspirenignite.com\/jntuh\/?p=3424"},"modified":"2019-07-14T19:04:16","modified_gmt":"2019-07-14T19:04:16","slug":"jntuh-b-tech-2016-2017-r16-detailed-syllabus-data-structures-c","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuh\/jntuh-b-tech-2016-2017-r16-detailed-syllabus-data-structures-c\/","title":{"rendered":"JNTUH B.Tech 2016-2017 (R16) Detailed Syllabus Data Structures through C++"},"content":{"rendered":"<p>Data Structures through C++ Detailed Syllabus for B.Tech second year first 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 through C++ B.Tech 2016-2017 (R16) \u00a0second year first sem is as follows.<\/p>\n<p>B.Tech. II Year I Sem. \u00a0 \u00a0L\/T\/P\/C<br \/>\nCourse Code: CS302ES 4\/0\/0\/4<\/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 Linear\u00a0Data 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 an appropriate data structure for a specified application.<\/li>\n<li>To understand and analyze various searching and sorting algorithms.<\/li>\n<li>To learn to implement ADTs such as lists, stacks, queues, trees, graphs, search trees\u00a0in C++ to solve problems.<\/li>\n<\/ul>\n<p><strong>Course Outcomes:<\/strong><\/p>\n<ul>\n<li>Ability to choose appropriate data structures to represent data items in real world\u00a0problems.<\/li>\n<li>Ability to analyze the time and space complexities of algorithms.<\/li>\n<li>Ability to design programs using a variety of data structures such as stacks, queues,\u00a0hash tables, binary trees, search trees, heaps, graphs, and B-trees.<\/li>\n<li>Able to analyze and implement various kinds of searching and sorting techniques.<\/li>\n<\/ul>\n<p><strong>UNIT &#8211; I\u00a0C++ Programming Concepts:<\/strong> Review of C, input and output in C++, functions in C++-<br \/>\nvalue parameters, reference parameters, Parameter passing, function overloading, function\u00a0templates, Exceptions-throwing an exception and handling an exception, arrays, pointers,\u00a0new and delete operators, class and object, access specifiers , friend functions, constructors\u00a0and destructor, Operator overloading, class templates, Inheritance and Polymorphism..\u00a0Basic Concepts &#8211; Data objects and Structures, Algorithm Specification-Introduction,\u00a0Recursive algorithms, Data Abstraction, Performance analysis- time complexity and space\u00a0complexity, Asymptotic Notation-Big O, Omega and Theta notations, Complexity Analysis\u00a0Examples, Introduction to Linear and Non Linear data structures.<\/p>\n<p><strong>UNIT &#8211; II\u00a0Representation of single<\/strong>, two dimensional arrays, sparse matrices-array and linked<br \/>\nrepresentations.\u00a0Linear list ADT-array representation and linked representation, Singly Linked ListsOperations-Insertion,\u00a0Deletion, Circularly linked lists-Operations for Circularly linked lists,<br \/>\nDoubly Linked Lists- Operations- Insertion, Deletion.\u00a0Stack ADT, definition, array and linked implementations, applications-infix to postfix\u00a0conversion, Postfix expression evaluation, recursion implementation, Queue ADT, definition,\u00a0array and linked Implementations, Circular queues-Insertion and deletion operations.<\/p>\n<p><strong>UNIT &#8211; III\u00a0Trees<\/strong> \u2013 definition, terminology, Binary trees-definition, Properties of Binary Trees, Binary<br \/>\nTree ADT, representation of Binary Trees-array and linked representations, Binary Tree\u00a0traversals, Threaded binary trees, Priority Queues \u2013Definition and applications, Max Priority\u00a0Queue ADT-implementation-Max Heap-Definition, Insertion into a Max Heap, Deletion\u00a0from a Max Heap.<\/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>Data structures, Algorithms and Applications in C++, 2nd Edition, Sartaj Sahni,\u00a0Universities Press.<\/li>\n<li>Data structures and Algorithms in C++, Adam Drozdek, 4th edition, Cengage learning.<\/li>\n<\/ul>\n<p><strong>REFERENCE BOOKS<\/strong>:<\/p>\n<ul>\n<li>Data structures with C++, J. Hubbard, Schaum\u2019s outlines, TMH.<\/li>\n<li>Data structures and Algorithms in C++, M.T. Goodrich, R. Tamassia and D. Mount,\u00a0Wiley India.<\/li>\n<li>Data structures and Algorithm Analysis in C++, 3rd edition, M. A. Weiss, Pearson.<\/li>\n<li>Classic Data Structures, D. Samanta, 2nd edition, PHI.<\/li>\n<\/ul>\n<p>For all other B.Tech 2nd\u00a0Year 1st Sem syllabus go to <a href=\"https:\/\/www.inspirenignite.com\/jntuh\/jntuh-second-year-first-sem-information-technology-course-structure-for-2016-2017-r16-batch\/\">JNTUH B.Tech Information Technology 2nd\u00a0Year 1st 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 through C++ Detailed Syllabus for B.Tech second year first sem is covered here. This gives the details about credits, number of hours and other details along with reference [&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-3424","post","type-post","status-publish","format-standard","hentry","category-syllabus"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/3424","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=3424"}],"version-history":[{"count":3,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/3424\/revisions"}],"predecessor-version":[{"id":18016,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/3424\/revisions\/18016"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/media?parent=3424"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/categories?post=3424"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/tags?post=3424"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}