jainakshay781.files.wordpress.com · Web view((MARKS)) (1/2/3...) 1 ((QUESTION)) Which of these truly defines Software design ? ((OPTION_A)) Software design is an activity subjected

((MARKS)) (1/2/3...)

1

((QUESTION))

Which of these truly defines Software design ?

((OPTION_A))

Software design is an activity subjected to constraints

((OPTION_B))

Software Design specifies nature and composition of software product

((OPTION_C))

Software Design satisfies client needs and desires

((OPTION_D))

All of the mentioned

((CORRECT_CHOICE)) (A/B/C/D)

D

((EXPLANATION)) (OPTIONAL)

Software design explains all of the statements as its definition

((MARKS)) (1/2/3...)

1

((QUESTION))

Modularity can be achieved using ?

((OPTION_A))

Encapsulation

((OPTION_B))

Interfaces

((OPTION_C))

Separate Compilation

((OPTION_D))

All of the mentioned


D


((MARKS)) (1/2/3...)

1

((QUESTION))

The basis of encapsulation is ----------------

((OPTION_A))

Class

((OPTION_B))

Object

((OPTION_C))

Member Function

((OPTION_D))

All of These


D


((MARKS)) (1/2/3...)

1

((QUESTION))

Encapsulation is describe by ----------------

((OPTION_A))

Algorithm

((OPTION_B))

Data Structure

((OPTION_C))

Specification and Implementation

((OPTION_D))

None of These


C


((MARKS)) (1/2/3...)

1

((QUESTION))

Which keyword is used to declare friend in C++

((OPTION_A))

Friend

((OPTION_B))

Friend_class

((OPTION_C))

Friend_method

((OPTION_D))

None of These


A


((MARKS)) (1/2/3...)

1

((QUESTION))

Generic data structure can be implemented using-------

((OPTION_A))

Function template

((OPTION_B))

class template

((OPTION_C))

File template

((OPTION_D))

Inheritance


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Is it possible to declare as friend

((OPTION_A))

Member function

((OPTION_B))

global function

((OPTION_C))

Class

((OPTION_D))

All of these


D


((MARKS)) (1/2/3...)

1

((QUESTION))

ADA support the creation of the generic unit by using the the keyword keyword ---------------

((OPTION_A))

templete

((OPTION_B))

General

((OPTION_C))

Generic

((OPTION_D))

None of these


C


((MARKS)) (1/2/3...)

1

((QUESTION))

Recursion works with the help of .......................data structure

((OPTION_A))

Array

((OPTION_B))

List

((OPTION_C))

Queue

((OPTION_D))

Stack


D


((MARKS)) (1/2/3...)

1

((QUESTION))

System Stack is part of…………...

((OPTION_A))

RAM

((OPTION_B))

ROM

((OPTION_C))

Hard disk

((OPTION_D))

Cache


A


((MARKS)) (1/2/3...)

1

((QUESTION))

When a function calls itself, it is known as……….

((OPTION_A))

Self Referential

((OPTION_B))

Recursion

((OPTION_C))

Repeated Call

((OPTION_D))

Loop


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Indirect recursion is also called as ……………………

((OPTION_A))

Mutual Recursion

((OPTION_B))

Redirect Recursion

((OPTION_C))

Tail Recursion

((OPTION_D))

None of the Above


A


((MARKS)) (1/2/3...)

1

((QUESTION))

Mutual recursion is also called as ……………………

((OPTION_A))

Indirect Recursion

((OPTION_B))

Redirect Recursion

((OPTION_C))

Tail Recursion

((OPTION_D))

None of the Above


A


((MARKS)) (1/2/3...)

1

((QUESTION))

A recursive function is said to be …………….recursive if there are no pending operations to be performed on return from a recursive call.

((OPTION_A))

End

((OPTION_B))

Tail

((OPTION_C))

Linear

((OPTION_D))

Binary


B


((MARKS)) (1/2/3...)

1

((QUESTION))

The simplest form of Recursion is …………………

((OPTION_A))

Linear Recursion

((OPTION_B))

Indirect Recursion

((OPTION_C))

Mutual Recursion

((OPTION_D))

Tail Recursion


A

((MARKS)) (1/2/3...)

2

((QUESTION))

Fac t (n )

Beg in

I f (n<=1) r e tu rn 1 ;

E l s e re tu rn n* fac t (n -1 )

End

((OPTION_A))

Function is example of Direct Recursion

((OPTION_B))

Function is example of Indirect Recursion

((OPTION_C))

Function is example of Mutual Recursion

((OPTION_D))

Both A and B


A


((MARKS)) (1/2/3...)

2

((QUESTION))

A stack frame in recursion consists of.................

((OPTION_A))

Parameters to be processed by the called function

((OPTION_B))

Local variables in the calling function

((OPTION_C))

The return address

((OPTION_D))

All above


D


((MARKS)) (1/2/3...)

1

((QUESTION))

In recursive call the return address of called function is stored

on .............

((OPTION_A))

Stack frame

((OPTION_B))

Queue

((OPTION_C))

Tree

((OPTION_D))

Cache


A


((MARKS)) (1/2/3...)

1

((QUESTION))

When recursive call is the last statement in the function, it is called………………….

((OPTION_A))

End recursion

((OPTION_B))

Tail Recursion

((OPTION_C))

Base Case

((OPTION_D))

Indirect Recursion


B


((MARKS)) (1/2/3...)

1

((QUESTION))

The following operation cannot be performed on stack without removing elements from it.

((OPTION_A))

Sorting

((OPTION_B))

Printing

((OPTION_C))

Traversal

((OPTION_D))

All above


D


((MARKS)) (1/2/3...)

1

((QUESTION))

The situation when in a linked implementation of stack

TOP=NULL is ............

((OPTION_A))

Underflow

((OPTION_B))

Overflow

((OPTION_C))

Houseful

((OPTION_D))

Saturated


A


((MARKS)) (1/2/3...)

1

((QUESTION))

The situation when in a linked implementation of stack, while

adding new element, memory allocation failure occurs it can be

considered as......

((OPTION_A))

Underflow

((OPTION_B))

Overflow

((OPTION_C))

Houseful

((OPTION_D))

Saturated


B


((MARKS)) (1/2/3...)

1

((QUESTION))


overflow occurs, we cannot perform..............

((OPTION_A))

PUSH operation

((OPTION_B))

POP operation

((OPTION_C))

Both A and B

((OPTION_D))

None of above


A


((MARKS)) (1/2/3...)

1

((QUESTION))


overflow occurs; it may be because of..............

((OPTION_A))

No space available in stack

((OPTION_B))

Memory Allocation Failure

((OPTION_C))

Both A and B

((OPTION_D))

None of above


B

((MARKS)) (1/2/3...)

2

((QUESTION))

A data structure whose size is determined at compile time and cannot be changed at run time is_________.

((OPTION_A))

ADT

((OPTION_B))

static

((OPTION_C))

ephemeral

((OPTION_D))

