UI FLUTTER AND DESIGN LAB

[Link] (CSE) IIIYEAR I SEM (R22)

LAB MANUAL

Department of
Computer Science and Engineering

AURORA’S SCIENTIFIC AND TECHNOLOGICAL INSTITUTE

Aushapur, Ghatkesar, Hyderabad
 Aurora’s Scientific and Technological Institute

CONTENTS

[Link] Particulars Page No

1 Course Details 2

2 Course Introduction 3

3 Course Objectives 4

4 Course Outcomes 4

5 CO/PO Mapping Matrix 4

6 Syllabus 5

7 Textbooks & References 6

8 Session Plan 7

9 Lecture Notes/Slides 9

10 Question Bank for Mid-Term Examinations 10

11 Question Bank for External Examination 25

12 Assignments 26

13 Seminars 28

1
 Aurora’s Scientific and Technological Institute

1. Course Details

1 Course Code CS304PC

2 Course Title Computer Organization and Architecture
3 Course Abbreviation COA
4 Credits 3 (L:3-T:0-P:0)
5 Regulation R22
6 Academic Year 2025-26
7 Programme [Link]
8 Specialisation Computer Science and Engineering
9 Year – Semester II Year – I Semester
10 Course File Prepared by Jampula Sushma, Teaching Assistant, Department of CSE

2
 Aurora’s Scientific and Technological Institute

2. Course Introduction

The course Programming for Problem Solving introduces students to the foundational principles of programming
and computational problem-solving using the C language, one of the most versatile and widely used programming
languages in engineering and industry. The course aims to build a systematic understanding of how problems can
be analysed, designed, and implemented as computer programs that produce efficient and correct solutions.

Students begin by understanding the basic components of a computer system, the steps involved in developing
a program, and the role of algorithms and flowcharts in transforming problem statements into logical solutions.
The course then explores the syntax and semantics of the C programming language, including data types, control
statements, functions, arrays, pointers, and structures. Through this, students acquire the essential programming
skills required to develop modular, reusable, and maintainable code.

Beyond the syntax of C, the course emphasizes problem-solving methodologies — such as decomposition,
stepwise refinement, and debugging — to cultivate algorithmic thinking. Students learn to design algorithms for
computational tasks, translate them into programs, test them with suitable inputs, and analyse their behaviour.
The course also provides exposure to file handling, enabling students to work with data persistence and external
data storage, which is vital for developing real-world applications.

In line with the Outcome-Based Education (OBE) framework, this course lays the foundation for higher-level
courses such as Data Structures, Object-Oriented Programming, Database Systems, and Software Engineering,
by establishing programming discipline and computational reasoning. The practical sessions complement the
theory by offering extensive hands-on experience in writing, compiling, executing, and debugging C programs on
modern IDEs and compilers.

By the end of this course, students will not only be able to write syntactically correct C programs but will also
develop the ability to analyse problems, design algorithms, implement solutions, and evaluate program
performance — core competencies for every computing professional.

Key Highlights

 Develops algorithmic and logical reasoning required for engineering problem solving.
 Builds strong fundamentals in structured programming and C syntax.
 Encourages modularity, readability, and efficiency in program design.
 Integrates hands-on lab sessions to reinforce conceptual learning.
 Prepares students for advanced programming and software development courses.

3
 Aurora’s Scientific and Technological Institute

3. Course Objectives

The purpose of the course is to introduce principles of computer organization and the
basic architectural concepts. ● It begins with basic organization, design, and
programming of a simple digital computer and introduces simple register transfer
language to specify various computer operations. ● Topics include computer
arithmetic, instruction set design, microprogrammed control unit, pipelining and
vector processing, memory organization and I/O systems, and multiprocessors4. Course
Outcomes (COs)

No Statement Bloom Level Mapped POs/PSOs

CO1 To write algorithms and to draw flowcharts for solving problems. L1-L3 PO1

CO2 To convert the algorithms/flowcharts to C programs. L2-L3 PO1, PO2

CO3 To code and test a given logic in the C programming language. L3-L4 PO2, PO3, PSO1

CO4 To decompose a problem into functions and to develop modular reusable code. L3-L4 PO2, PO3

CO5 To use arrays, pointers, strings and structures to write C programs. L3-L5 PO2, PO3, PSO1

5. CO-PO Mapping Matrix (3-2-1 Scale)

CO \
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
PO/PSO
CO1 3 2

CO2 3 3 1 1

CO3 3 3 2 1 2 2 1

CO4 2 3 3 1 2 3 1

CO5 2 3 3 1 2 3 2

CO6 2 3 3 2 2 3 2

Scale: 3=Strong, 2=Moderate, 1=Low, 0=None (blank)

4
 Aurora’s Scientific and Technological Institute

6. Syllabus

Unit Topics Hours

Overview of C: C Language Elements, Variable Declarations and Data Types, Executable Statements, General Form
of a C Program, Arithmetic Expressions, Formatting Numbers in Program Output.
Selection Structures: Control Structures, Conditions, if Statement, if Statements with Compound Statements,
I 10
Decision Steps in Algorithms.
Repetition and Loop Statements: Repetition in Programs, Counting Loops and the while Statement, Computing a
Sum or Product in a Loop, for Statement, Conditional Loops, Loop Design, Nested Loops, do-while Statement.
Top-Down Design with Functions: Building Programs from Existing Information, Library Functions, Top-Down
Design and Structure Charts, Functions without Arguments, Functions with Input Arguments.
II Pointers and Modular Programming: Pointers and the Indirection Operator, Functions with Output Parameters, 8
Multiple Calls to a Function with Input/ Output Parameters, Scope of Names, Formal Output Parameters as Actual
Arguments.
Arrays: Declaring and Referencing Arrays, Array Subscripts, Using for Loops for Sequential Access, Using Array
Elements as Function Arguments, Array Arguments, Searching and Sorting an Array, Parallel Arrays and
III Enumerated Types, Multidimensional Arrays. 9
Strings: String Basics, String Library Functions: Assignment and Substrings, Longer Strings: Concatenation and
Whole-Line Input, String Comparison, Arrays of Pointers.
Recursion: The Nature of Recursion, Tracing a Recursive Function, Recursive Mathematical Functions, Recursive
Functions with Array and String Parameters
IV 7
Structure and Union Types: User-Defined Structure Types, Structure Type Data as Input and Output Parameters,
Functions with Structured Result Values, Union Types.
Text and Binary File Pointers: Input/ Output Files - Review and Further Study, Binary Files, Searching a Database.
V Searching and Sorting: Basic searching in an array of elements (linear and binary search techniques), Basic 11
algorithms to sort array of elements (Bubble, Insertion and Selection sort algorithms).

Total Hours 45

5
 Aurora’s Scientific and Technological Institute

7. Textbooks & References

7.1. Textbooks:

1. Jeri R. Hanly & Elliot B. Koffman, Problem Solving and Program Design in C, 7e, Pearson.
2. Forouzan & Gilberg, C Programming and Data Structures, 3e, Cengage.

7.2. References:

