{"id":1053,"date":"2016-06-05T07:05:30","date_gmt":"2016-06-05T07:05:30","guid":{"rendered":"http:\/\/www.inspirenignite.com\/jntuh\/?p=1053"},"modified":"2019-07-13T13:58:26","modified_gmt":"2019-07-13T13:58:26","slug":"jntuh-b-tech-2nd-year-1-sem-information-technology-engineering-2-1-data-structures-engineering-r13","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuh\/jntuh-b-tech-2nd-year-1-sem-information-technology-engineering-2-1-data-structures-engineering-r13\/","title":{"rendered":"JNTUH B.Tech 2nd Year 1 sem Information Technology Engineering (2-1) Data Structures Engineering R13."},"content":{"rendered":"<p>JNTUH B.Tech 2nd year Data Structures gives you detail information 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 lists Operations\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 Representations-array and linked representations, Binary Tree traversals, Threaded binary trees, Max Priority Queue ADT-implementation-Max Heap-Definition, Insertion into a Max Heap, Deletion from a Max Heap. Graphs \u2013 Introduction, Definition, Terminology, Graph ADT, Graph Representations- Adjacency matrix, Adjacency lists, Graph traversals- DFS and BFS.<\/p>\n<p style=\"text-align: center\"><em><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\"><span style=\"color: #ff0000\"><b>Download iStudy Android App for complete\u00a0JNTUH syllabus, results, timetables and all other updates. There are no ads and no pdfs and will make your life way easier<\/b><\/span><b>.<\/b><\/a><\/em><\/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 Anderson-Freed,\u00a0Universities Press.<\/li>\n<li>Data structures A Programming Approach with C, D.S.Kushwaha and A.K.Misra, PHI.<\/li>\n<\/ul>\n<p><strong>REFERENCE BOOKS<\/strong><\/p>\n<ul>\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 Algorithms made easy in JAVA, 2nd Edition, Narsimha Karumanchi, Career Monk\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<\/ul>\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<p><strong>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.<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"<p>JNTUH B.Tech 2nd year Data Structures gives you detail information Data Structures Engineering R13 year subject. It will be help full you to understand you complete curriculum of the year. [&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-1053","post","type-post","status-publish","format-standard","hentry","category-syllabus"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/1053","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=1053"}],"version-history":[{"count":4,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/1053\/revisions"}],"predecessor-version":[{"id":17114,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/1053\/revisions\/17114"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/media?parent=1053"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/categories?post=1053"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/tags?post=1053"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}