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
Answers by Arpit Dhuriya
13
votes
1
GATE CSE 1992 | Question: 15.b
Let $S$ be the set of all integers and let $n > 1$ be a fixed integer. Define for $a,b \in S, a R b$ iff $a-b$ is a multiple of $n$. Show that $R$ is an equivalence relation and find its equivalence classes for $n = 5$.
Let $S$ be the set of all integers and let $n 1$ be a fixed integer. Define for $a,b \in S, a R b$ iff $a-b$ is a multiple of $n$. Show that $R$ is an equivalence relat...
3.5k
views
answered
Jan 14, 2018
Set Theory & Algebra
gate1992
set-theory&algebra
normal
relations
descriptive
+
–
0
votes
2
intermediate code
Consider four programming languages viz. C, C++, C# and JAVA and three machines which have different configuration (such as OS, hardware). If someone needs to write a compiler for the above mentioned languages and machines, then the number of compilers required with and without intermediate code phase are --------- and ------ respectively.
Consider four programming languages viz. C, C++, C# and JAVA and three machines which have different configuration (such as OS, hardware). If someone needs to write a com...
2.2k
views
answered
Jan 11, 2018
Compiler Design
intermediate-code
compiler-design
+
–
3
votes
3
Microprogrammed control unit 1
Ques:- Control field of microinstruction contain two groups of control signal group 1 supports none or one of 64 control signals and group 2 supports at most 6 from remaining. What is size of micro operation? (what is the meaning of "from remaining" here?)
Ques:-Control field of microinstruction contain two groups of control signal group 1 supports none or one of 64 control signals and group 2 supports at most 6 from remain...
1.3k
views
answered
Dec 25, 2017
CO and Architecture
co-and-architecture
microprogramming
+
–
0
votes
4
Test series
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are 5 ns, 17 ns, 10 ns, 8 ns ... of this program, the time (in ns) needed to complete the program is ________ . (A) 612 (B) 1854 (C) 1133 (D) 578
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction ...
755
views
answered
Dec 25, 2017
CO and Architecture
pipelining
+
–
0
votes
5
Testbook Mock Test (DM + Probability)
Ram draws an empty graph of 6 nodes and tosses a fair die for every pair of distinct nodes, if a prime number occurs he draws an edge between the respective pair otherwise he moves on without drawing edge between that pair. What is the probability that after the end of ... a randomly chosen node will have degree 2? (a) 5/16 (b) 1/2 (c) 3/8 (d) None of the above
Ram draws an empty graph of 6 nodes and tosses a fair die for every pair of distinct nodes, if a prime number occurs he draws an edge between the respective pair otherwis...
621
views
answered
Dec 20, 2017
Probability
testbook-mock-test
discrete-mathematics
probability
+
–
1
votes
6
Variance
There are two data sets,each of size 5. The variances of those sets are 4 and 5; means are 2 and 4 respectively. If the sets are combined, what would be variance of combined data? (A) 10/11 (B) 11/13 (C) 11/2 (D) 13/11
There are two data sets,each of size 5. The variances of those sets are 4 and 5; means are 2 and 4 respectively. If the sets are combined, what would be variance of combi...
653
views
answered
Dec 20, 2017
Probability
variance
+
–
1
votes
7
ISRO-DEC2017-5
Let $f(x)=\log|x|$ and $g(x) =\sin x$. If $A$ is the range of $f(g(x))$ and $B$ is the range of $g(f(x))$ then $A\cap B$ is $[-1,0]$ $[-1,0)$ $[-\infty ,0]$ $[-\infty ,1]$
Let $f(x)=\log|x|$ and $g(x) =\sin x$. If $A$ is the range of $f(g(x))$ and $B$ is the range of $g(f(x))$ then $A\cap B$ is$[-1,0]$$[-1,0)$$[-\infty ,0]$$[-\infty ,1]$
3.2k
views
answered
Dec 20, 2017
Set Theory & Algebra
isrodec2017
set-theory&algebra
functions
+
–
3
votes
8
ISRO-DEC2017-3
A bag contains $19$ red balls and $19$ black balls.Two balls are removed at a time repeatedly and discarded if they are of the same colour, but if they are different, black ball is discarded and red ball is returned to the bag ,The probability that this process will terminate with one red ball is $1$ $\dfrac{1}{21}$ $0$ $0.5$
A bag contains $19$ red balls and $19$ black balls.Two balls are removed at a time repeatedly and discarded if they are of the same colour, but if they are different, bla...
4.4k
views
answered
Dec 20, 2017
Probability
isrodec2017
+
–
0
votes
9
TIFR-2015-Maths-A-7
Let $f$ and $g$ be two functions from $[0, 1]$ to $[0, 1]$ with $f$ strictly increasing. Which of the following statements is always correct? If $g$ is continuous, then $f ∘ g$ is continuous If $f$ is continuous, then $f ∘ g$ is continuous If $f$ and $f ∘ g$ are continuous, then $g$ is continuous If $g$ and $f ∘ g$ are continuous, then $f$ is continuous
Let $f$ and $g$ be two functions from $[0, 1]$ to $[0, 1]$ with $f$ strictly increasing. Which of the following statements is always correct?If $g$ is continuous, then $f...
584
views
answered
Dec 19, 2017
Set Theory & Algebra
tifrmaths2015
functions
continuity
+
–
6
votes
10
counting
How many bit strings of length 10 contain either five consecutive 0s or five consecutive 1s? I got 382.Is it correct?
How many bit strings of length 10 contain either five consecutive 0s or five consecutive 1s?I got 382.Is it correct?
4.0k
views
answered
Dec 17, 2017
Combinatory
counting
+
–
0
votes
11
DBMS-Normalisation-Lossless Join Decomposition
1.2k
views
answered
Dec 13, 2017
Databases
databases
decomposition
database-normalization
lossless-join
+
–
0
votes
12
testbook
474
views
answered
Dec 7, 2017
Theory of Computation
minimum-spanning-tree
+
–
0
votes
13
Graph Theory
Consider a 'reversed Kruskal' Algorithm for computing a MST. Initialize T to be the set of all edges in the graph. Now consider edges from largest to smallest cost. For each edge, delete it from T if that edge belongs to a cycle in T. Assuming all the edge costs are distinct, does this new algorithm correctly compute a MST? a) Yes b) no c) cant say
Consider a 'reversed Kruskal' Algorithm for computing a MST. Initialize T to be the set of all edges in the graph. Now consider edges from largest to smallest cost. For e...
1.4k
views
answered
Dec 7, 2017
Graph Theory
graph-theory
graph-matching
graph-connectivity
minimum-spanning-tree
+
–
0
votes
14
DISCRETE
The size of minimum vertex cover can be - (A) Smaller than the size of maximum matching (B) No smaller than the size of maximum matching (C) Cannot say
The size of minimum vertex cover can be - (A) Smaller than the size of maximum matching (B) No smaller than the size of maximum matching (C) Cannot say
400
views
answered
Dec 6, 2017
Graph Theory
vertex-cover
+
–
0
votes
15
num of perfect matching in a tree is 1 . Is it right ? If possible draw diagram buddy.
432
views
answered
Dec 6, 2017
0
votes
16
If G is an infinite cyclic group then which of the following is not true?
If G is an infinite cyclic group then which of the following is not true? a) G has exactly 2 generators. b) G is isomorphic to (Z,+). c) Every proper sub group of G is finite.
If G is an infinite cyclic group then which of the following is not true?a) G has exactly 2 generators.b) G is isomorphic to (Z,+).c) Every proper sub group of G is fini...
2.6k
views
answered
Dec 6, 2017
2
votes
17
Database 2PL protocol
In 2PL protocol if all exclusive locks are acquired by transaction in increasing order of their accesses then is the 2PL starvation free ?
In 2PL protocol if all exclusive locks are acquired by transaction in increasing order of their accesses then is the 2PL starvation free ?
1.2k
views
answered
Nov 26, 2017
Databases
databases
transaction-and-concurrency
test-series
+
–
2
votes
18
File system OS
One way to use contiguous allocation of disk and not suffer from holes is to compact the disk every time a file is removed. Since all files are contiguous, copying a file requires a seek and rotational delay to read the file, followed by the transfer at full speed. ... of 1MB, how long does it take to read a file into main memory then write it back to the disk at a new location?
One way to use contiguous allocation of disk and not suffer from holes is to compact the disk every time a file is removed. Since all files are contiguous, copying a file...
1.3k
views
answered
Nov 24, 2017
CO and Architecture
co-and-architecture
operating-system
file-system
+
–
0
votes
19
Computer networks
There are 10 stations in a LAN always having constant load, ready to transmit. During any particular contention slot, each station transmits with a probability 0.1. If the average frame takes 122ms to transmit, what is the channel efficiency, if the round trip time is 51.2 micro seconds?
There are 10 stations in a LAN always having constant load, ready to transmit. During any particular contention slot, each station transmits with a probability 0.1. If th...
1.4k
views
answered
Oct 28, 2017
0
votes
20
CO-Pipeline-CPI
327
views
answered
Sep 25, 2017
0
votes
21
effective memory access time
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 entry exist in TLB ... page memory access 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 ...
1.3k
views
answered
Aug 26, 2017
1
votes
22
compiler design
the following intermediate best suited for derivation of common subexpression?????????? a. qudraples b.triples c.trees d.postfix code explain plz
the following intermediate best suited for derivation of common subexpression??????????a. qudraplesb.triplesc.treesd.postfix code explain plz
298
views
answered
Jul 13, 2017
Compiler Design
compiler-design
intermediate-code
+
–
0
votes
23
Gray Code
Addition of all gray code to convert decimal(0-9) into gray code is a)129 b) 108 c) 69 d) 53
Addition of all gray code to convert decimal(0-9) into gray code isa)129 b) 108 c) 69 d) 53
2.4k
views
answered
Jun 30, 2017
Digital Logic
digital-logic
+
–
1
votes
24
C Programming
long fun( char * s){ long r = 0; for( ; *s ; r = (r << 1) | (*s++ - '0')); return r; } What does the fun("000001010") returns?
long fun( char * s){ long r = 0; for( ; *s ; r = (r << 1) | (*s++ - '0')); return r;}What does the fun("000001010") returns?
739
views
answered
Jun 13, 2017
Programming in C
programming-in-c
+
–
0
votes
25
Test by Bikram | Computer Organization and Architecture | Test 2 | Question: 23
Consider a two level memory hierarchy having only one level cache and main memory. Cache and Main memory access times are $20$ ns and $120$ ns/word respectively. The size of cache block is $4$ words . If main memory is referenced $40 \%$ of the times, then average access time is _______ ns
Consider a two level memory hierarchy having only one level cache and main memory. Cache and Main memory access times are $20$ ns and $120$ ns/word respectively. The size...
557
views
answered
Jun 11, 2017
CO and Architecture
tbb-coa-2
numerical-answers
co-and-architecture
cache-memory
+
–
0
votes
26
Carl hamacher
A program consists of two nested loops-a small inner loop and a much larger outer loop.The decimal memory addresses shown delineate the location of the two loops and the beginning and end of the total program. All memory locations in the various sections of ... the cycle time of the cache is 1τ s. Compute the total time needed for instruction fetching during execution of the program.
A program consists of two nested loops—a small inner loop and a much larger outer loop.The decimal memory addressesshown delineate the location of the two loops and the...
1.9k
views
answered
Jun 11, 2017
CO and Architecture
co-and-architecture
carl-hamacher
cache-memory
+
–
3
votes
27
IISc PhD
If a cache memory system has only one block, which of the following options is true? It exploits both temporal and spatial locality It exploits only temporal locality but not spatial locality It exploits only spatial locality but not temporal locality It exploits neither temporal locality nor spatial locality
If a cache memory system has only one block, which of the following options is true?It exploits both temporal and spatial localityIt exploits only temporal locality but n...
585
views
answered
Jun 10, 2017
CO and Architecture
iisc
iisc-interview
cache-memory
+
–
0
votes
28
CSMA/CD
consider two nodes A and B are on the same 10 Mbps Ethernet segment, and the propagation delay between the two nodes is 225 bit times. Suppose at time t = 0 B starts to transmit a frame. Suppose A also transmits at some time t=x, but before completing its transmission A recieves bits from B. Assuming node A follows CSMA/CD protocol what is the maximum value of x?
consider two nodes A and B are on the same 10 Mbps Ethernet segment, and the propagation delay between the two nodes is 225 bit times. Suppose at time t = 0 B starts to t...
1.5k
views
answered
Jun 7, 2017
Computer Networks
csma-cd
computer-networks
+
–
0
votes
29
iisc written
Consider a directed graph with V nodes and E edges. The graph is represented by two arrays, source src[] and destination dest[] each of size E, such that src[i] and dest[i] represent the nodes connected by edge, i. How to calculate the maximum indegree(or out degree)?
Consider a directed graph with V nodes and E edges. The graph is represented by two arrays, sourcesrc[] and destination dest[] each of size E, such that src[i] and dest[i...
563
views
answered
Jun 7, 2017
Graph Theory
graph-theory
graph-connectivity
iisc-interview
iisc
mtech
descriptive
+
–
0
votes
30
Implementation of BSA(Branch and save address) instruction
I have a doubt regarding the implementation of BSA instruction. I read that BSA instruction can be implemented as :- T4:- m[AR] <-- PC; AR<--AR+1 T5:- PC<--AR; SC<--0 Here T4 and T5 are 4th and ... to the position where PC is written. So they should happen at different clock cycles right so that they can execute in proper order?
I have a doubt regarding the implementation of BSA instruction. I read that BSA instruction can be implemented as :-T4:- m[AR] < PC; AR< AR+1T5:- PC< AR; SC< 0He...
3.2k
views
answered
Jun 7, 2017
CO and Architecture
co-and-architecture
machine-instruction
branch-conditional-instructions
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register