permanent


B


((MARKS)) (1/2/3...)

2

((QUESTION))

Data structure which is capable of expressing more complex relationship than that of physical adjacency is called______________.

((OPTION_A))

linked list

((OPTION_B))

non linear data structure

((OPTION_C))

data structure

((OPTION_D))

linear data structure


B


((MARKS)) (1/2/3...)

2

((QUESTION))

The correctness of a divide and conquer algorithm is usually proved by _________.

((OPTION_A))

mathematical theorem

((OPTION_B))

mathematical induction

((OPTION_C))

de-Morgan’s law

((OPTION_D))

none


B


((MARKS)) (1/2/3...)

2

((QUESTION))

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

((OPTION_A))

Abstract Data Type

((OPTION_B))

Semantic Stack

((OPTION_C))

Symbol Table

((OPTION_D))

Parse Table


C


((MARKS)) (1/2/3...)

2

((QUESTION))

The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is

((OPTION_A))

θ (n)

((OPTION_B))

θ (log n)

((OPTION_C))

θ (n.log n)

((OPTION_D))

θ (1)


A


((MARKS)) (1/2/3...)

2

((QUESTION))

The time complexity of an algorithm T(n), where n is the input size, is given by

T( n) = T( n - 1) + 1/n if n > 1The order of this algorithm is_____________.

((OPTION_A))

n

((OPTION_B))

log (n)

((OPTION_C))

n.n

((OPTION_D))

n.log (n)


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Given a function to compute on n inputs, the divide-and-conquer strategy consists of:

((OPTION_A))

Divide the problem into two or more smaller subproblems. That is splitting the inputs into k distinct subsets, 1 £ k £ n, yielding k sub-problems.

((OPTION_B))

Conquer the sub problems by solving them recursively.

((OPTION_C))

Combine the solutions to the sub problems into the solutions for the original problem.

((OPTION_D))

All of the above


D


((MARKS)) (1/2/3...)

1

((QUESTION))

Which one is true about divide-and-conquer strategy:

((OPTION_A))


((OPTION_B))

Select set of input from given input set

((OPTION_C))

To solve the problem takes a sequence of decision

((OPTION_D))

None


A


((MARKS)) (1/2/3...)

1

((QUESTION))

Which one is not true about divide-and-conquer strategy:

((OPTION_A))


((OPTION_B))

Select set of input from given input set

((OPTION_C))

To solve the problem divides input into two parts

((OPTION_D))

None


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Which of the following is not method by which we can solvethe recurrence relation

((OPTION_A))

Substitution Method

((OPTION_B))

Change of Variable

((OPTION_C))

Characteristic Equation

((OPTION_D))

None


D


((MARKS)) (1/2/3...)

1

((QUESTION))

Substitution method is used for

((OPTION_A))

For solving recurrence relation

((OPTION_B))

Algorithmic Design Strategy

((OPTION_C))

Both A & B

((OPTION_D))

Neither A or B


A


((MARKS)) (1/2/3...)

1

((QUESTION))

Characteristic equation is used for

((OPTION_A))


((OPTION_B))


((OPTION_C))

Both A & B

((OPTION_D))

Neither A or B


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Change of variablemethod is used for

((OPTION_A))


((OPTION_B))


((OPTION_C))

Both A & B

((OPTION_D))

Neither A or B


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Divide and Conquer method is

((OPTION_A))


((OPTION_B))

Used for solving recurrence relation

((OPTION_C))

Both A & B

((OPTION_D))

Neither A or B


A


((MARKS)) (1/2/3...)

1

((QUESTION))

Divide and Conquer method is

((OPTION_A))


((OPTION_B))


((OPTION_C))

Used to find out optimal solution to given problem

((OPTION_D))

Takes sequence of decision to find out the solution.


A


((MARKS)) (1/2/3...)

1

((QUESTION))

Divide and Conquer method is not

((OPTION_A))


((OPTION_B))


((OPTION_C))

Used to find out solution to given problem by dividing given problem into sub-problem or subtask

((OPTION_D))

Divides the problem and combine the solutions.


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Divide and Conquer method is not

((OPTION_A))


((OPTION_B))


((OPTION_C))

Both A & B

((OPTION_D))

Neither A nor B


A


((MARKS)) (1/2/3...)

1

((QUESTION))

Greedy method is

((OPTION_A))


((OPTION_B))


((OPTION_C))

Both A & B

((OPTION_D))

Neither A or B


A


((MARKS)) (1/2/3...)

1

((QUESTION))

Greedy method is not

((OPTION_A))


((OPTION_B))


((OPTION_C))


((OPTION_D))

Takes sequence of decision to find out the solution.


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Greedy method is

((OPTION_A))


((OPTION_B))


((OPTION_C))


((OPTION_D))

Divides the problem and combine the solutions.


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Greedy method is not

((OPTION_A))


((OPTION_B))


((OPTION_C))

Both A & B

((OPTION_D))

Neither A nor B


A


((MARKS)) (1/2/3...)

1

((QUESTION))

Which among these is false ?

((OPTION_A))

A process is collection of related tasks that transforms set of inputs to set of output

((OPTION_B))

A design notation is a symbolic representational system

((OPTION_C))

Software Design satisfies client needs and desiresA design heuristic is a rule proceeding guidance, with guarantee for achieving some end

((OPTION_D))

Software design method is orderly procedure for providing software design solutions


B


A heuristic is a rule followed but there is no guarantee that we get output

((MARKS)) (1/2/3...)

1

((QUESTION))

Which of these describes stepwise refinement ?

((OPTION_A))

Nicklaus Wirth described the first software engineering method as stepwise refinement

((OPTION_B))

Stepwise refinement follows its existence from 1971

((OPTION_C))

It is a Bottom-up approach

((OPTION_D))

a,b


D


it is top down approach and not bottom up.

((MARKS)) (1/2/3...)

1

((QUESTION))

What is incorrect about structural design ?

((OPTION_A))

Structural design introduced notations and heuristics

((OPTION_B))

Structural design emphasis on procedural decomposition

((OPTION_C))

The advantage is data flow representation

((OPTION_D))

It follows Structure chart


C


The biggest drawback or problem is data flow diagram of structure design.

((MARKS)) (1/2/3...)

1

((QUESTION))

What is solution for Structural design ?

((OPTION_A))

The specification model following data flow diagram

((OPTION_B))

Procedures represented as bubbles

((OPTION_C))

Specification model is structure chart showing procedure calling hierarchy and flow of data in and out of procedures

((OPTION_D))

Emphasizing procedural decomposition


C


It is solution to central problem. Rest others are problems.

((MARKS)) (1/2/3...)

1

((QUESTION))

Which of these are followed by latest versions of structural

((OPTION_A))

More detailed and flexible processes

((OPTION_B))

Regular Notations

((OPTION_C))

Wide support by CASE(Computer Aided Software Engineering)

((OPTION_D))

a,c


D


Notations used are more specialized and sophisticated one

