Scribd
Upload
99 views

8 Problem Solving Techniques March 2023

This document contains a practice exam for a Problem Solving Techniques course. It has 3 parts - Part A contains 4 multiple choice questions worth 2 marks each. Part B contains 4 short answer questions worth 5 marks each. Part C contains 4 long answer questions worth 8 marks each, with subquestions. The questions cover topics like algorithms, variables, data types, sorting, arrays, pointers, loops, and string functions.

Uploaded by

Meena Vinoth
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
99 views

8 Problem Solving Techniques March 2023

This document contains a practice exam for a Problem Solving Techniques course. It has 3 parts - Part A contains 4 multiple choice questions worth 2 marks each. Part B contains 4 short answer questions worth 5 marks each. Part C contains 4 long answer questions worth 8 marks each, with subquestions. The questions cover topics like algorithms, variables, data types, sorting, arrays, pointers, loops, and string functions.

Uploaded by

Meena Vinoth
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

l llilllfi lllil ffi illll rilri ilil illl NP - 314

I Semester B.C.A. Degree #*in"tion, MarchlApril 2023


(NEP) (F + R) QA21 - 22 and Onwards)
COMPUTER SCIENCE
Problem Solving Techniques

Time : 2lzl Hours Max. Marks :60

lnstruction : Answer any four questions


Q-;;;;'#
PART _ A

Answer any 4 questions. Each question carries 2 marks. (4x2=$)

1. What is an Algorithm ?

2. What is variable ? Give an example.


3. What are escape sequences ?
4. Find ihe prime factor af 72.
5. What is sorting ? Mention different sorting methods.
6. What is an array ? How it is initialised ?
PART -B
Answer any 4 questions. Each question carries 5 marks. (4x5=20)

7. Write an algorithm for,summation of set of numbers.


8. Explain asymptotic notations.
9. What is datatype ? Explain different datatypes with examples.
10. Write a program to find the factorial of a nurnber.

11. Mention any 5 string library functions.

12. Write an algorithm to perform binary search on the given set of elements.

P.T.O.
NP - 314 Illllfillliltffi ilfi ililtilil ilil

PART - C

Answer any 4 questions. Each question carries 8 marks. (4x8=32)

13. a) Explain loop control structures in C with general syntax. 6


b) What is the differ:ence between break and continue statements ? 2

14. a) Write the characteristics. of algorithm. 4


b) Explain formatted input and output statements. 4

15. a) Write an algorithm to generate the Fibonacci sequence. 5


b) What is pointers ? How to initialize pointer arrays ? 3

16. a) Write a C program to find GCD of 2 numbers. 4


b) Write an algorithm to cornpute a prime factors of an integer. 4

17_ a) Explain the algorithm to find the maxirnum element in a set. 4


b) Sort the following array using insertion sort. 4
43 75 21 3t 12

18. a) Write an algorithm to sort the set of elements using selection sort. 4
b) Explain keyword searching in text. 4

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy