Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by David
1
answer
1
ISRO-DEC2017-37
A two-way set associative cache memory unit with a capacity of $16\, KB$ is built using a block size of $8\, words.$ The word length is $32-bits.$ The physical address space is $4\, GB.$ The number of bits in the TAG, SET fields are $20,7$ $19,8$ $20,8$ $21,9$
A two-way set associative cache memory unit with a capacity of $16\, KB$ is built using a block size of$8\, words.$ The word length is $32-bits.$ The physical address spa...
2.4k
views
commented
Apr 20, 2018
CO and Architecture
isrodec2017
cache-memory
+
–
7
answers
2
ISRO-2013-15
A pipeline $P$ operating at $400$ MHz has a speedup factor of $6$ and operating at $70$% efficiency. How many stages are there in the pipeline? $5$ $6$ $8$ $9$
A pipeline $P$ operating at $400$ MHz has a speedup factor of $6$ and operating at $70$% efficiency. How many stages are there in the pipeline?$5$$6$$8$$9$
8.7k
views
commented
Apr 15, 2018
CO and Architecture
isro2013
co-and-architecture
pipelining
+
–
2
answers
3
ISRO-2013-26
Calculate the order of leaf ($P_{leaf}$) and non leaf (P) nodes of a $B^{+}$ tree based on the information given below. Search key field = $12$ field Record pointer = $10$ bytes Block pointer = $8$ bytes Block size = $1$KB $P_{leaf}$ = 51 & p = 46 $P_{leaf}$ = 47 & p = 52 $P_{leaf}$ = 46 & p = 51 $P_{leaf}$ = 52 & p = 47
Calculate the order of leaf ($P_{leaf}$) and non leaf (P) nodes of a $B^{+}$ tree based on the information given below.Search key field = $12$ fieldRecord pointer = $10$ ...
8.4k
views
commented
Apr 15, 2018
Databases
isro2013
databases
b-tree
+
–
3
answers
4
ISRO-2013-30
In a three stage counter, using $RS$ flip flops what will be the value of the counter after giving $9$ pulses to its input ? Assume that the value of counter before giving any pulses is $1$ : $1$ $2$ $9$ $10$
In a three stage counter, using $RS$ flip flops what will be the value of the counter after giving $9$ pulses to its input ? Assume that the value of counter before givin...
6.0k
views
comment edited
Apr 15, 2018
Digital Logic
isro2013
digital-logic
flip-flop
+
–
3
answers
5
TIFR CSE 2013 | Part B | Question: 8
Which one of the following languages over the alphabet ${0, 1}$ is regular? The language of balanced parentheses where $0, 1$ are thought of as $(,)$ respectively. The language of palindromes, i.e. bit strings $x$ that read the same from left to right as well as right to ... $(c)$ above. $\left \{ 0^{m} 1^{n} | 1 \leq m \leq n\right \}$
Which one of the following languages over the alphabet ${0, 1}$ is regular?The language of balanced parentheses where $0, 1$ are thought of as $(,)$ respectively.The lang...
4.1k
views
commented
Apr 3, 2018
Theory of Computation
tifr2013
theory-of-computation
regular-language
+
–
5
answers
6
GATE CSE 2016 Set 1 | Question: 44
Let $X$ be a recursive language and $Y$ be a recursively enumerable but not recursive language. Let $W$ and $Z$ be two languages such that $\overline{Y}$ reduces to $W$, and $Z$ reduces to $\overline{X}$ (reduction means the standard ... enumerable. $W$ is not recursively enumerable and $Z$ is recursive. $W$ is not recursively enumerable and $Z$ is not recursive.
Let $X$ be a recursive language and $Y$ be a recursively enumerable but not recursive language. Let $W$ and $Z$ be two languages such that $\overline{Y}$ reduces to $W$,...
12.5k
views
commented
Apr 1, 2018
Theory of Computation
gatecse-2016-set1
theory-of-computation
easy
recursive-and-recursively-enumerable-languages
reduction
+
–
3
answers
7
TIFR CSE 2012 | Part B | Question: 18
Let $a^{i}$ denote a sequence $a . a ... a$ with $i$ letters and let $\aleph$ be the set of natural numbers ${ 1, 2,...}$. Let $L_{1}=\left\{a^{i}b^{2i}\mid i \in \aleph\right\}$ ... $L_{2}$ are recursive but not context-free. $L_{1}$ is regular and $L_{2}$ is context-free. Complement of $L_{2}$ is context-free.
Let $a^{i}$ denote a sequence $a . a ... a$ with $i$ letters and let $\aleph$ be the set of natural numbers ${ 1, 2,...}$. Let $L_{1}=\left\{a^{i}b^{2i}\mid i \in \aleph...
1.6k
views
commented
Apr 1, 2018
Theory of Computation
tifr2012
theory-of-computation
identify-class-language
+
–
2
answers
8
GATE CSE 2013 | Question: 32
Consider the following languages. $L_1 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0 \right \}$ $L_2 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0, p\neq r \right \}$ Which one of the following statements is FALSE? $L_2$ is context-free. $L_1\cap L_2$ is context-free. Complement of $L_2$ is recursive. Complement of $L_1$ is context-free but not regular.
Consider the following languages.$L_1 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0 \right \}$$L_2 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0, p\neq r \right \}$Which one of the fol...
15.6k
views
commented
Apr 1, 2018
Theory of Computation
gatecse-2013
theory-of-computation
identify-class-language
normal
+
–
0
answers
9
gate overflow book
166
views
asked
Mar 30, 2018
5
answers
10
GATE CSE 2018 | Question: 32
Consider the following C code. Assume that unsigned long int type length is $64$ bits. unsigned long int fun(unsigned long int n) { unsigned long int i, j=0, sum = 0; for( i=n; i>1; i=i/2) j++; for( ; j>1; j=j/2) sum++; return sum; } The value returned when we call fun with the input $2^{40}$ is: $4$ $5$ $6$ $40$
Consider the following C code. Assume that unsigned long int type length is $64$ bits.unsigned long int fun(unsigned long int n) { unsigned long int i, j=0, sum = 0; for(...
16.1k
views
commented
Mar 30, 2018
Programming in C
gatecse-2018
programming-in-c
normal
programming
2-marks
+
–
1
answer
11
Test by Bikram | Data Structures | Test 2 | Question: 11
The concatenation of $2$ lists is to be performed in $O(1)$ time. Which of the following implementations should be used? array implementation of list doubly linked list singly linked list circular doubly linked list
The concatenation of $2$ lists is to be performed in $O(1)$ time. Which of the following implementations should be used?array implementation of listdoubly linked listsing...
396
views
commented
Dec 1, 2016
Programming in C
tbb-ds-2
+
–
3
answers
12
Test by Bikram | Computer Organization and Architecture | Test 1 | Question: 20
A computer has $32$ bit instructions and $12$ bit addresses. If there are $250$ two-address instructions, the number of one-address instructions that can be formulated are ______.
A computer has $32$ bit instructions and $12$ bit addresses.If there are $250$ two-address instructions, the number of one-address instructions that can be formulated are...
644
views
comment edited
Dec 1, 2016
CO and Architecture
tbb-coa-1
co-and-architecture
numerical-answers
instruction-format
+
–
1
answer
13
Test by Bikram | Computer Organization and Architecture | Test 1 | Question: 26
A block-set-associative cache consists of a total of $64$ blocks divided into $4$-block sets. The main memory contains $4096$ blocks (each consisting of $128$ words). Answer the following questions based on this info: How many bits are there in a main ... and $8,7,4$ $20$ and $6,7,8$ $19$ and $8,4,7$ $17$ and $8,7,4$
A block-set-associative cache consists of a total of $64$ blocks divided into $4$-block sets. The main memory contains $4096$ blocks (each consisting of $128$ words).Answ...
375
views
answered
Dec 1, 2016
CO and Architecture
tbb-coa-1
co-and-architecture
cache-memory
+
–
3
answers
14
Max number of one address instruction, when two address instruction is given is?
A computer uses expanding opcode. It has 16 bit instructions 6 bit addresses, it supports one address, two address instructions only. If there are n two address instructions, the maximum number of one address instructions are?
A computer uses expanding opcode. It has 16 bit instructions 6 bit addresses, it supports one address, two address instructions only. If there are n two address instructi...
11.8k
views
commented
Dec 1, 2016
CO and Architecture
co-and-architecture
addressing-modes
machine-instruction
instruction-format
+
–
2
answers
15
Test by Bikram | Computer Organization and Architecture | Test 1 | Question: 13
A non-pipeline system takes $25$ ns to process a task. The same task can be processed in a six-segment pipeline in a clock cycle of $10$ ns. The speed-up rotation of the pipeline for $10$ tasks will be _______.
A non-pipeline system takes $25$ ns to process a task. The same task can be processed in a six-segment pipeline in a clock cycle of $10$ ns.The speed-up rotation of the p...
345
views
answered
Dec 1, 2016
CO and Architecture
tbb-coa-1
co-and-architecture
pipelining
speedup
numerical-answers
+
–
3
answers
16
Test by Bikram | Data Structures | Test 2 | Question: 28
A circular linked list is used to represents a queue. A single variable L is used to access the queue. To which node should L point such that both the operation enqueue and dequeue can be performed in constant time ? node next to front front node not possible with a single node rear node
A circular linked list is used to represents a queue. A single variable L is used to access the queue. To which node should L point such that both the operation enqueue a...
825
views
answered
Dec 1, 2016
Programming in C
tbb-ds-2
+
–
2
answers
17
Test by Bikram | Data Structures | Test 2 | Question: 9
Suppose you have a hash table that can hold $100$ elements. It currently stores $30$ elements (in one of $30$ possible different locations in the hash table). The probability that your next two inserts will cause at least one collision is ( by assuming a totally random hash function) __________
Suppose you have a hash table that can hold $100$ elements. It currently stores $30$ elements (in one of $30$ possible different locations in the hash table). The probab...
1.5k
views
commented
Dec 1, 2016
Programming in C
tbb-ds-2
numerical-answers
+
–
2
answers
18
Test by Bikram | Data Structures | Test 2 | Question: 7
You are given a linked list, L, and another linked list, P, containing integers, sorted in ascending order. The operation print_lots(L,P) will print the elements in L that are in positions specified by P. For instance, if $P = 1, 3, 4, 6$, the first, ... of your routine function is ______________ ? $O( n^2 )$ $O(n)$ $O(n \log n)$ $O(\log n)$
You are given a linked list, L, and another linked list, P, containing integers, sorted in ascending order. The operation print_lots(L,P) will print the elements in L tha...
1.4k
views
commented
Dec 1, 2016
Programming in C
tbb-ds-2
+
–
1
answer
19
Test by Bikram | Data Structures | Test 2 | Question: 4
State the TRUE one among these choices: Let P be a shortest path from some vertex s to some other vertex t in a directed graph. If the weight of each edge in the graph is increased by one, P will still be a shortest path from s ... to run Bellman-Ford for only k passes in order to solve the single-source shortest paths problem on G. a b c d
State the TRUE one among these choices:Let P be a shortest path from some vertex s to some other vertex t in a directed graph. If the weight of each edge in the graph is ...
1.5k
views
commented
Dec 1, 2016
Programming in C
tbb-ds-2
+
–
2
answers
20
Test by Bikram | Digital Logic | Test 2 | Question: 22
Synchronous counters eliminate the delay problems encountered with asynchronous counters because: The input clock pulses are applied only to the first and last stages. The input clock pulses are applied only to the last stage. The ... used to activate any of the counter stages. The input clock pulses are applied simultaneously to each stage.
Synchronous counters eliminate the delay problems encountered with asynchronous counters because:The input clock pulses are applied only to the first and last stages.The ...
257
views
answered
Dec 1, 2016
Digital Logic
tbb-digital-logic-2
+
–
3
answers
21
Test by Bikram | Digital Logic | Test 2 | Question: 21
On the fifth clock pulse, a $4$-bit Johnson sequence is $Q0 = 0, \ Q1 = 1, \ Q2 = 1$, and $Q3 = 1$. On the sixth clock pulse, the sequence is ________. $Q0 = 1, \ Q1 = 0, \ Q2 = 0, \ Q3 = 0$ $Q0 = 1, \ Q1 = 1, \ Q2 = 1, \ Q3 = 0$ $Q0 = 0, \ Q1 = 0, \ Q2 = 1, \ Q3 = 1$ $Q0 = 0, \ Q1 = 0, \ Q2 = 0, \ Q3 = 1$
On the fifth clock pulse, a $4$-bit Johnson sequence is $Q0 = 0, \ Q1 = 1, \ Q2 = 1$, and $Q3 = 1$. On the sixth clock pulse, the sequence is ________.$Q0 = 1, \ Q1 = 0, ...
930
views
answered
Dec 1, 2016
Digital Logic
tbb-digital-logic-2
+
–
2
answers
22
Test by Bikram | Digital Logic | Test 2 | Question: 10
How many minimum number of two input AND gates and two input OR gates are required to realize $Y = BD+CE+AB$ ? $2, 2$ $4, 2$ $3, 2$ $2, 3$
How many minimum number of two input AND gates and two input OR gates are required to realize $Y = BD+CE+AB$ ?$2, 2$$4, 2$$3, 2$$2, 3$
1.2k
views
commented
Dec 1, 2016
Digital Logic
tbb-digital-logic-2
+
–
1
answer
23
Test by Bikram | Digital Logic | Test 2 | Question: 5
The Boolean expression $ A \cdot B+ A \cdot B+ A \cdot B$ is equivalent to: $A + B$ $A \cdot B$ $A \oplus B$ $A \cdot B + A' B'$
The Boolean expression $ A \cdot B+ A \cdot B+ A \cdot B$ is equivalent to:$A + B$$A \cdot B$$A \oplus B$$A \cdot B + A' B'$
206
views
answered
Dec 1, 2016
Digital Logic
tbb-digital-logic-2
+
–
2
answers
24
Perimeter
Find the sum of the perimeters of all the rectangles with integral sides whose area is 216 sq. units.
Find the sum of the perimeters of all the rectangles with integral sides whose area is 216 sq. units.
930
views
answered
Nov 30, 2016
2
answers
25
GATE Overflow | Digital Logic | Test 1 | Question: 5
Which function does not implement the Karnaugh Map given below? wz 00 01 11 10 xy 00 0 x 0 0 01 0 x 1 1 11 1 1 1 1 10 0 x 0 0 $(w+x)y$ $xy + yw$ $(w+x) (\bar w + y) (\bar x + y)$ All of the above implement the given Karnaugh Map
Which function does not implement the Karnaugh Map given below?wz00011110xy000x00010x11111111100x00$(w+x)y$$xy + yw$$(w+x) (\bar w + y) (\bar x + y)$All of the above impl...
734
views
commented
Nov 30, 2016
Digital Logic
digital-logic
go-digital-logic-1
k-map
+
–
9
answers
26
GATE CSE 2015 Set 2 | Question: 31
A Young tableau is a $2D$ array of integers increasing from left to right and from top to bottom. Any unfilled entries are marked with $\infty$, and hence there cannot be any entry to the right of, or below a $\infty$. The following Young tableau ... The minimum number of entries (other than $1$) to be shifted, to remove $1$ from the given Young tableau is _____.
A Young tableau is a $2D$ array of integers increasing from left to right and from top to bottom. Any unfilled entries are marked with $\infty$, and hence there cannot be...
13.2k
views
commented
Nov 29, 2016
DS
gatecse-2015-set2
databases
array
normal
numerical-answers
+
–
5
answers
27
GATE CSE 2012 | Question: 3
What will be the output of the following C program segment? char inChar = 'A'; switch ( inChar ) { case 'A' : printf ("Choice A \ n"); case 'B' : case 'C' : printf ("Choice B"); case ... : printf ("No Choice"); } No Choice Choice A Choice A Choice B No Choice Program gives no output as it is erroneous
What will be the output of the following C program segment?char inChar = 'A'; switch ( inChar ) { case 'A' : printf ("Choice A \ n"); case 'B' : case 'C' : printf ("Choic...
11.0k
views
commented
Nov 28, 2016
Programming in C
gatecse-2012
programming
easy
programming-in-c
switch-case
+
–
1
answer
28
GATE IT 2007 | Question: 35
Early binding refers to a binding performed at compile time and late binding refers to a binding performed at execution time. Consider the following statements: Static scope facilitates w1 bindings. Dynamic scope requires w2 bindings. Early bindings w3 ... , decrease, increase Late, early, increase, decrease Late, early, decrease, increase Early, late, increase, decrease
Early binding refers to a binding performed at compile time and late binding refers to a binding performed at execution time. Consider the following statements:Static sco...
5.2k
views
commented
Nov 28, 2016
Programming in C
gateit-2007
programming
variable-binding
normal
out-of-syllabus-now
+
–
1
answer
29
GATE Overflow | Mathematics | Test 1 | Question: 20
Every element of some ring $(R,+,*)$ is such that $a*a=a.$ This ring is commutative is non-commutative may or may not be commutative none
Every element of some ring $(R,+,*)$ is such that $a*a=a.$ This ringis commutative is non-commutative may or may not be commutative none
587
views
commented
Aug 31, 2016
Set Theory & Algebra
go-mathematics-1
set-theory
group-theory
+
–
1
answer
30
GATE Overflow | Mathematics | Test 1 | Question: 17
The set $\{1,2,3,4,6,8,12,24\}$ together with the two binary operations LCM and GCD represents which of the following algebraic structure? group ring lattice field
The set $\{1,2,3,4,6,8,12,24\}$ together with the two binary operations LCM and GCD represents which of the following algebraic structure?group ring lattice field
562
views
commented
Aug 31, 2016
Set Theory & Algebra
go-mathematics-1
set-theory
group-theory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register