Time and Work / Pipe and Cistern
Square, Cube, Indices & Surds
Geometry
Average
Miscellaneous
Number Series
Algebraic Expressions and Inequalities
LCM, HCF and Fraction
Probability
Simple Interest
Permutation and Combination
Alligation and Mixture
Ratio & Proportion
Compound Interest
Problem Based on Ages
Quantitative Aptitude
Simplification
Distance, Speed and Time
Number System
Profit, Loss & Discount
Mensuration
Simple & Compound Interest
Data Interpretation
Percentage

Socio-Eco-Political Environment of India
Books & Authors
Events/ Organisation/ Summits
Micro Finance & Economics
Awards & Honours
Foreign Trade
History of Banking & its Development
Current Banking
Banking Terminologies
Government Schemes
Banking Product & Services
Country and Capital
Sports & Games
Appointment/ Election/ Resignation
RBI & its Monetary Policies
Science & Technology
General Awareness
Current Affairs
Agriculture
Financial Awareness
Marketing

Reading Comprehension
Direct and Indirect Speech
Deriving conclusion from passages
Correct Usage of Preposition
Sentence Improvement
Homonyms
Sentence Completion
Para Jumbles
Active and Passive Voice
Synonyms & Antonyms
Passage Completion
One Word Substitution
Theme Detection
English Language
Synonyms
Vocabulary Test
Double Synonms
Antonyms
Cloze Test
Similar Substitution
Idioms and Phrases
Spotting the Errors
Spelling
English Language / Hindi Language

Fundamentals of Marketing, Product and Branding
Modern Marketing/ Marketing in Banking Industry
Logic Gates
Computer Awareness
Computer Fundamental/ Binary System/ OS
DBMS (Database management system)
Internet, Networking & Computer Abbreviations
Market Situation, Distribution, Promotion & Advertising
MS Office/ Commands & Shortcut Keys
Market Segmentation, Targeting & Positioning
Computer Architecture
Softwares/ Programming
Professional Knowledge (IT)
Data Structure Compiler

Data Structure Compiler

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 1. Two main measures for the efficiency of an algorithm are

Processor and memory

Complexity and capacity

Time and space

Data and space

None of these

Time and space

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 2. The time factor when determining the efficiency of algorithm is measured by

Counting microseconds

Counting the number of key operations

Counting the number of statements

Counting the kilobytes of algorithm

None of these

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 3. The space factor when determining the efficiency of algorithm is measured by

Counting the maximum memory needed by the algorithm

Counting the minimum memory needed by the algorithm

Counting the average memory needed by the algorithm

Counting the maximum disk space needed by the algorithm

None of these

Counting the maximum memory needed by the algorithm

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 4. Which of the following case does not exist in complexity theory

Best case

Worst case

Average case

Null case

None of these

Null case

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 5. The Worst case occur in linear search algorithm when

Item is somewhere in the middle of the array

Item is not in the array at all

Item is the last element in the array

Item is the last element in the array or is not there at all

None of these

Item is the last element in the array or is not there at all

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 6. The Average case occur in linear search algorithm

When Item is somewhere in the middle of the array

When Item is not in the array at all

When Item is the last element in the array

When Item is the last element in the array or is not there at all

None of these

When Item is somewhere in the middle of the array

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 7. The complexity of linear search algorithm is

{tex}O(n){/tex}

{tex}O(log ){/tex}

{tex}O(n^2){/tex}

{tex}O(n log n){/tex}

None of these

{tex}O(n){/tex}

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 8. The complexity of Binary search algorithm is

{tex}O(n){/tex}

{tex}O(log ){/tex}

{tex}O(n^2){/tex}

{tex}O(n log n){/tex}

None of these

{tex}O(logn){/tex}

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 9. The complexity of Bubble sort algorithm is

{tex}O(n){/tex}

{tex}O(log n){/tex}

{tex}O(n^2){/tex}

{tex}O(n log n){/tex}

None of these

{tex}O(n^2){/tex}

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 10. Each array declaration need not give, implicitly or explicitly, the information about

the name of array

the data type of array

the first data from the set to be stored

the index set of the array

None of these

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 11. If the sequence of operations - push(1), push(2), pop, push (1), push(2), pop, pop, pol , push(2), pop are preformed on a stack, the sequence of popped out values are ?

2, 2, 1, 1, 2