1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of India.
2. E. Balagurusamy, Computer fundamentals and C, 2nd Edition, McGraw-Hill.
3. Yashavant Kanetkar, Let Us C, 18th Edition, BPB.
4. R.G. Dromey, How to solve it by Computer, Pearson (16th Impression).
5. Programming in C, Stephen G. Kochan, Fourth Edition, Pearson Education.
6. Herbert Schildt, C: The Complete Reference, Mc Graw Hill, 4th Edition.
7. Byron Gottfried, Schaum’s Outline of Programming with C, McGraw-Hill.

7.3. Website References:

1. [Link]
2. [Link]
3. [Link]
4. [Link]
5. [Link]
6. [Link]
7. [Link]
8. [Link]
9. [Link]
10. [Link]
11. [Link]
12. [Link]
13. [Link]
14. [Link]
15. [Link]

6
 Aurora’s Scientific and Technological Institute

8. Session Plan

S No Unit Topic / Sub-topic Teaching Methodology Reference (TB)

1 I Introduction to Programming and C Language Elements Lecture + PPT + Examples TB1 Ch.1

2 I Variable Declarations, Constants, and Data Types Lecture + Code Demo TB1 Ch.2

3 I Executable Statements and Structure of a C Program Lecture + Example Programs TB1 Ch.2

4 I Arithmetic Expressions and Operator Precedence Board + PPT + Coding Demo TB1 Ch.3

5 I Input/Output Functions and Formatting Numbers Lecture + Hands-on Demo TB1 Ch.3

6 I Control Structures and Conditional Logic PPT + Code Examples TB1 Ch.4

7 I Simple if and Compound if Statements Lecture + Code Tracing TB1 Ch.4

8 I Decision Steps in Algorithms – Flowchart Practice Chalkboard + Flowchart Exercises TB1 Ch.4

9 I Repetition in Programs and Loop Design PPT + Problem Solving TB1 Ch.5

10 I Counting Loops, while, for, do-while, Nested Loops Lecture + Demo Programs TB1 Ch.5

11 II Introduction to Top-Down Design and Modularization Lecture + Diagrammatic Explanation TB1 Ch.6

12 II Library Functions and Function Basics Lecture + Demo TB1 Ch.6

13 II Functions without Arguments Lecture + Example Programs TB1 Ch.7

14 II Functions with Input Arguments Lecture + Problem Solving TB1 Ch.7

15 II Pointers and Indirection Operator PPT + Code Tracing TB1 Ch.8

16 II Functions with Output Parameters Lecture + Hands-on Examples TB1 Ch.8

17 II Multiple Calls with Input/Output Parameters Demo + Problem Solving TB1 Ch.8

18 II Scope of Names and Modular Programming Concepts Lecture + Discussion TB1 Ch.9

19 III Introduction to Arrays and Subscripts Lecture + Example Programs TB2 Ch.5

20 III Array Traversal Using for Loops Lecture + Coding Practice TB2 Ch.5

21 III Arrays as Function Arguments Lecture + Problem Solving TB2 Ch.5

22 III Searching and Sorting Arrays (Intro) Lecture + Demo + Exercise TB2 Ch.5

23 III Parallel Arrays and Enumerated Types PPT + Discussion TB2 Ch.5

24 III Multidimensional Arrays and Matrix Operations Lecture + Hands-on TB2 Ch.6

25 III String Basics and Library Functions Lecture + Example Programs TB2 Ch.7

26 III String Manipulation – Substrings, Concatenation Demo + Coding Practice TB2 Ch.7

27 III String Comparison and Arrays of Pointers PPT + Examples TB2 Ch.7

28 IV Introduction to Recursion – Concept & Tracing Lecture + Flowchart Demo TB1 Ch.9

29 IV Recursive Mathematical Functions (Factorial, Fibonacci) Lecture + Code Demo TB1 Ch.9

30 IV Recursion with Arrays and Strings Hands-on Examples TB1 Ch.9

31 IV User-defined Structure Types Lecture + Demo Programs TB1 Ch.10

7
 Aurora’s Scientific and Technological Institute

32 IV Passing Structures to Functions Lecture + Practice Problems TB1 Ch.10

33 IV Structure Result Values and Nested Structures Lecture + Demo TB1 Ch.10

34 IV Union Types and Memory Sharing Concepts Lecture + PPT TB1 Ch.10

35 V File Handling Basics – Text and Binary Files Lecture + Demo TB2 Ch.8

36 V File Pointers and Sequential File Operations Hands-on Code Examples TB2 Ch.8

37 V Binary Files and Record Handling Lecture + Example Programs TB2 Ch.8

38 V Searching a Database using Files PPT + Code Demo TB2 Ch.8

39 V Introduction to Searching Algorithms – Linear Search Lecture + Code Examples TB2 Ch.9

40 V Binary Search Algorithm and Efficiency Comparison Lecture + Hands-on Demo TB2 Ch.9

41 V Sorting Algorithms – Bubble Sort Lecture + Dry Run TB2 Ch.9

42 V Insertion Sort and Selection Sort Lecture + Example Programs TB2 Ch.9

43 V Comparison of Sorting Techniques Discussion + Demo TB2 Ch.9

44 V Case Studies: Integrated Problem Solving in C Practice Session TB1 & TB2

45 V Course Summary, Review, and Revision Discussion + Recap + Quiz TB1 & TB2

8
 Aurora’s Scientific and Technological Institute

9. Lecture Notes/Slides

Lectures Notes/Slides are included at the end of the course file.

9
 Aurora’s Scientific and Technological Institute

10. Question Bank for Mid-Term Examinations

The Part A of the mid-term examination shall be objective/quiz question paper containing 20 questions with 10
MCQs, 5 Fill in the Blanks and 5 Match the Following questions and shall be evaluated for 10 marks. Each question
in Part A carries 0.5 marks in the mid-term examination. Mid I shall be conducted at the middle of the semester
with questions from 2.5 units of syllabus and Mid II at the end of the semester with questions from the remaining
2.5 units of syllabus.

The Part B of the mid-term examination shall be descriptive question paper for 20 marks. The descriptive paper
shall contain 6 questions out of which, the student has to answer 4 questions, each carrying 5 marks. The
questions shall be as follows.

10.1. Unit I – Part A – Objective Questions

S No Type Question CO Bloom Answer

