{"id":59,"date":"2016-05-06T22:31:52","date_gmt":"2016-05-06T22:31:52","guid":{"rendered":"http:\/\/www.inspirenignite.com\/jntuh\/?p=59"},"modified":"2019-07-14T07:27:22","modified_gmt":"2019-07-14T07:27:22","slug":"jntuh-b-tech-1st-year-computer-programming-lab-for-engineering-r13","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/jntuh\/jntuh-b-tech-1st-year-computer-programming-lab-for-engineering-r13\/","title":{"rendered":"JNTUH B.Tech 1st Year Computer Programming Lab for Engineering R13"},"content":{"rendered":"<p style=\"text-align: justify\">JNTUH B.Tech 1st year Computer Programming Lab\u00a0for Engineering R13 gives you detail \u00a0information about Engineering Computer Programming Lab subject.<\/p>\n<p><strong>Objectives<\/strong><\/p>\n<ul>\n<li>\u00a0To write programs in C to solve the problems.<\/li>\n<li>\u00a0To implement linear data structures such as lists, stacks, queues.<\/li>\n<li>\u00a0To implement simple searching and sorting methods.<\/li>\n<\/ul>\n<p><strong>Outcomes<\/strong><\/p>\n<p><strong>Recommended Systems\/Software Requirements<\/strong>:<\/p>\n<ul>\n<li>Intel based desktop PC<\/li>\n<li>ANSI C Compiler with Supporting Editors<\/li>\n<\/ul>\n<p><strong> Week l <\/strong><\/p>\n<ul>\n<li>\u00a0Write a C program to find the sum of individual digits of a positive integer.<\/li>\n<li>A Fibonacci sequence is defined as follows: the first and second terms in the sequence are 0 and 1. 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>\u00a0Write a C program to generate all the prime numbers between 1 and n, where n is a value supplied by the user.<\/li>\n<\/ul>\n<p><strong>Week 2<\/strong><\/p>\n<ul>\n<li>Write a C program to calculate the following Sum: Sum=1-x 2 \/2! +x4 \/4!-x 6 \/6!+x8 \/8!-x 10\/10!<\/li>\n<li>\u00a0Write a C program to find the roots of a quadratic equation.<\/li>\n<\/ul>\n<p><strong>Week 3 <\/strong><\/p>\n<ul>\n<li>The total distance travelled by vehicle in \u2018t\u2019 seconds is given by distance = ut+1\/2at2 where \u2018u\u2019 and \u2018a\u2019 are the initial velocity (m\/sec.) and acceleration (m\/sec2 ). Write C program to find the distance travelled at regular intervals of time given the values of \u2018u\u2019 and \u2018a\u2019. The program should provide the flexibility to the user to select his own time intervals and repeat the calculations for different values of \u2018u\u2019 and \u2018a\u2019.<\/li>\n<li>\u00a0Write a C program, which takes two integer operands and one operator from the user, performs the operation and then prints the result. (Consider the operators +,-,*, \/, % and use Switch Statement<\/li>\n<\/ul>\n<p><strong>Week 4 <\/strong><\/p>\n<ol>\n<li>Write C programs that use both recursive and non-recursive functions<\/li>\n<\/ol>\n<ul>\n<li>To find the factorial of a given integer.<\/li>\n<li>\u00a0To find the GCD (greatest common divisor) of two given integers.<\/li>\n<\/ul>\n<p><strong>Week 5 <\/strong><\/p>\n<ol>\n<li>Write a C program to find the largest integer in a list of integers.<\/li>\n<li>Write a C program that uses functions to perform the following:<\/li>\n<\/ol>\n<ul>\n<li>\u00a0Addition of Two Matrices<\/li>\n<li>\u00a0Multiplication of Two Matrices<\/li>\n<\/ul>\n<p><strong>Week 6 <\/strong><\/p>\n<ol>\n<li>\u00a0Write a C program that uses functions to perform the following operations:<\/li>\n<\/ol>\n<ul>\n<li>\u00a0To 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<\/ul>\n<p>2. Write a C program to determine if the given string is a palindrome or not<\/p>\n<p><strong>Week 7 <\/strong><\/p>\n<ul>\n<li>Write a C program that displays the position or index in the string S where the string T begins, or \u2013 1 if S doesn\u2019t contain T.<\/li>\n<li>Write a C program to count the lines, words and characters in a given text.<\/li>\n<\/ul>\n<p><strong> Week 8 <\/strong><\/p>\n<ul>\n<li>Write a C program to generate Pascal\u2019s triangle.<\/li>\n<li>\u00a0Write a C program to construct a pyramid of numbers.<\/li>\n<\/ul>\n<p><strong>Week 9 <\/strong><\/p>\n<p style=\"text-align: justify\">Write a C program to read in two numbers, x and n, and then compute the sum of this geometric progression: 1+x+x2 +x3 +\u2026\u2026\u2026\u2026.+x n For 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 \u2013 if n is less than 0. 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.<\/p>\n<p><strong>Week 10<\/strong><\/p>\n<ol>\n<li>\u00a02\u2019s complement of a number is obtained by scanning it from right to left and complementing all the bits after the first appearance of a 1. Thus 2\u2019s complement of 11100 is 00100. Write a C program to find the 2\u2019s complement of a binary number.<\/li>\n<li>Write a C program to convert a Roman numeral to its decimal equivalent. Week 11 Write a C program that uses functions to perform the following operations:<\/li>\n<\/ol>\n<ul>\n<li>Reading a complex number<\/li>\n<li>\u00a0Writing a complex number<\/li>\n<li>\u00a0Addition of two complex numbers<\/li>\n<li>\u00a0Multiplication of two complex numbers (Note: represent complex number using a structure.)<\/li>\n<\/ul>\n<p><strong> Week 12 <\/strong><\/p>\n<ul>\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.<\/li>\n<\/ul>\n<p>(Note: The file name and n are specified on the command line.)<\/p>\n<p><strong>Week 13 <\/strong><\/p>\n<ul>\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)<\/li>\n<\/ul>\n<p><strong>Week 14 <\/strong><\/p>\n<ul>\n<li>\u00a0Write a C program that uses non recursive function to search for a Key value in a given list of integers using Linear search.<\/li>\n<li>Write a C program that uses non recursive function to search for a Key value in a given sorted list of integers using Binary search.<\/li>\n<\/ul>\n<p><strong>Week 15<\/strong><\/p>\n<ul>\n<li>Write a C program that implements the Selection sort method to sort a given array of integers in ascending order.<\/li>\n<li>\u00a0Write a C program that implements the Bubble sort method to sort a given list of names in ascending order.<\/li>\n<\/ul>\n<p><strong>Week 16<\/strong><\/p>\n<p>Write a C program that uses functions to perform the following operations:<\/p>\n<ul>\n<li>Create a singly linked list of integer elements.<\/li>\n<li>Traverse the above list and display the elements.<\/li>\n<\/ul>\n<p><strong> Week 17<\/strong><\/p>\n<ul>\n<li>Write a C program that implements stack (its operations) using a singly linked list to display a given list of integers in reverse order. Ex. input: 10 23 4 6 output: 6 4 23 10<\/li>\n<\/ul>\n<p><strong> Week 18 <\/strong><\/p>\n<ul>\n<li>Write a C program that implements Queue (its operations) using a singly linked list to display a given list of integers in the same order. Ex. input: 10 23 4 6 output: 10 23 4 6<\/li>\n<\/ul>\n<p><strong>Week 19 <\/strong><\/p>\n<ul>\n<li>Write a C program to implement the linear regression algorithm.<\/li>\n<\/ul>\n<p><strong>Week 20<\/strong><\/p>\n<ul>\n<li>Write a C program to implement the polynomial regression algorithm.<\/li>\n<\/ul>\n<p><strong>Week 21<\/strong><\/p>\n<ul>\n<li>Write a C program to implement the Lagrange interpolation.<\/li>\n<\/ul>\n<p><strong>Week 22<\/strong><\/p>\n<ul>\n<li>Write C program to implement the Newton- Gregory forward interpolation.<\/li>\n<\/ul>\n<p><strong>Week 23 <\/strong><\/p>\n<ul>\n<li>Write a C program to implement Trapezoidal method.<\/li>\n<\/ul>\n<p><strong>Week 24 <\/strong><\/p>\n<ul>\n<li>Write a C program to implement Simpson method.<\/li>\n<\/ul>\n<div 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><\/div>\n<div><\/div>\n<p><strong>TEXT BOOKS<\/strong><\/p>\n<ol>\n<li>\u00a0C programming and Data Structures, P. Padmanabham, Third Edition, BS Publications<\/li>\n<li>\u00a0Computer Programming in C, V. Rajaraman, PHI Publishers.<\/li>\n<li>\u00a0C Programming, E.Balagurusamy, 3rd edition, TMH Publishers.<\/li>\n<li>C Programming, M.V.S.S.N.Prasad, ACME Learning Pvt. Ltd.<\/li>\n<li>\u00a0C and Data Structures, N.B.Venkateswarlu and E.V.Prasad,S.Chand Publishers<\/li>\n<li>\u00a0Mastering C, K.R. Venugopal and S.R. Prasad, TMH Publishers<\/li>\n<\/ol>\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","protected":false},"excerpt":{"rendered":"<p>JNTUH B.Tech 1st year Computer Programming Lab\u00a0for Engineering R13 gives you detail \u00a0information about Engineering Computer Programming Lab subject. Objectives \u00a0To write programs in C to solve the problems. \u00a0To [&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-59","post","type-post","status-publish","format-standard","hentry","category-syllabus"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/59","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=59"}],"version-history":[{"count":4,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/59\/revisions"}],"predecessor-version":[{"id":17543,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/posts\/59\/revisions\/17543"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/media?parent=59"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/categories?post=59"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/jntuh\/wp-json\/wp\/v2\/tags?post=59"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}