Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
akash
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by akash
2
answers
1
toc -recuresively ennumerable
Let L be a regular language, and R be a turing recognizable language but not acceptable language. Which of the following is possible? a) Set of strings common in L and R' can be in not RE(where ' is a complement operation) b)Set of strings common in L and R' can be recursive. 1) only a 2)only b 3) both 4) none
Let L be a regular language, and R be a turing recognizable language but not acceptable language. Which of the following is possible?a) Set of strings common in L and R' ...
962
views
commented
Aug 3, 2016
Theory of Computation
recursive-and-recursively-enumerable-languages
theory-of-computation
+
–
4
answers
2
Probablity_basic
What is the probability that a five-card poker hand contains a straight, that is, five cards that have consecutive kinds? Answer is 10240/C(52,5) My approch: 2*(4)^5/C(52,5)
What is the probability that a five-card poker hand contains a straight, that is, five cards that have consecutive kinds?Answer is 10240/C(52,5)My approch:2*(4)^5/C(52,5)...
1.4k
views
answer edited
Dec 7, 2015
Probability
probability
engineering-mathematics
+
–
2
answers
3
Q-13 (ch-2) Made easy workbook 2015
The control field of 1-address control word has to support 2 groups of control signals.In the group-1 it is requires to generate either 1 or none of the 63 control signals.In the group-2 at most 4 from the remaining.What will be the minimum no. bits needed for control field. option (A) 6 option (B) 10 option (c) 67 option (D) 81.
The control field of 1-address control word has to support 2 groups of control signals.In the group-1 it is requires to generate either 1 or none of the 63 control signal...
3.2k
views
commented
Nov 28, 2015
CO and Architecture
microprogramming
co-and-architecture
+
–
2
answers
4
Q-20 (control unit design) madeEasy workBook 2015
Show below are sements of a code run on a CISC and RISC archy separately CISC RISC MOV AX,05 MOV AX,00 MOV BX,06 MOV BX,05 MUL AX,BX MOV CX,06 start:ADD AX,BX loop loop start; loop till CX=0 If the MUL instruction takes 40 clock cycles, ... 2.8 (c) The CISC code runs slower by a factor of 0.025 (d) The RISC code will run faster by a factor of 40
Show below are sements of a code run on a CISC and RISC archy separatelyCISC RISCMOV AX,05 ...
2.2k
views
commented
Nov 28, 2015
CO and Architecture
clock-frequency
co-and-architecture
cisc-risc-architecture
+
–
1
answer
5
madeeasy test2015
358
views
answered
Nov 23, 2015
2
answers
6
plz answer..
372
views
answered
Nov 13, 2015
11
answers
7
GATE CSE 2015 Set 3 | Question: 36
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a pack...
32.6k
views
commented
Nov 12, 2015
Computer Networks
gatecse-2015-set3
computer-networks
normal
numerical-answers
network-switching
+
–
1
answer
8
255.255.31.0 how many number of subnet bits is there if it is subnet mask
If it is super net mask how many super net bits is there
If it is super net mask how many super net bits is there
460
views
commented
Nov 11, 2015
4
answers
9
Network layer
The routine table of a router is shown below : Destination subnet Interface 132.81.0.0 255.225.0.0 eth0 132.81.64.0 255.255.224.0 eth1 132.81.68.0 255.255.255.0 eth2 132.81.68.64 255.255.255.224 eth3 A packet begining a destination address 132.81.68.132 arrive at the router . on which of the interfaces it cant be forwarded ? a) eth 0 b ) eth 1 c) eth 2 d) eth 3
The routine table of a router is shown below :Destination subnet Interface 132.81.0.0255.225.0.0eth0132.81.64.0255.255.224.0eth1132.81.68.0255.255.255.0eth2132.81.68.6...
2.0k
views
answered
Nov 9, 2015
Computer Networks
computer-networks
+
–
1
answer
10
Efficiency of ethernet
If the transmission delay is $200 \text{ms}$ and throughput is $50%$ then what is the RTT for the Ethernet (A). $40\text{ms}$ (B). $80\text{ms}$ (C). $20\text{ms}$ (D).None
If the transmission delay is $200 \text{ms}$ and throughput is $50%$ then what is the RTT for the Ethernet(A). $40\text{ms}$(B). $80\text{ms}$(C). $20\text{ms}$(D).None
1.6k
views
commented
Nov 8, 2015
Computer Networks
computer-networks
+
–
2
answers
11
Sliding window protocol
Consider three nodes $ A,B,C$ connected in series. Node $A$ is connected to Node B via $ 3 \text{Gbps}$ link, $500 \text{km}$ length. The links are full duplex, but no other traffic on the links. A large file is to be sent from node $A$ to node $C$. Packets ... protocol is used what is the optimal value of sender’s window (a). $28$ (b). $38$ (c). $54$ (d). $72$
Consider three nodes $ A,B,C$ connected in series. Node $A$ is connected to Node B via $ 3 \text{Gbps}$ link, $500 \text{km}$ length. The links are full duplex, but no ot...
1.5k
views
answered
Nov 8, 2015
Computer Networks
sliding-window
+
–
5
answers
12
CSMA/CD
The network consists of 4 hosts distributed as shown below: Assume this network uses CSMA/CD . And signal travels at $3$ $X$ $10^{5} \text{km/sec}$ If sender sends at $1 \text{Mbps}$. What could be the minimum size of packet? (a).$600$ $\text{bits}$ (b). $400$ $\text{bits}$ (c). $6000$ $\text{bits}$ (d). $1500$ $\text{bits}$
The network consists of 4 hosts distributed as shown below: Assume this network uses CSMA/CD . And signal travels at $3$ $X$ $10^{5} \text{km/sec}$If sender sends at $1 ...
2.3k
views
commented
Nov 8, 2015
Computer Networks
computer-networks
+
–
2
answers
13
Page tables are stored in memory , which has access time of 100 ns.
Page tables are stored in memory , which has access time of 100 ns. The TLB holding 8 page table entries, has an access time of 10 ns. Using execution of process , it is found that 85 % of the time, a required page table ... requires 2 memory accesses and TLB requires one memory access. A) 38120 ns B) 40000 ns C) 40120 ns D) None
Page tables are stored in memory , which has access time of 100 ns. The TLB holding 8 page table entries, has an access time of 10 ns. Using execution of process , it is ...
4.9k
views
commented
Nov 1, 2015
Operating System
operating-system
virtual-memory
normal
+
–
2
answers
14
cpu utilization?
Assume that there are $2$ independent processes which are in memory and each process spends a fraction $\frac{1}{2}$ of its time waiting for I/O to complete. Each process requires $4$ minutes of CPU time. The utilization of CPU in percentage is _____.
Assume that there are $2$ independent processes which are in memory and each process spends a fraction $\frac{1}{2}$ of its time waiting for I/O to complete. Each process...
1.5k
views
commented
Oct 21, 2015
Operating System
operating-system
+
–
3
answers
15
Galvin Eighth Edition
Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound tasks issue an I/O operation once for every millisecond of CPU computing and that each I/O operation takes 10 milliseconds to complete. Also ... . Describe the CPU utilization for a round-robin scheduler when: The time quantum is 1 millisecond The time quantum is 10 milliseconds
Consider a system running ten I/O-bound tasks and one CPU-bound task. Assume that the I/O-bound tasks issue an I/O operation once for every millisecond of CPU computing a...
8.4k
views
commented
Oct 20, 2015
Operating System
process-scheduling
+
–
1
answer
16
File system
Which file is a sequence of bytes organized into blocks understandable by the system’s linker? a) object file b) source file c) executable file d) text file
Which file is a sequence of bytes organized into blocks understandable by the system’s linker?a) object fileb) source filec) executable filed) text file
2.6k
views
commented
Oct 20, 2015
Operating System
operating-system
+
–
1
answer
17
Memory management
In a 32 bit machin we divide the VA into 4 segments 10bit ---8 bit ---6 bit --8 bit . We use a 3 level page such that first 10 bit are used for the first level and so on . then what is size of a page table for a process that has a address 0 ? a 4096 bytes b 4274 bytes c 4608 bytes d 2148 bytes
In a 32 bit machin we divide the VA into 4 segments10bit -8 bit -6 bit 8 bit . We use a 3 level page such that first 10 bit are used for the first level and so on .the...
704
views
commented
Oct 19, 2015
Operating System
memory-management
+
–
3
answers
18
How many entries will be present in one page of inner page table in below question ?
In 2 level paging say I have an inner page table which is of size 2^22 Bytes ,Now page size is of 4KB , so no we will divide this page table into pages ,so no of pages =2^10 ,Now in outer page table ... be present in 1 page out of the 2^10 pages in the inner page table,assuming that each entry is of size 4Bytes.
In 2 level paging say I have an inner page table which is of size 2^22 Bytes ,Now page size is of 4KB , so no we will divide this page table into pages ,so no of pages =2...
641
views
answered
Oct 18, 2015
9
answers
19
GATE CSE 2006 | Question: 20, ISRO2015-17
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$ interest. T1 start T1 B old $=12000$ new $=10000$ ... $3$ because transaction T1 has committed We can apply redo and undo operations in arbitrary order because they are idempotent
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$...
27.6k
views
commented
Oct 13, 2015
Databases
gatecse-2006
databases
transaction-and-concurrency
normal
isro2015
+
–
1
answer
20
grouping when attribute have some null entry..
select state, companyname, count(*) from abovetable group by state, companyname../
select state, companyname, count(*) from abovetable group by state, companyname../
315
views
commented
Oct 5, 2015
7
answers
21
GATE CSE 2015 Set 2 | Question: 21
Consider the following statements. The complement of every Turing decidable language is Turing decidable There exists some language which is in NP but is not Turing decidable If L is a language in NP, L is Turing decidable Which of the above statements is/are true? Only II Only III Only I and II Only I and III
Consider the following statements.The complement of every Turing decidable language is Turing decidableThere exists some language which is in NP but is not Turing decidab...
15.3k
views
commented
Sep 20, 2015
Theory of Computation
gatecse-2015-set2
theory-of-computation
decidability
easy
+
–
10
answers
22
GATE CSE 2010 | Question: 53
A hash table of length $10$ uses open addressing with hash function $h(k) = k \: \mod \: 10$, and linear probing. After inserting $6$ ... of the key values using the same hash function and linear probing will result in the hash table shown above? $10$ $20$ $30$ $40$
A hash table of length $10$ uses open addressing with hash function $h(k) = k \: \mod \: 10$, and linear probing. After inserting $6$ values into an empty hash table, the...
26.9k
views
commented
Aug 26, 2015
DS
data-structures
hashing
normal
gatecse-2010
+
–
2
answers
23
number of comparision in searching in BST
Consider the following Binary Search Tree 10 / \ 5 20 / / \ 4 15 30 / 11 If we randomly search one of the keys present in above BST, what would be the expected number of comparisons? (A) 2.75 (B) 2.25 (C) 2.57 (D) 3.25
Consider the following Binary Search Tree 10 / \ 5 20 / / \ 4 15 30 ...
18.4k
views
commented
Aug 23, 2015
DS
data-structures
binary-tree
+
–
3
answers
24
why do we not apply Binary search for insertion in the heap ?
however number of comparisions in binary search=O(loglogn) and in linear search it is O(logn), time complexity in case of binary search- O(logn) and in case of linear it is also O(logn)
however number of comparisions in binary search=O(loglogn) and in linear search it is O(logn),time complexity in case of binary search- O(logn) and in case of linear it i...
850
views
commented
Aug 23, 2015
DS
data-structures
algorithms
+
–
5
answers
25
GATE CSE 2001 | Question: 2.2
Consider the following statements: $S_1:$ There exists infinite sets $A$, $B$, $C$ such that $A \cap (B \cup C)$ is finite. $S_2:$ There exists two irrational numbers $x$ and y such that $(x+y)$ ... $S_2$? Only $S_1$ is correct Only $S_2$ is correct Both $S_1$ and $S_2$ are correct None of $S_1$ and $S_2$ is correct
Consider the following statements:$S_1:$ There exists infinite sets $A$, $B$, $C$ such that $A \cap (B \cup C)$ is finite.$S_2:$ There exists two irrational numbers $x$ a...
8.8k
views
comment edited
Aug 19, 2015
Set Theory & Algebra
gatecse-2001
set-theory&algebra
normal
set-theory
+
–
9
answers
26
GATE CSE 2005 | Question: 44
What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs $(a,b)$ and $(c,d)$ in the chosen set such that, $a \equiv c\mod 3$ and $b \equiv d \mod 5$ $4$ $6$ $16$ $24$
What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs $(a,b)$ and $(c,d)$ in the chosen set such th...
13.3k
views
commented
Aug 16, 2015
Combinatory
gatecse-2005
set-theory&algebra
normal
pigeonhole-principle
+
–
5
answers
27
GATE CSE 2014 Set 3 | Question: 16
Let $\Sigma$ be a finite non-empty alphabet and let $2^{\Sigma^*}$ be the power set of $\Sigma^*$. Which one of the following is TRUE? Both $2^{\Sigma^*}$ and $\Sigma^*$ are countable $2^{\Sigma^*}$ is countable and $\Sigma^*$ is uncountable $2^{\Sigma^*}$ is uncountable and $\Sigma^*$ is countable Both $2^{\Sigma^*}$ and $\Sigma^*$ are uncountable
Let $\Sigma$ be a finite non-empty alphabet and let $2^{\Sigma^*}$ be the power set of $\Sigma^*$. Which one of the following is TRUE? Both $2^{\Sigma^*}$ and $\Sigma^*$ ...
9.5k
views
answered
Aug 15, 2015
Theory of Computation
gatecse-2014-set3
theory-of-computation
normal
countable-uncountable-set
+
–
5
answers
28
GATE CSE 1996 | Question: 2.2
Let $R$ be a non-empty relation on a collection of sets defined by $_{A}R_ B$ if and only if $A \cap B = \phi$. Then, (pick the true statement) $A$ is reflexive and transitive $R$ is symmetric and not transitive $R$ is an equivalence relation $R$ is not reflexive and not symmetric
Let $R$ be a non-empty relation on a collection of sets defined by $_{A}R_ B$ if and only if $A \cap B = \phi$. Then, (pick the true statement)$A$ is reflexive and transi...
13.8k
views
answered
Aug 13, 2015
Set Theory & Algebra
gate1996
set-theory&algebra
relations
normal
+
–
4
answers
29
GATE IT 2006 | Question: 2
For the set $N$ of natural numbers and a binary operation $f : N \times N \to N,$ an element $z \in N$ is called an identity for $f,$ if $f (a, z) = a = f(z, a),$ for all $a \in N.$ Which of the following binary operations have an identity? $f (x, y) = x + y - 3$ $f (x, y) = \max(x, y)$ $f (x, y) = x^y$ I and II only II and III only I and III only None of these
For the set $N$ of natural numbers and a binary operation $f : N \times N \to N,$ an element $z \in N$ is called an identity for $f,$ if $f (a, z) = a = f(z, a),$ for all...
9.4k
views
commented
Aug 13, 2015
Set Theory & Algebra
gateit-2006
set-theory&algebra
easy
binary-operation
+
–
2
answers
30
functions
Let $f:A\to B$ and $E$ and $F$ be subsets of $A$. Is below statement true or false? $S:f(E \cap F)= f(E) \cap f(F)$
Let $f:A\to B$ and $E$ and $F$ be subsets of $A$. Is below statement true or false?$S:f(E \cap F)= f(E) \cap f(F)$
546
views
commented
Aug 13, 2015
Set Theory & Algebra
functions
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register