((MARKS)) (1/2/3...)

1

((QUESTION))

The incorrect method for structural design is?

((OPTION_A))

Transition of problem models to solution models

((OPTION_B))

Handling of larger and more complex products

((OPTION_C))

Designing Object oriented systems

((OPTION_D))

More procedural approach


B


It does not account for larger and complex products.

((MARKS)) (1/2/3...)

1

((QUESTION))

What are followed by design task?

((OPTION_A))

Choosing specific classes, operations

((OPTION_B))

Checking model’s completeness

((OPTION_C))

Following design task heuristics

((OPTION_D))

a, b,c


D


All of these tasks are followed by design task

((MARKS)) (1/2/3...)

1

((QUESTION))

Which of these analysis are not acceptable ?

((OPTION_A))

Object oriented design is far better approach compared to structural design

((OPTION_B))

Object oriented design always dominates structural design

((OPTION_C))

Object oriented design are given more preference than structural design

((OPTION_D))

Object oriented uses more specific notations


B


Though object oriented design is considered far better approach but it never dominates structural approach.

((MARKS)) (1/2/3...)

1

((QUESTION))

Which these does not represent object oriented design ?

((OPTION_A))

It follows regular procedural decomposition in favor of class and object decomposition

((OPTION_B))

Programs are thought of collection of objects

((OPTION_C))

Central model represents class diagrams that show the classes comprising a program and their relationships to one another

((OPTION_D))

Object-oriented methods incorporates Structural methods


A


It does not follow regular procedural decomposition.

((MARKS)) (1/2/3...)

1

((QUESTION))

The most important feature of spiral model is

((OPTION_A))

requirement analysis

((OPTION_B))

risk management

((OPTION_C))

quality management

((OPTION_D))

configuration management


B


((MARKS)) (1/2/3...)

1

((QUESTION))

The worst type of coupling is

((OPTION_A))

Data coupling.

((OPTION_B))

control coupling

((OPTION_C))

stamp coupling

((OPTION_D))

content coupling


D


((MARKS)) (1/2/3...)

1

((QUESTION))

IEEE 830-1993 is a IEEE recommended standard for

((OPTION_A))

Software requirement specification

((OPTION_B))

Software design.

((OPTION_C))

Testing.

((OPTION_D))

Both(A)and (B)


A


((MARKS)) (1/2/3...)

1

((QUESTION))

One of the fault base testing techniques is

((OPTION_A))

unit testing

((OPTION_B))

beta testing

((OPTION_C))

Stress testing.

((OPTION_D))

mutation testing


D


((MARKS)) (1/2/3...)

1

((QUESTION))

Changes made to an information system to add thedesired but

required features is called

((OPTION_A))

Preventative maintenance.

((OPTION_B))

Adaptive maintenance

((OPTION_C))

Corrective maintenance

((OPTION_D))

Perfective maintenance.


D


((MARKS)) (1/2/3...)

1

((QUESTION))

All the modules of the system are integrated and tested as

case of

((OPTION_A))

Bottom up testing .

((OPTION_B))

Top-down testing

((OPTION_C))

Sandwich testing

((OPTION_D))

Big-Bang testing.


D


((MARKS)) (1/2/3...)

1

((QUESTION))

If every requirement stated in the Software Requirement

only one interpretation, SRS is said to be

((OPTION_A))

correct

((OPTION_B))

unambiguous.

((OPTION_C))

Consistent

((OPTION_D))

verifiable.


B


((MARKS)) 1

(1/2/3...)

((QUESTION))

A fault simulation testing technique is

((OPTION_A))

Mutation testing

((OPTION_B))

Stress testing

((OPTION_C))

Black box testing

((OPTION_D))

White box testing


A


((MARKS)) (1/2/3...)

1

((QUESTION))

If the objects focus on the problem domain, then we are

((OPTION_A))

Object Oriented Analysis

((OPTION_B))

Object Oriented Design

((OPTION_C))

Object Oriented Analysis & Design

((OPTION_D))

None of the above


A


((MARKS)) (1/2/3...)

1

((QUESTION))

The model in which the requirements are implemented by

((OPTION_A))

Evolutionary Development Model

((OPTION_B))

Waterfall Model

((OPTION_C))

Prototyping

((OPTION_D))

Iterative Enhancement Model concerned wit


A


((MARKS)) (1/2/3...)

1

((QUESTION))

SRD stands for

((OPTION_A))

Software requirements definition

((OPTION_B))

Structured requirements definition

((OPTION_C))

Software requirements diagram

((OPTION_D))

Structured requirements


B


((MARKS)) (1/2/3...)

1

((QUESTION))

A COCOMO model is

((OPTION_A))

Common Cost Estimation Model.

((OPTION_B))

Constructive Cost Estimation Model.

((OPTION_C))

Complete Cost Estimation Model

((OPTION_D))

Comprehensive Cost Estimation Model.



((MARKS)) (1/2/3...)

1

((QUESTION))

The desired level of coupling is

((OPTION_A))

No coupling

((OPTION_B))

Control coupling

((OPTION_C))

Common coupling

((OPTION_D))

Data coupling


D


((MARKS)) (1/2/3...)

1

((QUESTION))

The feature of the object oriented paradigm which helps code

((OPTION_A))

object

((OPTION_B))

class

((OPTION_C))

inheritance.

((OPTION_D))

aggregation


C


((MARKS)) (1/2/3...)

1

((QUESTION))

The level at which the software uses scarce resources is

((OPTION_A))

reliability

((OPTION_B))

efficiency

((OPTION_C))

portability

((OPTION_D))

all of the above


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Modifying the software to match changes in the ever changing

((OPTION_A))

adaptive maintenance

((OPTION_B))

corrective maintenance

((OPTION_C))

perfective maintenance

((OPTION_D))

preventive maintenance


A


((MARKS)) (1/2/3...)

1

((QUESTION))

All activities lying on critical path have slack time equal to

((OPTION_A))

0

((OPTION_B))

1

((OPTION_C))

2

((OPTION_D))

None of above


A


((MARKS)) (1/2/3...)

1

((QUESTION))

An object encapsulates

((OPTION_A))

Data

((OPTION_B))

Behaviour

((OPTION_C))

State

((OPTION_D))

Both Data and behaviour


D


((MARKS)) (1/2/3...)

1

((QUESTION))

In function point analysis, number of general system

system are

((OPTION_A))

10

((OPTION_B))

14

((OPTION_C))

20

((OPTION_D))

12


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Aggregation represents

((OPTION_A))

is_a relationship

((OPTION_B))

part_of relationship

((OPTION_C))

composed_of relationship

((OPTION_D))

none of above


C


((MARKS)) (1/2/3...)

1

((QUESTION))

ER model shows the

((OPTION_A))

Static view

((OPTION_B))

Functional view

((OPTION_C))

Dynamic view

((OPTION_D))

All the above


A


((MARKS)) (1/2/3...)

1

((QUESTION))

Changes made to the system to reduce the future system failure

