Scribd
Upload
2 views1 page

Problem Solving and Programming

This document outlines the examination structure for a B.E. degree in Computer Science and Engineering, specifically focusing on Problem Solving and Programming. It includes details on the duration, maximum marks, and the distribution of questions across three parts: A, B, and C, covering topics such as data types, algorithms, flowcharts, and various programming tasks. The exam assesses knowledge through both theoretical questions and practical programming assignments.

Uploaded by

Yogashree
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
2 views1 page

Problem Solving and Programming

This document outlines the examination structure for a B.E. degree in Computer Science and Engineering, specifically focusing on Problem Solving and Programming. It includes details on the duration, maximum marks, and the distribution of questions across three parts: A, B, and C, covering topics such as data types, algorithms, flowcharts, and various programming tasks. The exam assesses knowledge through both theoretical questions and practical programming assignments.

Uploaded by

Yogashree
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

Name of the Candidate: Reg. No.

:
22CS240
B.E. DEGREE– APRIL 2023 – EXAMINATIONS
BRANCH: COMPUTER SCIENCE AND ENGINEERING
PROBLEM SOLVING AND PROGRAMMING

Duration : 3Hours Maximum: 100 Marks


Answer All questions
PART – A (4 x 2.5=10) CO
A1. Classify the data types in C. CO1
A2. Draw the flowchart of decision making structure. CO1
A3. Write the types of loops to handle looping requirements. CO2
A4. Write the operators precedence and its order of evaluation. CO2

PART – B (6 x 5 =30)CO
B1. Write the role of an algorithm and flowchart in developing a program. CO1
B2. Illustrate the two simple ways to define constants in C with an example. CO1
B3. Construct a program to signify an infinite loop. CO2
B4. List the operators and expressions supported by C language. CO2
B5. List the advantages of storage classes. CO2
B6. Explain the difference between structure and arrays. CO4

PART – C (4 x 15=60)CO
C1. Implement the divide and conquer problem solving technique in search operation. CO3
(OR)
C2. Write a program to generate and print 'n' Fibonacci numbers, with and without using CO3
recursion.

C3. Develop a student portal using array of structures based on branch, year of study, CGPA and CO4
company placed, across the institution. Write a C program that will display the students who
got placed in a specific organization.
(OR)
C4. Write a program that will generate a file containing the list of organizations and their CO4
corresponding GST number, PAN number, mobile number and mail-id. Write the source code
using structures to determine the GST number of a specified organization based on the
mobile number.

C5. Write a program for the implementation of Tower of Hanoi algorithm using recursion. CO5
(OR)
C6. Write a C Program to print diagonal elements of a 3 * 3 matrix. CO5

C7. Implement a C program to compare two files and report mismatches (i.e. Find the line CO6
number and their position where those corrupted letter exists as well as total number of
corrupted letters).
(OR)
C8. Implement a C program to read and print all files from a Zip file. CO6

*******************

You might also like