The document contains a series of four tests for 12th-grade Computer Science students, each worth 25 marks. Each test includes multiple-choice questions, short answer questions, and longer essay-type questions covering various programming concepts such as subroutines, data types, scopes, algorithms, and more. The tests aim to assess students' understanding of fundamental computer science principles and programming practices.
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
0 ratings0% found this document useful (0 votes)
15 views4 pages
12th CS (EM) - Unit Test 1 - 4
The document contains a series of four tests for 12th-grade Computer Science students, each worth 25 marks. Each test includes multiple-choice questions, short answer questions, and longer essay-type questions covering various programming concepts such as subroutines, data types, scopes, algorithms, and more. The tests aim to assess students' understanding of fundamental computer science principles and programming practices.
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/ 4
TEST – 1
12th STD COMPUTER SCIENCE MARKS: 25
I. Choose the best answer: 5X1=5 1. The small sections of code that are used to perform a particular task is called (A) Subroutines (B) Files (C) Pseudo code (D) Modules 2. Which of the following is a distinct syntactic block? (A) Subroutines (B) Function (C) Definition (D) Modules 3. The functions which cause side effects to the arguments passed are called (A) Impure functions (B) Partial Functions (C) Dynamic Functions (D) Pure functions 4. Which of the following are mandatory to write the type annotations in the function definition? (A) { } (B) ( ) (C) [ ] (D) < > 5. The values which are passed to a function definition are called (A) Arguments (B) Subroutines (C) Function (D) Definition
II. Answer any 3 Questions: 3X2=6
1. What is a subroutine? 2. Differentiate interface and implementation. 3. Write the inference you get from X:=(78). 4. Define Function with respect to Programming language.
III. Answer any 3 Questions: 3X3=9
1. Mention the characteristics of Interface. 2. Why strlen is called pure function? 3. Differentiate pure and impure function. 4. What is the side effect of impure function? Give example.
IV. Answer any one of the following: 1X5=5
1. What are called Parameters and write a note on (i) Parameter without Type (ii) Parameter with Type 2. Explain with example Pure and impure functions.
Best Of Luck
J. Kavitha, B.Sc, B.Ed, M.C.A, M.Phil., Computer Instructor Gr-I, GHSS, S.S.KULAM – CBE. TEST – 2 12th STD COMPUTER SCIENCE MARKS: 25 I. Choose the best answer: 5X1=5 1. Which of the following allow to name the various parts of a multi-item object? (A) Tuples (B) Lists (C) Classes (D) quadrats 2. Which of the following is constructed by placing expressions within square brackets? (A) Tuples (B) Lists (C) Classes (D) quadrats 3. A sequence of immutable objects is called (A) Built in (B) List (C) Tuple (D) Derived data 4. The data type whose representation is unknown are called (A) Built in datatype (B) Derived datatype (C) Concrete datatype (D) Abstract datatype 5. Which of the following functions that build the abstract data type? (A) Constructors (B) Destructors (C) recursive (D) Nested
II. Answer any 3 Questions: 3X2=6
1. What is abstract data type? 2. Differentiate constructors and selectors. 3. What is a Pair? Give an example. 4. What is a Tuple? Give an example.
III. Answer the following Questions: 3X3=9
1. Differentiate Concrete data type and abstract data type. 2. Which strategy is used for program designing? Define that Strategy. 3. What are the different ways to access the elements of a list. Give example.
IV. Answer any one of the following: 1X5=5
1. How will you facilitate data abstraction. Explain it with suitable example. 2. What is a List? Why List can be called as Pairs. Explain with suitable example.
Best Of Luck
J. Kavitha, B.Sc, B.Ed, M.C.A, M.Phil., Computer Instructor Gr-I, GHSS, S.S.KULAM – CBE. TEST – 3 12th STD COMPUTER SCIENCE MARKS: 25 I. Choose the best answer: 5X1=5 1. Which of the following refers to the visibility of variables in one part of a program to another partof the same program. (A) Scope (B) Memory (C) Address (D) Accessibility 2. Which of the following is used in programming languages to map the variable and object? (A):: (B) := (C) = (D) == 3. Containers for mapping names of variables to objects is called (A) Scope (B) Mapping (C) Binding (D) Namespaces 4. The process of subdividing a computer program into separate sub-programs is called (A) Procedural Programming (B) Modular programming 5. The members that are accessible from within the class and are also available to its subclasses is called (A) Public members (B) Protected members (C) Secured members (D) Private members
II. Answer any 3 Questions: 3X2=6
1. What is a scope? 2. How Python represents the private and protected Access specifiers? 3. What do you mean by Namespaces? 4. What is Mapping?
III. Answer any 3 Questions: 3X3=9
1. Define Local scope with an example. 2. Define Enclosed scope with an example. 3. Define Global scope with an example. 4. Why access control is required?
IV. Answer any one of the following: 1X5=5
1. Write any five benefits in using modular programming. 2. Write any Five Characteristics of Modules.
Best Of Luck
J. Kavitha, B.Sc, B.Ed, M.C.A, M.Phil., Computer Instructor Gr-I, GHSS, S.S.KULAM – CBE. TEST – 4 12th STD COMPUTER SCIENCE MARKS: 25 I. Choose the best answer: 5X1=5 1. The word comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Musa al Khowarizmi is called? (A) Flowchart (B) Flow (C) Algorithm (D) Syntax 2. Two main measures for the efficiency of an algorithm are (A) Processor and memory (B) Complexity and capacity (C) Time and space (D) Data and space 3. Big Ω is the reverse of (A) Big O (B) Big θ (C) Big A (D) Big S 4. Binary search is also called as (A) Linear search (B) Sequential search (C) Random search (D) Half-interval search 5. In dynamic programming, the technique of storing the previously calculated values is called? (A) Saving value property (B) Storing value property (C) Memoization (D) Mapping
II. Answer any 3 Questions: 3X2=6
1. What is searching? Write its types. 2. What is Insertion sort? 3. What is Sorting? 4. What is an Algorithm?
III. Answer any 3 Questions: 3X3=9
1. Discuss about Algorithmic complexity and its types. 2. What are the factors that influence time and space complexity. 3. What do you understand by Dynamic programming? 4. Write a note on Asymptotic notation.
IV. Answer any one of the following: 1X5=5
1. Explain the characteristics of an algorithm. 2. What is Binary search? Discuss with example.
Best Of Luck