Which symbol is used to terminate a statement in C?
1 MCQ CO1 L1 C
A) , B) : C) ; D) .
The basic building blocks of a C program are _____.
2 MCQ CO1 L1 B
A) Classes B) Functions C) Headers D) Objects
Which of the following is a valid variable name?
3 MCQ CO1 L1 C
A) 1total B) total-sum C) total_sum D) total sum
The keyword used to declare a constant in C is _____.
4 MCQ CO1 L1 A
A) const B) constant C) define D) fixed
Default return type of a C function if not specified is _____.
5 MCQ CO2 L1 C
A) void B) float C) int D) char
Header file required for printf() and scanf() is _____.
6 MCQ CO2 L1 B
A) iostream.h B) stdio.h C) conio.h D) stdlib.h
Which data type occupies the largest memory in C?
7 MCQ CO1 L1 B
A) float B) double C) char D) int
What is the result of 5/2 in C (integer division)?
8 MCQ CO2 L2 C
A) 2.5 B) 3 C) 2 D) 2.0
Which operator has the highest precedence in C?
9 MCQ CO1 L2 C
A) * B) + C) () D) =
Conversion specifier for printing a float value is _____.
10 MCQ CO2 L2 C
A) %d B) %c C) %f D) %lf
The if statement is an example of _____.
11 MCQ CO2 L1 A
A) Selection B) Iteration C) Jump D) Loop
while and for statements are examples of _____.
12 MCQ CO2 L1 B
A) Decision B) Iteration C) Jump D) Label
In C, logical AND operator is _____.
13 MCQ CO2 L1 B
A) & B) && C) AND D) !
Output of printf("%d", 5>3); is _____.
14 MCQ CO2 L2 B
A) 0 B) 1 C) Error D) True
A loop inside another loop is called _____.
15 MCQ CO2 L2 B
A) Infinite loop B) Nested loop C) Multiple loop D) Inner loop
Which loop executes its body at least once?
16 MCQ CO2 L2 C
A) for B) while C) do-while D) if
Statement used to skip remaining code in a loop is _____.
17 MCQ CO2 L2 C
A) exit B) break C) continue D) return
Statement that terminates the loop is _____.
18 MCQ CO2 L2 B
A) exit B) break C) stop D) halt

10
 Aurora’s Scientific and Technological Institute

Output of for(i=0;i<3;i++) printf("%d",i); is _____.

19 MCQ CO2 L2 B
A) 123 B) 012 C) 321 D) 0123
The return keyword is used in _____.
20 MCQ CO2 L1 C
A) Loop B) Condition C) Function D) Structure
A group of statements within { } is called _____.
21 MCQ CO1 L1 B
A) Code B) Compound statement C) Macro D) Block variable
In a flowchart, a decision is represented by _____.
22 MCQ CO1 L2 C
A) Oval B) Rectangle C) Diamond D) Parallelogram
Statement used for multi-way branching is _____.
23 MCQ CO2 L2 C
A) if-else B) goto C) switch D) break
Value of x after x = 10; x += 5; is _____.
24 MCQ CO2 L2 C
A) 5 B) 10 C) 15 D) 20
A loop that never ends is called _____.
25 MCQ CO2 L1 B
A) Dead loop B) Infinite loop C) Nested loop D) Null loop
Format specifier for a character is _____.
26 MCQ CO2 L1 C
A) %d B) %f C) %c D) %s
Relational operator used for equality test is _____.
27 MCQ CO2 L1 B
A) = B) == C) != D) >=
Output of printf("%d", 3 + 4 * 2); is _____.
28 MCQ CO2 L2 B
A) 14 B) 11 C) 10 D) 9
Expression (a>b ? a:b) uses the ____ operator.
29 MCQ CO2 L3 B
A) Bitwise B) Ternary C) Relational D) Logical
Repeating instructions until a condition is met is called _____.
30 MCQ CO2 L2 B
A) Selection B) Iteration C) Branching D) Conditioning
31 Fill In C, every program must contain a ________ function. CO2 L1 main()

32 Fill The extension of a C source file is ________. CO1 L1 .c

33 Fill The smallest individual unit in a program is called a ________. CO1 L1 Token

34 Fill The printf() function is used for ________ output. CO2 L1 Formatted

35 Fill A ________ loop checks its condition before executing the body. CO2 L1 while

36 Fill The scanf() function uses ________ operator to read input. CO2 L2 & (address-of)

37 Fill The %d format specifier is used for ________ data. CO2 L1 Integer

38 Fill The if statement evaluates a ________ expression. CO2 L2 Boolean / condition

A ________ loop executes statements repeatedly until a condition
39 Fill CO2 L2 for loop
becomes false.
Condition becomes
40 Fill The do – while loop terminates when ________. CO2 L2
false
Match the Following:
1. Keyword for constant
2. Loop with counter
1-j
3. Function for output
2-g
4. Header for I/O functions
3-c
5. Conditional structure
4-d
6. Symbol for assignment
CO1 5-b
41 Match 7. Loop executes once before test L2
CO2 6-a
8. Flowchart symbol for start/end
7-f
9. Relational operator
8-i
10. Statement terminator
9-e
10-h
Options:
(a) =
(b) if
11
 Aurora’s Scientific and Technological Institute

(c) printf()
(d) stdio.h
(e) >
(f) do–while
(g) for (h) ;
(i) Oval
(j) const

10.2. Unit I – Part B – Descriptive Questions

S No Question CO Bloom

1 Explain the structure of a C program with an example. CO1 L2

2 Describe the various data types in C and their sizes. CO1 L2

3 Write an algorithm and draw a flowchart to find the largest of three numbers. CO1 L3

4 Discuss the rules for naming identifiers in C with suitable examples. CO1 L2

5 Explain variable declaration, initialization, and scope in C. CO1 L2

6 What are arithmetic expressions in C? Demonstrate with examples showing operator precedence. CO1 L3

7 Explain formatted input and output statements in C using scanf() and printf() functions. CO2 L2

8 Write a C program to calculate the sum and average of n numbers. CO2 L3

9 Describe the different types of control structures in C. CO2 L2

10 Explain the syntax and use of the if, if–else, and nested if statements with examples. CO2 L3

11 Differentiate between switch and if–else statements with examples. CO2 L3

12 Write a C program to find the factorial of a number using a loop. CO2 L3

13 Explain the syntax, flow, and working of a for loop in C. CO2 L2

14 Compare while and do–while loops in C with suitable examples. CO2 L3

15 Write an algorithm and C program to generate the Fibonacci series. CO2 L3

16 Discuss the use of break and continue statements in C with code examples. CO2 L3

17 Write a C program to find whether a number is prime or not using loops. CO2 L3

18 Explain the concept of nested loops with a C program example. CO2 L3

19 Describe the steps involved in program development from problem statement to executable code. CO1 L2

20 Illustrate the flow of control in a loop using a flowchart and a C program example. CO2 L4

12
 Aurora’s Scientific and Technological Institute

10.3. Unit II – Part A – Objective Questions

S No Type Question CO Bloom Answer

