JNTUH Model Paper Answers with Explanations

Section A: Short Answer Questions (30 Marks)

1. What is a compiler? Explain its phases briefly. (5M)

A compiler is a specialized program that translates code written in a high-level
programming language (like C, Java, or Python) into machine code (binary code) that
a computer's processor can execute directly. The compilation process involves
several phases:
1. Lexical Analysis: The source code is scanned and divided into tokens
(keywords, identifiers, operators, etc.). This helps in identifying the structure of
the code.
2. Syntax Analysis: The tokens are analyzed according to the grammatical rules of
the programming language to create a parse tree. This checks for syntax errors.
3. Semantic Analysis: The compiler checks the parse tree for semantic errors, such
as type mismatches or undefined variables, ensuring that the code makes logical
sense.
4. Intermediate Code Generation: The compiler translates the parse tree into an
intermediate representation, which is easier to manipulate.
5. Code Optimization: The intermediate code is optimized for performance by
eliminating unnecessary instructions or using efficient algorithms.
6. Code Generation: Finally, the optimized intermediate code is converted into
machine code or executable code.
7. Code Optimization (again): Further optimization can be applied to enhance the
efficiency of the generated code.

2. Define an algorithm. Discuss the importance of algorithm representation. (5M)

An algorithm is a well-defined sequence of steps or instructions designed to perform
a specific task or solve a particular problem. Algorithms can be represented in
various forms, such as natural language, pseudocode, flowcharts, or programming
code. The representation of an algorithm is crucial because:
1. Clarity: It provides a clear understanding of the problem-solving process,
making it easier for developers to follow and implement.

TEJA KOTAMRAJU Page 1

 2. Communication: A well-represented algorithm facilitates communication
among team members and stakeholders, ensuring everyone understand the
solution approach.
3. Implementation: It serves as a blueprint for coding, helping programmers to
translate the logic into actual code more easily.
4. Analysis: Representation allows for the analysis of the algorithm’s efficiency in
terms of time and space complexity, helping in the selection of the best approach
for a given problem.

3. Write an algorithm to find the roots of a quadratic equation ax2+bx+c=0? (5M)

Alogrithm Def:
Steps:
See notes
Explanation: This algorithm uses the quadratic formula to find the roots based
on the discriminant, which helps determine whether the roots are real or
complex.

4. Provide pseudocode to find the minimum and maximum numbers in a given set
of integers. (5M)
Definition
The algorithm to find the minimum and maximum numbers in a given set of
integers involves iterating through the list of integers to compare each number. The
minimum and maximum values are updated based on comparisons as the algorithm
processes each element.
Pseudocode: Find Min and Max
FUNCTION FindMinMax(numbers: ARRAY OF INTEGER):
IF numbers is EMPTY THEN
RETURN "Array is empty"

SET min = numbers[0] // Initialize min to the first element

SET max = numbers[0] // Initialize max to the first element

TEJA KOTAMRAJU Page 2

 FOR EACH number IN numbers DO:
IF number < min THEN
min = number // Update min if current number is smaller
ENDIF

IF number > max THEN

max = number // Update max if current number is larger
ENDIF
ENDFOR

RETURN (min, max) // Return the minimum and maximum values

END FUNCTION

Example Usage

1. Input: A set of integers: {5, 3, 8, 1, 4}

2. Output:
 Minimum: 1
 Maximum: 8

Explanation of the Pseudocode Steps:

1. Function Declaration: Define a function FindMinMax that takes an array of

integers as input.
2. Check for Empty Array: If the array is empty, return a message indicating that
the array is empty.
3. Initialization: Set both min and max to the first element of the array.
4. Iterate through Array: Use a loop to go through each integer in the array.
 Compare the current number with min and update min if the current
number is smaller.
 Compare the current number with max and update max if the current
number is larger.
5. Return Values: After the loop finishes, return the minimum and maximum
values found.

TEJA KOTAMRAJU Page 3

This algorithm efficiently finds the minimum and maximum values in a single pass
through the array, resulting in a time complexity of O(n), where n is the number of
elements in the array.

5. Differentiate between syntax errors and logical errors in C programming.

Provide examples for each. (5M)
 Syntax Errors: These occur when the code violates the grammatical rules of the
