Jawaharlal Nehru Technological University Hyderabad 2005 B.E Computer Science C & DATA STRUCTURES I B.TechRegular s, set 4 - Question Paper

Code No: RR10203 Set No.4
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) Write the different steps involved in executing a C program and illustrate it
with a help of flowchart.
(b) Candidates have to score 90 or above in the IQ test to be considered eligible
for taking further tests. All candidates who do not clear the IQ test are sent
reject letters and others are sent call letters for further tests. Represent the
logic for automating this task.[8+8]
2. (a) Distinguish ranging from get char and scan functions for studying strings.
(b) Write a program to count the number of words, lines and characters in a text.[8+8]
3. (a) How are Structure elements accessed using pointer? Which operator is used?
provide an example.
(b) Write a program to use structure within union. Display the contents of
structure elements.[8+8]
4. (a) Distinguish ranging from the subsequent functions.
i. Printf and fprintf.
ii. eof and ferror.
(b) Write a program to copy the contents of 1 file into a different.[8+8]
5. Use the operations push, pop, stack top, and empty to construct operations on
stack, which do every of the following:
provided an integer n, set i to the n the element from the top of stack, leaving the
stack unchanged Set I to the bottom element of stack, leaving the stack empty.[16]
6. Write a C program to create a singly linked list and split it at the middle and make
the 2nd half as the 1st and viceversa.
Display the final list.[16]
7. Write an algorithm, provided the address of an input binary tree, prints the equivalent
infix expression with minimum number of parenthesis.[16]
8. explain in detail about the subsequent searching methods.
(a) Sequential search
(b) Fibonacci search[8+8]

Earning:   Approval pending.