((OPTION_A))

Preventive Maintenance

((OPTION_B))

Adaptive Maintenance

((OPTION_C))

Corrective Maintenance

((OPTION_D))

Perfective Maintenance


A


((MARKS)) (1/2/3...)

1

((QUESTION))

Requirements can be refined using

((OPTION_A))

The waterfall model

((OPTION_B))

prototyping model

((OPTION_C))

the evolutionary model

((OPTION_D))

the spiral model


B


((MARKS)) (1/2/3…)

1

((QUESTION)) In structured programming, the problem is divided into various ?

((OPTION_A)) modules

((OPTION_B)) Functions

((OPTION_C)) Structures

((OPTION_D)) objects

((CORRECT_CHOICE))(A/B/C/D)

B

((MARKS)) (1/2/3…)

1

((QUESTION)) Which of the following is not the member of class?

((OPTION_A)) Static function

((OPTION_B)) Virtual function

((OPTION_C)) Friend function

((OPTION_D)) Constant function


A

((MARKS)) (1/2/3…)

1

((QUESTION)) In Object-oriented programming, the problem is divided into :

((OPTION_A)) Classes

((OPTION_B)) Objects

((OPTION_C)) Functions

((OPTION_D)) Structures


A

((MARKS)) (1/2/3…)

1

((QUESTION)) The keyword friend does not appear in .

((OPTION_A)) The class allowing access to another class

((OPTION_B)) The class desiring access to another class

((OPTION_C)) The private section of a class

((OPTION_D)) The public section of a class


D

((MARKS)) (1/2/3…)

1

((QUESTION)) The term ___ means the ability to take many forms

((OPTION_A)) Inheritance

((OPTION_B)) Polymorphism

((OPTION_C)) Member function

((OPTION_D)) Encapsulation


B

((MARKS)) (1/2/3…)

1

((QUESTION)) Which of the following term is used for a function defined inside a class?

((OPTION_A)) Member variable

((OPTION_B)) Member function

((OPTION_C)) Class function

((OPTION_D)) Friend fcuntion


B

((MARKS)) (1/2/3…)

1

((QUESTION)) How many instances of an abstract class can be created?

((OPTION_A)) 1

((OPTION_B)) 5

((OPTION_C)) 13

((OPTION_D)) 0


D

((MARKS)) (1/2/3…)

1

((QUESTION)) Which of the following concept of oops allows compiler to insert arguments in a function call if it is not specified?

((OPTION_A)) Call by value

((OPTION_B)) Call by reference

((OPTION_C)) Default arguments

((OPTION_D)) Call by pointer


C

((MARKS)) (1/2/3…)

1

((QUESTION)) A variable defined within a block is visible

((OPTION_A)) From the point of definition onward in the program

((OPTION_B)) From the point of definition onward in the function

((OPTION_C)) From the point of definition onward in the block

((OPTION_D)) Throughout the function


B

((MARKS)) (1/2/3…)

1

((QUESTION)) A class is ____ datatype

((OPTION_A)) Primitive

((OPTION_B)) Derived

((OPTION_C)) User derived

((OPTION_D)) All above


C

((MARKS)) (1/2/3…)

1

((QUESTION)) An object is ......

((OPTION_A)) Variable of class data type

((OPTION_B)) Same as class

((OPTION_C)) Just like global variable

((OPTION_D)) Collection of data members and member functions


A

((MARKS)) (1/2/3…)

1

((QUESTION)) A __________ is a special method used to initialize the instance variable of a class.

((OPTION_A)) Member function

((OPTION_B)) Constructor

((OPTION_C)) Destructor

((OPTION_D)) Structure


B

((MARKS)) (1/2/3…)

1

((QUESTION)) Which of the following concepts means adding new components to a program as it runs

((OPTION_A)) Data hiding

((OPTION_B)) Dynamic binding

((OPTION_C)) Dynamic loading

((OPTION_D)) Type casting


C

((MARKS)) (1/2/3…)

1

((QUESTION)) Which of the following statement is correct?

((OPTION_A)) A constructor is called at the time of declaration of an object.

((OPTION_B)) A constructor is called at the time of use of an object.

((OPTION_C)) A constructor is called at the time of declaration of a class.

((OPTION_D)) A constructor is called at the time of use of a class.


A

((MARKS)) (1/2/3…)

1

((QUESTION)) What are cin and cout?

((OPTION_A)) Functions

((OPTION_B)) Operators

((OPTION_C)) Pointers

((OPTION_D)) Stream objects


D

((MARKS)) (1/2/3…)

1

((QUESTION)) Including only necessary details and ignoring additional details while defining a class is known as ____.

((OPTION_A)) Overloading

((OPTION_B)) Data abstraction

((OPTION_C)) Polymorphism



B

((MARKS)) (1/2/3…)

1

((QUESTION)) Preventing direct access of data-members of the class from outside world is known as ____.

((OPTION_A)) Polymorphism

((OPTION_B)) Data abstraction

((OPTION_C)) Data hiding



C

((MARKS)) (1/2/3…)

1

((QUESTION)) Creating a new class using one or more existing classes is known as ____.



((OPTION_C)) Encapsulation

((OPTION_D)) Inheritance


D

((MARKS)) (1/2/3…)

1

((QUESTION)) Ability of an operator or function call to take different forms is known as ____.



((OPTION_C)) Encapsulation

((OPTION_D)) Inheritance


B

((MARKS)) (1/2/3…)

1

((QUESTION)) A __________ is a special method used to initialize the instance variable of a class

((OPTION_A)) Member function

((OPTION_B)) Destructor

((OPTION_C)) Structure

((OPTION_D)) Constructor


D

((MARKS)) (1/2/3…)

1

((QUESTION)) Which of the following statement is correct?

((OPTION_A)) C++ allows static type checking

((OPTION_B)) C++ allows dynamic type checking.

((OPTION_C)) C++ allows static member function be of type const.

((OPTION_D)) Both A and B.


D

((MARKS)) (1/2/3…)

1

((QUESTION)) Which of the following header file includes definition of cin and cout?

((OPTION_A)) Iomanip.h

((OPTION_B)) Iostream.h

((OPTION_C)) Stream.h

((OPTION_D)) String.h


B

((MARKS)) (1/2/3…)

1

((QUESTION)) Which one of the following is correct about the statements given below? I: All function calls are resolved at compile-time in Procedure Oriented Programming. II: All function calls are resolved at compile-time in OOPS.

((OPTION_A)) I

((OPTION_B)) II

((OPTION_C)) ONLY II

((OPTION_D)) ONLY I


D

((MARKS)) (1/2/3…)

1

((QUESTION)) Which of the access specifier is used as a default in a class definition?

((OPTION_A)) Private

((OPTION_B)) Protected

((OPTION_C)) Public

((OPTION_D)) Friend


C

((MARKS)) (1/2/3…)

1

((QUESTION)) What is correct about the static data member of a class?

((OPTION_A)) A static member function can access only static data members of a class.

