InstaQB

Home
Institutions
- Institutions
  
  Polytechnic Colleges
  
  Medical Colleges
  
  Arts & Science Colleges
  
  Universities
  
  Engineering Colleges
  
  Agricultural Colleges
  
  Research Institute
  
  Law Colleges
  
  Audiology and Speech Colleges
  
  Business & Management colleges
  
  Nursing colleges
  
  Hotel Management institutes
  
  Aeronautical Colleges
  
  Bachelor's Degree
Syllabus
Courses
Stateboard
- 12th Standard English Medium
  
  Maths
  
  Physics
  
  Chemistry
  
  Biology
  
  Computer Science
  
  Business Maths
  
  Economics
  
  Commerce
  
  Accountancy
  
  History
  
  Computer Applications
  
  Computer Technology
  12th Standard Tamil Medium
  
  உயிரியல்
  
  கணினி பயன்பாடுகள்
  
  கணினி அறிவியல்
  
  வணிகக் கணிதம்
  
  வணிகவியல்
  
  பொருளியல்
  
  கணிதவியல்
  
  வேதியியல்
  
  இயற்பியல்
  
  கணினி தொழில்நுட்பம்
  
  வரலாறு
  
  கணக்குப்பதிவியல்
  11th Standard English Medium
  
  Maths
  
  Commerce
  
  Economics
  
  Biology
  
  Business Maths
  
  Accountancy
  
  Computer Science
  
  Physics
  
  Chemistry
  
  Computer Applications
  
  History
  
  Computer Technology
  
  Bio - Zoology
  11th Standard Tamil Medium
  
  கணிதவியல்
  
  உயிரியல்
  
  பொருளியல்
  
  இயற்பியல்
  
  வேதியியல்
  
  வணிகக் கணிதம்
  
  கணினி அறிவியல்
  
  கணக்குப்பதிவியல்
  
  வணிகவியல்
  
  கணினி பயன்பாடுகள்
  10th Standard English Medium
  
  Mathematics
  
  Science
  
  Social Science
  
  9th Standard English Medium
  
  Mathematics
  
  Science
  
  Social Science
  
  8th Standard English Medium
  
  Mathematics
  
  Science
  
  Social Science
  7th Standard English Medium
  
  Mathematics
  
  Science
  
  Social Science
ICSE/ISC
- Class XII
  
  Mathematics
  
  Physics
  
  Accountancy
  
  Biology
  
  History
  
  Geography
  
  Psychology
  
  chemistry
  
  Economics
  
  Computer Science
  
  Political Science
  
  Business Studies
  Class XI
  
  Accountancy
  
  Chemistry
  
  Mathematics
  
  Biology
  
  Geography
  
  Physics
  
  History
CBSE
- 12Th Standard
  
  Physics
  
  Chemistry
  
  Maths
  
  Biology
  
  History
  
  Economics
  
  Commerce
  
  Geography
  
  Socialogy
  
  Business Studies
  
  Computer Science
  
  Biotechnology Class
  
  Political Science
  
  Home Science
  11Th Standard
  
  Physics
  
  Chemistry
  
  Maths
  
  Biology
  
  History
  
  Economics
  
  Commerce
  
  Socialogy
  
  Business Studies
  
  Geography
  
  Home Science
  
  Computer Science
  
  Biotechnology Class
  
  Political Science
  10Th Standard
  
  Physics
  
  Chemistry
  
  Biology
  
  Mathematics
  
  Economics
  
  Geography
  
  History & Civics
  
  Computer Application
  9Th Standard
  
  Physics
  
  Chemistry
  
  Biology
  
  mathematics
  
  Computer Application
  
  Economics
  
  Geography
  
  History & Civics

12th Computer Science Weekly Test - 4 ( Algorithmic Strategies )

St. Britto Hr. Sec. School - Madurai

12th Computer Science Weekly Test - 4 ( Algorithmic Strategies )-Aug 2020

Time : 1.00 Hours

Part - A

Multiple Choice Question - Answer All Question