programming language, preventing the program from compiling.
For example:
int main( { // Syntax error: missing closing parenthesis
printf("Hello, World!");
}

 Logical Errors: These errors occur when the program runs without crashing but
produces incorrect results due to a mistake in the logic of the code. For example:
int main() {
int a = 10, b = 5;
printf("The sum is: %d", a - b); // Logical error: should be a + b
}

Explanation: Understanding the difference is important for debugging. Syntax errors

are usually caught by the compiler, while logical errors require careful inspection of the
code logic.

6. Describe the different storage classes in C, specifically auto, extern, static, and
register. (5M)
 auto: This is the default storage class for local variables. These variables are
created when the block is entered and destroyed when it is exited. They are not
accessible outside their block.
 extern: This storage class is used to declare a variable that is defined in another
file or function. It allows the use of the same variable across multiple files,
facilitating global access.

TEJA KOTAMRAJU Page 4

  static: A static variable retains its value between function calls. It is local to the
function where it is defined, but its value is preserved for the lifetime of the
program.
 register: This storage class requests the compiler to store the variable in a CPU
register instead of RAM for faster access. It is used for frequently accessed
variables, but the number of registers is limited.
Explanation: Understanding storage classes helps in managing variable lifetimes and
scopes, which is crucial for effective memory management in C programming.

Section B: Programming Problems (40 Marks)

7. Write a C program to check if a number is prime. Include comments

explaining your code. (10M)

#include <stdio.h>
int main() {
int num, i, isPrime = 1; // Flag to check if the number is prime
printf("Enter a number: ");
scanf("%d", &num);

if (num <= 1) {
isPrime = 0; // Numbers less than 2 are not prime
} else {
for (i = 2; i <= num / 2; i++) { // Loop from 2 to num/2
if (num % i == 0) { // If num is divisible by i
isPrime = 0; // Not a prime number
break; // Exit loop
}
}
}

if (isPrime)
printf("%d is a prime number.\n", num);
else

TEJA KOTAMRAJU Page 5

 printf("%d is not a prime number.\n", num);

return 0;
}

Explanation: This program checks if a number is prime by attempting to divide it by all

integers up to half of its value. If any division results in a remainder of zero, it is not
prime. The use of a flag (isPrime) simplifies the decision-making process for output.

8. Demonstrate the use of bitwise operators in a C program. Provide examples of

AND, OR, XOR, and NOT operations. (10M)
Below is a C program that demonstrates the use of bitwise operators, including
AND (&), OR (|), XOR (^), and NOT (~). The program performs these operations on
two integers and displays the results.
#include <stdio.h>
int main() {
// Declare two integers
int a = 5; // Binary: 0101
int b = 3; // Binary: 0011

// Bitwise AND
int andResult = a & b; // 0101 & 0011 = 0001 (1 in decimal)
printf("Bitwise AND of %d and %d is: %d\n", a, b, andResult);

// Bitwise OR
int orResult = a | b; // 0101 | 0011 = 0111 (7 in decimal)
printf("Bitwise OR of %d and %d is: %d\n", a, b, orResult);

// Bitwise XOR
int xorResult = a ^ b; // 0101 ^ 0011 = 0110 (6 in decimal)
printf("Bitwise XOR of %d and %d is: %d\n", a, b, xorResult);

// Bitwise NOT
int notResultA = ~a; // ~0101 = 1010 (in 2's complement, this is -6)

TEJA KOTAMRAJU Page 6

 int notResultB = ~b; // ~0011 = 1100 (in 2's complement, this is -4)
printf("Bitwise NOT of %d is: %d\n", a, notResultA);
printf("Bitwise NOT of %d is: %d\n", b, notResultB);

return 0;
}
Explanation of Bitwise Operations
1. Bitwise AND (&):
See notes definition, truth table and example
2. Bitwise OR (|):
See notes definition, truth table and example
3. Bitwise XOR (^):
See notes definition, truth table and example
4. Bitwise NOT (~):
See notes definition, truth table and example

Program Output
When you run the program, the output will be:
Bitwise AND of 5 and 3 is: 1
Bitwise OR of 5 and 3 is: 7
Bitwise XOR of 5 and 3 is: 6
Bitwise NOT of 5 is: -6
Bitwise NOT of 3 is: -4

9. Write a C program that accepts command-line arguments to calculate the sum

of integers provided as arguments.
C program that accepts command-line arguments to calculate the sum of integers
provided as arguments. The program will convert the command-line arguments from
strings to integers and then sum them up.
#include <stdio.h>
#include <stdlib.h> // For atoi()

int main(int argc, char *argv[]) {

int sum = 0;

TEJA KOTAMRAJU Page 7

 // Check if the number of arguments is greater than 1
if (argc < 2) {
printf("No integers provided. Please provide integers as command-line
arguments.\n");
return 1; // Exit with error code
}

// Iterate through the command-line arguments

for (int i = 1; i < argc; i++) {
// Convert each argument to an integer and add to the sum
sum += atoi(argv[i]);
}

// Print the total sum

printf("The sum of the provided integers is: %d\n", sum);

return 0; // Exit successfully

}

Explanation of the Program

1. Header Files:
 #include <stdio.h>: Includes standard input-output functions.
 #include <stdlib.h>: Includes functions like atoi() for string to integer
conversion.
2. Main Function:
 int main(int argc, char *argv[]): The main function accepts command-
line arguments where argc is the count of arguments and argv is an array
of argument strings.
3. Check for Arguments:
 The program checks if the number of arguments (argc) is less than 2 (the
first argument is the program name). If true, it prints a message and exits.
4. Calculate Sum:
TEJA KOTAMRAJU Page 8
  A for loop iterates through each command-line argument starting from
index 1 (the first argument after the program name).
 atoi(argv[i]) converts the string argument to an integer, and this value is
added to the sum.
5. Print Result:
 Finally, the program prints the calculated sum of the integers.

How to Compile and Run

1. Compile the Program:

gcc -o sum_integers sum_integers.c

2. Run the Program with Command-Line Arguments:

./sum_integers 5 10 15
Example Output
When you run the program with the arguments 5, 10, and 15, the output will be:
The sum of the provided integers is: 30

10. Create a flowchart for a program that finds the maximum number in a set of
integers. Explain each step in the flowchart.

See notes definition, diagram and example

Section C: Long Answer Questions (30 Marks)

11. Explain structured programming in C. Discuss its advantages and provide a C

program that exemplifies structured programming principles?(15m)
Structured Programming in C
Structured programming is a programming paradigm that emphasizes the use of
clear, linear flow of control through the use of structured control flow constructs such
as sequences, selections, and iterations. It promotes the use of functions to encapsulate
logic, making programs easier to understand, maintain, and debug. The key concepts of
structured programming include:

TEJA KOTAMRAJU Page 9

 1. Modularity: The program is divided into smaller, manageable pieces or
functions, each performing a specific task.
2. Control Structures: Utilizes structured control constructs like if, for, and while
instead of unstructured jumps (e.g., goto statements).
3. Top-Down Design: Programs are designed starting from the highest-level
functions down to the lower-level functions.
4. Data Abstraction: Promotes the use of data types and structures to manage and
manipulate data effectively.

Advantages of Structured Programming

1. Improved Readability: The use of functions and control structures makes code
easier to read and understand.
2. Ease of Maintenance: Code changes can be made in specific functions without
affecting the entire program, simplifying debugging and updates.
3. Reusability: Functions can be reused in different programs, reducing
redundancy.
4. Enhanced Collaboration: Multiple programmers can work on different
functions simultaneously, improving team productivity.
5. Clearer Logic Flow: The structured approach helps in visualizing the program's
logic flow, making it easier to trace the execution path.

Example of Structured Programming in C

Below is an example C program that demonstrates structured programming principles
by calculating the factorial of a number using functions.

#include <stdio.h>

// Function to calculate factorial

int factorial(int n) {
if (n == 0) // Base case
return 1;
else
return n * factorial(n - 1); // Recursive call
}

TEJA KOTAMRAJU Page 10

// Function to get user input
int getUserInput() {
int num;
printf("Enter a non-negative integer: ");
scanf("%d", &num);
return num;
}

// Function to display the result

void displayResult(int num, int fact) {
printf("The factorial of %d is %d\n", num, fact);
}

// Main function
int main() {
int number = getUserInput(); // Get user input
if (number < 0) {
printf("Factorial is not defined for negative numbers.\n");
} else {
int result = factorial(number); // Calculate factorial
displayResult(number, result); // Display the result
}
return 0; // Exit the program
}

Explanation of the Program

1. Function factorial(int n):
 This function calculates the factorial of a number using recursion. If the
input number is 0, it returns 1 (base case). Otherwise, it calls itself with
n-1 until it reaches 0.
2. Function getUserInput():
 Prompts the user to enter a non-negative integer and returns the input
value.

TEJA KOTAMRAJU Page 11

 3. Function displayResult(int num, int fact):
 Takes the original number and its factorial as parameters and prints the
result to the console.
4. Main Function:
 Calls getUserInput() to read the number.
 Checks if the input is negative. If so, it displays an error message.
 If the input is valid, it calls factorial() to compute the factorial and then
displayResult() to print it.

12. Discuss operators and their precedence in C. Provide examples for different
types of operators and demonstrate expression evaluation.
Operators in C?(15m)

Operators in C are special symbols that perform operations on variables and values.
They can be classified into several categories based on their functionality. Here’s a
detailed discussion of different types of operators in C along with their precedence:

1. Arithmetic Operators

These operators perform basic mathematical operations.

Operator Description Example

+ Addition a+b

- Subtraction a-b

* Multiplication a*b

/ Division a/b

% Modulus a%b

TEJA KOTAMRAJU Page 12

2. Relational Operators

These operators compare two values and return a boolean result.

Operator Description Example

== Equal to a == b

!= Not equal to a != b

> Greater than a>b

< Less than a<b

>= Greater than or equal a >= b

<= Less than or equal a <= b

3. Logical Operators

These operators are used to combine conditional statements.

Operator Description Example

&& Logical AND a && b

` `

! Logical NOT !a

4. Bitwise Operators

These operators perform operations on binary representations of integers.

Operator Description Example

& Bitwise AND a&b

` ` Bitwise OR

^ Bitwise XOR a^b

~ Bitwise NOT ~a

TEJA KOTAMRAJU Page 13

 Operator Description Example

<< Left shift a << 2

>> Right shift a >> 2

5. Assignment Operators

These operators are used to assign values to variables.

Operator Description Example

= Simple assignment a=b

+= Add and assign a += b

-= Subtract and assign a -= b

*= Multiply and assign a *= b

/= Divide and assign a /= b

%= Modulus and assign a %= b

6. Unary Operators

These operators operate on a single operand.

Operator Description Example

++ Increment ++a or a++

-- Decrement --a or a--

- Unary minus -a

+ Unary plus +a

TEJA KOTAMRAJU Page 14

Operator Precedence

Operator precedence determines the order in which operators are evaluated in

expressions. The following table outlines the precedence of operators in C (from highest
to lowest):

Precedence Operators Associativity

1 () (Function call) Left to Right

2 ++, --, - (Unary), !, ~ Right to Left

3 *, /, % Left to Right

4 +, - Left to Right

5 <<, >> Left to Right

6 <, <=, >, >= Left to Right

7 ==, != Left to Right

8 & Left to Right

9 ^ Left to Right

10 ` `

11 && Left to Right

12 `

13 ?: (Ternary) Right to Left

14 = (Assignment) Right to Left

15 +=, -=, *=, /=, %= Right to Left

16 , (Comma) Left to Right

TEJA KOTAMRAJU Page 15

Expression Evaluation Example

Let's consider an example to demonstrate the evaluation of expressions with different

operators and their precedence.

#include <stdio.h>

int main() {

int a = 5, b = 10, c = 15;

int result;

// Example expression

result = a + b * c - a / 5 + (c % b) * (a + b);

printf("Result: %d\n", result);

return 0;

Expression Breakdown

 The expression evaluated is: result = a + b * c - a / 5 + (c % b) * (a + b);

Following the operator precedence:

1. Multiplication and Division:

 b * c → 10 * 15 = 150

 a/5→5/5=1
 c % b → 15 % 10 = 5
 (a + b) → 5 + 10 = 15
 5 * 15 = 75
2. Addition and Subtraction:
 a + 150 - 1 + 75

 5 + 150 = 155
 155 - 1 = 154
 154 + 75 = 229

TEJA KOTAMRAJU Page 16

Therefore, the output of the program will be:

Result: 229

TEJA KOTAMRAJU Page 17