((OPTION_B)) A static data member is shared among all the object of the class

((OPTION_C)) A static data member can be accessed directly from main().

((OPTION_D)) Both A and B.


D

((MARKS)) (1/2/3…)

1

((QUESTION)) Which of the following concepts means waiting until runtime to determine which function to call?

((OPTION_A)) Data hiding

((OPTION_B)) Dynamic binding

((OPTION_C)) Dynamic casting

((OPTION_D)) Dynamic loading


B

((MARKS)) (1/2/3…)

1

((QUESTION)) Which of the following approach is adapted by C++?

((OPTION_A)) TOP-DOWN

((OPTION_B)) Bottom-up

((OPTION_C)) Right-left

((OPTION_D)) Left-right


B

((MARKS)) (1/2/3…)

1

((QUESTION)) Which of the following is used to make an abstract class?

((OPTION_A)) Declaring it abstract using static keyword

((OPTION_B)) Declaring it abstract using virtual keyword

((OPTION_C)) Making at least one member function as virtual function.

((OPTION_D)) Making at least one member function as pure virtual function


D

((MARKS)) (1/2/3…)

1

((QUESTION)) Which of the following concepts means wrapping up of data and functions together?

((OPTION_A)) Abstraction

((OPTION_B)) Encapsulation

((OPTION_C)) Inheritance

((OPTION_D)) Polymorphism


B

((MARKS)) (1/2/3...)

1

((QUESTION))

_______________ is the formal arrangement of jobs within an

((OPTION_A))

Departmentalization

((OPTION_B))

Organizational design

((OPTION_C))

Organizational structure

((OPTION_D))

Work specialization


C


((MARKS)) (1/2/3...)

1

((QUESTION))

Organizational design is based on decisions about

((OPTION_A))

work specialization and mechanisms

((OPTION_B))

chain of command and span of control

((OPTION_C))

centralization and matrices

((OPTION_D))

strategy and structure


C


((MARKS)) (1/2/3...)

1

((QUESTION))

The model that assumes that effort and development time are

size alone is____________. organization

((OPTION_A))

Basic COCOMO model (B) (C) (D)

((OPTION_B))

Intermediate COCOMO model

((OPTION_C))

Detailed COCOMO model

((OPTION_D))

All the three COCOMO models


A


((MARKS)) 1

(1/2/3...)

((QUESTION))

Arrays in C++ are

((OPTION_A))

Row Major

((OPTION_B))

Column Major

((OPTION_C))

Diagonal Major

((OPTION_D))

None of the above


A


((MARKS)) (1/2/3...)

1

((QUESTION))

Which among the following pairs of operations is Supported by an array ADT?

i) Store and retrieveii) Insert and deleteiii) Copy and deleteiv) Append and copy

((OPTION_A))

(i)

((OPTION_B))

(ii)

((OPTION_C))

(iii)

((OPTION_D))

(iv)


A


((MARKS)) (1/2/3...)

1

((QUESTION))

The number of elements in an array ARRAY[b1:u1,b2:u2] is given by

((OPTION_A))

(u1-b1-1)(u2-b2-1)

((OPTION_B))

(u1.u2)

((OPTION_C))

(u1-b1)(u2-b2)

((OPTION_D))

(u1-b1+1)(u2-b2+1)


D


((MARKS)) (1/2/3...)

1

((QUESTION))

A multi dimensional array OPEN[0:2,10:20,3:4,-10:2] contains ______ elements

((OPTION_A))

240

((OPTION_B))

858

((OPTION_C))

390

((OPTION_D))

160


B


((MARKS)) (1/2/3...)

1

((QUESTION))

For the array A[1:u1,1:u2,1:u3] where a the base address, the address of A[i,j,1] is given by

((OPTION_A))

a+(i-1) u2u3 + (j-1)u3

((OPTION_B))

a+i.u2u3+j.u3

((OPTION_C))

a+(i-1)u1u2+(j-1)u2

((OPTION_D))

a+i.u1u2+j.u2


A


((MARKS)) (1/2/3...)

1

((QUESTION))

____ is a structure used to represent the linear relationship between elements by means of sequential memory locations

((OPTION_A))

Linked List

((OPTION_B))

Array

((OPTION_C))

Pointer

((OPTION_D))

Stack


B


((MARKS)) (1/2/3...)

1

((QUESTION))

A ____ is a list of finite number of homogeneous data elements

((OPTION_A))

Linear array

((OPTION_B))

Pointer

((OPTION_C))

Linked List

((OPTION_D))

Tree


A


((MARKS)) (1/2/3...)

1

((QUESTION))

The number of elements n is called the length or ___ of the ar-ray

((OPTION_A))

Upper Bound

((OPTION_B))

Lower Bound

((OPTION_C))

Size

((OPTION_D))

Variable


C


((MARKS)) (1/2/3...)

1

((QUESTION))

The number K in A[K] is called the subscript or the _____

((OPTION_A))

Size

((OPTION_B))

Index

((OPTION_C))

Variable

((OPTION_D))

Constant


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Which of the following are not part of the array declaration ?

((OPTION_A))

Name of the array

((OPTION_B))

Data type of the array

((OPTION_C))

Index set of the array

((OPTION_D))

Length of the array


D


((MARKS)) (1/2/3...)

1

((QUESTION))

The process of accessing and processing each element of an ar-ray A exactly once is called _______

((OPTION_A))

Deleting

((OPTION_B))

Inserting

((OPTION_C))

Traversing

((OPTION_D))

Searching


C


((MARKS)) (1/2/3...)

1

((QUESTION))

Two dimensional arrays are sometimes called ______ arrays.

((OPTION_A))

Integer

((OPTION_B))

Boolean

((OPTION_C))

Matrix

((OPTION_D))

Real


C


((MARKS)) (1/2/3...)

1

((QUESTION))

Representation of a two dimensional array as one single column of rows and mapping it sequentially is called ____ representa-tion

((OPTION_A))

Row-Major

((OPTION_B))

Row

((OPTION_C))

Column-Major

((OPTION_D))

Column


A


((MARKS)) (1/2/3...)

1

((QUESTION))

Matrices with relatively high proportion of zero entries are called _____ matrices

((OPTION_A))

Triangular

((OPTION_B))

Diagonal

((OPTION_C))

Sparse

((OPTION_D))

Adjacency


C


((MARKS)) (1/2/3...)

1

((QUESTION))

_____arrays are where the elements in the different arrays with the same subscript belong to the same record.

((OPTION_A))

One dimensional

((OPTION_B))

Parallel

((OPTION_C))

Two-dimensional

((OPTION_D))

Static


B


((MARKS)) (1/2/3...)

1

((QUESTION))

A matrix in which nonzero entries can only occure on the diag-onal or on elements immediately above or below the diagonal is called ______ matrix.

((OPTION_A))

Triangular

((OPTION_B))

Tridiagonal

((OPTION_C))

Sparse

((OPTION_D))

Simple


C


