Computer question paper, Exams of Computer science

A unit test for a Computer Science class on scopes and algorithms. The test includes fill in the blank questions, short answer questions, and detailed answer questions. Topics covered include variable scopes, mapping, modular programming, algorithms, sorting, access control, access modifiers, algorithmic solutions, time and space complexity, and asymptotic notation. The test is designed for a high school or secondary school level course and was administered at Trinity Matric HR Sec School in Coimbatore, India.

Typology: Exams

2021/2022

Available from 11/15/2022

A12003kash
A12003kash 🇮🇳

2 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
TRINITY MATRIC HR SEC
SCHOOL,
RAMANATHAPURAM,
COIMBATORE
-641045.
UNIT
TEST
NO
: 2
2022
-
2023
STD
XIl
A
MARKS:45
SUB:
COMPUTER
sCIENCE
PORTION:
Chapter
3&4
TIME
:1
Hr
DATE
:
28-07-2022
PART-A
I.Fill
in
the
Blanks
1.
of
the
same
program.
2.Among
the
global
,
enclosed
,
list
and
built-in_
3.
The
complexity
of
the linear search algorithm is
4.A
Theorectical
performance
analysis
of
an
algorithm
is
called
as
5.
(51-5)
refers
to
the
visibility
of
the
variables
in
one
part
of
the
program
to
another
part
is not a variable scope.
is
used
to
describe
the
lower
bound
of
asymptotic
function
PART-B
(6*2-12)
IAnswer
the
following
Questions
Very
Shortly:-
6.What
is a scope?
7.What is Mapping?
8.What is Modular Programming?
9.What is an Algorithm?
10.What is Sorting?
11.What
is
an
Algorithmic
Solution?
PART-C (6*3=18)
M.Answer
the following Questions Shortly:-
12.Why Access control is required?
13.Writea
note
on
Access
Modifiers
ofa
Class.
14. List the Characteristics
of
an Algorithm.
15.What are the factors that influence the time and space complexity?
16.Write
a
short
on
Asymptotic
notation.
17.Design
an
Algorithm
to
find
the
square
of
the
given
number
and
display
the
result.
PART-D
(2*5-10)
IV.Answer
all
the
Questions
in
Detail:
18.Explain
in
detail
about
the
Types
of
Scopes
for Variables
or
LEGB
rule
with
example
19.Explain
in
detail
about
the
Bubble
Sort
Algorithm
with
an
example.
*****
ALL
THE
BEST
******
1
pf2

Partial preview of the text

Download Computer question paper and more Exams Computer science in PDF only on Docsity!

TRINITY MATRIC HR SEC SCHOOL, RAMANATHAPURAM, COIMBATORE -641045.

UNIT TEST NO : 2 2022 -^2023

STD XIl A (^) MARKS: SUB: COMPUTERsCIENCE PORTION:Chapter 3&

TIME :1^ Hr DATE : 28-07-

PART-A I.Fill in (^) the Blanks

of the same program.

2.Among the global , enclosed , list and built-in_

3. The complexity of the linear search algorithm is

4.A Theorectical performance analysis of an algorithm is called as

(51-5) refers to the visibility of the variables in one part of the program to another part

is not a variable scope.

is used to describe the lower bound of asymptotic function

PART-B

IAnswer the following Questions Very Shortly:- (6*2-12)

6.What is a scope?

7.What is Mapping?

8.What is Modular Programming?

9.What is an Algorithm?

10.What is Sorting?

11.What is an Algorithmic Solution?

PART-C

M.Answer the following Questions Shortly:- (6*3=18)

12.Why Access control is required?

13.Writea note on Access Modifiers ofa Class.

14. List the Characteristics of an Algorithm.

15.What are the factors that influence the time and space complexity?

16.Write a short on Asymptotic notation.

17.Design an^ Algorithm^ to^ find^ the^ square^

of the given number^ and^ display the^ result.

PART-D

IV.Answer all the Questions in Detail: (2*5-10)

18.Explain in detail about the Types of Scopes for Variables or LEGB rule with example

19.Explain in^ detail^ about^ the^ Bubble^ Sort^ Algorithm^

with an example.

***** ALL THE BEST ******

TRINITY MATRIC HR SEC SCHOoL, RAMANATHAPURAM, COIMBATORE 641045.

UNIT TEST NO: 2 2022 2023

STD Xl AL

SUB: COMPUTERSCIENCE

PORTION:Chapter 3&

MARKS: 45 TIME :1 Hr DATE: 04-08-

PART-A

L.Fill in the blanks (5*1-5)

is the process of binding a variable name with an object. is the security technique that regulates who can use resources in a computing environment.

is an example of non object orirnted programming language.

are the two main measures for the efficiency of an algorithm.

5.Bubble sort is also called as Sort.

PART-B

I1.Answer the following Questions Very Shortly:- (6 2-12)

6.How Python represents the private and protected access specifiers? 7.What is meant by a Module? 8.Define Pseudo Code. 9.Who is an Algorist? 10.What is Searching?Write its types.

11.Write a note on Memoization

PART-C

IIILAnSwer the following Questions Shortly: (6*3=18)

12.How the changes inside the function can't affect the variable on the outside of the function in

unexpected ways?

13.Write a^ note^ on^ Module.

14.How will you ensure the principles of data encapsulation in object oriented programming?

15.What do you understand by Dynamic Programming.

16.List the manipulation manipulated effectively through data structures by algorithm.

17.Write the different factors in which the time efficieney ofan algorithm is measured.

PART-D

IV.Answer all the Questions in Detail :- (2*5-10)

18. Write about the Charecteristics and Benefits of using a Modular Programming

  1. Write in detail about the Binary Search Algorithm.

***** ALL THE BEST *k****