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 JashanArora
0
votes
1
UGC NET CSE | Junet 2015 | Part 2 | Question: 13
Given that $x=7.5, j=-1.0, n=1.0, m=2.0$ the value of $--x+j==x>n>=m$ is: $0$ $1$ $2$ $3$
Given that $x=7.5, j=-1.0, n=1.0, m=2.0$ the value of $ x+j==x>n>=m$ is:$0$$1$$2$$3$
3.0k
views
answered
Nov 19, 2020
Programming in C
ugcnetcse-june2015-paper2
programming-in-c
+
–
1
votes
2
TIFR CSE 2016 | Part B | Question: 8
Consider the following language $\mathsf{PRIMES} = \Biggl\{ \underbrace{111 \dots 11}_{p \: \text{ times} } : \: p \: \text{ is prime } \Biggl\}$ Then, which of the following is TRUE? $\mathsf{PRIMES}$ ... is decidable in polynomial time $\mathsf{PRIMES}$ is context free but not regular $\mathsf{PRIMES}$ is NP-complete and P $\neq$ NP
Consider the following language$$\mathsf{PRIMES} = \Biggl\{ \underbrace{111 \dots 11}_{p \: \text{ times} } : \: p \: \text{ is prime } \Biggl\}$$Then, which of the follo...
680
views
answered
Mar 8, 2020
Theory of Computation
tifr2016
theory-of-computation
decidability
p-np-npc-nph
+
–
0
votes
3
TIFR CSE 2016 | Part B | Question: 13
An undirected graph $G = (V, E)$ is said to be $k$-colourable if there exists a mapping $c: V \rightarrow \{1, 2, \dots k \}$ such that for every edge $\{u, v\} \in E$ we have $c(u) \neq c(v)$. Which of the following ... degree in $G$ There is a polynomial time algorithm to check if $G$ is $2$-colourable If $G$ has no triangle then it is $3$-colourable
An undirected graph $G = (V, E)$ is said to be $k$-colourable if there exists a mapping $c: V \rightarrow \{1, 2, \dots k \}$ such that for every edge $\{u, v\} \in E$ we...
1.3k
views
answered
Mar 7, 2020
Graph Theory
tifr2016
graph-theory
graph-coloring
+
–
4
votes
4
TIFR CSE 2012 | Part B | Question: 13
An array $A$ contains $n$ integers. We wish to sort $A$ in ascending order. We are told that initially no element of $A$ is more than a distance $k$ away from its final position in the sorted list. Assume that $n$ and $k$ are large ... $A$ can be sorted with constant $\cdot k^{2}n$ comparisons but not fewer.
An array $A$ contains $n$ integers. We wish to sort $A$ in ascending order. We are told that initially no element of $A$ is more than a distance $k$ away from its final p...
3.5k
views
answered
Mar 2, 2020
Algorithms
tifr2012
algorithms
sorting
+
–
1
votes
5
GATE IT 2005 | Question: 52
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which of the following statements is always TRUE? There exists a cutset in $G$ having ... $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which ...
20.8k
views
answered
Mar 1, 2020
Algorithms
gateit-2005
algorithms
spanning-tree
normal
+
–
5
votes
6
GATE IT 2004 | Question: 22
Which one of the following statements is FALSE? Packet switching leads to better utilization of bandwidth resources than circuit switching Packet switching results in less variation in delay than circuit switching Packet switching requires more per-packet processing than circuit switching Packet switching can lead to reordering unlike in circuit switching
Which one of the following statements is FALSE?Packet switching leads to better utilization of bandwidth resources than circuit switchingPacket switching results in less ...
13.3k
views
answered
Feb 29, 2020
Computer Networks
gateit-2004
computer-networks
network-switching
normal
+
–
2
votes
7
GATE IT 2004 | Question: 24
Which one of the following statements is FALSE? HTTP runs over TCP HTTP describes the structure of web pages HTTP allows information to be stored in a URL HTTP can be used to test the validity of a hypertext link
Which one of the following statements is FALSE?HTTP runs over TCPHTTP describes the structure of web pagesHTTP allows information to be stored in a URLHTTP can be used to...
11.6k
views
answered
Feb 29, 2020
Web Technologies
gateit-2004
web-technologies
normal
+
–
5
votes
8
GATE IT 2006 | Question: 55
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore initialized to $1$. The semaphore $F$ corresponds to the number of free slots in the buffer and is ... Signal $(F)$ in the Consumer process (I) only (II) only Neither (I) nor (II) Both (I) and (II)
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore ini...
13.5k
views
answered
Feb 28, 2020
Operating System
gateit-2006
operating-system
process-synchronization
normal
+
–
1
votes
9
TIFR CSE 2011 | Part B | Question: 25
Let $A_{TM}$ be defined as follows: $A_{TM}=\left \{ \left \langle M, w \right \rangle \mid \text{ The Turing machine $M$ accepts the word } w \right \}$ And let $L$ be some $\mathbf{NP}-$ complete language. Which of the following statements is ... Since $L$ is $\mathbf{NP}-$ complete, $A_{TM}$ is polynomial time reducible to $L$. $A_{TM} \notin \mathbf{NP}$.
Let $A_{TM}$ be defined as follows:$A_{TM}=\left \{ \left \langle M, w \right \rangle \mid \text{ The Turing machine $M$ accepts the word } w \right \}$And let $L$ be som...
2.2k
views
answered
Feb 27, 2020
Theory of Computation
tifr2011
theory-of-computation
decidability
+
–
7
votes
10
TIFR CSE 2011 | Part B | Question: 26
Consider the following two scenarios in the dining philosophers problem: First a philosopher has to enter a room with the table that restricts the number of philosophers to four. There is no restriction on the number of philosophers entering the room. Which ... . Starvation is possible in (i). Deadlock is not possible in (ii). Starvation is not possible in (ii)
Consider the following two scenarios in the dining philosophers problem:First a philosopher has to enter a room with the table that restricts the number of philosophers t...
6.5k
views
answered
Feb 27, 2020
Operating System
tifr2011
operating-system
process-synchronization
+
–
0
votes
11
TIFR CSE 2011 | Part B | Question: 40
Consider the class of object oriented languages. Which of the following is true? Pascal is an object oriented language. Object oriented languages require heap management. Object oriented languages cannot be implemented in ... languages are more powerful than declarative programming languages. Parallelism cannot be realized in object oriented languages.
Consider the class of object oriented languages. Which of the following is true?Pascal is an object oriented language.Object oriented languages require heap management.Ob...
1.2k
views
answered
Feb 27, 2020
Object Oriented Programming
tifr2011
programming
object-oriented-programming
non-gate
+
–
1
votes
12
UGC NET CSE | June 2019 | Part 2 | Question: 22
Consider the following C-code fragment running on a $32$-bit $X86$ machine: typedef struct { union { unsigned char a; unsigned short b; } U; unsigned char c; }S; S B[10]; S*p=&B[4]; S*q=&B[5]; p → U.b=0x1234; /* structure S takes 32-bits */ If M is the ... $(M,N)$ is $(1,1)$ $(3,2)$ $(1,2)$ $(4,4)$
Consider the following C-code fragment running on a $32$-bit $X86$ machine:typedef struct { union { unsigned char a; unsigned short b; } U; unsigned char c; }S; S B[10...
2.9k
views
answered
Feb 26, 2020
Programming in C
ugcnetcse-june2019-paper2
programming-in-c
+
–
0
votes
13
ME MOCK 4
Consider the following function: void madeeasy (int n) { if (n < 0) return; else { printf(n); madeeasy (- -n); madeeasy (n - -); printf(n); } } The sum of all values printed by madeeasy (5)_______ (I am getting -12 but given answer is 52)
Consider the following function:void madeeasy (int n) { if (n < 0) return; else { printf(n); madeeasy (- -n); madeeasy (n - -); printf(n); } }The sum of all values printe...
1.7k
views
answered
Feb 26, 2020
Programming in C
programming-in-c
recursion
made-easy-test-series
+
–
1
votes
14
#c lang
void main() { int i=6; for(--i; --i; i--) { printf(“%d”,i); } }
void main() { int i=6; for( i; i; i ) { printf(“%d”,i); } }
590
views
answered
Feb 26, 2020
Programming in C
programming-in-c
for-loop
+
–
0
votes
15
TIFR CSE 2010 | Part B | Question: 28
Consider the concurrent program: x: 1; cobegin x:= x + 3 || x := x + x + 2 coend Reading and writing of variables is atomic, but the evaluation of an expression is not atomic. The set of possible values of variable $x$ at the end of the execution of the program is: $\{4\}$ $\{8\}$ $\{4, 7, 10\}$ $\{4, 7, 8, 10\}$ $\{4, 7, 8\}$
Consider the concurrent program:x: 1; cobegin x:= x + 3 || x := x + x + 2 coendReading and writing of variables is atomic, but the evaluation of an expression is not atom...
3.8k
views
answered
Feb 26, 2020
Operating System
tifr2010
process-synchronization
+
–
6
votes
16
GATE CSE 2020 | Question: 26
Which of the following languages are undecidable? Note that $\left \langle M \right \rangle$ indicates encoding of the Turing machine M. $L_1 = \{\left \langle M \right \rangle \mid L(M) = \varnothing \}$ ... $L_1$, $L_3$, and $L_4$ only $L_1$ and $L_3$ only $L_2$ and $L_3$ only $L_2$, $L_3$, and $L_4$ only
Which of the following languages are undecidable? Note that $\left \langle M \right \rangle$ indicates encoding of the Turing machine M.$L_1 = \{\left \langle M \right \r...
14.6k
views
answered
Feb 24, 2020
Theory of Computation
gatecse-2020
theory-of-computation
decidability
2-marks
+
–
3
votes
17
ISRO2020-43
Which of the following is an efficient method of cache updating? Snoopy writes Write through Write within Buffered write
Which of the following is an efficient method of cache updating?Snoopy writesWrite throughWrite withinBuffered write
3.8k
views
answered
Feb 22, 2020
CO and Architecture
isro-2020
co-and-architecture
cache-memory
normal
+
–
7
votes
18
ISRO2020-24
In linear hashing, if blocking factor $bfr$, loading factor $i$ and file buckets $N$ are known, the number of records will be $cr= i+bfr+N$ $r=i-bfr-N$ $r=i+bfr-N$ $r=i ^{\ast} bfr ^{\ast} N$
In linear hashing, if blocking factor $bfr$, loading factor $i$ and file buckets $N$ are known, the number of records will be$cr= i+bfr+N$$r=i-bfr-N$$r=i+bfr-N$$r=i ^{\as...
3.3k
views
answered
Feb 22, 2020
Algorithms
isro-2020
algorithms
hashing
normal
+
–
7
votes
19
ISRO2020-2
Statements associated with registers of a CPU are given. Identify the false statement. The program counter holds the memory address of the instruction in execution Only opcode is transferred to the control unit An instruction in the instruction register consists of the ... The value of the program counter is incremented by $1$ once its value has been read to the memory address register
Statements associated with registers of a CPU are given. Identify the false statement.The program counter holds the memory address of the instruction in executionOnly opc...
3.9k
views
answered
Feb 22, 2020
CO and Architecture
isro-2020
co-and-architecture
control-unit
normal
+
–
4
votes
20
ISRO2020-26
The operating system and the other processes are protected from being modified by an already running process because they run at different time instants and not in parallel they are in different logical addresses they use a protection algorithm in the scheduler every address generated by the CPU is being checked against the relocation and limit parameters
The operating system and the other processes are protected from being modified by an already running process becausethey run at different time instants and not in paralle...
4.8k
views
answered
Feb 22, 2020
Operating System
isro-2020
operating-system
process-synchronization
easy
+
–
0
votes
21
ISRO2020-14
In a two-pass assembler, resolution of subroutine calls and inclusion of labels in the symbol table is done during second pass first pass and second pass respectively second pass and first pass respectively first pass
In a two-pass assembler, resolution of subroutine calls and inclusion of labels in the symbol table is done duringsecond passfirst pass and second pass respectivelysecond...
3.8k
views
answered
Feb 21, 2020
Compiler Design
isro-2020
compiler-design
assembler
easy
+
–
0
votes
22
ISRO2020-54
Checksum field in TCP header is ones complement of sum of header and data in bytes ones complement of sum of header, data and pseudo header in $16$ bit words dropped from $\textsf{IPv6}$ header format better than $\textsf{md5}$ or $\textsf{sh1}$ methods
Checksum field in TCP header isones complement of sum of header and data in bytesones complement of sum of header, data and pseudo header in $16$ bit wordsdropped from $\...
3.6k
views
answered
Feb 21, 2020
Computer Networks
isro-2020
computer-networks
tcp
normal
+
–
1
votes
23
ISRO2020-48
Properties of $\text{ DELETE'}$ and $\text{ TRUNCATE'}$ commands indicate that After the execution of $\text{ TRUNCATE'}$ operation, $\text{COMMIT}$, and $\text{ROLLBACK}$ statements cannot be performed to retrieve the lost data, while $\text{ DELETE'}$ ... allow it After the execution of $\text{ DELETE'}$ and $\text{ TRUNCATE'}$ operation no retrieval is possible for the lost data
Properties of $\text{‘DELETE’}$ and $\text{‘TRUNCATE’}$ commands indicate thatAfter the execution of $\text{‘TRUNCATE’}$ operation, $\text{COMMIT}$, and $\tex...
3.1k
views
answered
Feb 21, 2020
Databases
isro-2020
databases
sql
normal
+
–
1
votes
24
ISRO2020-66
The following circuit compares two $2$-bit binary numbers, $X$ and $Y$ represented by $X_1X_0$ and $Y_1Y_0$ respectively. ($X_0$ and $Y_0$ represent Least Significant Bits) Under what conditions $Z$ will be $1$? $X>Y$ $X<Y$ $X=Y$ $X!=Y$
The following circuit compares two $2$-bit binary numbers, $X$ and $Y$ represented by $X_1X_0$ and $Y_1Y_0$ respectively. ($X_0$ and $Y_0$ represent Least Significant Bit...
4.0k
views
answered
Feb 21, 2020
Digital Logic
isro-2020
digital-logic
digital-circuits
circuit-output
normal
+
–
4
votes
25
ISRO2020-17
Which one indicates a technique of building cross compilers? Beta cross Canadian cross Mexican cross X-cross
Which one indicates a technique of building cross compilers?Beta crossCanadian crossMexican crossX-cross
2.2k
views
answered
Feb 21, 2020
Compiler Design
isro-2020
compiler-design
compilation-phases
normal
+
–
0
votes
26
ISRO2020-72
A stack is implemented with an array of $'A[0...N-1]'$ and a variable $pos$'. The push and pop operations are defined by the following code. push (x) A[pos] <- x pos <- pos -1 end push pop() pos <- pos+1 return A[pos] end pop ... an empty stack with capacity $N$ for the above implementation $pos \leftarrow -1$ $pos\leftarrow 0$ $pos\leftarrow 1$ $pos\leftarrow N-1$
A stack is implemented with an array of $’A[0...N-1]’$ and a variable ‘$pos$’. The push and pop operations are defined by the following code.push (x) A[pos] <- x ...
3.4k
views
answered
Feb 21, 2020
DS
isro-2020
data-structures
stack
normal
+
–
0
votes
27
GATE IT 2006 | Question: 26
What are the eigenvalues of the matrix $P$ given below $P= \begin{pmatrix} a &1 &0 \\ 1& a& 1\\ 0&1 &a \end{pmatrix}$ $a, a -√2, a + √2$ $a, a, a$ $0, a, 2a$ $-a, 2a, 2a$
What are the eigenvalues of the matrix $P$ given below$$P= \begin{pmatrix} a &1 &0 \\ 1& a& 1\\ 0&1 &a \end{pmatrix}$$ $a, a -√2, a + √2...
7.6k
views
answered
Feb 6, 2020
Linear Algebra
gateit-2006
linear-algebra
eigen-value
normal
+
–
4
votes
28
GATE CSE 2004 | Question: 72
The following is the incomplete operation table of a $4-$ ... last row of the table is $c\;a\;e\; b$ $c\; b\; a\; e$ $c\; b\; e\; a$ $c\; e\; a\; b$
The following is the incomplete operation table of a $4-$element group.$$\begin{array}{|l|l|l|l|l|} \hline \textbf{*} & \textbf{e}& \textbf{a} &\textbf{b} & \textbf{c}\\\...
6.8k
views
answered
Feb 2, 2020
Set Theory & Algebra
gatecse-2004
set-theory&algebra
group-theory
normal
+
–
0
votes
29
GATE CSE 2012 | Question: 34, ISRO-DEC2017-32
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of addresses to Organization $A$, and a quarter to Organization $B$, while retaining the remaining ... $245.248.136.0/24 \text{ and } 245.248.132.0/21$
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of a...
30.3k
views
answered
Jan 31, 2020
Computer Networks
gatecse-2012
computer-networks
subnetting
normal
isrodec2017
+
–
4
votes
30
GATE CSE 2018 | Question: 26
Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$. Consider the following statements. P does not have an inverse P has a repeated eigenvalue P cannot be diagonalized Which one of the ... III are necessarily true Only II is necessarily true Only I and II are necessarily true Only II and III are necessarily true
Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$.Consider the following statements.P does not have an inverseP has ...
27.5k
views
answered
Jan 29, 2020
Linear Algebra
gatecse-2018
linear-algebra
matrix
eigen-value
normal
2-marks
+
–
Page:
1
2
3
4
5
6
...
16
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register