Dark Mode

Recent questions without answers

3 votes

0 answers

15451

MadeEasy Subject Test: Digital Logic - Circuit Output
For the circuit shown below: For how many number of clock pulses for which $y_2$ is '1' ? $ \text{A. 2 clock pulses} $ $ \text{B. 3 clock pulses} $ $ \text{C. 10 clock pulses} $ $ \text{D. 6 clock pulses} $

Sachin Mittal 1 asked in Digital Logic Jan 3, 2017

by Sachin Mittal 1

555 views

0 votes

0 answers

15452

what is condition to know whether a function is differentiable or not ? regarding following.
f(x)=|x|

Wanted asked in Mathematical Logic Jan 3, 2017

by Wanted

235 views

1 vote

0 answers

15453

General doubt on Unrepeatable read, phantom read and lost update
what is the difference between Unrepeatable read, phantom read and lost update?

S Ram asked in Databases Jan 3, 2017

by S Ram

406 views

0 votes

0 answers

15454

question on eigen vector
how to find eigen vector of following equation 2x-2y+z=0 2x-2y+z=0 2x-2y+z=0 problem : there is matrix of 3*3 and then i calculate its eigenvalues which comes 2,2,3 and when i put 2 then i get above equation so what are eigen vector here?

Wanted asked in Mathematical Logic Jan 3, 2017

by Wanted

288 views

0 votes

0 answers

15455

Correct ans would be (B) right?

thor asked in Computer Networks Jan 3, 2017

by thor

307 views

0 votes

0 answers

15456

What are normalied Eigon Vectors ?
Give normalized eigon vector for 3*3 matrix A[ij] , in general

PEKKA asked in Linear Algebra Jan 3, 2017

by PEKKA

265 views

0 votes

0 answers

15457

harshit agarwal asked in Computer Networks Jan 2, 2017

by harshit agarwal

310 views

1 vote

0 answers

15458

testbook
If the initial capacity of the router is 1Mbit. Number of tokens generated is 6 Mbit/sec and the output rate is maintained as 8 Mnit/sec. Calculate the total time of the bursty traffic. 1 sec 0.5 sec 0.25 sec 2 sec

harshit agarwal asked in Computer Networks Jan 2, 2017

by harshit agarwal

422 views

3 votes

0 answers

15459

Memory Reference count
Consider the 2 GHz clock frequency processor used execute the following program segment. Assume that memory reference consumers 4 cycles and ALU operations consumes 2 cycles then total time required to complete the program execution (in ns) is ___________.

Anirban Biswas asked in CO and Architecture Jan 2, 2017

by Anirban Biswas

599 views

2 votes

0 answers

15460

madeeasy test
how to solve this? please explain

S Ram asked in Databases Jan 2, 2017

by S Ram

305 views

2 votes

0 answers

15461

ER Model
Consider the following ER diagram Which of the following represents the total number of attributes in the minimized relation of above ER diagram ? 16 15 13 12

Anirban Biswas asked in Databases Jan 2, 2017

by Anirban Biswas

692 views

0 votes

0 answers

15462

Concurrency
Consider the following schedule : The number of serial schedules which are view equal to schedule (S) ___________.

Anirban Biswas asked in Databases Jan 2, 2017

by Anirban Biswas

189 views

0 votes

0 answers

15463

monty asked in CO and Architecture Jan 2, 2017

by monty

303 views

0 votes

0 answers

15464

CO - BIT MANIPULATION INSTRUCTIONS
What is the purpose of having SHL & SHLA, when both perform the same operations. SHRA is useful in division of numbers in sign magnitude representation by any power of 2. But why is SHLA required?

Kaushik.P.E asked in CO and Architecture Jan 2, 2017

120 views

0 votes

0 answers

15465

CO Cache Memory
Please suggest a good source for understanding cache circuitory from GATE point of view (not mapping alone). And please validate the following. If someone can wrtite a blog post regarding this it will be very helpful for everyone. Direct Mapped Cache: No of Comparators ... set) And One K-1 Multiplexors. This is done to enable parallel checking of blocks in a set. Thanks in advance.

Kaushik.P.E asked in CO and Architecture Jan 2, 2017

193 views

1 vote

0 answers

15466

Made easy Test
What is the difference between minimal candidate key and candidate keys? is minimal CK cotains only single character and having power to ditermin all the other attributes of given relation?

S Ram asked in Databases Jan 2, 2017

by S Ram

165 views

1 vote

0 answers

15467