A function is a ______ in C.
1 MCQ CO4 L1 C
A) Data type B) Variable C) Subprogram D) Header
A function definition must have _____.
2 MCQ CO4 L1 D
A) Return type B) Function name C) Parameter list D) All of these
A function that calls itself is known as _____.
3 MCQ CO4 L2 B
A) Callback B) Recursive C) Nested D) Inline
Which keyword is used to send control back to the calling function?
4 MCQ CO4 L1 C
A) continue B) break C) return D) goto
Library functions are declared in _____.
5 MCQ CO3 L1 A
A) Header files B) Main() C) User files D) None
The main advantage of top-down design is _____.
6 MCQ CO4 L2 B
A) Faster execution B) Modularity C) More memory D) Less code
Function prototype tells the compiler about _____.
7 MCQ A) Only return type B) Function name CO4 L2 C
C) Parameters and return type D) Local variables
The number of arguments passed to a function is known as its _____.
8 MCQ CO4 L2 B
A) Size B) Arity C) Scope D) Type
Functions that do not return any value have return type _____.
9 MCQ CO4 L1 A
A) void B) null C) int D) char
The variables defined inside a function are called _____.
10 MCQ CO4 L1 B
A) Global B) Local C) Static D) External
A variable declared outside all functions is _____.
11 MCQ CO4 L1 B
A) Local B) Global C) Static D) Auto
Which function finds square root of a number?
12 MCQ CO3 L1 B
A) sqr() B) sqrt() C) root() D) pow()
Header required for pow() is _____.
13 MCQ CO3 L1 A
A) math.h B) stdlib.h C) stdio.h D) string.h
Pointers store _____.
14 MCQ CO4 L2 A
A) Address B) Value C) Constant D) Expression
The operator used to access value from an address is _____.
15 MCQ CO4 L2 B
A) & B) * C) -> D) .
The address-of operator in C is _____.
16 MCQ CO4 L1 B
A) * B) & C) % D) @
int *p; declares p as _____.
17 MCQ CO4 L1 B
A) Integer B) Pointer to int C) Array D) Function
Passing arguments by value means _____.
18 MCQ A) Copy of value is passed B) Address is passed CO4 L2 A
C) Reference is passed D) None
In call by reference, _____.
19 MCQ A) Function gets copy of data B) Actual data is modified CO4 L3 B
C) Compilation error D) None
Which of the following cannot be a formal parameter?
20 MCQ CO4 L3 C
A) Array B) Pointer C) Constant D) Structure
A pointer that is not initialized is called _____.
21 MCQ CO4 L2 C
A) Void pointer B) Null pointer C) Wild pointer D) Dangling pointer
A pointer that points to nothing is _____.
22 MCQ CO4 L1 B
A) Void B) Null C) Empty D) Garbage
void *ptr; means _____.
23 MCQ A) Pointer to integer B) Pointer to void CO4 L2 C
C) Generic pointer D) Null pointer
Address of variable x is obtained by _____.
24 MCQ CO4 L1 B
A) x B) &x C) x D) *&x

13
 Aurora’s Scientific and Technological Institute

Function arguments are separated by _____.

25 MCQ CO4 L1 B
A) Colon B) Comma C) Semicolon D) Space
The function main() in C returns type _____.
26 MCQ CO3 L1 B
A) void B) int C) char D) long
How many return statements can a function have?
27 MCQ CO4 L2 B
A) One B) Multiple C) None D) Unlimited
The static keyword preserves variable value _____.
28 MCQ CO4 L2 C
A) Per call B) Only once C) Across function calls D) Never
The default storage class for local variables is _____.
29 MCQ CO4 L1 B
A) static B) auto C) extern D) register
What is the output of printf("%d", add(2,3)); if add returns sum?
30 MCQ CO3 L2 A
A) 5 B) 2 C) 3 D) Error
Recursive
31 Fill The function that calls itself is known as ________. CO4 L2
function
Modular
32 Fill The process of dividing a program into modules is called ________. CO4 L2
programming
function_name(ar
33 Fill The general form of a function call is ________. CO4 L1
guments);
Function without
34 Fill A function that does not take any arguments is called ________. CO4 L1
arguments
35 Fill ________ keyword is used to define functions that do not return any value. CO4 L1 void

36 Fill The concept of top-down design promotes ________. CO4 L2 modularity

37 Fill Every C program must have one ________ function. CO3 L1 main()

38 Fill Pointer variables are declared using the ________ symbol. CO4 L1 *

39 Fill The address of a variable is obtained using the ________ operator. CO4 L1 &

40 Fill A pointer initialized to zero is known as ________ pointer. CO4 L2 Null

Match the Following:
1. Indirection Operator
2. Function returning no value
3. Storage class for local variables
4. Address-of Operator
5. Wild Pointer
6. Function prototype header
1-b
7. Global Variable
2-f
8. Function with parameters
3-a
9. Static variable
4-j
10. Modular Design
5-d
41 Match CO4 L2
6-g
Options:
7-e
(a) auto
8-h
(b) *
9-i
(c) Top-down
10-c
(d) Uninitialized
(e) extern
(f) void
(g) math.h
(h) Arguments
(i) static
(j) &

14
 Aurora’s Scientific and Technological Institute

10.4. Unit II – Part B – Descriptive Questions

S No Question CO Bloom

1 Explain the concept of top-down design in program development with an example. CO4 L2

2 What are library functions? List any five commonly used library functions with their purpose. CO3 L1

3 Describe the syntax and working of a function definition and function call in C. CO4 L2

4 Write the general form of a function prototype and explain each part with an example. CO4 L2

5 Discuss the advantages of modular programming in C. CO4 L2

6 Differentiate between functions with arguments and functions without arguments using examples. CO4 L3

7 Explain call by value and call by reference parameter-passing mechanisms with examples. CO4 L3

8 Write a C program to calculate the factorial of a number using a user-defined function. CO3 L3

9 Write a function in C to find the maximum of three numbers and return the result. CO3 L3

10 What is a recursive function? Write a recursive C function to compute the Fibonacci series. CO4 L3

11 Explain the concept of pointer variables and how they are declared and initialized. CO4 L2

12 Write a C program to swap two numbers using call by reference. CO4 L3

13 Describe the use of the indirection (*) and address-of (&) operators with examples. CO4 L2

14 Explain scope, visibility, and lifetime of variables in C with suitable examples. CO4 L3

15 What is a global variable? Discuss its advantages and disadvantages. CO4 L2

16 Define a static variable. Illustrate how it differs from an automatic variable. CO4 L3

17 Explain the purpose of a void function and a void pointer with syntax examples. CO4 L2
Write and explain a C program using functions with output parameters to find both the sum and product
18 CO4 L3
of two numbers.
19 Discuss the importance of function prototypes in ensuring type safety during compilation. CO4 L2

20 Summarize the advantages of using pointers and functions together for efficient memory usage. CO4 L3

15
 Aurora’s Scientific and Technological Institute

10.5. Unit III – Part A – Objective Questions

S No Type Question CO Bloom Answer