((MARKS)) (1/2/3...)

1

((QUESTION))

Records can be stored in an area of memory called ____ memory

((OPTION_A))

Dynamic

((OPTION_B))

Static

((OPTION_C))

Simple

((OPTION_D))

Parallel


A


((MARKS)) (1/2/3...)

1

((QUESTION)) The memory address of the first element of an array is called

((OPTION_A)) floor address

((OPTION_B)) foundation address

((OPTION_C)) first address

((OPTION_D)) base address


D


((MARKS)) (1/2/3...)

1

((QUESTION)) Each array declaration need not give, implicitly or explicitly, the information about

((OPTION_A)) the name of array

((OPTION_B)) the data type of array

((OPTION_C)) the first data from the set to be stored

((OPTION_D)) the index set of the array


A


((MARKS)) (1/2/3...)

1

((QUESTION)) The elements of an array are stored successively in memory cells because

((OPTION_A)) by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

((OPTION_B)) architecture of computer memory does not allow arrays to store other than serially

((OPTION_C)) both of above

((OPTION_D)) none of above


A


((MARKS)) (1/2/3...)

1

((QUESTION)) The memory address of fifth element of an array can be cal-culated by the formula

((OPTION_A)) LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array

((OPTION_B)) LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array

((OPTION_C)) LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array

((OPTION_D)) None of above


A


((MARKS)) (1/2/3...)

1

((QUESTION)) Which of the following data structures are indexed struc-tures?

((OPTION_A)) linear arrays

((OPTION_B)) linked lists




A


((MARKS)) (1/2/3...)

1

((QUESTION)) Two dimensional arrays are also called

((OPTION_A)) tables arrays

((OPTION_B)) matrix arrays




C


((MARKS)) (1/2/3...)

1

((QUESTION)) A variable P is called pointer if

((OPTION_A)) P contains the address of an element in DATA.

((OPTION_B)) P points to the address of first element in DATA

((OPTION_C)) P can store only memory addresses

((OPTION_D)) P contain the DATA and the address of DATA


A


((MARKS)) (1/2/3...)

1

((QUESTION)) Which of the following data structure can't store the non-ho-mogeneous data elements?

((OPTION_A)) Arrays

((OPTION_B)) Records


((OPTION_D)) None


A


((MARKS)) (1/2/3...)

1

((QUESTION)) Which of the following data structure store the homoge-neous data elements?

((OPTION_A)) Arrays

((OPTION_B)) Records


((OPTION_D)) None


B


((MARKS)) (1/2/3...)

1

((QUESTION)) Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called

((OPTION_A)) elementary items

((OPTION_B)) atoms

((OPTION_C)) scalars

((OPTION_D)) all of above


D


((MARKS)) (1/2/3...)

1

((QUESTION)) The difference between linear array and a record is

((OPTION_A)) An array is suitable for homogeneous data but the data items in a record may have different data type

((OPTION_B)) In a record, there may not be a natural ordering in opposed to linear array.

((OPTION_C)) A record form a hierarchical structure but a linear array does not

((OPTION_D)) All of above


D


((MARKS)) (1/2/3...)

1

((QUESTION)) Each array declaration need not give, implicitly or explicitly, the information about

((OPTION_A)) The name of array

((OPTION_B)) The data type of array

((OPTION_C)) The first data from the set to be stored

((OPTION_D)) The index set of the array


C


((MARKS)) (1/2/3...)

1

((QUESTION)) The elements of an array are stored successively in memory cells because

((OPTION_A)) by this way computer can keep track only the address of the first element and the addresses of other elements can be cal-culated

((OPTION_B)) the architecture of computer memory does not allow arrays to store other than serially




A


((MARKS)) (1/2/3...)

1

((QUESTION)) Consider following code:#include<iostream.h>int main(){int a[10];A[0]=10; A[1]=4;A[3]=15;cout<<A[2+1];}What will be the output of following code?

((OPTION_A)) NULL

((OPTION_B)) 10

((OPTION_C)) 4

((OPTION_D)) 15


D


((MARKS)) (1/2/3...)

1

((QUESTION)) Which are the correct array initialization statements?

((OPTION_A)) int A[3]={1,2,3};

((OPTION_B)) int A[3]={123};

((OPTION_C)) int A[3]=”123”;

((OPTION_D)) All


A


((MARKS)) (1/2/3...)

1

((QUESTION)) Which of the following statements are wrong statements?

((OPTION_A)) Array is primitive data structure.

((OPTION_B)) Every element of array must be same.

((OPTION_C)) In array, Insert element is called push operation.

((OPTION_D)) All


A


((MARKS)) (1/2/3...)

1

((QUESTION)) Which are the applications of array?

((OPTION_A)) Sparse matrix

((OPTION_B)) Ordered list

((OPTION_C)) Both a & b

((OPTION_D)) none


C


((MARKS)) (1/2/3...)

1

((QUESTION)) Which among the following pairs of operations is supported by an array ADT?

((OPTION_A)) Store and Retrieve

((OPTION_B)) Insert and Delete

((OPTION_C)) Copy and Delete

((OPTION_D)) Append and Cop


A


((MARKS)) (1/2/3...)

1

((QUESTION)) The extra key inserted at the end of the array is called a,

((OPTION_A)) End key

((OPTION_B)) Stop key.

((OPTION_C)) Sentinel.

((OPTION_D)) Transposition


C


((MARKS)) (1/2/3...)

1

((QUESTION)) The largest element of an array index is called its

((OPTION_A)) lower bound.

((OPTION_B)) range

((OPTION_C)) upper bound.

((OPTION_D)) All of these.


C


((MARKS)) (1/2/3...)

2

((QUESTION)) What is the output of this C code?

#include <stdio.h> void main() {int a[2][3] = {1, 2, 3, 4, 5}; int i = 0, j = 0; for (i = 0; i < 2; i++) for (j = 0; j < 3; j++) printf("%d", a[i][j]); }

((OPTION_A)) 1 2 3 4 5 0

((OPTION_B)) 1 2 3 4 5 junk

((OPTION_C)) 1 2 3 4 5 5

((OPTION_D)) Run time error


A


((MARKS)) 1

(1/2/3...)

((QUESTION)) A mathematical-model with a collection of operations de-fined on that model is called

((OPTION_A)) Data Structure

((OPTION_B)) Abstract Data Type

((OPTION_C)) Primitive Data Type

((OPTION_D)) Algorithm


B


((MARKS)) (1/2/3...)

1

((QUESTION)) An ADT is defined to be a mathematical model of a user-de-fined type along with the collection of all ____________ op-erations on that model

((OPTION_A)) Cardinality

((OPTION_B)) Assignment

((OPTION_C)) Primitive

((OPTION_D)) Structured


C


((MARKS)) (1/2/3...)

1

((QUESTION)) Representation of data structure in memory is known as

((OPTION_A)) Recursive

((OPTION_B)) Abstract data type

((OPTION_C)) Storage structure

((OPTION_D)) File structure


B