2, 2, 1, 2, 2

2, 1, 2, 2, 1

2, 1, 2, 2, 2

None of these

The elements are popped from the top of the stack.

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 12. A machine needs a minimum of 100 sec to sort 1000 names by quick sort. The minimum time needed to sort 100 names will be approximately ?

50.2 sec

6.7 sec

72.7 sec

11.2 sec

None of these

In the best case quick sort algorithm makes n log(n) comparisons so 1000 x log (1000) = 9000 comparisons, which takes 100 sec. To sort 100 names a minimum of 100 log (100) = 600 comparisons are needed . This takes 100 x 600/9000 = 6.7 sec.

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 13. The number of binary trees with 3 nodes which when traversed in post order gives the sequence A,B, C is ?

3

9

7

5

None of these

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 14. The average search time of hashing with linear probing will be less if the load factor ?

is far less than one

equals one

is far greater than one

All of the above

None of these

Load factor is the ratio number of records that are currently present and the total number of records that can be present. If the load factor is less free space will be more. This means probability of collision is less. So the search time will be less.

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 15. A binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is ?

{tex}log_2n{/tex}

{tex}n - 1{/tex}

{tex}n{/tex}

{tex}2^n{/tex}

None of these

It can be proved by induction that a binary tree with n leaf nodes will have total of {tex}2n - 1{/tex} nodes. So number of non-leaf nodes is {tex}(2n - 1)-n = n- 1{/tex}

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 16. As part of maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be ?

Bubble sort

Insertion sort

Selection sort

Heap sort

None of these

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 17. The way a card game player arranges his cards as he picks them up one by one, is an example of ?

bubble sort

selection sort

insertion sort

merge sort

None of these

He scans throught the rest of the cards and pick the one with least value and places it next to the point till which he has already sorted the cards

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 18. Linked lists are suitable for which of the following problems?

Insertion sort

Binary search

Radix sort

Polynomial manipulation

None of these

Through Linked list binary search can be performed efficiently.

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 19. The lexical analysis for a modern computer language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?

Finite state automata

Deterministic push down automata

Non-deterministic push down automata

Turing machine

None of these

Finite state automata.

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 20. In a compiler, keyboards of a language are recognized during

parsing of the program

the code generation

the lexical analysis of the program

data flow analysis

None of these

the lexical analysis of program.

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 21. Which data structure in a compiler is used for managing information about variables and their attributes?

Abstract syntax-tree

Symbol table

Semantic stack

Parser table

None of these

Symbol table is a data structure in a compiler. It was devised for the purpose that it can be used to manage information about variable and their attributes. Example Symbol table.

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 22. Some code optimizations are carried out on the intermediate code because

they enhance the portability of the compiler to other target processors

program analysis is more accurate on intermediate code than on machine code

the information from data flow analysis cannot be used for optimization

the information from the front end cannot be used for optimization

None of these

Code optimizations are generally carried out on intermediate code. This is done to convert the source code to the machine language of the target machine on the basis of back end tools. It enhances the portability of the compilers to the other target processors.

**Correct Marks**
1

**Incorrectly Marks**
-0.25

Q 23. Which of the following are true?

1. A programming language which does not permit global variables of any kind and has no nesting of procedures/ functions, but permits recursive can be implemented with static storage allocation

2. Multi-level access link (or display) arrangement is needed to arrange activation records only, if the programming language being implemented has nesting of procedures/functions.

3. Recursion in programming languages cannot be implemented with dynamic storage allocation

4. Nesting of procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records.

5. Programming languages which permit a function to return a function as its result cannot be implemented with a stack based storage allocation scheme for activation records

2 and 5

1, 3 and 4

1, 2 and 5

2, 3 and 5

None of these

**Statement 1 True:** A programming language which does not permit global variables of any kind has no nesting of procedures/fimctions, but permits recursion can be implemented with static storage allocation.**Statement 2 False:** It is not necessary to have nesting of procedures/function in the programming language being implemented when activation records are arranged using multi level access link.**Statement 3 True:** Recursion in programming language cannot be implemented with dynamic storage allocation.**Statement 4 :** False Nesting of procedures/fimctions and recursion can be implemented with a stack based allocation scheme for activation.**Statement 5 True:**The programming languages which permit a function to return a function as its result cannot be implemented with a stack based storage allocation scheme for activation records.

Your request has been placed successfully.