Recent activity by manisha11

0 answers

1

ISI2014-DCG-70
For the matrices $A = \begin{pmatrix} a & a \\ 0 & a \end{pmatrix}$ and $B = \begin{pmatrix} 0 & 1 \\ -1 & 0 \end{pmatrix}$, $(B^{-1}AB)^3$ is equal to $\begin{pmatrix} a^3 & a^3 \\ 0 & a^3 \end{pmatrix}$ ... $\begin{pmatrix} a^3 & 0 \\ 3a^3 & a^3 \end{pmatrix}$ $\begin{pmatrix} a^3 & 0 \\ -3a^3 & a^3 \end{pmatrix}$

commented Jan 3 in Linear Algebra | 36 views

7 answers

2

GATE2019-45
A certain processor deploys a single-level cache. The cache block size is $8$ words and the word size is $4$ bytes. The memory system uses a $60$-MHz clock. To service a cache miss, the memory controller first takes $1$ cycle to accept the ... bandwidth for the memory system when the program running on the processor issues a series of read operations is ______$\times 10^6$ bytes/sec

commented Nov 12, 2019 in CO and Architecture | 3.2k views

1 answer

3

Number of Topological Order
Find the number of Topological order(sort) in the given graph? $(1)$ $(2)$

commented Oct 23, 2019 in DS | 553 views

0 answers

4

Complementary Number Systems
If N = 670 in base 9 system. Then find the radix complement of N.

commented Sep 23, 2019 in Digital Logic | 135 views

0 answers

5

MadeEasy Subject Test 2019: Digital Logic - Number Systems
Even after seeing the solution I was unable to understand this question: Can any one tell whats happening here:

commented Sep 23, 2019 in Digital Logic | 95 views

5 answers

6

GATE2019-40
Consider the following statements: The smallest element in a max-heap is always at a leaf node The second largest element in a max-heap is always a child of a root node A max-heap can be constructed from a binary search tree in $\theta(n)$ time A binary search tree can be ... time Which of te above statements are TRUE? I, II and III I, II and IV I, III and IV II, III and IV

commented Sep 16, 2019 in DS | 3k views

3 answers

7

GATE1992-01-vi
In an $11-bit$ computer instruction format, the size of address field is $4-bits.$ The computer uses expanding OP code technique and has $5$ two-address instructions and $32$ one-address instructions. The number of zero-address instructions it can support is ________

commented Sep 8, 2019 in CO and Architecture | 2.8k views

1 answer

8

instruction cycle
question A microprocessor provides an instruction capable of moving a string of bytes from one area of memory to another. The fetching and initial decoding of the instruction takes 10 clock cycles.Thereafter, it takes 15 clock cycles to transfer each byte ... cycle becoz control to interrupt will be given when the current instrunction will over and i will over after 970 clock cyle

commented Sep 2, 2019 in CO and Architecture | 1.1k views

6 answers

9

GATE2008-IT-18
How many bytes of data can be sent in $15$ seconds over a serial link with baud rate of $9600$ in asynchronous mode with odd parity and two stop bits in the frame? $10,000$ bytes $12,000$ bytes $15,000$ bytes $27,000$ bytes

commented Sep 1, 2019 in Computer Networks | 5.6k views

7 answers

10

GATE2008-IT-39
Consider a CPU where all the instructions require $7$ clock cycles to complete execution. There are $140$ instructions in the instruction set. It is found that $125$ control signals are needed to be generated by the control unit. While designing the horizontal microprogrammed ... minimum size of the control word and control address register? $125, 7$ $125, 10$ $135, 9$ $135, 10$

commented Sep 1, 2019 in CO and Architecture | 5.2k views

3 answers

11

GATE2007-71
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... is word addressable. The number of memory references for accessing the data in executing the program completely is $10$ $11$ $20$ $21$

commented Aug 31, 2019 in CO and Architecture | 6.6k views

1 answer

12

Question on Relations
A binary relation R on Z × Z is defined as follows: (a, b) R (c, d) iff a = c or b = d Consider the following propositions: 1. R is reflexive. 2. R is symmetric. 3. R is antisymmetric. Which one of the following statements is True?

commented Aug 30, 2019 in Set Theory & Algebra | 348 views

3 answers

13

Minimum number of tables to represent ER-Diagram
The minimum number of tables to represent ER-Diagram such that the relational database satisfies 1NF.

commented Aug 22, 2019 in Databases | 2.4k views

4 answers

14