((MARKS)) (1/2/3...)

1

((QUESTION))

What is right way to initialize array?

((OPTION_A))int num[6] = { 2, 4, 12, 5, 45, 5 };

((OPTION_B)) int n{} = { 2, 4, 12, 5, 45, 5 };

((OPTION_C)) int n{6} = { 2, 4, 12 };

((OPTION_D))int n(6) = { 2, 4, 12, 5, 45, 5 };


A


((MARKS)) (1/2/3...)

1

((QUESTION))

Which of the following is not the part of ADT description?

((OPTION_A))

Data

((OPTION_B))

Operations

((OPTION_C))

Both Data and Operations

((OPTION_D))

None of the above


C


An ADT consists ofDeclaration of data,Declaration of operations

((MARKS)) (1/2/3...)

1

((QUESTION))

Which of the following data structure can't store the non-homogeneous data elements?

((OPTION_A))

Records

((OPTION_B))

Array

((OPTION_C))

Pointers

((OPTION_D))

All of these


B


Array is collection of similar (homogeneous) data types

((MARKS)) (1/2/3...)

1

((QUESTION))

An algorithm is _____________________.

((OPTION_A))

a piece of code to be executed.

((OPTION_B))

a step by step procedure to solve problem.

((OPTION_C))

a loosely written code to make final code.

((OPTION_D))

All of these


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Which one of the following algorithmic approach tries to achieve localized optimum solution?

((OPTION_A))

Greedy Approach

((OPTION_B))

Divide and Conquer Approach

((OPTION_C))

Dynamic Approach

((OPTION_D))

Trial and Error Approach


A


Greedy approach focuses only on localized optimum solution.

((MARKS)) (1/2/3...)

1

((QUESTION))

Two main measures for the efficiency of an algorithm are _______________.

((OPTION_A))

Processor and Memory

((OPTION_B))

Complexity and Capacity

((OPTION_C))

Data and Space

((OPTION_D))

Time and Space


D


((MARKS)) (1/2/3...)

1

((QUESTION))

The time factor when determining the efficiency of algorithm is measured by_____________.

((OPTION_A))

Counting microseconds

((OPTION_B))

Counting space in KB of an algorithm

((OPTION_C))

Counting the number of statement

((OPTION_D))

Counting number of key operations


D


((MARKS)) (1/2/3...)

1

((QUESTION))

In best case analysis of an algorithm, ______________ of an algorithm is calculated.

((OPTION_A))

Big O

((OPTION_B))

Big Omega

((OPTION_C))

Big Theta

((OPTION_D))

None of these


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Which one of the following is not a built-in data type?

((OPTION_A))

Integer

((OPTION_B))

Boolean

((OPTION_C))

Structure

((OPTION_D))

Character


C


((MARKS)) (1/2/3...)

1

((QUESTION))

Which one of the following is not a derived data type?

((OPTION_A))

Integer

((OPTION_B))

Structure

((OPTION_C))

Character

((OPTION_D))

Both A and C


D


((MARKS)) (1/2/3...)

1

((QUESTION))

Which one of the following is derived data type?

((OPTION_A))

Integer

((OPTION_B))

Union

((OPTION_C))

Character

((OPTION_D))

Boolean


B


((MARKS)) (1/2/3...)

1

((QUESTION))

_______________ is a way to organized data in such a way that it can be used efficiently.

((OPTION_A))

Data Structure

((OPTION_B))

Data Type

((OPTION_C))

Data Set

((OPTION_D))

All of the above


A


((MARKS)) (1/2/3...)

1

((QUESTION))

_______________ is defined as a data declaration packaged together with the operations that are meaningful for the data type.

((OPTION_A))

Pseudocode

((OPTION_B))

Data structure

((OPTION_C))

Data Set

((OPTION_D))

Abstract data type


D


((MARKS)) (1/2/3...)

1

((QUESTION))

_______________ is defined as a data declaration packaged together with the operations that are meaningful for the data type.

((OPTION_A))

Pseudocode

((OPTION_B))

Data structure

((OPTION_C))

Data Set

((OPTION_D))

Abstract data type


D


((MARKS)) (1/2/3...)

1

((QUESTION))

Which one of the following is not the Linear Data Structure?

((OPTION_A))

Stack

((OPTION_B))

Tree

((OPTION_C))

Queue

((OPTION_D))

Linked List


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Which one of the following is the Static Data Structure?

((OPTION_A))

Stack

((OPTION_B))

Linked List

((OPTION_C))

Queue

((OPTION_D))

Array


D


((MARKS)) (1/2/3...)

1

((QUESTION))

Which one of the following is not the Dynamic Data Structure?

((OPTION_A))

Stack

((OPTION_B))

Linked List

((OPTION_C))

Array

((OPTION_D))

Queue


C


((MARKS)) (1/2/3...)

1

((QUESTION))

Dynamic data structure __________________.

((OPTION_A))

is easy to program.

((OPTION_B))

has random access.

((OPTION_C))

does efficient use of memory.

((OPTION_D))

None of the above.


C


((MARKS)) (1/2/3...)

1

((QUESTION))

Data structures that can change size while a program is running is known as______________

((OPTION_A))

Static Data Structure.

((OPTION_B))

Dynamic Data Structure.

((OPTION_C))

Linear Data Structure.

((OPTION_D))

Non-Linear Data Structure


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Graph is ___________ data structure.

((OPTION_A))

linear

((OPTION_B))

non-linear

((OPTION_C))

persistent

((OPTION_D))

ephemeral


B


((MARKS)) (1/2/3...)

1

((QUESTION))

List is ___________ data structure.

((OPTION_A))

static

((OPTION_B))

dynamic

((OPTION_C))

persistent

((OPTION_D))

ephemeral


C


((MARKS)) (1/2/3...)

1

((QUESTION))

Which one of the following is not a algorithm design strategy?

((OPTION_A))

Recursive

((OPTION_B))

Non-linear

((OPTION_C))

Backtracking

((OPTION_D))

Dynamic Programming


B


Non-linear is a type of data structures

((MARKS)) (1/2/3...)

1

((QUESTION))

Which one of the following is not an algorithm design tool?

((OPTION_A))

Pseudocode

((OPTION_B))

Flowchart

((OPTION_C))

Divide and Conquer

((OPTION_D))

Only A and B


D


Divide and Conquer is algorithm design tool

((MARKS)) (1/2/3...)

1

((QUESTION))

What is template?

((OPTION_A))

Template is formula for creating a generic class

((OPTION_B))

Template is used to manipulate class

((OPTION_C))

Template is used for creating functions

((OPTION_D))

None of these


C


((MARKS)) (1/2/3...)

1

((QUESTION))

Select the correct syntax of template:

((OPTION_A))

Template

((OPTION_B))

Template<>

((OPTION_C))

Temp

((OPTION_D))

None of these


B


((MARKS)) (1/2/3...)

1

((QUESTION))

A class is generated from template class is called _______.

((OPTION_A))

inherited class

