{"id":469,"date":"2016-07-23T07:04:12","date_gmt":"2016-07-23T07:04:12","guid":{"rendered":"http:\/\/www.inspirenignite.com\/jntuk\/?p=469"},"modified":"2016-08-07T12:20:31","modified_gmt":"2016-08-07T12:20:31","slug":"jntuk-b-tech-advanced-data-structures-for-r13-batch","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuk\/jntuk-b-tech-advanced-data-structures-for-r13-batch\/","title":{"rendered":"JNTUK B.Tech Advanced Data Structures for R13 Batch."},"content":{"rendered":"<p>JNTUK B.Tech Advanced Data Structures gives you detail information of Advanced Data Structures R13 syllabus It will be help full to understand you complete curriculum of the year.<\/p><div class=\"a9916ad81d5189659b0bfae0b37c143c\" data-index=\"1\" style=\"float: none; margin:10px 0 10px 0; text-align:center;\">\n<ins class=\"adsbygoogle\"\r\n     style=\"display:block; text-align:center;\"\r\n     data-ad-layout=\"in-article\"\r\n     data-ad-format=\"fluid\"\r\n     data-ad-client=\"ca-pub-1181153414625576\"\r\n     data-ad-slot=\"9648548092\"><\/ins>\r\n<script>\r\n     (adsbygoogle = window.adsbygoogle || []).push({});\r\n<\/script>\n<\/div>\n\n<p>(<strong>Note:<\/strong> C++ and Java implementation is not included in the syllabus)<\/p>\n<p><strong>Objectives<\/strong>: Exposed to hashing approaches, variants of trees , heaps, queues, implementation of graph algorithms, analysis of sorting algorithms with respect to bounds and file organizations and operations<\/p>\n<p><strong>UNIT I<\/strong><\/p>\n<ul>\n<li><strong>Objectives<\/strong>: Comprehensive understanding of dictionaries, hashing mechanism which supports faster retrieval and skip lists<\/li>\n<li><strong>Dictionaries<\/strong> : Sets, Dictionaries, Hash Tables, Open Hashing, Closed Hashing (Rehashing Methods), Hashing Functions( Division Method, Multiplication Method, Universal Hashing), Skip Lists, Analysis of Skip Lists. (Reference 1)<\/li>\n<\/ul>\n<p><strong>UNIT II<\/strong><\/p>\n<ul>\n<li><strong>Objectives<\/strong>: Illustartion of Balanced trees and their operations<\/li>\n<li><strong>AVL Trees:<\/strong> Maximum Height of AVL Tree, Insertions and Deletions. 2-3 Trees : Insertion, Deletion.<\/li>\n<\/ul>\n<p><strong>UNIT III<\/strong><\/p>\n<ul>\n<li><strong>Objectives<\/strong>: Comprehension of heaps, queues and their operations<\/li>\n<li><strong>Priority Queues<\/strong> :<\/li>\n<li><strong>Binary Heaps<\/strong> : Implementation of Insert and Delete min, Creating Heap.<\/li>\n<li><strong>Binomial Queues<\/strong> : Binomial Queue Operations, Binomial Amortized Analysis, Lazy Binomial Queues<\/li>\n<\/ul>\n<p><strong>UNIT IV<\/strong><\/p>\n<ul>\n<li><strong>Objectives:<\/strong> Detailed knowledge of nonlinear data structures and various algorithms using them Graph algorithms : Minimum-Cost Spanning Trees- Prim&#8217;s Algorithm, Kruskal&#8217;s Algorithm Shortest Path<\/li>\n<li><strong>Algorithms:<\/strong> Dijkstra&#8217;s Algorithm, All Pairs Shortest Paths Problem: Floyd&#8217;s Algorithm, Warshall&#8217;s Algorithm,<\/li>\n<\/ul>\n<p><strong>UNIT V<\/strong><\/p>\n<ul>\n<li><strong>Objectives:<\/strong> Analysis of complexities in various sorting techniques along with their lower bounds<\/li>\n<li><strong>Sorting Methods<\/strong> : Order Statistics: Lower Bound on Complexity for Sorting Methods: Lower Bound on Worst Case Complexity, Lower Bound on Average Case Complexity, Heap Sort, Quick Sort, Radix Sorting, Merge Sort.<\/li>\n<\/ul>\n<p><strong>UNIT VI<\/strong><\/p>\n<ul>\n<li><strong>Objectives:<\/strong> Illustration of tries which share some properties of table look up, various issues related to the design of file structures<\/li>\n<li><strong>Pattern matching and Tries<\/strong> : Pattern matching algorithms- the Boyer \u2013Moore algorithm, the Knuth- Morris-Pratt algorithm<\/li>\n<li><strong>Tries:<\/strong> Definitions and concepts of digital search tree, Binary trie, Patricia , Multi-way trie<\/li>\n<li><strong>File Structures:<\/strong> Fundamental File Processing Operations-opening files, closing files, Reading and Writing file contents, Special characters in files. Fundamental File Structure Concepts- Field and record organization, Managing fixed-length, fixed-field buffers. ( Reference 5)<\/li>\n<\/ul>\n<p><strong>Text Books<\/strong><\/p>\n<ul>\n<li>Data Structures, A Pseudocode Approach, Richard F Gilberg, Behrouz A Forouzan, Cengage.<\/li>\n<li>Fundamentals of DATA STRUCTURES in C: 2nd ed, , Horowitz , Sahani, Anderson-freed, Universities Press<\/li>\n<li>Data structures and Algorithm Analysis in C, 2nd edition, Mark Allen Weiss, Pearson<\/li>\n<\/ul>\n<p><strong>Reference Books<\/strong><\/p>\n<ul>\n<ul>\n<li>Web : http:\/\/lcm.csa.iisc.ernet.in\/dsa\/dsa.html<\/li>\n<li>http:\/\/utubersity.com\/?page_id=878<\/li>\n<li>http:\/\/freevideolectures.com\/Course\/2519\/C-Programming-and-Data-Structures<\/li>\n<li>http:\/\/freevideolectures.com\/Course\/2279\/Data-Structures-And-Algorithms<\/li>\n<li>File Structures :An Object oriented approach with C++, 3rd ed, Michel J Folk, Greg Riccardi, Bill Zoellick<\/li>\n<li>C and Data Structures: A Snap Shot oriented Treatise with Live examples from Science and\u00a0<span style=\"line-height: 1.6471\">Engineering, NB Venkateswarlu &amp; EV Prasad, S Chand, 2010.<\/span><\/li>\n<\/ul>\n<\/ul>\n<p>For more information about all JNTU updates please stay connected to us on FB and don\u2019t hesitate to ask any questions in the comment.<\/p>\n<div class=\"a9916ad81d5189659b0bfae0b37c143c\" data-index=\"2\" style=\"float: none; margin:10px 0 10px 0; text-align:center;\">\n<ins class=\"adsbygoogle\"\r\n     style=\"display:block; text-align:center;\"\r\n     data-ad-layout=\"in-article\"\r\n     data-ad-format=\"fluid\"\r\n     data-ad-client=\"ca-pub-1181153414625576\"\r\n     data-ad-slot=\"8060844699\"><\/ins>\r\n<script>\r\n     (adsbygoogle = window.adsbygoogle || []).push({});\r\n<\/script>\n<\/div>\n\n<div style=\"font-size: 0px; height: 0px; line-height: 0px; margin: 0; padding: 0; clear: both;\"><\/div>","protected":false},"excerpt":{"rendered":"<p>JNTUK B.Tech Advanced Data Structures gives you detail information of Advanced Data Structures R13 syllabus It will be help full to understand you complete curriculum of the year. (Note: C++ [&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":[2],"tags":[],"class_list":["post-469","post","type-post","status-publish","format-standard","hentry","category-syllabus"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/posts\/469","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/users\/2259"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/comments?post=469"}],"version-history":[{"count":5,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/posts\/469\/revisions"}],"predecessor-version":[{"id":475,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/posts\/469\/revisions\/475"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/media?parent=469"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/categories?post=469"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/tags?post=469"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}