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 Hradesh patel
3
answers
1
UGC NET CSE | November 2017 | Part 3 | Question: 74
Which of the following routing technique / techniques is/are used in distributed systems? Fixed Routing Virtual Routing Dynamic Routing (a) only (a) and (b) only (c) only All (a), (b), (c)
Which of the following routing technique / techniques is/are used in distributed systems?Fixed RoutingVirtual RoutingDynamic Routing(a) only(a) and (b) only(c) onlyAll (a...
908
views
answer reshown
Feb 23, 2022
Unknown Category
ugcnetcse-nov2017-paper3
+
–
0
answers
2
UGC NET CSE | June 2007 | Part 2 | Question: 20
Which statement is false regarding data Independence: Hierarchical data model suffers from data Independence. Network model suffers from data Independence. Relational model suffers only from logical data Independence. Relational model suffers only from physical data Independence.
Which statement is false regarding data Independence:Hierarchical data model suffers from data Independence.Network model suffers from data Independence.Relational model ...
413
views
commented
May 21, 2021
Others
ugcnetcse-june2007-paper2
+
–
1
answer
3
UGC NET CSE | June 2007 | Part 2 | Question: 6
$2$’s complement of $-100$ is: $00011100$ $10011101$ $10011100$ $11100100$
$2$’s complement of $-100$ is:$00011100$$10011101$$10011100$$11100100$
403
views
commented
May 21, 2021
Others
ugcnetcse-june2007-paper2
+
–
0
answers
4
UGC NET CSE | June 2007 | Part 2 | Question: 3
The maximum number of nodes in a binary tree of depth $10$: $1024$ $2^{10}-1$ $1000$ None of the above
The maximum number of nodes in a binary tree of depth $10$:$1024$ $2^{10}-1$ $1000$None of the above
1.2k
views
commented
May 21, 2021
Others
ugcnetcse-june2007-paper2
+
–
1
answer
5
MadeEasy Subject Test 2019: Compiler Design - Syntax Directed Translation
Consider the following Translation rules for the Grammar G : What will be the output for input string abebebe for bottom up parser ? CBBPBPBP CBBBPPBB CBPBPBPB CBPBBPPB
Consider the following Translation rules for the Grammar G :What will be the output for input string abebebe for bottom up parser ?CBBPBPBPCBBBPPBBCBPBPBPBCBPBBPPB
1.3k
views
commented
Feb 26, 2021
Compiler Design
compiler-design
syntax-directed-translation
made-easy-test-series
+
–
1
answer
6
ISI Maths
July 3, 1977, was a SUNDAY. Then July 3, 1970, was a (A) Wednesday (B) Friday (C) Sunday (D) Tuesday.
July 3, 1977, was a SUNDAY. Then July 3, 1970, was a (A) Wednesday (B) Friday (C) Sunday (D) Tuesday.
4.5k
views
commented
Feb 25, 2021
2
answers
7
GATE CSE 2021 Set 2 | Question: 41
For a string $w$, we define $w^R$ to be the reverse of $w$. For example, if $w=01101$ then $w^R=10110$. Which of the following languages is/are context-free? $\{ wxw^Rx^R \mid w,x \in \{0,1\} ^* \}$ $\{ ww^Rxx^R \mid w,x \in \{0,1\} ^* \}$ $\{ wxw^R \mid w,x \in \{0,1\} ^* \}$ $\{ wxx^Rw^R \mid w,x \in \{0,1\} ^* \}$
For a string $w$, we define $w^R$ to be the reverse of $w$. For example, if $w=01101$ then $w^R=10110$.Which of the following languages is/are context-free?$\{ wxw^Rx^R \...
7.3k
views
commented
Feb 23, 2021
Theory of Computation
gatecse-2021-set2
multiple-selects
theory-of-computation
context-free-language
2-marks
+
–
4
answers
8
GATE CSE 2021 Set 2 | Question: 38
For a statement $S$ in a program, in the context of liveness analysis, the following sets are defined: $\text{USE}(S)$ : the set of variables used in $S$ $\text{IN}(S)$ : the set of variables that are live at the entry of $S$ $\text{OUT}(S)$ : the set of variables ... S_2$) }\cup \text{ OUT ($S_2$)}$ $\text{OUT ($S_1$)} = \text{USE ($S_1$)} \cup \text{IN ($S_2$)}$
For a statement $S$ in a program, in the context of liveness analysis, the following sets are defined:$\text{USE}(S)$ : the set of variables used in $S$$\text{IN}(S)$ : t...
6.9k
views
commented
Feb 23, 2021
Compiler Design
gatecse-2021-set2
code-optimization
live-variable-analysis
compiler-design
2-marks
+
–
14
answers
9
GATE CSE 2021 Set 2 | Question: 24
Suppose that $P$ is a $4 \times 5$ matrix such that every solution of the equation $\text{Px=0}$ is a scalar multiple of $\begin{bmatrix} 2 & 5 & 4 &3 & 1 \end{bmatrix}^T$. The rank of $P$ is __________
Suppose that $P$ is a $4 \times 5$ matrix such that every solution of the equation $\text{Px=0}$ is a scalar multiple of $\begin{bmatrix} 2 & 5 & 4 &3 & 1 \end{bmatrix}^T...
19.1k
views
commented
Feb 23, 2021
Linear Algebra
gatecse-2021-set2
numerical-answers
linear-algebra
matrix
rank-of-matrix
1-mark
+
–
11
answers
10
GATE CSE 2021 Set 2 | Question: 10
Consider the following $\text{ANSI C}$ program. #include <stdio.h> int main() { int arr[4][5]; int i, j; for (i=0; i<4; i++) { for (j=0; j<5; j++) { arr[i][j] = 10 * i + j; } } printf(“%d”, *(arr[1]+9)); return 0; } What is the output of the above program? $14$ $20$ $24$ $30$
Consider the following $\text{ANSI C}$ program.#include <stdio.h int main() { int arr[4][5]; int i, j; for (i=0; i<4; i++) { for (j=0; j<5; j++) { arr[i...
30.4k
views
commented
Feb 22, 2021
Programming in C
gatecse-2021-set2
programming-in-c
array
output
1-mark
+
–
2
answers
11
GATE CSE 2021 Set 1 | Question: 51
In a pushdown automaton $P=(Q, \Sigma, \Gamma, \delta, q_0, F)$, a transition of the form, where $p,q \in Q$, $a \in \Sigma \cup \{ \epsilon \}$, and $X,Y \in \Gamma \cup \{ \epsilon \}$ ... $\Gamma = \{ \#, A\}$. The number of strings of length $100$ accepted by the above pushdown automaton is ___________
In a pushdown automaton $P=(Q, \Sigma, \Gamma, \delta, q_0, F)$, a transition of the form,where $p,q \in Q$, $a \in \Sigma \cup \{ \epsilon \}$, and $X,Y \in \Gamma \cup...
10.8k
views
commented
Feb 22, 2021
Theory of Computation
gatecse-2021-set1
theory-of-computation
pushdown-automata
numerical-answers
2-marks
+
–
9
answers
12
GATE CSE 2021 Set 1 | GA Question: 9
Given below are two statements $1$ and $2$, and two conclusions $\text{I}$ and $\text{II}$ $\text{Statement 1:}$ All bacteria are microorganisms. $\text{Statement 2:}$ All pathogens are microorganisms. $\text{Conclusion I:}$ Some pathogens are ... Either conclusion $\text{I}$ or $\text{II}$ is correct Neither conclusion $\text{I}$ nor $\text{II}$ is correct
Given below are two statements $1$ and $2$, and two conclusions $\text{I}$ and $\text{II}$$\text{Statement 1:}$ All bacteria are microorganisms.$\text{Statement 2:}$ All ...
14.5k
views
commented
Feb 22, 2021
Analytical Aptitude
gatecse-2021-set1
analytical-aptitude
logical-reasoning
statements-follow
2-marks
+
–
2
answers
13
GATE CSE 2021 Set 1 | Question: 23
A relation $r(A, B)$ in a relational database has $1200$ tuples. The attribute $A$ has integer values ranging from $6$ to $20$, and the attribute $B$ has integer values ranging from $1$ to $20$. Assume that the attributes $A$ and $B$ are independently distributed. The estimated number of tuples in the output of $\sigma _{(A>10)\vee(B=18)}(r)$ is ____________.
A relation $r(A, B)$ in a relational database has $1200$ tuples. The attribute $A$ has integer values ranging from $6$ to $20$, and the attribute $B$ has integer values r...
13.2k
views
commented
Feb 22, 2021
Databases
gatecse-2021-set1
databases
sql
numerical-answers
1-mark
+
–
4
answers
14
GATE CSE 2021 Set 2 | Question: 53
Consider a pipelined processor with $5$ stages, $\text{Instruction Fetch} (\textsf{IF})$, $\text{Instruction Decode} \textsf{(ID)}$, $\text{Execute } \textsf{(EX)}$, $\text{Memory Access } \textsf{(MEM)}$ ... $\textit{Speedup} $ achieved in executing the given instruction sequence on the pipelined processor (rounded to $2$ decimal places) is _____________
Consider a pipelined processor with $5$ stages, $\text{Instruction Fetch} (\textsf{IF})$, $\text{Instruction Decode} \textsf{(ID)}$, $\text{Execute } \textsf{(EX)}$, $\te...
15.8k
views
commented
Feb 22, 2021
CO and Architecture
gatecse-2021-set2
co-and-architecture
pipelining
numerical-answers
2-marks
+
–
5
answers
15
what is true about binary semaphore?
what is true about binary semaphore? 1)Binary semaphore has drawback called busy wait or spin lock. 2)Binary semaphore is applicable only for two processes 3)Binary semaphore has no drawback called busy wait or spin lock 4)none of the above
what is true about binary semaphore?1)Binary semaphore has drawback called busy wait or spin lock.2)Binary semaphore is applicable only for two processes3)Binary semaphor...
3.4k
views
commented
Feb 15, 2021
Operating System
semaphore
+
–
1
answer
16
UGC NET CSE | November 2017 | Part 2 | Question: 36
In Distributed system, the capacity of a system to adapt the increased service load is called Tolerance Scalability Capability Loading
In Distributed system, the capacity of a system to adapt the increased service load is calledToleranceScalabilityCapabilityLoading
793
views
commented
Oct 5, 2020
Unknown Category
ugcnetcse-nov2017-paper2
+
–
4
answers
17
UGC NET CSE | July 2018 | Part 2 | Question: 94
What does the following logic diagram represent? Synchronous Counter Ripple Counter Combinational Circuit Mod 2 Counter
What does the following logic diagram represent?Synchronous CounterRipple CounterCombinational CircuitMod 2 Counter
2.7k
views
commented
Oct 3, 2020
Digital Logic
ugcnetcse-july2018-paper2
digital-logic
ripple-counter-operation
+
–
4
answers
18
UGC NET CSE | July 2018 | Part 2 | Question: 67
A many-to-one relationship exists between entity sets $r_1$ and $r_2$. How will it be represented using functional dependencies if $Pk(r)$ denotes the primary key attribute of relation $r$? $Pk(r_1) \rightarrow Pk(r_2)$ ... $Pk(r_2) \rightarrow Pk(r_1) \text{ or } Pk(r_1) \rightarrow Pk(r_2)$
A many-to-one relationship exists between entity sets $r_1$ and $r_2$. How will it be represented using functional dependencies if $Pk(r)$ denotes the primary key attribu...
1.2k
views
commented
Oct 3, 2020
Databases
ugcnetcse-july2018-paper2
databases
rdbms
+
–
1
answer
19
UGC NET CSE | December 2018 | Part 2 | Question: 96
Consider the following statements related to $AND-OR$ Search algorithm. S1 : A solution is a subtree that has a goal node at every leaf. S2 : $OR$ nodes are analogous to the branching in a deterministic environment. S3 : $AND$ nodes are analogous to ... $S1 - True, S2 - True, S3 - True$ $S1 - False, S2 - True, S3 - False$
Consider the following statements related to $AND-OR$ Search algorithm.S1 : A solution is a subtree that has a goal node at every leaf.S2 : $OR$ node...
1.0k
views
commented
Oct 1, 2020
Unknown Category
ugcnetcse-dec2018-paper2
+
–
2
answers
20
UGC NET CSE | December 2018 | Part 2 | Question: 56
Consider the following method: int f(int m, int n, boolean x, boolean y) { int res=0; if (m<0) {res=n-m;} else if (x || y) { res=-1; if(n==m){res=1;} } else {res=n;} return res; } /*end of f */ If $P$ is the minimum number of tests ... number of tests to achieve full branch coverage for $f()$, then $(P,Q)$ = $(3, 4)$ $(4,3)$ $(2,3)$ $(3,2)$
Consider the following method:int f(int m, int n, boolean x, boolean y) { int res=0; if (m<0) {res=n-m;} else if (x || y) { res=-1; if(n==m){res=1;} } else {res=n;} retur...
5.0k
views
commented
Oct 1, 2020
Unknown Category
ugcnetcse-dec2018-paper2
+
–
1
answer
21
UGC NET CSE | December 2018 | Part 2 | Question: 49
What does the following Java function perform? (Assume int occupies four bytes of storage) public static int f(int a) { // Pre-conditions : a > 0 and no oveflow/underflow occurs int b=0; for (int i=0; i<32; ... the binary representation of integer a Return the int that represents the number of $0$'s in the binary representation of integer a
What does the following Java function perform? (Assume int occupies four bytes of storage)public static int f(int a) { // Pre-conditions : a 0 and no oveflow/underflow o...
1.3k
views
commented
Oct 1, 2020
Unknown Category
ugcnetcse-dec2018-paper2
+
–
0
answers
22
UGC NET CSE | December 2018 | Part 2 | Question: 48
Consider the following recursive Java function $f$ that takes two long arguments and returns a float value : public static float f(long m, long n) { float result = (float) m / (float) n; if (m<0 || n <0) return 0.0f; else result += ... return result; } Which of the following integers best approximates the value of $f(2, 3)$? $0$ $1$ $2$ $3$
Consider the following recursive Java function $f$ that takes two long arguments and returns a float value :public static float f(long m, long n) { float result = (float)...
1.9k
views
commented
Oct 1, 2020
Unknown Category
ugcnetcse-dec2018-paper2
+
–
3
answers
23
UGC NET CSE | December 2018 | Part 2 | Question: 34
Consider the following two languages : $L_1 = \{ x \mid \text{ for some y with } \mid y \mid = 2^{\mid x \mid} , xy \in \text{ L and L is regular language} \}$ ... $L_2$ is regular language Both $L_1$ and $L_2$ are regular languages Both $L_1$ and $L_2$ are not regular languages
Consider the following two languages :$L_1 = \{ x \mid \text{ for some y with } \mid y \mid = 2^{\mid x \mid} , xy \in \text{ L and L is regular language} \}$$L_2=\{ x \m...
3.1k
views
commented
Oct 1, 2020
Theory of Computation
ugcnetcse-dec2018-paper2
theory-of-computation
+
–
1
answer
24
UGC NET CSE | December 2018 | Part 2 | Question: 1
In mathematical logic, which of the following are statements? There will be snow in January. What is the time now? Today is Sunday. You must study Discrete mathematics Choose the correct answer from the code given below: i and iii i and ii ii and iv iii and iv
In mathematical logic, which of the following are statements?There will be snow in January.What is the time now?Today is Sunday.You must study Discrete ...
5.1k
views
commented
Oct 1, 2020
Mathematical Logic
ugcnetcse-dec2018-paper2
mathematical-logic
+
–
2
answers
25
UGC NET CSE | June 2019 | Part 2 | Question: 95
Let $A_{\alpha_0}$ denotes the $\alpha$-cut of a fuzzy set $A$ at $\alpha_0$. If $\alpha_1 < \alpha_2$, then $A_{\alpha_1} \supseteq A_{\alpha_2}$ $A_{\alpha_1} \supset A_{\alpha_2}$ $A_{\alpha_1} \subseteq A_{\alpha_2}$ $A_{\alpha_1} \subset A_{\alpha_2}$
Let $A_{\alpha_0}$ denotes the $\alpha$-cut of a fuzzy set $A$ at $\alpha_0$. If $\alpha_1 < \alpha_2$, then$A_{\alpha_1} \supseteq A_{\alpha_2}$$A_{\alpha_1} \supset A_{...
1.9k
views
commented
Sep 17, 2020
Others
ugcnetcse-june2019-paper2
fuzzy-set
alpha-cut
+
–
3
answers
26
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...
3.0k
views
commented
Sep 17, 2020
Programming in C
ugcnetcse-june2019-paper2
programming-in-c
+
–
3
answers
27
UGC NET CSE | January 2017 | Part 3 | Question: 4
Match the following : ... $\text{a-iv, b-ii, c-i, d-iii}$ $\text{a-iv, b-iii, c-ii, d-i}$
Match the following :$\begin{array}{clcl} & {\textbf{Addressing Mode}} & {} & {\textbf{Location of operand}} \\ \text{a.} & \text{Implied} & \text{i.} & \text{Registe...
1.7k
views
commented
Sep 2, 2020
CO and Architecture
ugcnetcse-jan2017-paper3
co-and-architecture
addressing-modes
match-the-following
+
–
1
answer
28
UGC NET CSE | June 2013 | Part 3 | Question: 25
The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel's Approximation method is ... $76$ $80$ $90$ $96$
The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s Approximation method is$\begin{array}{|l|l|l|l...
4.8k
views
commented
Aug 27, 2020
Others
ugcnetcse-june2013-paper3
linear-programming
transportation-problem
+
–
1
answer
29
NIELIT 2017 OCT Scientific Assistant A (CS) - Section C: 12
Web links are stored within the page itself and when you wish to ‘jump’ to the page that is linked, we select the hotspot or anchor. This technique is called Hypertext Hypermedia Both $(A)$ and $(B)$ Anchoring
Web links are stored within the page itself and when you wish to ‘jump’ to the page that is linked, we select the hotspot or anchor. This technique is calledHypertext...
919
views
commented
Aug 26, 2020
Web Technologies
nielit2017oct-assistanta-cs
non-gate
web-technologies
html
+
–
1
answer
30
UGC NET CSE | June 2006 | Part 2 | Question: 28
What is the difference between the Ethernet frame preamble field and the $\text{IEEE}$ $802.3$ preamble and start of frame Delimiter fields? $1$ byte $1$ bit $4$ bits $16$ bits
What is the difference between the Ethernet frame preamble field and the $\text{IEEE}$ $802.3$ preamble and start of frame Delimiter fields?$1$ byte$1$ bit$4$ bits$16$ bi...
1.1k
views
commented
Aug 21, 2020
Others
ugcnetcse-june2006-paper2
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register