{"id":24620,"date":"2020-07-20T07:39:40","date_gmt":"2020-07-20T07:39:40","guid":{"rendered":"https:\/\/www.inspirenignite.com\/jntuh\/computer-programming-and-data-structures-lab-syllabus-for-mca-1st-year-1st-sem-r19-regulation-jntuh\/"},"modified":"2020-07-20T07:39:40","modified_gmt":"2020-07-20T07:39:40","slug":"computer-programming-and-data-structures-lab-syllabus-for-mca-1st-year-1st-sem-r19-regulation-jntuh","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuh\/computer-programming-and-data-structures-lab-syllabus-for-mca-1st-year-1st-sem-r19-regulation-jntuh\/","title":{"rendered":"Computer Programming and Data Structures Lab Syllabus for MCA 1st Year 1st Sem R19 Regulation JNTUH"},"content":{"rendered":"<p align=\"justify\">Computer Programming and Data Structures Lab detailed Syllabus for Master of Computer Applications(MCA), R19 regulation has been taken from the <a href=\"https:\/\/jntuh.ac.in\/syllabus\/\" style=\"color: inherit\" target=\"_blank\" rel=\"noopener\">JNTUH<\/a> official website and presented for the students affiliated to JNTUH course structure. For Course Code, Subject Names, Theory Lectures, Tutorial, Practical\/Drawing, Credits, and other information do visit full semester subjects post given below. The Syllabus PDF files can also be downloaded from the universities official website.<\/p>\n<p align=\"justify\">For all other MCA 1st Year 1st Sem Syllabus for R19 Regulation JNTUH, do visit <a href=\"..\/mca-1st-year-1st-sem-syllabus-for-r19-regulation-jntuh\">MCA 1st Year 1st Sem Syllabus for R19 Regulation JNTUH <\/a>Subjects. The detailed Syllabus for computer programming and data structures lab is as follows.  <\/p>\n<h4>Course Objectives:<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete Syllabus, results, class timetable, and many other features kindly download the <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdfs platform to make students&#8217;s lives easier.<\/b><br \/><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>.  <\/p>\n<h4>Course Outcomes:<\/h4>\n<ol>\n<li>Develop C programs for computing and real life applications using basic elements like control statements, arrays, functions, pointers and strings, and data structures like stacks, queues and linked lists.<\/li>\n<li>Implement searching and sorting algorithmsWeek 1:<\/li>\n<li>Write a C program to find the sum of individual digits of a positive integer.<\/li>\n<li>Fibonacci sequence is defined as follows: the first and second terms in the sequence are 0 and<\/li>\n<li>Subsequent terms are found by adding the preceding two terms in the sequence. Write a C program to generate the first n terms of the sequence.<\/li>\n<li>Write a C program to generate all the prime numbers between 1 and n, where n is a value supplied by the user.<\/li>\n<li>Write a C program to find the roots of a quadratic equation. Week 2:<\/li>\n<li>Write a C program to find the factorial of a given integer.<\/li>\n<li>Write a C program to find the GCD (greatest common divisor. of two given integers.<\/li>\n<li>Write a C program to solve Towers of Hanoi problem.<\/li>\n<li>Write a C program, which takes two integer operands and one operator from the user, performsthe operation and then prints the result. (Consider the operators +,-,*, \/, % and use Switch Statement) Week 3:<\/li>\n<li>Write a C program to find both the largest and smallest number in a list of integers.<\/li>\n<li>Write a C program that uses functions to perform the following:\n<ol type=\"i\">\n<li>Addition of Two Matrices<\/li>\n<li>Multiplication of Two Matrices Week 4:<\/li>\n<\/ol>\n<\/li>\n<li>Write a C program that uses functions to perform the following operations:\n<ol type=\"i\">\n<li>To insert a sub-string in to a given main string from a given position.<\/li>\n<li>To delete n Characters from a given position in a given string.<\/li>\n<\/ol>\n<\/li>\n<li>Write a C program to determine if the given string is a palindrome or not<\/li>\n<li>Write a C program that displays the position or index in the string S where the string T begins, or &#8211; 1 ifS doesnt contain T.<\/li>\n<li>Write a C program to count the lines, words and characters in a given text. Week 5:<\/li>\n<li>Write a C program to generate Pascals triangle.<\/li>\n<li>Write a C program to construct a pyramid of numbers.<\/li>\n<li>Write a C program to read in two numbers, x and n, and then compute the sum of this geometric progression:<\/li>\n<li>&#8230;&#8230;..+xnFor example: if n is 3 and x is 5, then the program computes 1+5+25+125. Print x, n, the sum Perform error checking. For example, the formula does not make sense for negative exponents &#8211; if n is less than<\/li>\n<li>Have your program print an error message if n&lt;0, then go back and read in the next pair of numbers of without computing the sum. Are any values of x also illegal ? If so, test for them too.Week 6:<\/li>\n<li>2s complement of a number is obtained by scanning it from right to left and complementing all the bits after the first appearance of a<\/li>\n<li>Thus 2s complement of 11100 is 00100. Write a C program to find the 2s complement of a binary number.<\/li>\n<li>Write a C program to convert a Roman numeral to its decimal equivalent.Week 7:<\/li>\n<li>Write a C program that uses functions to perform the following operations:\n<ol type=\"i\">\n<li>Reading a complex number<\/li>\n<li>Writing a complex number<\/li>\n<li>Addition of two complex numbers<\/li>\n<li>Multiplication of two complex numbers(Note: represent complex number using a structure.) Week 8:<\/li>\n<\/ol>\n<\/li>\n<li>\n<ol type=\"i\">\n<li>Write a C program which copies one file to another.<\/li>\n<li>Write a C program to reverse the first n characters in a file.(Note: The file name and n are specified on the command line.)<\/li>\n<\/ol>\n<\/li>\n<li>\n<ol type=\"i\">\n<li>Write a C program to display the contents of a file.<\/li>\n<li>Write a C program to merge two files into a third file (i.e., the contents of the first file followed by those of the second are put in the third file)Week 9:<\/li>\n<\/ol>\n<\/li>\n<li>Write a C program that uses functions to perform the following operations on singly linked list.:\n<ol type=\"i\">\n<li>Creation<\/li>\n<li>Insertion<\/li>\n<li>Deletion<\/li>\n<li>TraversalWeek 10:<\/li>\n<\/ol>\n<\/li>\n<li>Write C programs that implement stack (its operations) using\n<ol type=\"i\">\n<li>Arrays<\/li>\n<li>Pointers<\/li>\n<\/ol>\n<\/li>\n<li>Write C programs that implement Queue (its operations) using\n<ol type=\"i\">\n<li>Arrays<\/li>\n<li>PointersWeek 11:<\/li>\n<\/ol>\n<\/li>\n<li>Write a C program that implements the following sorting methods to sort a given list of integers in ascending order\n<ol type=\"i\">\n<li>Bubble sort<\/li>\n<li>Selection sortWeek 12:<\/li>\n<\/ol>\n<\/li>\n<li>Write C programs that use both recursive and non recursive functions to perform the following searching operations for a Key value in a given list of integers:\n<ol type=\"i\">\n<li>Linear search<\/li>\n<li>Binary search<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n<h4>Text Books:<\/h4>\n<ol>\n<li>C Programming and Data Structures, B.A.Forouzan and R.F. Gilberg, 3rd Edition, Cengage Learning.<\/li>\n<li>Problem Solving and Program Design in C, J.R. Hanly and E.B. Koffman, 5th Edition, Pearson Education.<\/li>\n<li>The C Programming Language, B.W. Kernighan and Dennis M.Ritchie, PHI\/Pearson Education<\/li>\n<\/ol>\n<h4>Reference Books:<\/h4>\n<p id=\"istudy\" style=\"text-align:center\">For the complete Syllabus, results, class timetable, and many other features kindly download the <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">iStudy App<\/a><br \/><b> It is a lightweight, easy to use, no images, and no pdfs platform to make students&#8217;s lives easier.<\/b><br \/><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy&amp;pcampaignid=pcampaignidMKT-Other-global-all-co-prtnr-py-PartBadge-Mar2515-1\" target=\"_blank\" rel=\"noopener\"><img decoding=\"async\" src=\"https:\/\/play.google.com\/intl\/en_us\/badges\/static\/images\/badges\/en_badge_web_generic.png\" alt=\"Get it on Google Play\" style=\"height:65px\"><\/a>.<\/p>\n<p align=\"justify\">For detail Syllabus of all other subjects of Master of Computer Applications 1st Year, visit <a href=\"..\/category\/mca+1st-year\">MCA 1st Year Syllabus<\/a> Subjects.<\/p>\n<p align=\"justify\">For all MCA results, visit <a href=\"https:\/\/www.inspirenignite.com\/jntuh\/jntuh-mca-results\/\">JNTUH MCA all years, and semester results <\/a>from direct links.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Computer Programming and Data Structures Lab detailed Syllabus for Master of Computer Applications(MCA), R19 regulation has been taken from the JNTUH official website and presented for the students affiliated to [&hellip;]<\/p>\n","protected":false},"author":2344,"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":[120,130],"tags":[],"class_list":["post-24620","post","type-post","status-publish","format-standard","hentry","category-1st-year","category-mca"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/24620","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\/2344"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/comments?post=24620"}],"version-history":[{"count":0,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/24620\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/media?parent=24620"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/categories?post=24620"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/tags?post=24620"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}