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

Code No: RR10203 Set No.2
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 a Flowchart? discuss the various symbols used in a Flowchart?
(b) Write a program to obtain the maximum and minimum of provided numbers.[8+8]
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?
(e) Write a program to obtain the largest element in an array.[4+4+4+2+2]
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) discuss the process of accessing a variable through its pointer. provide an Example.
(b) Write a C program using pointers to learn in an array of integers and print its
elements in reverse order.[8+8]
5. Show how to implement a queue of integers in C by using an array int
q[QUEUESIZE], where q[0] is used to indicate the front of the queue , q[1] is
used to indicate its rear and where q[2] through q[QUEUESIZE 1]
contain
elements on the queue. Show how to initialize such an array to represent the
empty queue and write routines remove, insert and empty for such an
implementation.[16]
6. What is Circular doubly linked list? discuss the different operations on Circular
doubly linked lists with suitable algorithms.[16]
7. Write an algorithm for every of the following:[6+4+4]
(a) In order traversal
(b) Preorder traversal
(c) Post order traversal
8. Write a C program that searches a value in a stored array using binary search.
What is the time complexity of binary search?[16}

Earning:   Approval pending.