Arrays in C are _____.
1 MCQ CO5 L1 B
A) Variables B) Data structures C) Functions D) Macros
Array subscripts in C start from _____.
2 MCQ CO5 L1 B
A) 1 B) 0 C) –1 D) Depends
Size of int a[5]; is _____.
3 MCQ CO5 L1 B
A) 4 B) 5 C) 6 D) Undefined
Elements of an array are stored in _____.
4 MCQ CO5 L2 B
A) Random B) Sequential C) Tree D) Stack
Which loop is most commonly used to access arrays?
5 MCQ CO5 L1 C
A) while B) do-while C) for D) switch
In C, an array name represents _____.
6 MCQ CO5 L2 C
A) Its first element B) Its address C) Both A & B D) None
To access the fifth element of array a, we use _____.
7 MCQ CO5 L2 A
A) a[4] B) a(5) C) a{5} D) a[5]
Which of the following declares a 2-D array?
8 MCQ CO5 L1 A
A) int a[3][3]; B) int a(3,3); C) array a[3][3]; D) int a{3,3};
In a 2-D array, elements are stored in ____ order.
9 MCQ CO5 L2 A
A) Row-major B) Column-major C) Random D) Mixed
An array with rows and columns is called _____.
10 MCQ CO5 L2 B
A) Linear B) Matrix C) Tree D) String
Which operator is used for array indexing?
11 MCQ CO5 L1 B
A) ( ) B) [ ] C) { } D) <>
If int a[5] = {1,2,3}; then remaining elements are _____.
12 MCQ CO5 L2 A
A) 0 B) Garbage C) –1 D) NULL
Which keyword is used to define array size at compile time?
13 MCQ CO5 L2 B
A) const B) define C) static D) auto
What is the output of printf("%d", a[0]); if int a[3]={10,20,30};?
14 MCQ CO5 L2 A
A) 10 B) 0 C) Garbage D) Error
The function used to copy one string to another is _____.
15 MCQ CO5 L2 B
A) strcat() B) strcpy() C) strcmp() D) strlen()
Which function is used to find length of a string?
16 MCQ CO5 L1 B
A) len() B) strlen() C) length() D) count()
strcmp(s1,s2) returns 0 when _____.
17 MCQ CO5 L2 C
A) s1>s2 B) s1<s2 C) s1==s2 D) Error
String constants in C are enclosed in _____.
18 MCQ CO5 L1 B
A) ' ' B) "" C) ( ) D) { }
Header file for string functions is _____.
19 MCQ CO5 L1 B
A) stdio.h B) string.h C) stdlib.h D) ctype.h
Strings in C are terminated by _____.
20 MCQ CO5 L1 B
A) '\n' B) '\0' C) '\t' D) EOF
Which function joins two strings?
21 MCQ CO5 L2 B
A) strcpy() B) strcat() C) strchr() D) strcmp()
Which function reads a line of text from keyboard?
22 MCQ CO5 L2 B
A) scanf() B) gets() C) puts() D) printf()
Function that prints string to output is _____.
23 MCQ CO5 L1 B
A) printf() B) puts() C) cout D) display()
The expression "CSE"[1] returns _____.
24 MCQ CO5 L2 B
A) C B) S C) E D) Error
char s[10] = "ABC"; occupies ____ bytes.
25 MCQ CO5 L2 B
A) 3 B) 4 C) 10 D) 11
Which function compares two strings lexicographically?
26 MCQ CO5 L2 B
A) strstr() B) strcmp() C) strrev() D) strncmp()

16
 Aurora’s Scientific and Technological Institute

To convert string to uppercase, we use _____.

27 MCQ CO5 L2 A
A) toupper() B) tolower() C) strupr() D) convert()
What is the output of printf("%s","HELLO"+3); ?
28 MCQ CO5 L3 C
A) HELLO B) ELLO C) LO D) LO
Basic Linear Search checks elements ____.
29 MCQ CO5 L2 B
A) Randomly B) Sequentially C) Binary D) Recursively
Bubble Sort repeatedly ____ adjacent elements.
30 MCQ CO5 L3 B
A) Adds B) Swaps C) Compares D) Deletes
31 Fill An array is a collection of ________ elements of same type. CO5 L1 Homogeneous

32 Fill The first element of array a is accessed as ________. CO5 L1 a[0]

33 Fill The last character in a string is always ________. CO5 L1 \0'

34 Fill The function used to copy a string is ________. CO5 L1 strcpy()

35 Fill The function used to find string length is ________. CO5 L1 strlen()

36 Fill The function that joins two strings is ________. CO5 L1 strcat()

37 Fill Arrays are stored in ________ memory locations. CO5 L2 Contiguous

38 Fill A 2-D array of 3×3 has ________ elements. CO5 L2 9

39 Fill A character array terminated by '\0' is called a ________. CO5 L1 String

40 Fill The header file for string functions is ________. CO5 L1 string.h
Match the Following:
1. Copy string
2. Join strings
3. Length of string
4. Compare strings
5. Null terminator
6. Index of first element
1-a
7. Access loop
2-b
8. Array order
3-d
9. Basic search
4-c
10. Adjacent swap sort
5-e
41 Match CO5 L2
6-h
Options:
7-f
(a) strcpy()
8-g
(b) strcat()
9-i
(c) strcmp()
10-j
(d) strlen()
(e) \0
(f) for
(g) Row-major
(h) 0
(i) Linear Search
(j) Bubble Sort

17
 Aurora’s Scientific and Technological Institute

10.6. Unit III – Part B – Descriptive Questions

S No Question CO Bloom

1 Explain the syntax and declaration of arrays in C with examples. CO5 L2

2 Differentiate between 1-D and 2-D arrays with examples. CO5 L2

3 Write an algorithm and C program to input and display elements of an array. CO5 L3

4 Explain how arrays are passed to functions in C with syntax and example. CO5 L3

5 Write a C program to find the sum and average of n array elements. CO5 L3

6 Write a C program to find maximum and minimum element in an array. CO5 L3

7 Describe the concept of two-dimensional arrays and write a program for matrix addition. CO5 L3

8 Explain memory organization of 2-D arrays (row-major order) in C. CO5 L2

9 Write a C program to multiply two matrices using arrays. CO5 L3

10 Explain the concept of string as a character array in C with example. CO5 L2

11 Write a C program to count vowels, consonants and spaces in a string. CO5 L3

12 Write a C program to reverse a string without using library functions. CO5 L3

13 Compare gets() and scanf() for string input and discuss their limitations. CO5 L2

14 Explain the use of strcpy(), strcat(), strcmp() and strlen() functions with examples. CO5 L2

15 Write a C program to concatenate two strings without using library functions. CO5 L3

16 Discuss how strings can be passed to and returned from functions. CO5 L3

17 Define searching. Explain the logic of Linear Search algorithm in brief. CO5 L2

18 Write a simple C program to implement Linear Search. CO5 L3

19 Define sorting. Explain the basic concept of Bubble Sort algorithm. CO5 L2

20 Write a basic C program to perform Bubble Sort on an array. CO5 L3

18
 Aurora’s Scientific and Technological Institute

10.7. Unit IV – Part A – Objective Questions

S No Type Question CO Bloom Answer