((OPTION_B))

derived class

((OPTION_C))

generated class

((OPTION_D))

subclass


C


((MARKS)) (1/2/3...)

1

((QUESTION))

________ is useful when template of template is used?

((OPTION_A))

Friend function

((OPTION_B))

Static function

((OPTION_C))

Typedef

((OPTION_D))

Inheritance


C


((MARKS)) 1

(1/2/3...)

((QUESTION))

Which of the C++ feature allows you to create classes that are dynamic for using data types?

((OPTION_A))

Templates

((OPTION_B))

Inheritance

((OPTION_C))

Polymorphism

((OPTION_D))

Information hiding


A


((MARKS)) (1/2/3...)

1

((QUESTION))

A function template means _______.

((OPTION_A))

creating a function having exact type

((OPTION_B))

creating a function without having to specify exact type

((OPTION_C))

both a and b

((OPTION_D))

none of these


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Which of the following is used to describe the function using placeholder type?

((OPTION_A))

Template type parameter

((OPTION_B))

Template parameter

((OPTION_C))

Template type

((OPTION_D))

none of these


A


((MARKS)) (1/2/3...)

1

((QUESTION))

String template is used _____.

((OPTION_A))

to replace a string.

((OPTION_B))

to replace a string with another string

((OPTION_C))

to delete a string

((OPTION_D))

none of these


B


((MARKS)) (1/2/3...)

1

((QUESTION))

Maximum number of template argument in function template is _______.

((OPTION_A))

2

((OPTION_B))

3

((OPTION_C))

4

((OPTION_D))

Many


D


((MARKS)) (1/2/3...)

1

((QUESTION))

Templates provide way of abstracting ______ information.

((OPTION_A))

type

((OPTION_B))

Data

((OPTION_C))

Method

((OPTION_D))

Access


A


((MARKS)) (1/2/3...)

1

((QUESTION))

If you create instantiation of a class template with an int and then create a secondinstantiation with a double then

((OPTION_A))

once the function is used for one data type it becomes unavailable for other type

((OPTION_B))

you can not perform this kind of operation in C++

((OPTION_C))

you must precede each function call with the word int or double

((OPTION_D))

none of these


C


((MARKS)) (1/2/3...)

1

((QUESTION))

In the template <class T>declaration of T stands for ________.

((OPTION_A))

integer data type

((OPTION_B))

arbitary class

((OPTION_C))

generic data types

((OPTION_D))

none of these


C


((MARKS)) (1/2/3...)

1

((QUESTION))

What is the meaning of template parameter?

((OPTION_A))

It is used to pass a type as argument

((OPTION_B))

It is used to evalute a type

((OPTION_C))

It has no return type

((OPTION_D))

None of these


A


((MARKS)) (1/2/3...)

1

((QUESTION))

What can be passed by non-type template parameter during compile time?

((OPTION_A))

int

((OPTION_B))

double

((OPTION_C))

char

((OPTION_D))

Constant expression


D


((MARKS)) (1/2/3...)

1

((QUESTION))

Choose the correct statement from the following:

((OPTION_A))

Template function will take long time to execute

((OPTION_B))

Template functions are written when you want to have only onecode for many different types

((OPTION_C))

Due to template function the duplicate code will get increased

((OPTION_D))

None of these


B


((MARKS)) (1/2/3...)

1

((QUESTION))

What is the task of compiler while handling template?

((OPTION_A))

type association

((OPTION_B))

portability

((OPTION_C))

code elimination

((OPTION_D))

all of the above


A


((MARKS)) (1/2/3...)

1

((QUESTION))

What should be the name of the parameter that the template should take?

((OPTION_A))

same as class

((OPTION_B))

same as function

((OPTION_C))

same as template

((OPTION_D))

none of these


C


((MARKS)) (1/2/3...)

1

((QUESTION))

Which of the following describes a diffrence between template function andtemplate class in c++?

((OPTION_A))

The compiler determines the type of a template function's arguments,but the types of template classes must be stated explicitly when declaring objects

((OPTION_B))

template functions cannot be defined for user-defined types,but template

classes can

((OPTION_C))

template classes cannot be defined for user-defined types,buttemplate functions can.

((OPTION_D))

none of these


A


((MARKS)) (1/2/3...)

1

((QUESTION))

What does STL stand for ?

((OPTION_A))

Source templete Library

((OPTION_B))

stream Templete library

((OPTION_C))

Standard Templete library

((OPTION_D))

Standard Temporary library


C


((MARKS)) (1/2/3...)

1

((QUESTION))

For STL iterator itr,the statement ++itr does the following:

((OPTION_A))

post increament the item to which the iterator points

((OPTION_B))

pre-increament the item to which the iterator points

((OPTION_C))

increase by 1 the size of container pointed to by it

((OPTION_D))

advances the iterator to the next item


D


((MARKS)) (1/2/3...)

1

((QUESTION))

Which of the following data structure is not container implemented in STL?

((OPTION_A))

List

((OPTION_B))

stack

((OPTION_C))

Hash Table

((OPTION_D))

Vector


C


((MARKS)) (1/2/3...)

1

((QUESTION))

Choose the correct optionI.Vector implementation uses on array and dequeuea's implementation usesmultiple arraysII.insertion at the front od dequeue is more efficient than insertion at the frontof a vector

((OPTION_A))

only I is true

((OPTION_B))

only II is true

((OPTION_C))

Both I and II are true

((OPTION_D))

neither I nor II is true


C


((MARKS)) (1/2/3...)

1

((QUESTION))

Access to ranges of elements in an STL container is typically handledby_____.

((OPTION_A))

Pointers

((OPTION_B))

References

((OPTION_C))

iterators

((OPTION_D))

None of these


C


((MARKS)) (1/2/3...)

1

((QUESTION))

The size of STL vector is defined to be____.

((OPTION_A))

Totale size of data members in the vector class

((OPTION_B))

Number of bytes the vestor occupies in memory

((OPTION_C))

number of elements currently stored in the vector

((OPTION_D))

None of these


C


((MARKS)) (1/2/3...)

1

((QUESTION))

STL is based on following programming paradigm____.

((OPTION_A))

template

((OPTION_B))

inheritance

((OPTION_C))

polymorphism

((OPTION_D))

None of these


A


((MARKS)) (1/2/3...)

1

((QUESTION))

STL is based on following programming paradigm

((OPTION_A))

structured programming

((OPTION_B))

function programming

((OPTION_C))

object oriented programming

((OPTION_D))

None of these


B


((MARKS)) (1/2/3...)

1

((QUESTION))

The use of namespace is to___.

((OPTION_A))

structure the program into logical units

((OPTION_B))

to encapsulate data

((OPTION_C))

to indicate the beginning of program

((OPTION_D))

None of these


B


Documents

jainakshay781.files.wordpress.com · Web view((MARKS)) (1/2/3...) 1 ((QUESTION)) Which of these truly defines Software design ? ((OPTION_A)) Software design is an activity subjected