{"id":854,"date":"2016-05-30T15:22:45","date_gmt":"2016-05-30T15:22:45","guid":{"rendered":"http:\/\/www.inspirenignite.com\/jntuh\/?p=854"},"modified":"2019-07-14T10:32:01","modified_gmt":"2019-07-14T10:32:01","slug":"jntuh-b-tech-2nd-year-1-sem-computer-science-technology-2-1-data-structures-engineering-r13","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuh\/jntuh-b-tech-2nd-year-1-sem-computer-science-technology-2-1-data-structures-engineering-r13\/","title":{"rendered":"JNTUH B.Tech 2nd Year 1 sem Computer Science &amp; Technology  (2-1) Data Structures Engineering R13."},"content":{"rendered":"<p>JNTUH B.Tech 2nd year Data Structures gives you detail information about Data Structures Engineering R13 year subject. It will be help full you to understand you complete curriculum of the year.<\/p>\n<p><strong>Objectives<\/strong><\/p>\n<ul>\n<li>To understand the basic concepts such as Abstract Data Types, Linear and Non Linear Data structures.<\/li>\n<li>To understand the notations used to analyze the Performance of algorithms.<\/li>\n<li>To understand the behaviour of data structures such as stacks, queues, trees, hash tables, search trees,\u00a0Graphs 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 lists, stacks,\u00a0queues, trees, graphs, hash tables, search trees.<\/li>\n<\/ul>\n<p><strong>UNIT- I<\/strong><\/p>\n<p>Basic concepts- Algorithm Specification-Introduction, Recursive algorithms, Data Abstraction Performance\u00a0analysis- time complexity and space complexity, Asymptotic Notation-Big O, Omega and Theta notations,\u00a0Introduction to Linear and Non Linear data structures.\u00a0Singly Linked Lists-Operations-Insertion, Deletion, Concatenating singly linked lists, Circularly linked listsOperations\u00a0for Circularly linked lists, Doubly Linked Lists- Operations- Insertion, Deletion.\u00a0Representation of single, two dimensional arrays, sparse matrices-array and linked representations.<\/p>\n<p><strong>UNIT- II<\/strong><\/p>\n<p>Stack ADT, definition, operations, array and linked implementations in C, applications-infix to postfix conversion,\u00a0Postfix expression evaluation, recursion implementation, Queue ADT, definition and operations ,array and linked\u00a0Implementations in C, Circular queues-Insertion and deletion operations, Deque (Double ended queue)ADT,\u00a0array and linked implementations in C.<\/p>\n<p><strong>UNIT- III<\/strong><\/p>\n<p>Trees \u2013 Terminology, Representation of Trees, Binary tree ADT, Properties of Binary Trees, Binary Tree\u00a0Representations-array and linked representations, Binary Tree traversals, Threaded binary trees, Max Priority\u00a0Queue ADT-implementation-Max Heap-Definition, Insertion into a Max Heap, Deletion from a Max Heap.\u00a0Graphs \u2013 Introduction, Definition, Terminology, Graph ADT, Graph Representations- Adjacency matrix, Adjacency\u00a0lists, Graph traversals- 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><em><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>.<\/em><\/strong><\/a><\/p>\n<p><strong>TEXT BOOKS<\/strong><\/p>\n<ol>\n<li>Fundamentals of Data structures in C, 2nd Edition, E.Horowitz, S.Sahni and Susan Anderson-Freed,\u00a0Universities Press.<\/li>\n<li>Data structures A Programming Approach with C, D.S.Kushwaha and A.K.Misra, PHI.<\/li>\n<\/ol>\n<p>REFERENCE BOOKS:<\/p>\n<ol>\n<li>Data structures: A Pseudocode Approach with C, 2nd edition, R.F.Gilberg And B.A.Forouzan, Cengage\u00a0Learning.<\/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.Leung,Pearson.<\/li>\n<li>Data Structures and Algorithms made easy in JAVA, 2nd Edition, Narsimha Karumanchi, CareerMonk\u00a0Publications.<\/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<\/ol>\n<p><strong>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 respective language.<\/li>\n<li>Ability to solve problems independently and think critically.<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>JNTUH B.Tech 2nd year Data Structures gives you detail information about Data Structures Engineering R13 year subject. It will be help full you to understand you complete curriculum of the [&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-854","post","type-post","status-publish","format-standard","hentry","category-syllabus"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/854","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=854"}],"version-history":[{"count":6,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/854\/revisions"}],"predecessor-version":[{"id":17770,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/854\/revisions\/17770"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/media?parent=854"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/categories?post=854"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/tags?post=854"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}