A function that calls itself is called _____.
1 MCQ CO5 L2 B
A) Callback B) Recursive C) Reentrant D) Inline
Recursion terminates when _____.
2 MCQ A) A return statement is executed B) Base condition is met C) Stack is CO5 L2 B
empty D) All functions finish
Which of the following is necessary in a recursive function?
3 MCQ CO5 L2 B
A) Global variable B) Base case C) Loop D) Goto
Recursion uses which data structure internally?
4 MCQ CO5 L3 B
A) Queue B) Stack C) Array D) Linked List
What will happen if the base condition is not specified in a recursive
5 MCQ function? CO5 L3 B
A) Compile error B) Infinite recursion C) Runtime error D) No output
Recursive version of factorial for 5 calls function ____ times.
6 MCQ CO5 L3 B
A) 4 B) 5 C) 6 D) 10
Recursion is preferred when problem can be broken into _____.
7 MCQ A) Sequential steps B) Similar sub-problems C) Independent modules D) CO5 L2 B
Loops
Which of the following is NOT a typical example of recursion?
8 MCQ CO5 L1 D
A) Factorial B) Fibonacci C) Sum of array D) Switch statement
Tail recursion means _____.
9 MCQ A) Recursive call is last statement B) Function calls itself twice C) Function CO5 L3 A
returns before call D) None
Which of the following is an advantage of recursion?
10 MCQ CO5 L2 B
A) Saves memory B) Simpler code C) No stack usage D) Faster execution
Which keyword is used to define a structure in C?
11 MCQ CO5 L1 B
A) record B) struct C) structure D) define
A structure is a collection of _____.
12 MCQ CO5 L1 C
A) Functions B) Arrays C) Variables of different types D) Pointers
Which operator is used to access structure members through a pointer?
13 MCQ CO5 L2 B
A) . B) -> C) & D) *
Nested structure means _____.
14 MCQ A) Structure within structure B) Pointer to structure C) Array of structures CO5 L2 A
D) Union of structures
The default alignment of structure members is _____.
15 MCQ CO5 L2 C
A) Sequential B) Random C) Aligned by compiler D) User defined
A structure variable is accessed by _____.
16 MCQ CO5 L1 A
A) Dot operator B) Arrow operator C) Ampersand D) Star operator
What is the size of an empty structure in C?
17 MCQ CO5 L1 B
A) 0 B) 1 C) Undefined D) Error
A group of records having common structure is called _____.
18 MCQ CO5 L2 A
A) Structure array B) Nested structure C) Union D) Class
The keyword used to define union is _____.
19 MCQ CO5 L1 B
A) struct B) union C) record D) class
In a union, all members share the same _____.
20 MCQ CO5 L2 B
A) Value B) Memory C) Name D) Type
The size of a union is equal to _____.
21 MCQ CO5 L3 B
A) Sum of members B) Size of largest member C) Average D) Undefined
Structures are stored in _____.
22 MCQ CO5 L2 C
A) Heap B) Stack C) Contiguous memory D) Random
Which operator is used to reference structure members?
23 MCQ CO5 L1 A
A) Dot B) Comma C) Ampersand D) Colon
Can structures be passed to functions?
24 MCQ CO5 L3 A
A) Yes B) No C) Only by reference D) Only by value
19
 Aurora’s Scientific and Technological Institute

Which feature of structures is NOT allowed in C?

25 MCQ CO5 L3 C
A) Self-reference B) Pointer members C) Function members D) Nested
How are arrays of structures declared?
26 MCQ CO5 L1 B
A) struct student s[]; B) struct student s[10]; C) struct s[10]; D) None
What is the output of recursive Fibonacci(4)?
27 MCQ CO5 L3 B
A) 2 B) 3 C) 5 D) 8
Which of the following is an example of indirect recursion?
28 MCQ CO5 L3 B
A) main() calls itself B) A calls B and B calls A C) A calls A D) B calls C
Recursive solutions are usually ____ than iterative ones.
29 MCQ CO5 L3 A
A) Slower B) Faster C) Simpler D) None
Which memory segment stores recursive calls?
30 MCQ CO5 L3 B
A) Heap B) Stack C) Code D) Global
31 Fill A function that calls itself is called a ________ function. CO5 L1 Recursive

32 Fill Recursive functions use a ________ to store return addresses. CO5 L2 Stack

33 Fill The base condition in recursion is used to ________ recursion. CO5 L2 Terminate

34 Fill Structure members are accessed using ________ operator. CO5 L1 Dot (.)

35 Fill When a structure contains another structure, it is called ________. CO5 L2 Nested structure

36 Fill In a union, all members share the same ________. CO5 L2 Memory

37 Fill The keyword used to define a union is ________. CO5 L1 union

The operator used to access structure member through pointer is
38 Fill CO5 L2 ->
________.
39 Fill Recursive program for factorial(3) calls function ________ times. CO5 L2 3

40 Fill The keyword used to declare a structure is ________. CO5 L1 struct

Match the Following:
1. Recursion
2. Base case
3. Stack
4. Structure
5. Union
6. Member access
1-f
7. Arrow operator
2-g
8. Nested structure
3-i
9. Memory sharing
4-j
10. Keyword for structure
5-b
41 Match CO5 L2
6-c
Options:
7-d
(a) struct
8-e
(b) union
9-h
(c) .
10-a
(d) ->
(e) Structure inside structure
(f) Function calling itself
(g) Condition to stop
(h) Common memory
(i) Memory stack
(j) Data grouping of different types

20
 Aurora’s Scientific and Technological Institute

10.8. Unit IV – Part B – Descriptive Questions

S No Question CO Bloom

1 Define recursion and explain its working with the help of a simple example. CO5 L2

2 Write an algorithm and recursive C function to find the factorial of a number. CO5 L3

3 Trace the recursive calls for factorial(4) and show stack behavior. CO5 L3

4 Write a recursive function to generate the Fibonacci series. CO5 L3

5 Differentiate between recursion and iteration with examples. CO5 L2

6 Explain tail recursion and non-tail recursion with examples. CO5 L3

7 Discuss the advantages and disadvantages of using recursion. CO5 L2

8 Write a recursive function to compute the sum of array elements. CO5 L3

9 Explain the use of structures in C and write syntax for definition and declaration. CO5 L2

10 Write a C program to read and display student details using structures. CO5 L3

11 What is a nested structure? Write a C program using nested structures. CO5 L3

12 Explain the difference between structure and union with a neat example. CO5 L3

13 Write a C function that accepts structure as argument and returns it. CO5 L4

14 Discuss how structure variables can be passed by value and by reference. CO5 L3

15 Explain the use of pointer-to-structure and arrow operator with syntax and example. CO5 L3

16 Write a program to store and display information of 5 students using an array of structures. CO5 L3

17 Explain memory sharing in a union and write a small program demonstrating it. CO5 L3

18 Define self-referential structures with an example. CO5 L4

19 Describe the importance of typedef with structures and unions in simplifying code. CO5 L3

20 Write a short note on differences between structure, array and union in C. CO5 L2

21
 Aurora’s Scientific and Technological Institute

10.9. Unit V – Part A – Objective Questions

S No Type Question CO Bloom Answer