GBN Question
Compare $GBN$, $SR$, and $TCP$ (no delayed $ACK$). Assume that the timeout values for all three protocols are sufficiently long such that $5$ consecutive data segments and their corresponding $ACK$s can be received (if not lost in the channel) by the ... explain this quesiton for GBN and SR with possible answer. link ftp://ftp.cs.sjtu.edu.cn:990/shen-lp/assign3/assign3-5100309313.pdf

dd asked in Computer Networks Jan 2, 2017

by dd

2.1k views

7 votes

0 answers

15468

gate 2011
The fuel consumed by a motorcycle during a journey while traveling at various speeds is indicated in the graph below. The distances covered during four laps of the journey are listed in the table below Lap Distance (kilometers) Average speed (kilometers per hour) P 15 15 Q 75 45 R ... , we can conclude that the fuel consumed per kilometer was least during the lap (A) P (B) Q (C) R (D) S

firki lama asked in Quantitative Aptitude Jan 2, 2017

2.1k views

0 votes

0 answers

15469

Prateek kumar asked in Digital Logic Jan 2, 2017

by Prateek kumar

159 views

1 vote

0 answers

15470

Discrete Mathematics Problem

Anup patel asked in Mathematical Logic Jan 2, 2017

244 views

2 votes

0 answers

15471

Turing Recognizable (TestBook Question)
Which of the following is/are NOT turing-recognizable? 1. L1={M1M2|M1M2 are Turing Machines with L(M1)=L(M2)} 2. L2={M,w|M is a Turing Machine that halts on input w} 3. L3={M,w|M is a Turing Machine that accepts string w} 4.All of the Above

Archies09 asked in Theory of Computation Jan 2, 2017

649 views

2 votes

0 answers

15472

IS It possible for an application to enjoy reliable data transfer even when the application runs over UDP?

Akriti sood asked in Computer Networks Jan 2, 2017

886 views

0 votes

0 answers

15473

reena_kandari asked in Theory of Computation Jan 2, 2017

by reena_kandari

573 views

1 vote

0 answers

15474

preorder complexity
time complexity to construct bst from preorder? a) O(n) b)O(nlogn) c)O(n^2) d)O(1) given O(nlogn) my doubt:- there are two approaches one that gives O(nlogn) (by finding the inorder traversal) and the other that gives O(n) :- set a ... >data..max .. INT_MAX}. reference:-http://www.geeksforgeeks.org/construct-bst-from-given-preorder-traversa/ so shouldn't it be O(n) ?

Sanket_ asked in Algorithms Jan 2, 2017

601 views

0 votes

0 answers

15475

What is probability of N1 succeeded in slot 5?
Suppose there are 4 nodes N1, N2, N3 and N4 are using a slotted ALOHA channel to send their own huge data. When competing all the nodes to transfer their data only one node will get succeeded with a probability P. The time is divided into slots S1, S2, ... -p)3)4 is because in first 4 slots ,any one can succeed and p*(1-p)3 for success of N1 in slot 5

Akriti sood asked in Computer Networks Jan 2, 2017

285 views

2 votes

0 answers

15476

Type checking Grammar
Which grammar is used for type checking?

reena_kandari asked in Theory of Computation Jan 2, 2017

by reena_kandari

624 views

0 votes

0 answers

15477

How is it possible to maintain the same frame size?
The minimum size of ethernet frame is 64 bytes long to make sure that the sender is able to detect the collision at the far end of the cable. If the Fast Ethernet with bandwidth 100 Mb/s also has the same 64 byte minimum frame size, but ... the cable length by a factor of 10 Frame size must be change i think both A and B can be the answer..

Akriti sood asked in Computer Networks Jan 2, 2017

1.3k views

0 votes

0 answers

15478

Weak Areas
I have below areas where I am not much condfident: Digital : Diff gate delays and overall circuit delays due to that. Network: Header + Data => Total data send by diff networks having diff capacity Please help with videos, resources, good Qtn URLs. Thank you .

pps121 asked in Study Resources Jan 2, 2017

by pps121

171 views

0 votes

0 answers

15479

PDA-ACCEPTANCE
// pda accept the string in 2 -ways.either by final state or empty stack. my doubt is in the diagram at state q1 is for every 'a' it pops one 'b'.when no of 'b' are equall it accept or not. and what is the language accepted by above PDA?

santhoshdevulapally asked in Theory of Computation Jan 2, 2017

by santhoshdevulapally

615 views

0 votes

0 answers

15480

How this statement is true
How this is true ? $_{r}^{\frac{n(n-1)}{2}}\textrm{C} = 2^{\frac{n(n-1))}{2}}$

PEKKA asked in Graph Theory Jan 2, 2017

by PEKKA

273 views

Page:

« prev
1
...
511
512
513
514
515
516
517
518
519
520
521
...
591
next »

Recent questions without answers