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 Raj_81
6
answers
1
GATE CSE 2021 Set 2 | Question: 44
If the numerical value of a $2$-byte unsigned integer on a little endian computer is $255$ more than that on a big endian computer, which of the following choices represent(s) the unsigned integer on a little endian computer? $0\text{x}6665$ $0\text{x} 0001$ $0\text{x} 4243$ $0\text{x} 0100$
If the numerical value of a $2$-byte unsigned integer on a little endian computer is $255$ more than that on a big endian computer, which of the following choices represe...
14.5k
views
commented
Dec 20, 2021
Digital Logic
gatecse-2021-set2
multiple-selects
digital-logic
number-representation
little-endian-big-endian
2-marks
+
–
3
answers
2
GATE CSE 2021 Set 1 | Question: 19
There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that: The fastest computer gets the toughest job and the slowest computer gets the easiest job. Every computer gets at least one job. The number of ways in which this can be done is ___________.
There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that:The fastest computer g...
11.8k
views
commented
Mar 30, 2021
Combinatory
gatecse-2021-set1
combinatory
counting
numerical-answers
1-mark
+
–
2
answers
3
GATE2016 EC-3: GA-9
Find the area bounded by the lines $3x + 2y=14, 2x - 3y = 5$ in the first quadrant. $14.95$ $15.25$ $15.70$ $20.35$
Find the area bounded by the lines $3x + 2y=14, 2x - 3y = 5$ in the first quadrant.$14.95$$15.25$$15.70$$20.35$
5.0k
views
commented
Mar 18, 2021
Quantitative Aptitude
gate2016-ec-3
cartesian-coordinates
geometry
normal
+
–
3
answers
4
GATE CSE 1993 | Question: 7.10
Assume that the following jobs are to be executed on a single processor system ... time (completion time) for job $p$ if scheduling is round robin with time slice $1$ $4$ $10$ $11$ $12$ None of the above
Assume that the following jobs are to be executed on a single processor system$$\begin{array}{|c|c|} \hline \textbf{Job Id} & \textbf{CPU Burst Time} \\\hline \text{p} ...
13.2k
views
commented
Mar 17, 2021
Operating System
gate1993
operating-system
process-scheduling
normal
+
–
2
answers
5
FAQ-5
How to attempt Gate exam ?
How to attempt Gate exam ?
1.8k
views
commented
Mar 10, 2021
GATE
faq
+
–
2
answers
6
GATE Overflow Test Series | Mock GATE | Test 2 | Question: 56
Station $A$ is sending data to station $B$ over a full-duplex error-free channel. A sliding window protocol is being used for flow control. The send and receive window size is being used for flow control with both the window ... link is $200\;\mu s.$ What is the max achievable throughput in this communication in Mega bytes per second?
Station $A$ is sending data to station $B$ over a full-duplex error-free channel. A sliding window protocol is being used for flow control. The send and receive window si...
520
views
commented
Jan 22, 2021
Computer Networks
go2025-mockgate-2
numerical-answers
normal
sliding-window-protocol
+
–
2
answers
7
GATE Overflow Test Series | Mock GATE | Test 1 | Question: 31
Which of the following is the correct first order logic representation for the below sentence? $\text{ Bill has at most one sister"}$ here $\text{SisterOf}(x,y) = x$ is sister of $y$ ... $\exists x(\text{SisterOf(x,Bill)} \wedge \forall y(\text{SisterOf(y,Bill)} \rightarrow (x = y)) $
Which of the following is the correct first order logic representation for the below sentence?$$\text{“Bill has at most one sister"}$$ here $\text{SisterOf}(x,y) = x...
739
views
commented
Jan 12, 2021
Mathematical Logic
go2025-mockgate-1
first-order-logic
multiple-selects
mathematical-logic
+
–
4
answers
8
GATE IT 2005 | Question: 82b
A database table $T_1$ has $2000$ records and occupies $80$ disk blocks. Another table $T_2$ has $400$ records and occupies $20$ disk blocks. These two tables have to be joined as per a specified join condition that needs to be evaluated for ... outer loop, the reduction in number of block accesses required for reading the data will be $0$ $30400$ $38400$ $798400$
A database table $T_1$ has $2000$ records and occupies $80$ disk blocks. Another table $T_2$ has $400$ records and occupies $20$ disk blocks. These two tables have to be ...
16.3k
views
commented
Jan 3, 2021
Databases
gateit-2005
databases
normal
joins
+
–
10
answers
9
GATE CSE 2016 Set 2 | Question: 29
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.
17.9k
views
commented
Dec 24, 2020
Combinatory
gatecse-2016-set2
modular-arithmetic
normal
numerical-answers
+
–
2
answers
10
TOC - What is quotient operation ?
Let A = {(a*b*)} and B = {bb, ba, bbb}. Then A/B represents of the following language when / is quotient operation. a) ∅ b) {b*} c) {a*b*} d) None What is the quotient operation here, and how to operate it on given languages.
Let A = {(a*b*)} and B = {bb, ba, bbb}. Then A/B represents of the following language when / is quotient operation.a) ∅b) {b*}c) {a*b*}d) NoneWhat is the quotient o...
3.7k
views
commented
Dec 14, 2020
Theory of Computation
theory-of-computation
+
–
1
answer
11
GATE Overflow Test Series | Computer Organization and Architecture | Test 1 | Question: 30
Consider a CPU with an average CPI of $1.4$ ... allocate policy with the probability of a cache block being dirty being $0.15$ (round off to $2$ decimal places).
Consider a CPU with an average CPI of $1.4$ when all memory accesses hit on the cache.Assume an instruction mix$$\begin{array}{|c | c|}\hline\text{ALU }& 45\%\\\text{LOAD...
826
views
commented
Nov 13, 2020
CO and Architecture
go2025-coa-1
numerical-answers
normal
cache-memory
+
–
2
answers
12
test series
Consider the following orders of transactions: T2:R(x); T3:W(x); T3:commit; T1:W(x); T1:commit; T2:R(y); T2:W(z); T2:commit; T4:R(x); T4:R(y); T4:commit. If S is serializable, then how many conflict serial orderings of S is possible? (A)10 (B)11 (C)8 (D)13
Consider the following orders of transactions:T2:R(x); T3:W(x); T3:commit; T1:W(x); T1:commit; T2:R(y); T2:W(z); T2:commit; T4:R(x); T4:R(y); T4:commit.If S is serializab...
6.0k
views
comment edited
Oct 27, 2020
6
answers
13
deadlock
If a process is in unsafe state, then: (a) It is in deadlock (b) It might successfully complete (c) It will lead to deadlock (d) None of the above
If a process is in unsafe state, then:(a) It is in deadlock (b) It might successfully complete(c) It will lead to deadlock (d) None of the above
10.7k
views
commented
Oct 17, 2020
Operating System
deadlock-prevention-avoidance-detection
bankers-algorithm
+
–
2
answers
14
ISRO2018-66
Of the following sorting algorithms, which has a running time that is least dependent on the initial ordering of the input? Mege Sort Insertion Sort Selection Sort Quick Sort
Of the following sorting algorithms, which has a running time that is least dependent on the initial ordering of the input?Mege SortInsertion SortSelection SortQuick Sort...
5.6k
views
commented
Oct 7, 2020
Algorithms
isro2018
algorithms
sorting
+
–
7
answers
15
number of WAR dependencies
Consider the following instructions. $I_1:R_1=100$ $I_2:R_1=R_2+R_4$ $I_3:R_2=R_4+25$ $I_4:R_4=R_1+R_3$ $I_5:R_1=R_1+30$ Calculate sum of ($\text{WAR, RAW and WAW}$) dependencies the above instructions. $10$ $12$ $6$ $8$
Consider the following instructions.$I_1:R_1=100$$I_2:R_1=R_2+R_4$$I_3:R_2=R_4+25$$I_4:R_4=R_1+R_3$$I_5:R_1=R_1+30$Calculate sum of ($\text{WAR, RAW and WAW}$) dependenci...
6.7k
views
commented
Oct 4, 2020
CO and Architecture
co-and-architecture
data-dependency
+
–
3
answers
16
GATE CSE 2014 Set 1 | Question: 20
Which one of the following is FALSE? User level threads are not scheduled by the kernel. When a user level thread is blocked, all other threads of its process are blocked. Context switching between user level threads is faster than context switching between kernel level threads. Kernel level threads cannot share the code segment.
Which one of the following is FALSE?User level threads are not scheduled by the kernel.When a user level thread is blocked, all other threads of its process are blocked.C...
24.7k
views
commented
Sep 5, 2020
Operating System
gatecse-2014-set1
operating-system
threads
normal
+
–
3
answers
17
GATE IT 2007 | Question: 62
Let us consider a statistical time division multiplexing of packets. The number of sources is $10$. In a time unit, a source transmits a packet of $1000$ bits. The number of sources sending data for the first $20$ ... unit. Then the average number of backlogged of packets per time unit during the given period is $5$ $4.45$ $3.45$ $0$
Let us consider a statistical time division multiplexing of packets. The number of sources is $10$. In a time unit, a source transmits a packet of $1000$ bits. The number...
13.0k
views
commented
Aug 17, 2020
Computer Networks
gateit-2007
computer-networks
communication
normal
+
–
1
answer
18
Peter Linz Edition 4 Exercise 3.1 Question 10 (Page No. 76)
Give a regular expression for L = $\left \{a^{n}b^{m};n\geq 1,m \geq 1,nm \geq3 \right \}$
Give a regular expression forL = $\left \{a^{n}b^{m};n\geq 1,m \geq 1,nm \geq3 \right \}$
2.3k
views
commented
Jul 6, 2020
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
regular-expression
+
–
12
answers
19
GATE CSE 2006 | Question: 48
Let $T$ be a depth first search tree in an undirected graph $G$. Vertices $u$ and $ν$ are leaves of this tree $T$. The degrees of both $u$ and $ν$ in $G$ are at least $2$ ... exist a cycle in $G$ containing $u$ and $ν$ There must exist a cycle in $G$ containing $u$ and all its neighbours in $G$
Let $T$ be a depth first search tree in an undirected graph $G$. Vertices $u$ and $ν$ are leaves of this tree $T$. The degrees of both $u$ and $ν$ in $G$ are at least $...
21.1k
views
commented
Jul 3, 2020
Algorithms
gatecse-2006
algorithms
graph-algorithms
normal
+
–
2
answers
20
GATE2015 EC-3: GA-5
If $x > y > 1,$ which of the following must be true$?$ $\ln x > \ln y$ $e^{x} > e^{y} $ $y^x > x^y $ $\cos x > \cos y$ (i) and (ii) (i) and (iii) (iii) and (iv) (ii) and (iv)
If $x y 1,$ which of the following must be true$?$$\ln x \ln y$$e^{x} e^{y} $$y^x x^y $$\cos x \cos y$(i) and (ii)(i) and (iii)(iii) and (iv)(ii) and (iv)
2.1k
views
commented
Dec 22, 2019
Quantitative Aptitude
gate2015-ec-3
general-aptitude
quantitative-aptitude
functions
+
–
1
answer
21
MadeEasy Test Series: Programming & DS - Stack
Consider a stack S given below with elements 1,2,3 along with the usual operations push(), pop() and top() as shown. The number of elements that will remain in the stack after the parsing of the input string according to the above SDT rules is _______ I think the answer should be 5 but 4 is provided as answer.
Consider a stack S given below with elements 1,2,3 along with the usual operations push(), pop() and top() as shown.The number of elements that will remain in the stack a...
1.7k
views
commented
Oct 1, 2019
DS
made-easy-test-series
data-structures
stack
+
–
4
answers
22
C programming
Does C perform array out of bound checking? What is the output of the following program? int main() { int i; int arr[5] = {0}; for (i = 0; i <= 5; i++) printf("%d ", arr[i]); return 0; }
Does C perform array out of bound checking? What is the output of the following program?int main() { int i; int arr[5] = {0}; for (i = 0; i <= 5; i++) printf("%d ", arr[i...
1.7k
views
commented
Sep 30, 2019
Programming in C
programming-in-c
array
+
–
0
answers
23
Question on Array
Caption
Caption
853
views
commented
Sep 29, 2019
Programming in C
algorithms
array
+
–
1
answer
24
ARRAY
A Sorted array of n elements contains 0 and 1 to find out majority of 0 and 1.How much time it will take??? and please explain Meaning -majority of 0 and 1??
A Sorted array of n elements contains 0 and 1 to find out majority of 0 and 1.How much time it will take???and please explain Meaning -majority of 0 and 1??
1.2k
views
commented
Sep 29, 2019
DS
array
+
–
0
answers
25
Ace Test Series: Compilers - Run Time Environment
460
views
commented
Sep 26, 2019
Compiler Design
ace-test-series
compiler-design
runtime-environment
+
–
2
answers
26
Find the number of Synthesized attributes
how many Synthesized attributes are present in the given Syntax directed Definition? (Answer key says only 2 Synthesized attributes are present. How to find them? Any idea?)
how many Synthesized attributes are present in the given Syntax directed Definition?(Answer key says only 2 Synthesized attributes are present. How to find them? Any idea...
2.4k
views
commented
Sep 25, 2019
Compiler Design
compiler-design
syntax-directed-translation
+
–
0
answers
27
MadeEasy Test Series 2018: Compiler Design - Parsing
Consider the following grammar G: The grammar G is A. LL (1) grammar and not LR (0) B. LL (1) and LR (0) C. Not LL (1) but LR (0) D. Neither LL (1) nor LR (0) Here B should be correct option?
Consider the following grammar G:The grammar G isA. LL (1) grammar and not LR (0)B. LL (1) and LR (0)C. Not LL (1) but LR (0)D. Neither LL (1) nor LR (0)Here B should be ...
278
views
commented
Sep 24, 2019
Compiler Design
compiler-design
parsing
made-easy-test-series
+
–
1
answer
28
MadeEasy Workbook: Compiler Design - Parsing
COMMENT(how the below statement is true) LL(k) languages are proper subset of LL(k-1) languages.
COMMENT(how the below statement is true)LL(k) languages are proper subset of LL(k-1) languages.
340
views
answered
Sep 23, 2019
Compiler Design
compiler-design
parsing
made-easy-booklet
+
–
2
answers
29
parser doubt
Consider the statements: (i) Every regular grammar is LL(1) (ii) Every LL(1) grammar is LALR(1) (iii) All LR(0) grammars are LL(k) (iv) A context-free grammar without left factoring and left recursion can be ambiguous Which of the above statement/s is/are TRUE? (i) only (i) and (iii) only (ii) and (iv) only (iv) only
Consider the statements: (i) Every regular grammar is LL(1) (ii) Every LL(1) grammar is LALR(1) (iii) All LR(0) grammars are LL(k) (iv) A context-free grammar without lef...
1.4k
views
answered
Sep 23, 2019
Compiler Design
compiler-design
parsing
grammar
+
–
3
answers
30
Made Easy Test Series:Programming-String
#include<stdio.h> #include<string.h> int main(void) { char *a="MADEEASY"; char *b="GATECSIT2019"; char *r=a; char *s=b; printf("%d",(int)strlen(b+3[r]-1[s])); return 0; } Ans is given $8.$ I know basic thing, but couldnot getting what strlen(b+3[r]-1[s]) returning?? Plz explain.
#include<stdio.h #include<string.h int main(void) { char *a="MADEEASY"; char *b="GATECSIT2019"; char *r=a; char *s=b; printf("%d",(int)strlen(b+3[r]-1[s])); return 0; }An...
1.6k
views
commented
Sep 17, 2019
Programming in C
made-easy-test-series
programming
programming-in-c
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register