{"id":456,"date":"2016-07-22T20:42:12","date_gmt":"2016-07-22T20:42:12","guid":{"rendered":"http:\/\/www.inspirenignite.com\/jntuk\/?p=456"},"modified":"2016-08-07T12:19:44","modified_gmt":"2016-08-07T12:19:44","slug":"jntuk-b-tech-data-structures-lab-for-r13-batch","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuk\/jntuk-b-tech-data-structures-lab-for-r13-batch\/","title":{"rendered":"JNTUK B.Tech Data Structures Lab for R13 Batch."},"content":{"rendered":"<p>JNTUk B.Tech Data Structures Lab R13 Syllabus for Engineering it gives you detail information about Data Structures Lab syllabus.<\/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>Exercise 1<\/strong><br \/>\nWrite recursive program which computes the nth Fibonacci number, for appropriate values of n.<br \/>\nAnalyze behavior of the program Obtain the frequency count of the statement for various values of n.<\/p>\n<p><strong>Exercise 2<\/strong><br \/>\nWrite recursive program for the following<br \/>\na) Write recursive and non recursive C program for calculation of Factorial of an integer<br \/>\nb) Write recursive and non recursive C program for calculation of GCD (n, m)<br \/>\nc) Write recursive and non recursive C program for Towers of Hanoi : N disks are to be transferred from<br \/>\npeg S to peg D with Peg I as the intermediate peg.<\/p>\n<p><strong>Exercise 3<\/strong><br \/>\na) Write C program that use both recursive and non recursive functions to perform Linear search for a Key<br \/>\nvalue in a given list.<br \/>\nb) Write C program that use both recursive and non recursive functions to perform Binary search for a Key<br \/>\nvalue in a given list.<br \/>\nc) Write C program that use both recursive and non recursive functions to perform Fibonacci search for a<br \/>\nKey value in a given list.<\/p>\n<p><strong>Exercise 4<\/strong><br \/>\na) Write C program that implement Bubble sort, to sort a given list of integers in ascending order<br \/>\nb) Write C program that implement Quick sort, to sort a given list of integers in ascending order<br \/>\nc) Write C program that implement Insertion sort,to sort a given list of integers in ascending order<\/p>\n<p><strong>Exercise 5<\/strong><br \/>\na) Write C program that implement heap sort, to sort a given list of integers in ascending order<br \/>\nb) Write C program that implement radix sort, to sort a given list of integers in ascending order<br \/>\nc) Write C program that implement merge sort, to sort a given list of integers in ascending order<\/p>\n<p><strong>Exercise 6<\/strong><br \/>\na) Write C program that implement stack (its operations) using arrays<br \/>\nb) Write C program that implement stack (its operations) using Linked list<\/p>\n<p><strong>Exercise 7<\/strong><br \/>\na) Write a C program that uses Stack operations to Convert infix expression into postfix expression<br \/>\na) Write C program that implement Queue (its operations) using arrays.<br \/>\nb) Write C program that implement Queue (its operations) using linked lists<\/p>\n<p><strong>Exercise 8<\/strong><br \/>\na) Write a C program that uses functions to create a singly linked list<br \/>\nb) Write a C program that uses functions to perform insertion operation on a singly linked list<br \/>\nc) Write a C program that uses functions to perform deletion operation on a singly linked list<\/p>\n<p><strong>Exercise 9<\/strong><br \/>\na) Adding two large integers which are represented in linked list fashion.<br \/>\nb) Write a C program to reverse elements of a single linked list.<br \/>\nc) Write a C program to store a polynomial expression in memory using linked list<br \/>\nd) Write a C program to representation the given Sparse matrix using arrays.<br \/>\ne) Write a C program to representation the given Sparse matrix using linked list<\/p>\n<p><strong>Exercise 10<\/strong><br \/>\na) Write a C program to Create a Binary Tree of integers<br \/>\nb) Write a recursive C program for Traversing a binary tree in preorder, inorder and postorder.<br \/>\nc) Write a non recursive C program for Traversing a binary tree in preorder, inorder and postorder.<br \/>\nd) Program to check balance property of a tree.<\/p>\n<p><strong>Exercise 11<\/strong><br \/>\na) Write a C program to Create a BST<br \/>\nb) Write a C program to insert a node into a BST.<br \/>\nc) Write a C program to delete a node from a BST.<\/p>\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 Data Structures Lab R13 Syllabus for Engineering it gives you detail information about Data Structures Lab syllabus. Exercise 1 Write recursive program which computes the nth Fibonacci number, [&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-456","post","type-post","status-publish","format-standard","hentry","category-syllabus"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/posts\/456","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=456"}],"version-history":[{"count":1,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/posts\/456\/revisions"}],"predecessor-version":[{"id":457,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/posts\/456\/revisions\/457"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/media?parent=456"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/categories?post=456"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuk\/wp-json\/wp\/v2\/tags?post=456"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}