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 ayush.5
0
votes
1
GATE CSE 2015 Set 2 | Question: 48
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is ... adder is implemented by using four full adders. The total propagation time of this $4$-bit binary adder in microseconds is ______.
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that o...
62.1k
views
answered
Jan 21, 2021
Digital Logic
gatecse-2015-set2
digital-logic
adder
normal
numerical-answers
+
–
0
votes
2
GATE CSE 2015 Set 2 | Question: 48
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is ... adder is implemented by using four full adders. The total propagation time of this $4$-bit binary adder in microseconds is ______.
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that o...
62.1k
views
answered
Jan 21, 2021
Digital Logic
gatecse-2015-set2
digital-logic
adder
normal
numerical-answers
+
–
0
votes
3
GATE CSE 2015 Set 2 | Question: 48
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is ... adder is implemented by using four full adders. The total propagation time of this $4$-bit binary adder in microseconds is ______.
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that o...
62.1k
views
answered
Jan 21, 2021
Digital Logic
gatecse-2015-set2
digital-logic
adder
normal
numerical-answers
+
–
5
votes
4
ISRO2020-5
An array of $2$ ...
An array of $2$ two byte integers is stored in big endian machine in byte addresses as shown below. What will be its storage pattern in little endian machine ?$$\begin{ar...
3.8k
views
answered
Jan 1, 2021
CO and Architecture
isro-2020
co-and-architecture
floating-point-representation
normal
little-endian-big-endian
+
–
2
votes
5
Candidate key
A candidate key should have unique values and a chosen CK is called primary key. Null is also unique. Why (C) is not answer?
A candidate key should have unique values and a chosen CK is called primary key. Null is also unique. Why (C) is not answer?
2.0k
views
answered
Nov 26, 2020
0
votes
6
INTERESTING QUESTION ON ER DIAGRAMS
How many minimum number of tables are required for this ER Diagram?
How many minimum number of tables are required for this ER Diagram?
1.0k
views
answered
Oct 21, 2020
Databases
databases
er-diagram
+
–
4
votes
7
IEEE 754 Standard
In IEEE $754$ single floating point format, how many numbers can be represented in the interval [10, 16)? A. $2^{21}$ B. $3 * 2^{21}$ C. $5 * 2^{21}$ D. $2^{22}$
In IEEE $754$ single floating point format, how many numbers can be represented in the interval [10, 16)? A. $2^{21}$ B. $3 * 2^{21}$ C. $5 * 2^{21}$ ...
2.1k
views
answered
Oct 17, 2020
Digital Logic
digital-logic
floating-point-representation
ieee-representation
+
–
2
votes
8
Graph Theory conceptual
A simple graph is one in which there are no self loops and each pair of distinct vertices is connected by at most one edge. Let G be a simple graph on 8 vertices such that there is a vertex of degree 1, a vertex of degree 2, a vertex of degree 3, a vertex of degree ... a vertex of degree 7. Which of the following can be the degree of the last vertex? (A) 3 (B) 0 (C) 5 (D) 4
A simple graph is one in which there are no self loops and each pair of distinct vertices is connected by at most one edge. Let G be a simple graph on 8 vertices such tha...
1.1k
views
answered
Oct 14, 2020
Graph Theory
graph-theory
discrete-mathematics
+
–
1
votes
9
ISI2015-MMA-42
Let $\lambda_1, \lambda_2, \lambda_3$ denote the eigenvalues of the matrix $A \begin{pmatrix} 1 & 0 & 0 \\ 0 & \cos t & \sin t \\ 0 & - \sin t & \cos t \end{pmatrix}.$ If $\lambda_1+\lambda_2+\lambda_3 = \sqrt{2}+1$ ... $\{ - \frac{\pi}{4}, \frac{\pi}{4} \}$ $\{ - \frac{\pi}{3}, \frac{\pi}{3} \}$
Let $\lambda_1, \lambda_2, \lambda_3$ denote the eigenvalues of the matrix$$A \begin{pmatrix} 1 & 0 & 0 \\ 0 & \cos t & \sin t \\ 0 & – \sin t & \cos t \end{pmatrix}.$$...
776
views
answered
Oct 12, 2020
Linear Algebra
isi2015-mma
linear-algebra
matrix
eigen-value
+
–
3
votes
10
ISI2016-MMA-19
Let $A$ be a real $2 \times 2$ matrix. If $5+3i$ is an eigenvalue of $A$, then $det(A)$ equals 4 equals 8 equals 16 cannot be determined from the given information
Let $A$ be a real $2 \times 2$ matrix. If $5+3i$ is an eigenvalue of $A$, then $det(A)$equals 4equals 8equals 16cannot be determined from the given information
643
views
answered
Oct 12, 2020
Linear Algebra
isi2016-mmamma
linear-algebra
matrix
eigen-value
+
–
2
votes
11
ISI2015-DCG-22
The value of $\begin{vmatrix} 1 & \log _x y & \log_x z \\ \log _y x & 1 & \log_y z \\ \log _z x & \log _z y & 1 \end{vmatrix}$ is $0$ $1$ $-1$ None of these
The value of $$\begin{vmatrix} 1 & \log _x y & \log_x z \\ \log _y x & 1 & \log_y z \\ \log _z x & \log _z y & 1 \end{vmatrix}$$ is$0$$1$$-1$None of these
502
views
answered
Oct 12, 2020
Linear Algebra
isi2015-dcg
linear-algebra
determinant
+
–
4
votes
12
NIELIT 2016 DEC Scientist B (IT) - Section B: 26
Two eigenvalues of a $3\times3$ real matrix $P$ are $(2+ \sqrt-1)$ and $3$. The determinant of $P$ is ________. $0$ $1$ $15$ $-1$
Two eigenvalues of a $3\times3$ real matrix $P$ are $(2+ \sqrt-1)$ and $3$. The determinant of $P$ is ________.$0$$1$$15$$-1$
983
views
answered
Oct 12, 2020
Linear Algebra
nielit2016dec-scientistb-it
engineering-mathematics
linear-algebra
determinant
eigen-value
+
–
1
votes
13
MadeEasy Test Series: Set Theory & Algebra - Relations
461
views
answered
Oct 12, 2020
Mathematical Logic
made-easy-test-series
set-theory&algebra
relations
+
–
3
votes
14
TIFR-2013-Maths-A: 3
True/False Question : The equation $x^{3}+3x-4=0$ has exactly one real root.
True/False Question :The equation $x^{3}+3x-4=0$ has exactly one real root.
314
views
answered
Oct 12, 2020
TIFR
tifrmaths2013
true-false
+
–
5
votes
15
OS NPTEL ASSIGNMENT QUESTION
Degree of concurrency in threads can be arranged in the manner One-to-one > many-to-one > many-to-many One-to-one > many-to-many > many-to-one Many-to-many > many-to-one > one-to-one None of the above answer given is A but according to me answer is B. Someone please confirm
Degree of concurrency in threads can be arranged in the manner One-to-one many-to-one many-to-many One-to-one many-to-many many-to-one Many-to-many many-to-one one-...
1.5k
views
answered
Oct 12, 2020
Unknown Category
threads
+
–
2
votes
16
TIFR-2012-Maths-D: 31
True/False Question: $f : \left [ 0,\infty \right ]\rightarrow \left [ 0,\infty \right ]$ is continuous and bounded then $f$ has a fixed point.
True/False Question:$f : \left [ 0,\infty \right ]\rightarrow \left [ 0,\infty \right ]$ is continuous and bounded then $f$ has a fixed point.
726
views
answered
Sep 7, 2020
TIFR
tifrmaths2012
+
–
3
votes
17
Self Doubt:Paging
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a frame at that time it may not fully occupy the frame. Similarly, if ... exceed a page size. Then there should be external fragmentation, right? So why is it said that paging does not have external fragmentation?
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a...
1.7k
views
answered
Aug 31, 2020
Operating System
memory-management
paging
operating-system
multilevel-paging
self-doubt
+
–
2
votes
18
difference between compulsory miss, conflict miss and capacity miss
I want to clearly understand the difference between compulsory miss, conflict miss and capacity miss what I understood is compulsory miss: when a block of main memory is trying to occupy fresh empty line of cache, it ... Because in associative mapping, no block of main memory tries to occupy already filled line. is this correct?
I want to clearly understand the difference between compulsory miss, conflict miss and capacity misswhat I understood iscompulsory miss: when a block of main memory is tr...
18.7k
views
answered
Jul 22, 2020
CO and Architecture
co-and-architecture
cache-memory
misses
+
–
2
votes
19
Kenneth Rosen Edition 7 Exercise 2.3 Question 40 (Page No. 154)
Let $f$ be a function from the set $A$ to the set $B$. Let $S$ adn$T$ be subsets of $A$ .Show that $f(S \cup T) = f(S) \cup f(T)$ $f(S \cap T) = f(S) \cap f(T)$
Let $f$ be a function from the set $A$ to the set $B$. Let $S$ adn$T$ be subsets of $A$ .Show that$f(S \cup T) = f(S) \cup f(T)$$f(S \cap T) = f(S) \cap f(T)$
1.2k
views
answered
Jul 19, 2020
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
set-theory&algebra
+
–
2
votes
20
NIELIT 2016 MAR Scientist C - Section C: 16
If $f:\{a,b\}^{\ast}\rightarrow \{a,b\}^{\ast }$ be given by $f(n)=ax$ for every value of $n\in \{a,b\}$, then $f$ is one to one not onto one to one and onto not one to one and not onto not one to one and onto
If $f:\{a,b\}^{\ast}\rightarrow \{a,b\}^{\ast }$ be given by $f(n)=ax$ for every value of $n\in \{a,b\}$, then $f$ isone to one not ontoone to one and ontonot one to one ...
856
views
answered
Jul 18, 2020
Set Theory & Algebra
nielit2016mar-scientistc
discrete-mathematics
set-theory&algebra
functions
+
–
3
votes
21
Counting number of pairs whose sum is less than k
How many pairs $(x,y)$ such that $x+y <= k$, where x y and k are integers and $x,y>=0, k > 0$. Solve by summation rules. Solve by combinatorial argument.
How many pairs $(x,y)$ such that $x+y <= k$, where x y and k are integers and $x,y>=0, k 0$.Solve by summation rules.Solve by combinatorial argument.
1.2k
views
answered
Jun 11, 2020
Combinatory
combinatory
summation
descriptive
+
–
1
votes
22
GATE IT 2005 | Question: 19, UGCNET-June2012-III: 57
A user level process in Unix traps the signal sent on a Ctrl-C input, and has a signal handling routine that saves appropriate files before terminating the process. When a Ctrl-C input is given to this process, what is the mode in which the signal handling routine executes? User mode Kernel mode Superuser mode Privileged mode
A user level process in Unix traps the signal sent on a Ctrl-C input, and has a signal handling routine that saves appropriate files before terminating the process. When ...
11.3k
views
answered
Oct 27, 2019
Operating System
gateit-2005
operating-system
os-protection
normal
ugcnetcse-june2012-paper3
+
–
2
votes
23
Test by Bikram | Computer Networks | Test 1 | Question: 20
Two hosts $A$ and $B$ are connected via a Router $R$ with two links $L_1$ and $L_2.$ Each link is $125m$ long and has a bandwidth of $109 \;bps.$ If router queuing delay is $5$ microsec and propagation speed is $250,000$ km/sec the total transfer delay of $1$ kB packet from $A$ to $B$ is _______ microsec
Two hosts $A$ and $B$ are connected via a Router $R$ with two links $L_1$ and $L_2.$ Each link is $125m$ long and has a bandwidth of $109 \;bps.$ If router queuing delay...
1.1k
views
answered
Sep 4, 2019
Computer Networks
tbb-cn-1
numerical-answers
routing
+
–
3
votes
24
GATE IT 2007 | Question: 83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes...
23.3k
views
answered
Aug 31, 2019
Operating System
gateit-2007
operating-system
disk-scheduling
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register