Scribd
Upload
19 views

May - 2018 2

This document contains a practice exam for a Computer Programming course. It has two parts: Part A contains 10 short answer questions covering topics like variables, constants, control statements, pointers, arrays, files, unions, and linked lists. Part B contains 11 programming questions to be answered, with choices to answer one full question from each of the 5 units, testing topics such as identifiers, recursion, loops, functions, pointers, structures, files, sorting, and stacks/queues.

Uploaded by

manchikatlahimanshu.13
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views

May - 2018 2

This document contains a practice exam for a Computer Programming course. It has two parts: Part A contains 10 short answer questions covering topics like variables, constants, control statements, pointers, arrays, files, unions, and linked lists. Part B contains 11 programming questions to be answered, with choices to answer one full question from each of the 5 units, testing topics such as identifiers, recursion, loops, functions, pointers, structures, files, sorting, and stacks/queues.

Uploaded by

manchikatlahimanshu.13
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Code No: 111AF R13

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD


B.Tech I Year Examinations, May - 2018
JN
COMPUTER PROGRAMMING
(Common to CE, EEE, ME, ECE, CSE, EIE, IT, MCT, MMT, AE, AME, MIE, PTM,
CEE, AGE)
TU
Time: 3 hours Max. Marks: 75

Note: This question paper contains two parts A and B.


Part A is compulsory which carries 25 marks. Answer all questions in Part A.
H
Part B consists of 5 Units. Answer any one full question from each unit. Each question
carries 10 marks and may have a, b, c as sub questions.
U
PART- A
(25 Marks)
SE
1.a) Distinguish between variables and constants. Give example. [2]
b) Explain the difference between break, goto and continue statements. [3]
c) What are the storage classes in C? [2]
d) Write a C program to interchange two values. [3]
D
e) Give the syntax of calloc function. [2]
f) What is a dangling Pointer? How it is different from normal Pointer? [3]
g) Write the array applications. [2]
16
h) Distinguish between text and binary files. [3]
i) Write brief notes on unions. [2]
j) What are the operations performed in linked lists? [3]
-0
PART-B
(50 Marks)
5-
2. State and explain various identifiers in C program. And also discuss about operator
precedence in expression evaluation with a suitable example. [10]
20
OR
3.a) Write and explain the structure of C program.
b) Write a program to print prime numbers up to a given number ‘n’. [5+5]
1
4.a) In what way a recursive function differs from non-recursive functions? Explain.
8P
b) With the help of flowchart and example program explain the while loop. [5+5]
OR
5.a) Define a function for determining whether a given character is a vowel or not.
b) Write the program for multiplication of two matrices? [5+5]
M
6.a) Discuss the programming applications of pointers.
b) Explain the role of pointers in inter function communication. [5+5]
OR
7.a) Illustrate the character input/output functions with suitable examples.
b) What are the string manipulation functions? Explain any three of them. [5+5]
8.a) What is the main reason for using structure? What special keyword is used in defining a
structure? Illustrate with example.
JN
b) Demonstrate how one structure can be copied to another of the same type. [5+5]
OR
9.a) How to read from and write to a file? Explain with examples.
TU
b) What is file? Explain about the Input and output functions of files. [5+5]

10. Sort the following 10 elements using bubble sort technique. Write the algorithm for the
same. [10]
H
85 53 96 35 27 87 37 12 90 23
OR
11.a) Give brief description about storage representation on queues.
b) Write a program to implement stack using arrays. [5+5]
U
SE

---ooOoo---
D
16
-0
5-
20
1 8P
M

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy