Jawaharlal Nehru Technological University Hyderabad 2005 B.E Computer Science C & DATA STRUCTURES I B.Tech Supplementary s, emr/emr set 3 - Question Paper

Code No: RR10203 Set No.3
I B.Tech. Regular Examinations, January 2005
C & DATA STRUCTURES
( Common to Electrical & Electronic Engineering, Electronics &
Communication Engineering, Computer Science & Engineering, Electronics
& Instrumentation Engineering, BioMedical
Engineering, info
Technology, Electronics & Control Engineering, Computer Science &
Systems Engineering, Electronics & Telematics, Electronics & Computer
Engineering, Instrumentation & Control Engineering and BioTechnology)
Time: three hours Max Marks: 80
ans any 5 ques.
All ques. carry equal marks
? ? ? ? ?
1. (a) What is the difference ranging from break and continue on statement? discuss with
examples.
(b) What is the purpose of go to statement? How is the associated target statement
identified?
(c) Write a C program to evaluate the power series
E x = one + x + x two + x three + ...x n , 0 < x < 1[6+6+4]
2. (a) In what way array is various from an ordinary variable?
(b) What conditions must be satisfied by the entire elements of any provided array?
(c) elaborate subscripts? How are they written? What restrictions apply to the
values that can be assigned to subscripts?
(d) What advantage is there in defining an array size in terms of a symbolic
constant rather than a fixed integer quantity?[4+4+4+4]
(e) Write a program to obtain the largest element in an array.
3. (a) What is the use of struct keyword? discuss the use of dot operator? provide an
example for every.
(b) Write a C program to accept records of the various states using array of
structures. The structure should contain char state, population, literacy rate,
and income. Display the state whose literacy rate is highest and whose income
is highest.[8+8]
4. (a) How to use pointers as arguments in a function? discuss through an example.
(b) Write a ‘C’ function using pointers to exchange the values stored in two
locations in the memory.[8+8]
5. Write in detail about the following:
(a) Recursion
(b) Applications of Stacks and Queues[8+8]
6. What is singly linked list? discuss different operations on singly linked list with
algorithms.[16]
7. (a) Write a C program to implement binary tree traversals.
(b) Write an algorithm to count the number of leaf nodes in a binary tree. What
is its computing time?[8+8]
8. discuss the algorithm for selection sort and provide a suitable example.[16]

Earning:   Approval pending.