0% found this document useful (0 votes)
50 views2 pages

B.Tech. Degree Examination BT, Cse, Ece, Eee, Eie & It: (Nov-16) (EID-101)

This document is the question paper for the first semester B.Tech. degree examination in Programming with C. It contains 10 questions divided into 5 modules. Each module carries 12 marks and students must answer 1 question from each module. The questions cover topics related to C programming language such as data types, variables, conditional statements, loops, functions, arrays, structures, file handling and more. Students are instructed to write their answers in the space provided and show the code for any programs required in the questions.

Uploaded by

kohli king
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
0% found this document useful (0 votes)
50 views2 pages

B.Tech. Degree Examination BT, Cse, Ece, Eee, Eie & It: (Nov-16) (EID-101)

This document is the question paper for the first semester B.Tech. degree examination in Programming with C. It contains 10 questions divided into 5 modules. Each module carries 12 marks and students must answer 1 question from each module. The questions cover topics related to C programming language such as data types, variables, conditional statements, loops, functions, arrays, structures, file handling and more. Students are instructed to write their answers in the space provided and show the code for any programs required in the questions.

Uploaded by

kohli king
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

[Nov-16]

[EID-101]
B.Tech. Degree Examination
BT, CSE, ECE, EEE, EIE & IT
I SEMESTER
PROGRAMMING WITH C
(Effective from the admitted batch 2015–16)

Ti me: 3 Hours Max.Marks: 60


--------------------------------------------------------------------------------------- -------------
Instructions: Each Module carries 12 marks.
Answer all modules choosing one question fro m each module.
All parts of the module must be answered in one place only.
Figures in the right hand marg in indicate marks allotted.
--------------------------------------------------------------------------------------- ------------

MODULE-I
1. a) Define programming. Discuss about different types of
programming languages 6
b) How is memory reserved using a declaration statement? Explain
in detail with examples 6
OR
2. a) Write short notes on the following:
i) loader ii) linker 6
b) Define variable. How many types of variables are supported
by C-language 6
MODULE -II
3. a) Differentiate between type casting and type conversion 6
b) What are the unconditional branching statements available in C?
Explain in detail 6
OR
4. a) Write short notes on printf and scanf functions 6
b) Compare the use of if-else construct with that of ternary operator 6

MODULE -III
5. a) Give the points of similarity and differences between a while
loop and a do-while loop 6
b) Write a program for matrix multiplication 6
OR
6. a) Write a program to print the following pattern: 6
1
1 2 1
1 2 3 2 1
1 2 3 4 3 2 1

b) Discuss about string handling functions 6


MODULE -IV
7. a) Write a program to find the factorial of a number using
recursion 6
b) What is an array of pointers? How is it different from a pointer
to an array? 6
OR
8. a) How do we pass an array to a function? Explain with an
example program 6
b) Write a short note on pointer arithmetic 6
MODULE -V
9. a) Is it possible to create an array of structures? Explain with the
help of an example 6
b) Write a program to read the details of a student and then print
it on the screen as well as write it into a file 6
OR
10. a) Explain with an example how structures are initialized 6
b) Write a short note on the following functions. For each function,
give a program code that demonstrates it usage
i) fopen() ii) fclose() 6

[1,3,4,5,6,7/I S/ 116]

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