My Profile
Active Members
TodayLast 7 Days
more...
Awards & Gifts
Online Exams
Fresher Jobs
Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian
cities including Bangalore, Chennai, Hyderabad, Pune or Kochi
Resources
Find educational articles, blogs, discussion threads and other resources.
Colleges
Find details about any college in India or search for courses.
Advertisements
|
JNTU 2007-2008 1ST YEAR B.Tech -COMPUTER PROGRAMMING LAB
Posted Date: 09 Dec 2007 Resource Type: Articles/Knowledge Sharing Category: Syllabus
|
Posted By: Sri Member Level: Gold
Rating:  Points: 1
|
|
|
2007-08
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY
HYDERABAD
I Year B.Tech. M.E. T P C
0 3 4
COMPUTER PROGRAMMING LAB
Objectives:
• To make the student learn a programming language.
• To teach the student to write programs in C solve the problems
• To Introduce the student to simple linear and non linear data structures such as lists, stacks, queues, trees and graphs.
Recommended Systems/Software Requirements:
• Intel based desktop PC
• ANSI C Compiler with Supporting Editors
UNIT- l:
a)Write a C program to find the sum of individual digits of a positive integer.
b)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.
c)Write a C program to generate all the prime numbers between 1 and n, where n is a value supplied by the user.
UNIT- II:
a)Write a C program to calculate the following Sum:
Sum=1-x2/2! +x4/4!-x6/6!+x8/8!-x10/10!
b)Write a C program toe find the roots of a quadratic equation.
UNIT- lII:
a)Write C programs that use both recursive and non-recursive functions
i)To find the factorial of a given integer.
ii)To find the GCD (greatest common divisor)of two given integers.
iii)To solve Towers of Hanoi problem.
UNIT- lV:
a)The total distance traveled by vehicle in ‘t’ seconds is given by distance = ut+1/2at2 where ‘u’ and ‘a’ are the initial velocity (m/sec.) and acceleration (m/sec2). Write C program to find the distance traveled at regular intervals of time given the values of ‘u’ and ‘a’. The program should provide the flexibility to the user to select his own time intervals and repeat the calculations for different values of ‘u’ and ‘a’.
b)Write a C program, which takes two integer operands and one operator form the user, performs the operation and then prints the result. (Consider the operators +,-,*,/,% and use Switch Statement)
UNIT- V:
a) Write a C program to find both the larges and smallest number in a list of integers.
b) Write a C program that uses functions to perform the following:
i)Addition of Two Matrices
ii)Multiplication of Two Matrices
UNIT- Vl:
a)Write a C program that uses functions to perform the following operations:
i)To insert a sub-string in to given main string from a given position.
ii)To delete n Characters from a given position in a given string.
b)Write a C program to determine if the given string is a palindrome or not
UNIT- VIl:
a) Write a C program that displays the position or index in the string S where the string T begins, or – 1 if S doesn’t contain T.
b) Write a C program to count the lines, words and characters in a given text.
UNIT- VIIl:
a) Write a C program to generate Pascal’s triangle.
b) Write a C program to construct a pyramid of numbers.
UNIT- IX:
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+………….+xn
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 – if n is less than 0. Have your program print an error message if n<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.
UNIT- X:
a) 2’s 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’s complement of 11100 is 00100. Write a C program to find the 2’s complement of a binary number.
b) Write a C program to convert a Roman numeral to its decimal equivalent.
UNIT- Xl:
Write a C program that uses functions to perform the following operations:
i)Reading a complex number
ii)Writing a complex number
iii)Addition of two complex numbers
iv)Multiplication of two complex numbers
(Note: represent complex number using a structure.)
UNIT- XIl:
a) Write a C program which copies one file to another.
b) 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.)
UNIT- XIIl:
Write a C program that uses functions to perform the following operations on singly linked list.:
i)Creation ii)Insertion iii) Deletion iv) Traversal
UNIT- XVl:
Write a C program that uses functions to perform the following operations on doubly linked list.:
i)Creation ii)Insertion iii) Deletion iv) Traversal in both ways
UNIT- XV:
Write C programs that implement stack (its operations) using
i)Arrays ii)Pointers
UNIT- XVl:
Write C programs that implement Queue (its operations) using
i)Arrays ii)Pointers
UNIT- XVII:
Write a C program that uses Stack operations to perform the following:
i)Converting infix expression into postfix expression
ii)Evaluating the postfix expression
UNIT- XVIII:
Write a C program that uses functions to perform the following:
i)Creating a Binary Tree of integers
ii)Traversing the above binary tree in preorder, inorder and postorder.
UNIT- XIX:
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 :
i)Linear search ii) Binary search
UNIT- XX:
Write C programs that implement the following sorting methods to sort a given list of integers in ascending order:
i)Bubble sort ii) Quick sort
UNIT- XXI:
Write C programs that implement the following sorting methods to sort a given list of integers in ascending order:
i)Insertion sort ii)Merge sort
UNIT- XXII:
Write C programs to implement the Lagrange interpolation and Newton- Gregory forward interpolation.
UNIT- XXIII:
Write C programs to implement the linear regression and polynomial regression algorithms.
UNIT- XXIV:
Write C programs to implement Trapezoidal and Simpson methods.
|
Responses
|
No responses found. Be the first to respond and make money from revenue sharing program.
|
|
|