File handling in C requires inclusion of header _____.
1 MCQ CO6 L1 C
A) files.h B) fstream.h C) stdio.h D) stdlib.h
The function used to open a file in C is _____.
2 MCQ CO6 L1 B
A) open() B) fopen() C) fileopen() D) create()
Which mode opens a file for reading?
3 MCQ CO6 L1 A
A) “r” B) “w” C) “a” D) “r+”
Which function closes a file in C?
4 MCQ CO6 L1 B
A) close() B) fclose() C) exit() D) stop()
Which of the following is a valid file pointer declaration?
5 MCQ CO6 L1 B
A) file *fp; B) FILE *fp; C) fp FILE; D) pointer fp;
Binary files store data in ____ form.
6 MCQ CO6 L2 D
A) ASCII B) Text C) Machine code D) Binary
Function used to write formatted data to a file is _____.
7 MCQ CO6 L2 B
A) printf() B) fprintf() C) fputs() D) fwrite()
Function used to read formatted data from a file is _____.
8 MCQ CO6 L2 B
A) scanf() B) fscanf() C) fgets() D) fread()
The function used to move file pointer to a given location is _____.
9 MCQ CO6 L3 A
A) fseek() B) rewind() C) ftell() D) goto()
Which mode is used to append data to a file?
10 MCQ CO6 L1 B
A) “r” B) “a” C) “w” D) “a+”
What does fclose(fp) return on success?
11 MCQ CO6 L2 A
A) 0 B) 1 C) –1 D) NULL
ftell(fp) returns _____.
12 MCQ CO6 L2 B
A) File pointer address B) Current position C) EOF D) Bytes read
The function rewind(fp) does _____.
13 MCQ CO6 L2 B
A) Reopens file B) Moves to beginning C) Deletes file D) Closes file
To check end of file, we use _____.
14 MCQ CO6 L2 A
A) feof() B) eof() C) end() D) null()
Which function writes a character to a file?
15 MCQ CO6 L1 A
A) putc() B) getc() C) fputs() D) fwrite()
Which function reads a character from a file?
16 MCQ CO6 L1 B
A) getch() B) getc() C) getchar() D) fscanf()
The default file opening mode is _____.
17 MCQ CO6 L1 B
A) Write B) Read C) Append D) Binary
Binary files are better for _____.
18 MCQ CO6 L3 A
A) Speed B) Readability C) Editing D) Portability
Which of these indicates end of file in C?
19 MCQ CO6 L1 A
A) EOF B) NULL C) –1 D) End
Which function is used to delete a file?
20 MCQ CO6 L2 A
A) remove() B) delete() C) fclose() D) clear()
Searching technique that checks each element is _____.
21 MCQ CO6 L1 B
A) Binary B) Linear C) Hash D) Tree
Binary search requires array to be _____.
22 MCQ CO6 L2 A
A) Sorted B) Random C) Reverse D) Grouped
Best case time for linear search is _____.
23 MCQ CO6 L3 A
A) O(1) B) O(n) C) O(log n) D) O(n²)
Average case time for binary search is _____.
24 MCQ CO6 L3 C
A) O(1) B) O(n) C) O(log n) D) O(n²)
Bubble sort is based on _____.
25 MCQ CO6 L2 B
A) Divide and Conquer B) Swapping C) Insertion D) Selection
In Bubble Sort, largest element is ____ after each pass.
26 MCQ CO6 L3 A
A) Bubbled to top B) Moved to front C) Deleted D) Ignored

22
 Aurora’s Scientific and Technological Institute

Insertion Sort works by _____.

27 MCQ CO6 L2 B
A) Selecting smallest B) Building sorted list C) Swapping D) Merging
Selection Sort works by _____.
28 MCQ CO6 L2 A
A) Finding min and swapping B) Swapping adjacent C) Dividing D) Merging
Number of comparisons in Bubble Sort for n elements ≈ ____.
29 MCQ CO6 L3 B
A) n²/2 B) n² C) n D) 2n
Complexity of Binary Search is ____.
30 MCQ CO6 L3 B
A) O(1) B) O(log n) C) O(n) D) O(n²)
31 Fill File pointers in C are declared using the keyword ________. CO6 L1 FILE

32 Fill Function used to write binary data to file is ________. CO6 L2 fwrite()

33 Fill Function used to read binary data is ________. CO6 L2 fread()

34 Fill The EOF constant is defined in header ________. CO6 L1 stdio.h

35 Fill Function to find current position of file pointer is ________. CO6 L2 ftell()

36 Fill Linear Search has ________ time complexity. CO6 L2 O(n)

37 Fill Binary Search has ________ time complexity. CO6 L2 O(log n)

38 Fill Bubble Sort is an ________ sorting algorithm. CO6 L2 Exchange

39 Fill In Insertion Sort, the array is divided into ________ and ________ parts. CO6 L3 Sorted, Unsorted
Selected and
40 Fill In Selection Sort, the minimum element is ________ in each pass. CO6 L3
Swapped
Match the Following:
1. File open function
2. End of file test
3. Write formatted to file
4. Read formatted from file
5. Reposition file pointer
6. Sequential search
1-b
7. Binary search
2-e
8. Bubble sort
3-c
9. Insertion sort
4-d
10. Selection sort
5-a
41 Match CO6 L2
6-f
Options:
7-g
(a) fseek()
8-h
(b) fopen()
9-i
(c) fprintf()
10-j
(d) fscanf()
(e) feof()
(f) O(n)
(g) O(log n)
(h) Swapping adjacent
(i) Building sorted list
(j) Finding min and swapping

23
 Aurora’s Scientific and Technological Institute

10.10. Unit V – Part B – Descriptive Questions

S No Question CO Bloom

1 Explain the concept of file handling in C and its advantages over keyboard I/O. CO6 L2

2 List and describe different modes of opening a file in C. CO6 L2

3 Write and explain a C program to write text data to a file. CO6 L3

4 Write a C program to read contents of a file and display them on screen. CO6 L3

5 Explain the use of file pointers and fopen(), fclose() functions. CO6 L2

6 Discuss the difference between text and binary files with examples. CO6 L3

7 Write a program to copy the contents of one file to another. CO6 L3

8 Explain the working of fseek(), ftell() and rewind() functions with examples. CO6 L3

9 Describe the steps to search a record in a binary file. CO6 L3

10 Write an algorithm and C program to implement Linear Search on an array. CO6 L3

11 Discuss the working principle of Binary Search algorithm with an example. CO6 L3

12 Write a C program to perform Binary Search on a sorted array. CO6 L3

13 Explain the logic of Bubble Sort and trace it for an example array. CO6 L3

14 Write a C program to sort an array using Bubble Sort. CO6 L3

15 Differentiate between Bubble, Insertion and Selection Sort techniques. CO6 L4

16 Explain the Insertion Sort algorithm and write a C function to perform it. CO6 L3

17 Write a C program to sort an array using Selection Sort. CO6 L3

18 Compare the time complexities of Linear, Binary Search and Sorting algorithms. CO6 L4

19 Write a short note on file pointer operations and random access in files. CO6 L3

20 Summarize the use of searching and sorting for database management in files. CO6 L4

24
 Aurora’s Scientific and Technological Institute

11. Question Bank for External Examination

11.1. Unit I

S No Year Reg/Supp Question Marks CO Bloom

25
 Aurora’s Scientific and Technological Institute

12. Assignments

Assignments are part of Continuous Internal Evaluation (CIE) and are evaluated for 5 marks. Student shall submit
two assignments in a course and the average of 2 Assignments each for 5 marks shall be taken. The first
assignment should be submitted before the conduct of the first mid-term examination, and the second
assignment should be submitted before the conduct of the second mid-term.

12.1. Assignment-I (from first 50% of the Syllabus)

S No Question CO Bloom