_________is used to describe the lower bound of asymptotic function.

Big Alpha
Big Beta
BigO
Big Omega

A theoretical performance analysis of an algorithm is called________

Posteriori testing
Priori estimates
Algorithmic efficiency
Algorithmic testing

Linear search is also called

Sequential search
Quick search
Binary search
Selection search

Which characteristics of algorithm defined the operation involving division by zero?

Finiteness
Definiteness
Input
Correctness

The word comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Musa al Khowarizmi is called?

Flowchart
Flow
Algorithm
Syntax

Recursion used to calculate factorial of a given value n in algorithm is an example of________ component

Fixed part
Variable part
Operator part
Time part

In dynamic programming, the technique of storing the previously calculated values is called ?

Saving value property
Storing value property
Memoization
Mapping

Binary search also called

Sequential search
Half-interval search
Unordered search
Full-interval search

The amount of memory required to run an algorithm completion is known by

Efficiency of an algorithm
Performance analysis of an algorithm
Space complexity of an algorithm
Time complexity of an algorithm

Choose the incorrect pair from the following

Big O - Worst case
Big \(\Omega\)- First case
Big\(\mu\) - Best case
Big \(\alpha\) - Average case

Which of the following optimization technique used in dynamic algorithms.

Memorization
Composition
Specification
Decomposition

Which of the following is a finite set of instructions to accomplish a particular task?

Flowchart
Functions
Algorithm
Abstraction

Simple variables and constants used in an algorithm is an example of________ component.

Time part
Variable part
Factor part
Fixed part

Algorithm resembles a______ which can be implemented in any programming language.

Solution
Program
Pseudocode
Function

In which programming the solutions of overlapped sub-problems are combined in order to get the better solution?

Object oriented
Procedural
Dynamic
Modular

Efficiency of an algorithm is measured by________factors.

3
4
2
1

Which of the following component is defined as the total space required by variables, which sizes depends on the problem and its iteration?

Variable part
Time part
Fixed part
Efficiency part

Which of the following could be designed to get a solution of a given problem?

Program
Algorithm
Flowchart
Input/Output

Which of the following are the characteristics of an algorithm?

(i) Definiteness

(ii) Correctness

(iii) Effectiveness

i, ii
ii, iii
Only ii
i, ii and iii

From the following sorting algorithms which has the lowest worst case complexity?

Bubble sort
Quick sort
Merge sort
Selection sort

Which characteristics of an algorithm should be generic, independent of any programming language?

Independent
Portable
Feasibility
Unambiguous

Choose the correct typical algorithm from the following.

Input \(\rightarrow\) Output \(\rightarrow\) Process
Output \(\rightarrow\) Input \(\rightarrow\) Process
Process \(\rightarrow\) Input \(\rightarrow\) Output
Input \(\rightarrow\) Process \(\rightarrow\) Output

An algorithm that yields expected output for a valid input is called an

Algorithmic Solution
Algorithmic Structure
Algorithmic Strategy
Algorithmic Procedure

Which sorting techniques working by taking elements from the list one by one and inserting them in their correct position into a new sorted list?

Bubble
Selection
Merge
Insertion

________are languages that uses meaningful statements about time and space complexity?

Time and space trade
Asymptotic notations
Complexity notations
Algorithmic notations

The_________of an algorithm is defined as the number of computational resources used by the algorithm.

Simplicity
Efficiency
Feasibility
Potable

Choose the correct pair from the following

Big O - Best case
Big \(\Omega\) - Worst case
Big \(\circleddash \) - Average case
Big \(\mu\)- First case

Which of the following is not a stable sorting algorithm?

Insertion sort
Quick sort
Merge sort
Selection sort

Which sorting algorithm repeatedly selects the next smallest element and swaps in into the right place for every pass?

Bubble sort
Sequential sort
Selection sort
Heap sort

Which of the following is the reverse of Big O?

Big \(\Omega \)
Big μ
Big symbol
Big b

Comment

Add Comment

Tamilnadu Stateboardszs - Class