Scribd
Upload
6 views2 pages

30 Problem Solving Techniques May 2022

This document outlines the structure and content of the Semester B.A./B.Sc. Examination for Computer Science, specifically focusing on Problem Solving Techniques. It is divided into three parts, with Part A consisting of short answer questions, Part B requiring more detailed responses, and Part C involving complex problem-solving tasks. The examination covers topics such as algorithms, programming in C, data structures, and searching techniques.

Uploaded by

hypertaker04
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
6 views2 pages

30 Problem Solving Techniques May 2022

This document outlines the structure and content of the Semester B.A./B.Sc. Examination for Computer Science, specifically focusing on Problem Solving Techniques. It is divided into three parts, with Part A consisting of short answer questions, Part B requiring more detailed responses, and Part C involving complex problem-solving tasks. The examination covers topics such as algorithms, programming in C, data structures, and searching techniques.

Uploaded by

hypertaker04
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

Iiiltilll llilttil litil ilfl filtlfit NP - 115

!o
I Sernester B.A./B.Sc. Examination, May 2422
(NEP -2A21 -22 and Onwards)
COT\]!PUTER SCIENCE
Problem Solving Techniques
Time '. TYz frours Max. Marks : 60

tnstruction : Answet afiy four quesfions from each Part.

PART _ A

l. Answer any four questions. Each question carries two marks. (4x2=8)
1) What are the factors affectinE the analysis of algorithms ?

2) What are command line arguments ?

3) Differentiate between formatted and unformaited input.

4) What is the difference between '&' and 'x' operators in

5) Define sorting. Mention any two types of sorting.


6) Define hash selarch.

PART * B

ll. Answer any four questions. Each question carries five marks.
7) Explain the various qualitative aspects of a good algorithm.
8) Explain if...else with an example. i

9) Write a C prograrn to swap two integers using pointers.


10) What is an array ? How will you input the elements in a two dimensional
array ?
1 1) Write an algoi'ithnn to find the gcd of 'two inteqei's.

12) Explain about keyword searching in a text"

P.T.O.
NP - 115 I rfiililt ilil lil it!fl tfit llri ffit

PAFIT -C
lll. Answer any four questions. Each question carries eight marks. (4x8=32)
13) Explain the various asymptotic notations used to represent the running
time of algorithm. I
14) Write a C program to read a nurnber, reverse the number and check
whether it is a palindrome or not. 8
15) a) Explain switch statement with an example. 4
b) Differentiate between while and do...while loops. 4
16) a) Write an algorithm to check whether a number is prime or not. 4
bi Write an algorithm to find the square root of a number . 4
sort.
17) Expiain selection sofi and insertion I
i8) Explain binary search technique wiih an example. I

,t,

You might also like