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
Recent activity by fahad1247
3
answers
1
GATE CSE 2021 Set 1 | Question: 29
Assume that a $12$-bit Hamming codeword consisting of $8$-bit data and $4$ check bits is $d_8d_7d_6d_5c_8d_4d_4d_3d_2c_4d_1c_2c_1$ ... $0$ and $y$ is $1$ $x$ is $1$ and $y$ is $0$ $x$ is $1$ and $y$ is $1$
Assume that a $12$-bit Hamming codeword consisting of $8$-bit data and $4$ check bits is $d_8d_7d_6d_5c_8d_4d_4d_3d_2c_4d_1c_2c_1$, where the data bits and the check bits...
15.7k
views
commented
Feb 20, 2021
Computer Networks
gatecse-2021-set1
computer-networks
hamming-code
2-marks
error-detection
+
–
5
answers
2
GATE CSE 2018 | Question: 32
Consider the following C code. Assume that unsigned long int type length is $64$ bits. unsigned long int fun(unsigned long int n) { unsigned long int i, j=0, sum = 0; for( i=n; i>1; i=i/2) j++; for( ; j>1; j=j/2) sum++; return sum; } The value returned when we call fun with the input $2^{40}$ is: $4$ $5$ $6$ $40$
Consider the following C code. Assume that unsigned long int type length is $64$ bits.unsigned long int fun(unsigned long int n) { unsigned long int i, j=0, sum = 0; for(...
16.2k
views
commented
Feb 9, 2021
Programming in C
gatecse-2018
programming-in-c
normal
programming
2-marks
+
–
5
answers
3
GATE CSE 2015 Set 2 | Question: 25
A computer system implements a $40\;\text{-bit}$ virtual address, page size of $8\;\text{kilobytes}$, and a $128\text{-entry}$ translation look-aside buffer $\text{(TLB)}$ organized into $32$ sets each having $4$ ways. Assume that the $\text{TLB}$ tag does not store any process id. The minimum length of the $\text{TLB}$ tag in bits is ______.
A computer system implements a $40\;\text{-bit}$ virtual address, page size of $8\;\text{kilobytes}$, and a $128\text{-entry}$ translation look-aside buffer $\text{(TLB)}...
21.9k
views
answered
Jan 28, 2021
Operating System
gatecse-2015-set2
operating-system
virtual-memory
easy
numerical-answers
+
–
7
answers
4
GATE IT 2008 | Question: 43
If we use Radix Sort to sort $n$ integers in the range $\left (n^{k/2}, n^k \right ]$, for some $k > 0$ which is independent of $n$, the time taken would be? $\Theta(n)$ $\Theta(kn)$ $\Theta(n \log n)$ $\Theta(n^2)$
If we use Radix Sort to sort $n$ integers in the range $\left (n^{k/2}, n^k \right ]$, for some $k 0$ which is independent of $n$, the time taken would be?$\Theta(n)$$\T...
21.0k
views
commented
Jan 22, 2021
Algorithms
gateit-2008
algorithms
sorting
normal
+
–
5
answers
5
GATE CSE 2002 | Question: 2.21
Which combination of the following features will suffice to characterize an OS as a multi-programmed OS? More than one program may be loaded into main memory at the same time for execution If a program waits for certain events such as I/O, another program is immediately scheduled ... is immediately scheduled for execution. (a) (a) and (b) (a) and (c) (a), (b) and (c)
Which combination of the following features will suffice to characterize an OS as a multi-programmed OS?More than one program may be loaded into main memory at the same t...
12.9k
views
commented
Jan 16, 2021
Operating System
gatecse-2002
operating-system
normal
process
+
–
4
answers
6
GATE CSE 2012 | Question: 13
What is the correct translation of the following statement into mathematical logic? “Some real numbers are rational” $\exists x (\text{real}(x) \lor \text{rational}(x))$ $\forall x (\text{real}(x) \to \text{rational}(x))$ $\exists x (\text{real}(x) \wedge \text{rational}(x))$ $\exists x (\text{rational}(x) \to \text{real}(x))$
What is the correct translation of the following statement into mathematical logic?“Some real numbers are rational”$\exists x (\text{real}(x) \lor \text{rational}(x))...
8.8k
views
commented
Oct 5, 2020
Mathematical Logic
gatecse-2012
mathematical-logic
easy
first-order-logic
+
–
5
answers
7
GATE CSE 2013 | Question: 20
In a $k$-way set associative cache, the cache is divided into $v$ sets, each of which consists of $k$ lines. The lines of a set are placed in sequence one after another. The lines in set $s$ are sequenced before the lines in set $(s+1)$. The main memory blocks are numbered 0 onwards. The ... $(j \text{ mod } k) * v \text{ to } (j \text{ mod } k) * v + (v-1) $
In a $k$-way set associative cache, the cache is divided into $v$ sets, each of which consists of $k$ lines. The lines of a set are placed in sequence one after another. ...
14.3k
views
commented
Oct 1, 2020
CO and Architecture
gatecse-2013
co-and-architecture
cache-memory
normal
+
–
8
answers
8
GATE CSE 2006 | Question: 46
Station $A$ needs to send a message consisting of $9$ packets to Station $B$ using a sliding window (window size $3$) and go-back-$n$ error control strategy. All packets are ready and immediately available for transmission. If every $5$th packet that $A$ ... what is the number of packets that $A$ will transmit for sending the message to $B$? $12$ $14$ $16$ $18$
Station $A$ needs to send a message consisting of $9$ packets to Station $B$ using a sliding window (window size $3$) and go-back-$n$ error control strategy. All packets ...
42.2k
views
commented
Sep 4, 2020
Computer Networks
gatecse-2006
computer-networks
sliding-window
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register