VIGNAN’S INSTITUTE OF ENGINEERING FOR WOMEN

Approved by AICTE, New Delhi, Affiliated to JNTU Kakinada

KapujaggarajuPeta, VSEZ(Post),Visakhapatnam-530049,AP

DEPARTMENT OF BASIC SCIENCE AND HUMANITIES

UNITWISE IMPORTANT QUESTIONS

Course Name: Programming for Problem Solving using C Course Code:C104

Year/Sem: I B.Tech I Sem CSE/ECE/EEE/IT/MECH Regulation: R20

Admitted Batch: 2020 Academic Year:2020-21
Course Coordinators : Mr.M.Srinivasa Rao/ Mrs.K.Guru Lakshmi
Course handled by : Mr. Ch. Sekhar/Mr.M. Srinivasa Rao/Ms.Ch.Usha/
Mrs.K.Guru Lakshmi/Mr.B. Ch.Venkata Ramana

UNIT-1
PART-A
Introduction to Computers

1) Explain the steps involved in creating and running C programs

2) Explain computer numbering system and different conversions form one type to another.
3) Explain the procedure for storing integers and storing real numbers

PART-B
Introduction to the C Language
4) Write about different data types available in C
5) Explain the basic structure of a C program
6) Discuss variables, constants and identifiers in C
7) Explain formatting I/O functions(printf() and scanf())
8) Discuss scope of the variables with suitable example (or) Explain local and global
variables with examples
9) Explain different storage classes and type qualifiers available in C with examples

PART-C
Structure of a C Program
10) Explain the concept of Precedence and Associativity of operators
11) Briefly explain type conversion and type casting statements for converting data types
12) How to evaluate expressions according to their precedence and associativity
13) What are command line arguments explain with an example

UNIT II
PART-A
Bitwise Operators
14) Explain Logical Bitwise Operators with their operations and truth tables
15) What are left shift and right shift operators explain with examples (or) Explain shift
operators with examples
PART-B
Selection & Making Decisions

16) Simulate Two Way Selection statements with examples (or) Explain Conditional
statements / Branching statements / Control structures / Decision making statements in C.
17) Simulate Multi way Selection statements with examples (or) Explain switch statement
with a suitable program

PART-C
Repetition
18) What are loops? Explain pretest and post test loops along with their initialization and
updating processes.
19) Explain Event and Counter Controlled Loops.
20) Simulate different types of loops available in C with examples (or) Explain Looping
statements / Iterative statements / Control structures / Repetition statements in C.
21) Simulate different types of jumping statements available in C with examples

UNIT III
PART A
Arrays
22) Explain the concept of arrays with example (or) Explain one dimensional arrays with
example
23) Explain two dimensional arrays with example (or) How to represent data that is
organized in rows and columns (tabular data) using arrays.

PART B
Strings
24) Discuss string I/O functions in C with suitable examples
25) Discuss string manipulation functions (or) string handling functions in C with suitable
examples
26) How to convert Data to string and string to data using sscanf() and sprint() functions

PART C
Enumerated, Structure, and Union
27) Explain typedef keyword(or) How to create alias name for data types in C(or)Discuss
the procedure to create user defined names for data types
28) Explain enum keyword(or) Explain enumerated data types in C
29) Explain the concept of structures in C (or) How to store records of information having
various types of data using structures.
30) Explain the concept of unions in C (or) How to store records of information having
various types of data using unions
31) Distinguish Structures and unions

UNIT IV
PART A
Pointers
32) Explain pointers with an example (or) How to initialize and use pointers
33) Explain the concept of pointers to pointers/chain of pointers/multiple indirection/double
pointer (or) How to store address of a pointer in another pointer?
34) Explain pointer compatibility

PART B
Pointer Applications
35) Demonstrate pointer arithmetic
36) Explain memory allocation functions in C (or) Explain dynamic memory allocation with
example (or) How to allocate memory dynamically to store a structure or any data (or)
Explain malloc(),calloc() and free() functions.
37) Differentiate malloc() and calloc()
38) Describe the procedure to create array of pointers
PART C
Processor Commands
39) Explain preprocessor commands (or) Describe preprocessor directives (or) Describe
processor commands (or) How to create macros in c program (#define)?

UNIT V
PART A
Text Input / Output
40) Describe the steps involved in processing a file/stream
41) What are the different modes to open a text file.
42) Explain standard library I/O functions for files (or) Demonstrate file handling functions
(or) what are the functions available to perform operations on files?

PART B
Binary Input / Output
43) Distinguish text and binary streams/files
44) Explain standard library functions for files(or) Demonstrate sequential file access
functions (or) Describe file handling functions
45) Describe with an example, how to convert a text file into binary and binary file into text
file.
PART C
 FUNCTIONS
46) Define function. Explain the procedure of declaring, calling, defining and returning a
value to function.
47) Define and describe user defined function with syntax and example.
48) Explain types of user defined functions with examples (or) How functions are
categorized depending on the arguments list and return values.
49) Explain inter function communication
50) Simulate parameter passing techniques with examples (or) Explain calling procedures of
functions (or) Explain the concept of call by value and call by reference techniques
51) Differentiate call by value and call by reference techniques
52) Describe how to pass arrays to a function.(or) In how many ways we can pass an array to
a function
53) Describe how to pass pointers to functions with example
54) Explain how a function can return a pointer
55) Explain the concept of Recursion (or) Explain how a function can call itself
56) State the advantages and disadvantages of recursion
57) Describe Towers of Hanoi problem (or) Describe an application of recursion