R7100106-c-programming-and-data-structures

  • May 2020
  • PDF

This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA


Overview

Download & View R7100106-c-programming-and-data-structures as PDF for free.

More details

  • Words: 936
  • Pages: 4
1

Code No: R7100106

I B.Tech (R07) Regular & Supplementary Examinations, June 2009 C PROGRAMMING AND DATA STRUCTURES (Common to Civil Engineering, Electrical & Electronics Engineering, Electronics & Communication Engineering, Computer Science & Engineering, Electronics & Instrumentation Engineering, Information Technology, Electronics & Control Engineering, Computer Science & Systems Engineering, Electronics & Computer 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 different from switch statement? Write a program using Switch statement to manipulate student grade system. [16] 2. (a) Write a program to send and receive value from the user defined function . (b) What are the standard header files used in ’C’. Explain their functions ? 3. Write short notes on pointers.

[8+8] [16]

4. Define Structure and write the general format for declaring and accessing members. [16] 5. Write a program using indexed sequential file for employee database .

[16]

6. Write a program to sort the elements whose worst and average case are O(n log n). [16] 7. Explain how stack will be used to evaluate the expression with an example.

[16]

8. (a) Write a program to create root of a tree. (b) Write a program to delete leaf nodes in a binary tree. ?????

[8+8]

2

Code No: R7100106

I B.Tech (R07) Regular & Supplementary Examinations, June 2009 C PROGRAMMING AND DATA STRUCTURES (Common to Civil Engineering, Electrical & Electronics Engineering, Electronics & Communication Engineering, Computer Science & Engineering, Electronics & Instrumentation Engineering, Information Technology, Electronics & Control Engineering, Computer Science & Systems Engineering, Electronics & Computer Engineering, Instrumentation & Control Engineering and Bio-Technology) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ????? 1. (a) Write a ’C’ program to print Pascal Triangle using Binomial Theorem. (b) Write short notes on goto statement.

[10+6]

2. (a) Compare function and recursive function . (b) Explain the concept of function.

[8+8]

3. How can a list of strings be stored in an two - dimensional array ? What library functions are available to simplify string processing ? [16] 4. (a) How structures can be nested. Write a program to demonstrate nesting of structure and accessing structure member. (b) What are the advantages and disadvantages of structures.

[10+6]

5. (a) Write the syntax for opening a file with various modes and closing a file . (b) Explain about file handling functions .

[8+8]

6. Which sorting technique is called as straight. Explain with a sample program ? [16] 7. Write an ’C’ program to implement linked stacks .

[16]

8. (a) What is a network? (b) What is a spanning tree? (c) Define minimal spanning tree . (d) What are the various traversals in a tree? ?????

[16]

3

Code No: R7100106

I B.Tech (R07) Regular & Supplementary Examinations, June 2009 C PROGRAMMING AND DATA STRUCTURES (Common to Civil Engineering, Electrical & Electronics Engineering, Electronics & Communication Engineering, Computer Science & Engineering, Electronics & Instrumentation Engineering, Information Technology, Electronics & Control Engineering, Computer Science & Systems Engineering, Electronics & Computer Engineering, Instrumentation & Control Engineering and Bio-Technology) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ????? 1. (a) Define Algorithm. (b) What is the use of flowchart ? (c) What are the different steps followed in the program development?

[3+3+10]

2. Explain the following library functions (a) sqrt(x) (b) fmod(x,y) (c) toupper(x) (d) fmod(x,y)

[16]

3. Write a program to reverse the strings stored in array of pointers.

[16]

4. (a) What are the rules for initializing the structure? (b) Write a program to print customer account details using structure.

[10+6]

5. What are the different Input/Output operations on Files ?

[16]

6. Write a program for searching mechanism whose worst case time complexity is O(log n) .

[16]

7. Explain the applications of stack and queue in detail.

[16]

8. (a) What is a network? (b) What is a spanning tree? (c) Define minimal spanning tree . (d) What are the various traversals in a tree? ?????

[16]

4

Code No: R7100106

I B.Tech (R07) Regular & Supplementary Examinations, June 2009 C PROGRAMMING AND DATA STRUCTURES (Common to Civil Engineering, Electrical & Electronics Engineering, Electronics & Communication Engineering, Computer Science & Engineering, Electronics & Instrumentation Engineering, Information Technology, Electronics & Control Engineering, Computer Science & Systems Engineering, Electronics & Computer Engineering, Instrumentation & Control Engineering and Bio-Technology) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks ????? 1. (a) Define Algorithm. (b) What is the use of flowchart ? (c) What are the different steps followed in the program development?

[3+3+10]

2. (a) Write short notes on nesting of functions. (b) Write a C program to explain call by value and call by reference concept. [6+10] 3. (a) Write a program to accept N numbers and print whether the number is even or odd using array. (b) Write short notes on one dimensional array.

[10+6]

4. Define Structure and write the general format for declaring and accessing members. [16] 5. Write a program using indexed sequential file for student database to perform addition, deletion and searching of data’s. [16] 6. Write a program to explain selection sort . Which type of technique does it belong. [16] 7. Explain how stack will be used to evaluate the expression with an example.

[16]

8. (a) What is a binary tree? Give the representation of binary tree? (b) What are the common operations done in a binary tree. Explain any one with example. [8+8] ?????