GATE2008-77
Delayed branching can help in the handling of control hazards The following code is to run on a pipelined processor with one branch delay slot: I1: ADD $R2 \leftarrow R7 + R8$ I2: Sub $R4 \leftarrow R5 – R6$ I3: ADD $R1 \leftarrow R2 + R3$ ... Which of the instructions I1, I2, I3 or I4 can legitimately occupy the delay slot without any program modification? I1 I2 I3 I4

commented Aug 13, 2019 in CO and Architecture | 4.4k views

3 answers

15

GATE2019-11
Consider the following two statements about database transaction schedules: Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable. Timestamp-ordering concurrency control protocol with Thomas' Write Rule can generate view serializable schedules that are ... of the above statements is/are TRUE? I only II only Both I and II Neither I nor II

commented Aug 11, 2019 in Databases | 3k views

1 answer

16

Ace Test Series: CO & Architecture - Cache Memory

commented Aug 6, 2019 in CO and Architecture | 141 views

1 answer

17

Stallings 6e Exercise-11.12 (page no.-539) I/O Management RAID
Consider a 4-drive, 200GB-per-drive RAID array. What is the available data storage capacity for each of the RAID levels, 0, 1, 3, 4, 5, and 6?

commented Aug 6, 2019 in Operating System | 77 views

1 answer

18

Ace Test Series: CO & Architecture - Disk
In the solution to this question it is given that the number of rotations needed is 2.75. How we got 2.75?

commented Aug 6, 2019 in CO and Architecture | 156 views

1 answer

19

Ace Test Series: CO & Architecture - Secondary Memory

commented Aug 6, 2019 in CO and Architecture | 90 views

1 answer

20

madeasy testseries cn
Ramesh buy a new laptop, he connected it to Ethernet and after sometime he wishes to surf the internet, so laptop send a DNS request. What will be the sequence of header packet geenrated on request, as it leaves the laptop? udp ... ;/p> Ethernet ip tcp dns udp dns Ethernet ip

commented Jul 31, 2019 in Computer Networks | 257 views

2 answers

21

ME TESTSERIES
If flooding is used to send packets from A to E, then the total number of packets generated in the above network when hop count for A to E is 3 are ________. ANSWER IS 14 .....BUT THE DOUBT IS THAT IS THEIR ANY EFFECT OF SAYING HOP COUNT FOR A TO E BECZ HERE IN 14 WE COUNTED THE HOP OF LENGTH...

commented Jul 31, 2019 in Computer Networks | 706 views

2 answers

22

made easy test series
Consider Amit lives in Delhi, connected to the internet via a 100 Mbps connection retrieve a 250 KB webpage from server in Bangalore, where page contain 3 images of 500 KB each. Assume one way propagation delay is 75 ms and Amit's access link is the ... Amit's screen using nonpersistent HTTP and T2 is time using persistent connection, then T = T1 - T2 will be ________ msec.

commented Jul 30, 2019 in Computer Networks | 683 views

1 answer

23

Andrew S. Tanenbaum Edition 5th Exercise 3 Question 6 (Page No. 252)
A bit string, 0111101111101111110, needs to be transmitted at the data link layer. What is the string actually transmitted after bit stuffing?

commented Jul 27, 2019 in Computer Networks | 125 views

1 answer

24

