Saturday 16 June 2012

JNTU Hyderabad 1st year B.tech (R09) C&DS December 2012 paper(SET-2)

Code No: 09A1EC01 R09 SET-2

I - B.TECH EXAMINATIONS, DECEMBER - 2010
COMPUTER PROGRAMMING AND DATA STRUCTURES

(COMMON TO CE, EEE, ME, ECE, CSE, CHEM, EIE, BME, IT, MECT, E.COMP.E,
MMT, MEP, AE, ICE, BT, AME)
Time: 3hours Max.Marks:75
Answer any FIVE questions
All questions carry equal marks
- - -
1 a) Define Algorithm? What are the characteristics that any algorithm should satisfy?
b) Draw a flowchart for finding maximum of given three integers?
c) Differentiate between compiler and interpreter? [7+4+4]
2 a) Differentiate between if-else-if ladder and switch statement?
b) What is the implicit type conversion hierarchy that is applied while evaluating
expressions?
c) List and give examples for different bitwise operators available in ‘C’? [4+4+7]
3 a) What is the need for user-defined functions?
b) What are the different ways in which 1-dimensional arrays can be declared and
initialized?
c) Write a C program using recursion for finding GCD (Greatest Common Divisor)
of two given numbers? [4+3+8]
4 a) Explain the syntax with suitable examples the dynamic memory allocation
functions available in C?
b) Write a C function to find the length of a string passed as an argument? [12+3]
5 a) Differentiate between structures and unions?
b) What do you mean by bit fields? How bit fields are different from structures?
c) Suppose or oppose the statement “In C a structure contains a union inside it”.
Give suitable example? [5+5+5]
6 a) Distinguish between getc() and getchar() functions?
b) Explain the general format of fseek() function with illustrative examples?
c) Write a C program to append the contents of a file to another file? [4+5+6]
7 a) Write a C program for insertion sort using functions?
b) An Array contains 47, 3, 66, 32, 56, and 92. After two passes of a sorting
algorithm, the array has been rearranged to: 3, 47, 66, 32, 56, and 92. Which
sorting algorithm among selection, insertion, and bubble sort is used? Defend
your answer? [9+6]
8 Write the steps with illustrative figures involved in the following operations of a
singly linked list without the head node?
I. Insert into an empty List
II. Insert at the first position
III. Insert at the last position
IV. Insert before a given element
V. Insert after a given element. [15]

Tags : Jntu,JNTUH,JNTU Hyderabad university CPDS papers,CPDS 2010 papers,R09,SET-2 C&DS paper,JNTU Hyderabad Computer programming and data structures previous papers,JNTU Hyderabad first year previous papers

No comments:

Post a Comment