Design an algorithm and flowchart for a menu-driven electricity billing system applying control structures and
1 CO1 L4
decision logic.
Develop a C program to simulate student marks processing – input marks of n students, compute average,
2 CO2 L5
highest scorer, and classification using loops.
Create a temperature conversion and analysis program that reads multiple readings, finds max/min/average,
3 CO2 L5
and categorizes results.
Build a library fine calculation system (using if–else and loops) for number of overdue days and amount per
4 CO2 L4
day.
Write a menu-driven program that uses modular functions to perform arithmetic, geometric, and harmonic
5 CO2 L5
mean for n numbers.
Develop an algorithm and code to simulate online voting system with eligibility check, vote count, and
6 CO2 L6
percentage calculation.
Construct a program that reads rainfall data of 12 months, stores in an array, and reports month with
7 CO5 L4
highest/lowest rainfall.
Create a modular C program to analyze students’ attendance: calculate attendance %, assign eligibility, and
8 CO3 L5
display class statistics.
Write a program to categorize students’ performance (Excellent, Average, Poor) based on average marks
9 CO5 L4
using arrays and control structures.
Develop a C program that analyzes daily sales data for a week using arrays and produces summary report
10 CO5 L5
(average, high, low).

11 Design an algorithm to find frequency of each digit (0–9) appearing in a series of inputs. CO2 L4

Write a C program to calculate employee payroll with allowances and deductions using structured decision
12 CO2 L5
logic.

13 Build a menu-driven grade card generator that computes total, average, and grade using loops and arrays. CO3 L4

Develop a program that stores daily temperatures of one week and displays bar chart using ‘*’ symbols to
14 CO5 L6
represent temperature levels.
Design an algorithm and C program for billing in a supermarket, including item totals, discounts, and final
15 CO2 L6
invoice.
Write a program that uses arrays to simulate a simple bank transaction system (deposit, withdraw, check
16 CO2 L5
balance).
Construct a modular program to evaluate performance of a cricket player using batting scores stored in
17 CO5 L4
arrays.
Create a program to track monthly expenses (input as array elements), compute category-wise totals, and
18 CO5 L5
compare with budget.

19 Write a program to calculate statistics of rainfall data for multiple cities (multi-dimensional arrays). CO5 L5

Develop a C program to generate class report summary showing total students passed/failed, average marks,
20 CO5 L6
and subject toppers using arrays.

26
 Aurora’s Scientific and Technological Institute

12.2. Assignment-II (from remaining 50% of the Syllabus)

S No Question CO Bloom

Design a C program to analyze text from a file – count vowels, consonants, digits, and lines; store results in
1 CO6 L5
another file.

2 Develop a program to track student records using structures and files – add, update, delete, and display data. CO6 L6

3 Create a structure-based inventory management system to calculate stock values and generate report file. CO6 L6

4 Write a program to sort a list of names alphabetically and save the sorted output to a file. CO6 L5

5 Design a C program to compare marks of students from two files and generate a consolidated grade report. CO6 L6

6 Create a C application to simulate a simple railway reservation system using structures and file handling. CO6 L6

7 Develop a program to search for a specific word in a text file and display the line numbers where it appears. CO6 L5

8 Implement a contact management system (add, search, delete contacts) using file operations and structures. CO6 L6

9 Write a program to count unique words in a paragraph, store the word-frequency list in a text file. CO6 L6

Design a C program to store student attendance in a file and generate monthly attendance report sorted by
10 CO6 L5
roll number.
Develop a program to simulate a library catalog – add books, search by author/title, and save data
11 CO6 L6
persistently using files.

12 Create a recursive function to display all permutations of a given string (no library function). CO5 L6

Design a program that compares the execution time of Bubble, Selection, and Insertion sorts on the same
13 CO6 L6
dataset.
Write a program to read employee details, sort them by salary using Insertion Sort, and save sorted output to
14 CO6 L6
a binary file.

15 Develop a program to search and update specific student records stored in binary file using roll number. CO6 L5

Build a program to analyze word frequency and character frequency in a large text file using arrays and
16 CO6 L6
structures.
Create a recursive program for binary search on sorted data read from a file and log the trace into a separate
17 CO6 L6
file.

18 Implement a student grading and ranking system using structures and file sorting based on total marks. CO6 L6

19 Design a C program to merge multiple student data files into a single master file and display duplicate entries. CO6 L6

Build a C program to maintain examination results, generate pass percentage, subject-wise toppers, and
20 CO6 L6
export summary file.

27
 Aurora’s Scientific and Technological Institute

13. Seminars

Seminars are part of the Continuous Internal Evaluation and are evaluated for five marks. Seminars are to be
given by each learning group of three students on a topic in the concerned subject. This assessment shall be
completed before II Mid-Term Examination.

S No Question Unit / Concept CO Bloom

Evolution of Programming Languages and the Role of C in Modern

1 Unit I – C Overview CO1 L4
Computing
Stepwise Refinement and Algorithmic Problem Solving in Engineering Unit I – Problem Solving &
2 CO1 L5
Applications Flowcharts
Unit I – Selection &
3 Control Structures in C and Their Real-world Applications CO2 L4
Iteration

4 Common Logical Errors in C Programs and How to Debug Them Effectively Unit I – Loops & Conditions CO2 L5

5 Modular Programming and Top-down Design: Principles and Benefits Unit II – Functions CO4 L5

Unit II – Functions &

6 Parameter Passing Mechanisms: Call by Value vs Call by Reference CO4 L4
Pointers

7 The Role of Pointers in Memory Management and Dynamic Data Handling Unit II – Pointers CO4 L5

Unit II – Modular
8 Scope, Lifetime and Storage Classes of Variables in C CO4 L4
Programming

9 Applications of Arrays in Scientific and Statistical Computation Unit III – Arrays CO5 L4

Comparison of Iterative and Recursive Solutions for Mathematical

10 Unit IV – Recursion CO5 L5
Problems

11 Multi-dimensional Arrays and Matrix Operations: Use Cases in Engineering Unit III – 2D Arrays CO5 L4

12 String Manipulation and Real-life Applications of String Functions Unit III – Strings CO5 L4

13 Understanding Structures and Unions for Complex Data Representation Unit IV – Structures CO5 L4

Real-world Applications of Structures: Student Records, Employee Payroll, Unit IV – Structures &
14 CO5 L5
Inventory Systems Functions
Recursive vs Iterative Problem Solving: Efficiency, Stack Usage, and
15 Unit IV – Recursion CO5 L5
Limitations

16 File Handling in C: Text vs Binary Files and Their Use Cases Unit V – File Pointers CO6 L4

17 Error Handling in File Operations and Its Importance in Software Reliability Unit V – File Operations CO6 L5

Searching Algorithms: Linear vs Binary Search – Concept, Comparison, and

18 Unit V – Searching CO6 L4
Use Cases

19 Sorting Algorithms in C: Logic, Performance, and Real-world Applications Unit V – Sorting CO6 L5

Integration of C Programming Concepts in Real-world Engineering Systems

20 Across All Units CO1-CO6 L6
(Mini Project Perspective)

28