Andrew S. Tanenbaum Edition 5th Exercise 5 Question 6 (Page No. 490)
Consider the network of Figure. Distance vector routing is used, and the following vectors have just come in to router C: from B: (5, 0, 8, 12, 6, 2); from D: (16, 12, 6, 0, 9, 10); and from E: (7, 6, 3, 9, 0 ... , and E, are 6, 3, and 5, respectively. What is C's new routing table? Give both the outgoing line to use and the cost.

commented Jul 27, 2019 in Computer Networks | 59 views

0 answers

25

Kurose and Ross Edition 6 Exercise 1 Question P29 (Page No 76)
Suppose there is a 10 Mbps microwave link between a geostationary satellite and its base station on Earth. Every minute the satellite takes a digital photo and sends it to the base station. Assume a propagation speed of ... the size of the photo. What is the minimum value of x for the microwave link to be continuously transmitting?

commented Jul 27, 2019 in Computer Networks | 16 views

1 answer

26

Kurose and Ross Edition 6 Exercise 1 Question P28 (Page No 76)
Suppose two hosts, A and B, are separated by 20,000 kilometers and are connected by a direct link of R = 2 Mbps. Suppose the propagation speed over the link is $2.5 10^8$meters/sec. How long does it take to send the file ... the preceding one is acknowledged. How long does it take to send the file? Compare the results from (a) and (b).

commented Jul 27, 2019 in Computer Networks | 24 views

2 answers

27

probability
a fair coin is tossed 10 times ,wt is the probability that head will come up in first two toss of coin??

commented Jul 14, 2019 in Probability | 822 views

1 answer

28

Suspended state in process transition diagram
Which one of the following state transition is not possible? (A) Blocked to Blocked Suspended (B) Blocked Suspended to Ready Suspended (C) Blocked Suspended to Blocked (D) Ready Suspended to Blocked Suspended Doubts: What are suspended ... ? Is there any difference between these: waiting, blocked, suspended? Is any other term also used for these?

commented Jul 14, 2019 in Operating System | 1.1k views

3 answers

29

GATE2017-2-20
The maximum number of IPv4 router addresses that can be listed in the record route (RR) option field of an IPv4 header is______.

commented Jul 14, 2019 in Computer Networks | 6.5k views

2 answers

30

Galvin
Assume that you have a page-reference string for a process with m frames (initially all empty). The page-reference string has length p; n distinct page numbers occur in it.Answer these questions for any page replacement algorithms: a. What is a lower bound on the number of page faults? b. What is an upper bound on the number of page faults?

commented Jul 6, 2019 in Operating System | 1.6k views

3 answers

31

GATE2018-28
Consider the first-order logic sentence $\varphi \equiv \exists \: s \: \exists \: t \: \exists \: u \: \forall \: v \: \forall \: w \forall \: x \: \forall \: y \: \psi(s, t, u, v, w, x, y)$ ... than or equal to $3$ There exists no model of $\varphi$ with universe size of greater than $7$ Every model of $\varphi$ has a universe of size equal to $7$

commented Jul 5, 2019 in Mathematical Logic | 7.7k views

7 answers

32

GATE2016-1-48
Cylinder a disk queue with requests for $I/O$ to blocks on cylinders $47, 38, 121, 191, 87, 11, 92, 10.$ The C-LOOK scheduling algorithm is used. The head is initially at cylinder number $63$, moving towards larger cylinder numbers on ... cylinders are numbered from $0$ to $199$. The total head movement (in number of cylinders) incurred while servicing these requests is__________.

commented Jul 2, 2019 in Operating System | 7.8k views

0 answers

33

B TRees DBMS Self doubt
In case of B Trees we split a node on insertion in case of overflow, is there any possible case in which this may lead to underflow also? as a key is promoted to parent the children formed may have subtrees, which may be broken such that we get underflow somewhere? just a thought

asked Jun 7, 2019 in Databases | 65 views

3 answers

34

C Program Output and Explaination
void fun(int *p) { int q = 10; p = &q; z } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; }

answer selected May 30, 2019 in Programming | 267 views

0 answers

35

pda self doubt
The language accepted by a DPDA with a final state is more compared to the DPDA with empty stack. DPDA with empty stack accepts LR(0) grammar. Can someone explain in depth/or give good reference links?

commented May 14, 2019 in Theory of Computation | 49 views

1 answer

36

self doubt dfa
Given an algorithm to tell whether a regular language L contains at least 100 strings

commented May 13, 2019 in Theory of Computation | 56 views

0 answers

37

Operating system swapping process
Please help me explaining this in simpler words: If we were to swap out process P1 and swap in process P2, the I/O operation might then attempt to use memory that now belongs to process P2. There are two main solutions to this ... system buffers and process memory then occur only when the process is swapped in. Note that this double buffering itself adds overhead.

commented May 10, 2019 in Operating System | 69 views

2 answers

38

Self Doubt CPU
In Multi-processing Operating Systems: (a) Maximum utilization of CPU can be achieved (b) Maximum throughput is achieved (c) Maximum security can be achieved (d) Not suitable for Real time Applications

commented May 10, 2019 in Operating System | 228 views

2 answers

39

Multi Processing OS
In Multi Processing OS Maximum CPU Utilization can be achieved. Maximum throughput is achieved. which of the following is true ? a) 1 only b) 2 only c) both d) none ANS - A) 2 only Please explain it ?

commented May 7, 2019 in Operating System | 259 views

4 answers

40

GATE2007-IT-26
Consider $n$ jobs $J_1, J_2 \dots J_n$ such that job $J_i$ has execution time $t_i$ and a non-negative integer weight $w_i$. The weighted mean completion time of the jobs is defined to be $\frac{\sum_{i=1}^{n}w_iT_i}{\sum_{i=1}^{n}w_i}$, ... of the jobs? Non-decreasing order of $t_i$ Non-increasing order of $w_i$ Non-increasing order of $w_it_i$ Non-increasing order of $w_i/t_i$

commented Apr 29, 2019 in Operating System | 4.9k views