The height of a binary tree is defined as the maximum number

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

The height of a binary tree is defined as the maximum number of edges in any path from the root to the leaf. The maximum number of nodes in any binary tree of height h is

A2^h

B2^h-1-1

C2^h+1

D2^h+1-1

Akilesh Kharvi ? Dec 8 '2016 at 21:59

Answer: \(2^{h+1}-1\)

Explanation:

The number  of nodes in a binary tree of height h is at least h + 1, 
and at most \(2^{h+1}-1\) here h is the depth of the tree.

reference: http://en.wikipedia.org/wiki/Binary_tree#Properties_of_binary_trees

View Answer

Discuss

The principle of cache memory is primarily based on

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

The principle of cache memory is primarily based on

Athe principle of locality of reference

Bthe heuristic 90-10 rule

Cthe fact that the entire program is not required at once

Dthe faster memories also tend to be costlier.

Akilesh Kharvi ? Dec 8 '2016 at 21:57

Answer:the principle of locality of reference

Explanation:

principle of cache memory primarily based on
Cache memory is a specially designed faster access but it has smaller memory area,so it is generally used to keep recently referenced data and data near recently referenced data.
When a program executes on a computer, most of the memory references are not made uniformly to a small number of locations. Here the Locality of the reference does matter.
Locality of Reference, also known as the Principle of Locality,the phenomenon of the same value or related storage locations being frequently accessed. Locality occurs in time(temporal locality) and in space (spatial locality).

Temporal Locality refers to the reuse of specific data and/or resources within relatively small time durations.

Spatial Locality refers to the use of data elements within relatively close storage locations. Sequential locality, a special case of spatial locality, occurs when data elements are arranged and accessed linearly, eg, traversing the elements in a one-dimensional array.

View Answer

Discuss

The number of data pulses required to shift one byte of data

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

The number of data pulses required to shift one byte of data from the input to the output of a 4 bit shift register is

A9

B12

C16

D32

No answer description available for this question. Let us discuss.

View Answer

Discuss

Any position independent code is best written using which of

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

Any position independent code is best written using which of the following addressing modes ?

AAbsolute

BDirect

CIndirect

DRelative.

Akilesh Kharvi ? Dec 8 '2016 at 21:52

Answer:Relative.

Explanation:

The relative addressing mode permits the writing of "position-independent code," programs which will be properly executed by the processor regardless of where they are located in memory.
The entire program (together with any necessary data) may be picked up from one region of memory and moved to another with no adverse effect. In order to be location-independent a program may not refer to any specific location by address. All references to memory must be through the use of relative addressing.

View Answer

Discuss

Two finite state machines are said to be equivalent only if

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

Two finite state machines are said to be equivalent only if they

Ahave the same number of states

Bhave the same number of edges

Chave the same number of states and also the same number of edges

Drecognise the same set of tokens.

No answer description available for this question. Let us discuss.

View Answer

Discuss