Code No: Z0121/R07

Set No. 1

I B.Tech Regular Examinations, May 2010 C PROGRAMMING AND DATA STRUCTURES ( Common to Civil Engineering, Electrical & Electronic Engineering, Electronics & Communication Engineering, Computer Science & Engineering, Chemical Engineering, Electronics & Instrumentation Engineering, Bio-Medical Engineering, Information Technology, Electronics & Control Engineering, Computer Science & Systems Engineering, Electronics & Telematics, Electronics & Computer Engineering, Aeronautical Engineering, Instrumentation & Control Engineering and Bio-Technology) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

1. In what way if statement is dierent from switch statement? Write a program using Switch statement to manipulate student grade system. [16] 2. What is a function ? What are the dierent types of functions? Explain function with no argument and no return type with an example. [16] 3. (a) How strings and characters are represented in an array . (b) Write a program to print array of character. 4. (a) How is structure dierent from an array. Explain (b) How an array be included as a member of a structure? [8+8] [6+10]

5. (a) Write the syntax for opening a le with various modes and closing a le . (b) Explain about le handling functions . [8+8]

6. (a) Write an algorithm for quick sort and explain the same with an example. (b) Justify why quick sort is better than bubble sort ? [10+6]

7. What dierence between queue and circular queue ? Explain about circular queue operations ? [16] 8. (a) What is a network? (b) What is a spanning tree? (c) Dene minimal spanning tree . (d) What are the various traversals in a tree? [16]

1 of 1 WWW.UandiSTAR.org Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark.

Code No: Z0121/R07

Set No. 2

I B.Tech Regular Examinations, May 2010 C PROGRAMMING AND DATA STRUCTURES ( Common to Civil Engineering, Electrical & Electronic Engineering, Electronics & Communication Engineering, Computer Science & Engineering, Chemical Engineering, Electronics & Instrumentation Engineering, Bio-Medical Engineering, Information Technology, Electronics & Control Engineering, Computer Science & Systems Engineering, Electronics & Telematics, Electronics & Computer Engineering, Aeronautical Engineering, Instrumentation & Control Engineering and Bio-Technology) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

1. (a) Dene Algorithm. (b) What is the use of owchart ? (c) What are the dierent steps followed in the program development? [3+3+10] 2. (a) Explain about call by value with an example . (b) Write a program to generate Fibonacci series using with argument and return type. [8+8] 3. Dene an array. What are the dierent types of arrays. Explain. [16] 4. (a) Write short notes on array of structure. (b) Write a program for passing a copy of entire structure to function. [8+8]

5. (a) Write the syntax for opening a le with various modes and closing a le . (b) Explain about le handling functions . [8+8]

6. Write a program to sort the elements whose worst case is O(n2 ) and average case is O(n log n). [16] 7. What are the advantages and disadvantages of stack ? Write a program to illustrate stack operation ? [16] 8. Write an algorithm to perform deletion operation in a Binary Search Tree. [16]

1 of 1 Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark. WWW.UandiSTAR.org

Code No: Z0121/R07

Set No. 3

I B.Tech Regular Examinations, May 2010 C PROGRAMMING AND DATA STRUCTURES ( Common to Civil Engineering, Electrical & Electronic Engineering, Electronics & Communication Engineering, Computer Science & Engineering, Chemical Engineering, Electronics & Instrumentation Engineering, Bio-Medical Engineering, Information Technology, Electronics & Control Engineering, Computer Science & Systems Engineering, Electronics & Telematics, Electronics & Computer Engineering, Aeronautical Engineering, Instrumentation & Control Engineering and Bio-Technology) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

1. Why while statement is called as repetition structure? Write a program to nd whether number is Armstrong or not. [16] 2. What are the facilities provided by the preprocessor statement. Explain with a program. [16] 3. What is the advantage of using arrays ? Give syntax for declaration , accessing and printing one - dimensional array ? [16] 4. Dene Structure and write the general format for declaring and accessing members. [16] 5. (a) Write the syntax for opening a le with various modes and closing a le . (b) Explain about le handling functions . [8+8]

6. Write a program to sort the elements in an array which considers element by element and insert it at proper place in the sequence . [16] 7. Give an algorithm / C program to reverse a singly linked circular list inplace. [16] 8. Write an recursive algorithm for a Binary Search Tree. [16]

1 of 1 Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark. WWW.UandiSTAR.org

WWW.UandiSTAR.org

Code No: Z0121/R07

Set No. 4

I B.Tech Regular Examinations, May 2010 C PROGRAMMING AND DATA STRUCTURES ( Common to Civil Engineering, Electrical & Electronic Engineering, Electronics & Communication Engineering, Computer Science & Engineering, Chemical Engineering, Electronics & Instrumentation Engineering, Bio-Medical Engineering, Information Technology, Electronics & Control Engineering, Computer Science & Systems Engineering, Electronics & Telematics, Electronics & Computer Engineering, Aeronautical Engineering, Instrumentation & Control Engineering and Bio-Technology) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

1. (a) Dene Algorithm. (b) What is the use of owchart ? (c) What are the dierent steps followed in the program development? [3+3+10] 2. How automatic and static variables are used in dierent blocks. Explain with a program. [16] 3. Write short notes on pointers. 4. (a) How bits are manipulated using bit elds in C explain? (b) Dene structure. Write the rule for declaring structure and accessing with a program. [8+8] 5. (a) Write the syntax for opening a le with various modes and closing a le . (b) Explain about le handling functions . [8+8] [16]

6. Write a program to sort the elements whose worst and average case are o(n2 ). [16] 7. What dierence between queue and circular queue ? Explain about circular queue operations ? [16] 8. Write a C program to implement recursive algorithm for a Binary Search Tree. [16]

1 of 1 Please purchase PDF Split-Merge on www.verypdf.com to remove this watermark.