Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most viewed questions in Unknown Category
3
votes
2
answers
21
8-bit 1's complement form of -77.25 a) 01001101.0100 b)01001101.0010 c)10110010.1011 d)10110010.1101
8-bit 1's complement form of -77.25a) 01001101.0100b)01001101.0010c)10110010.1011d)10110010.1101
Çșȇ ʛấẗẻ
5.6k
views
Çșȇ ʛấẗẻ
asked
Aug 24, 2016
0
votes
2
answers
22
UGC NET CSE | December 2018 | Part 2 | Question: 79
_______ command is used to remove a relation from SQL database. Drop table Delete table Remove table Update table
_______ command is used to remove a relation from SQL database.Drop tableDelete tableRemove tableUpdate table
Arjun
5.6k
views
Arjun
asked
Jan 2, 2019
Unknown Category
ugcnetcse-dec2018-paper2
+
–
1
votes
3
answers
23
silly window syndrome is related to
Anuanu
5.3k
views
Anuanu
asked
May 30, 2016
0
votes
1
answer
24
Assume the following C variable declaration int *A [10], B[10][10];
Of the following expressions I A[2] II A[2][3] III B[1] IV B[2][3] which will not give compile-time errors if used as left hand sides of assignment statements in a C program? I, II, and IV only B II, III, and IV only C II and IV only IV only
Of the following expressions I A II A [3] III B IV B [3] which will not give compile-time errors if used as left hand sides of assignment statements in a C program? I, ...
cse23
5.2k
views
cse23
asked
Jun 16, 2016
0
votes
2
answers
25
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...
Arjun
5.0k
views
Arjun
asked
Jan 2, 2019
Unknown Category
ugcnetcse-dec2018-paper2
+
–
5
votes
1
answer
26
Cn
suppose host A sending a large file to host B over a Tcp connection .the two end hosts are 10ms apart connected by a 1Gbps link.assume that they are using 1000 bytes packets to transmit the file.for simplicity ignore ack packets.atleast how big would the window size (in packets) have to be for the channel utilization to be greater than 80%.
suppose host A sending a large file to host B over a Tcp connection .the two end hosts are 10ms apart connected by a 1Gbps link.assume that they are using 1000 bytes pack...
Prachi Agarwal
4.9k
views
Prachi Agarwal
asked
Jul 28, 2016
1
votes
1
answer
27
the cubic polynomial y(x) which take sthe following values: y(0)=1, y(1)=0, y(2)=1 and y(3)=10 is
Isha Gupta
4.8k
views
Isha Gupta
asked
Jun 20, 2016
0
votes
2
answers
28
UGC NET CSE | November 2017 | Part 2 | Question: 48
Which of the following is not a Clustering method? K-Means method Self Organizing feature map method K- nearest neighbor method Agglomerative method
Which of the following is not a Clustering method?K-Means methodSelf Organizing feature map methodK- nearest neighbor methodAgglomerative method
Arjun
4.6k
views
Arjun
asked
Nov 5, 2017
Unknown Category
ugcnetcse-nov2017-paper2
data-mining
clustering
+
–
0
votes
1
answer
29
what is c-look algorithm
shadab
4.6k
views
shadab
asked
May 6, 2016
0
votes
1
answer
30
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.4k
views
.
asked
Jul 12, 2016
2
votes
1
answer
31
What is the meaning of probe sequence in binary search tree
Kittu Sharma
4.3k
views
Kittu Sharma
asked
Jun 3, 2016
0
votes
2
answers
32
UGC NET CSE | December 2018 | Part 2 | Question: 12
Consider the graph shown below: Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is $17$ $14$ $16$ $13$
Consider the graph shown below:Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is$17$$14$$16$$13$
Arjun
4.3k
views
Arjun
asked
Jan 2, 2019
Unknown Category
ugcnetcse-dec2018-paper2
algorithms
minimum-spanning-tree
+
–
3
votes
1
answer
33
Cardinality of a table
Rahul Jain25
4.1k
views
Rahul Jain25
asked
Oct 4, 2016
Unknown Category
sql
databases
+
–
0
votes
1
answer
34
binary equivalent to decimal number 42.75
Arun508
4.0k
views
Arun508
asked
Jul 1, 2016
3
votes
2
answers
35
ambiguous grammar
An ambiguous grammar is one that produces more than one left most derivation for the same sentence. more than one right most derivation for the same sentence. more than one leftmost derivation for the different sentence. i and ii i or ii ii and iii ii or iii
An ambiguous grammar is one that producesmore than one left most derivation for the same sentence.more than one right most derivation for the same sentence.more than one ...
vivekpinto07
3.9k
views
vivekpinto07
asked
Jun 24, 2016
Unknown Category
parsing
compiler-design
grammar
ambiguous
+
–
0
votes
2
answers
36
if you want to get a good night's sleep . you_______any coffee in the evening since it gives insomia
if you want to get a good night's sleep . you_______any coffee in the evening since it gives insomia.a.were able to drinkb.mustn't drinkc.don't have to drinkd.would rathe...
Lohithendra Kumar
3.9k
views
Lohithendra Kumar
asked
Jun 9, 2016
Unknown Category
english-grammar
+
–
0
votes
1
answer
37
ISI Maths
Two contestants run a 3-kilometre race along a circular course of length 300 metres. If there speeds are in the ratio of 4:3, how often and where would the winner pass the other? (The initial start-off is not counted as passing.) (A) 4 times; at the ... at a distance of 225 metres from the starting point. (D) Twice; once at 75 metres and again at 225 metres from the starting point.
Two contestants run a 3-kilometre race along a circular course of length 300 metres. If there speeds are in the ratio of 4:3, how often and where would the winner pass th...
.
3.9k
views
.
asked
Jul 13, 2016
Unknown Category
numerical-answers
+
–
0
votes
1
answer
38
UGC NET CSE | December 2018 | Part 2 | Question: 41
If the frame buffer has $10$-bits per pixel and $8$-bits are allocated for each of the $R, G$, and $B$ components, then what would be the size of the color lookup table (LUT)? $(2^8+2^9)$ bytes $(2^{10}+2^8)$ bytes $(2^{10}+2^{24})$ bytes $(2^{10}+2^{11})$ bytes
If the frame buffer has $10$-bits per pixel and $8$-bits are allocated for each of the $R, G$, and $B$ components, then what would be the size of the color lookup table (...
Arjun
3.7k
views
Arjun
asked
Jan 2, 2019
Unknown Category
ugcnetcse-dec2018-paper2
+
–
1
votes
1
answer
39
UGC NET CSE | December 2018 | Part 2 | Question: 23
Consider two sequences $X$ and $Y$ : $X=<0, 1, 2, 1, 3, 0, 1>$ $Y=<1, 3, 2, 0, 1, 0>$ The length of longest common subsequence between $X$ and $Y$ is $2$ $3$ $4$ $5$
Consider two sequences $X$ and $Y$ :$X=<0, 1, 2, 1, 3, 0, 1>$$Y=<1, 3, 2, 0, 1, 0>$The length of longest common subsequence between $X$ and $Y$ is$2$$3$$4$$5$
Arjun
3.7k
views
Arjun
asked
Jan 2, 2019
Unknown Category
ugcnetcse-dec2018-paper2
algorithms
dynamic-programming
+
–
1
votes
3
answers
40
UGC NET CSE | December 2018 | Part 2 | Question: 19
Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $0.5$ ns, $5$ ns and $100$ ns respectively. The hit rates of Level $1$ and Level $2$ caches are $0.7$ and $0.8$ ... access time of the system ignoring the search time within the cache? $35.20$ ns $7.55$ ns $20.75$ ns $24.35$ ns
Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $0.5$ ns, $5$ ns and $100$ ns respectively. The hit rates of ...
Arjun
3.7k
views
Arjun
asked
Jan 2, 2019
Unknown Category
ugcnetcse-dec2018-paper2
+
–
Page:
« prev
1
2
3
4
5
6
7
...
44
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register