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
0
votes
0
answers
121
eigenvectors of [1 cos theta cos theta 1] are
Isha Gupta
1.8k
views
Isha Gupta
asked
Jun 12, 2016
0
votes
2
answers
122
probability
two cards are drawn from a well shuffled deck of 52 cards one after the other without replacement the probabaility of first card being a spade and second a black kings is
two cards are drawn from a well shuffled deck of 52 cards one after the other without replacement the probabaility of first card being a spade and second a black kings i...
focus _GATE
1.8k
views
focus _GATE
asked
Nov 25, 2016
Unknown Category
probability
+
–
1
votes
1
answer
123
UGC NET CSE | November 2017 | Part 3 | Question: 69
Consider the following LPP: Min $Z=2x_1+x_2+3x_3$ Subject to: $x_1 – 2x_2+x_3 \geq 4$ $2x_1+x_2+x_3 \leq 8$ $x_1-x_3 \geq 0$ $x_1, x_2, x_3 \geq 0$ The solution of this LPP using Dual Simplex Method is $x_1=0, x_2=0, x_3=3$ and $Z=9$ $x_1=0, x_2=6, x_3=0$ and $Z=6$ $x_1=4, x_2=0, x_3=0$ and $Z=8$ $x_1=2, x_2=0, x_3=2$ and $Z=10$
Consider the following LPP:Min $Z=2x_1+x_2+3x_3$Subject to:$x_1 – 2x_2+x_3 \geq 4$$2x_1+x_2+x_3 \leq 8$$x_1-x_3 \geq 0$$x_1, x_2, x_3 \geq 0$The solution of this LPP us...
Arjun
1.8k
views
Arjun
asked
Nov 5, 2017
Unknown Category
ugcnetcse-nov2017-paper3
+
–
1
votes
1
answer
124
UGC NET CSE | November 2017 | Part 3 | Question: 57
Let $P, Q, R$ and $S$ be Propositions. Assume that the equivalences $P \Leftrightarrow (Q \vee \neg Q )$ and $Q \Leftrightarrow R$ hold. Then the truth value of the formula $(P \wedge Q) \Rightarrow ((P \wedge R) \vee S)$ is always True False Same as truth table of $Q$ Same as truth table of $S$
Let $P, Q, R$ and $S$ be Propositions. Assume that the equivalences $P \Leftrightarrow (Q \vee \neg Q )$ and $Q \Leftrightarrow R$ hold. Then the truth value of the formu...
Arjun
1.8k
views
Arjun
asked
Nov 5, 2017
Unknown Category
ugcnetcse-nov2017-paper3
+
–
1
votes
2
answers
125
UGC NET CSE | November 2017 | Part 2 | Question: 37
In ________ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without serving any requests on the return trip. LOOK SCAN C-LOOK C-SCAN
In ________ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the requests along the way. When the head reaches the other end,...
Arjun
1.8k
views
Arjun
asked
Nov 5, 2017
Unknown Category
ugcnetcse-nov2017-paper2
operating-system
disk-scheduling
+
–
6
votes
1
answer
126
Arrays
Let A[1:n ] be such an array such that A[i]=i.An algorithm randomly permutes the elements of A,call the resulting array A'.Let X denote the number of locations such that A'[i]=i.What is expectation of X? a)n^2 b)n/2 c)n d)1
Let A[1:n ] be such an array such that A[i]=i.An algorithm randomly permutes the elements of A,call the resulting array A'.Let X denote the number of locations such that ...
Shivangi Verma
1.7k
views
Shivangi Verma
asked
Sep 15, 2016
0
votes
1
answer
127
The plane left ___ time.
The plane left ___ time. a.for b.to c.at d.on
The plane left ___ time.a.forb.toc.atd.on
Lohithendra Kumar
1.7k
views
Lohithendra Kumar
asked
Jun 10, 2016
Unknown Category
english-grammar
+
–
1
votes
3
answers
128
train problem
Two, trains, one from Howrah to Patna and the other from Patna to Howrah, start simultaneously. After they meet, the trains reach their destinations after 9 hours and 16 hours respectively. The ratio of their speeds is ??
Two, trains, one from Howrah to Patna and the other from Patna to Howrah, start simultaneously. After they meet, the trains reach their destinations after 9 hours and 16 ...
dhairya
1.7k
views
dhairya
asked
May 28, 2016
0
votes
1
answer
129
UGC NET CSE | December 2018 | Part 2 | Question: 47
Consider the following two $C++$ programs $P1$ and $P2$ and two statements $S1$ and $S2$ about these programs: $P1$ $P2$ void f(int a, int *b, int &c) { a=1; *b=2; c=3; } int main() { int i=0; f(i, &i, i); count << ... $S1$ and $S2$? $Code:$ Only $S1$ is true Only $S2$ is true Both $S1$ and $S2$ are true Neither $S1$ nor $S2$ is true
Consider the following two $C++$ programs $P1$ and $P2$ and two statements $S1$ and $S2$ about these programs:$P1$$P2$void f(int a, int *b, int &c){a=1;*b=2;c=3;}int main...
Arjun
1.7k
views
Arjun
asked
Jan 2, 2019
Unknown Category
ugcnetcse-dec2018-paper2
+
–
1
votes
1
answer
130
combination
How many 5 digit integers are possible so that in each of these integers , every digit is greater than digit on its right?
How many 5 digit integers are possible so that in each of these integers , every digit is greater than digit on its right?
Ankush Tiwari
1.7k
views
Ankush Tiwari
asked
Aug 8, 2016
0
votes
1
answer
131
UGC NET CSE | December 2018 | Part 2 | Question: 6
The relation $\leq$ and $>$ on a boolean algebra are defined as: $x \leq y$ if and only if $x \vee y =y$ $x <y$ means $x \leq y$ but $x \neq y$ $x \geq y$ means $y \leq x$ and $x>y$ means $y<x$ Considering ... $y < z$, then $x < y$ Choose the correct answer from the code given below: i and ii only ii and iii only iii only iv only
The relation $\leq$ and $>$ on a boolean algebra are defined as:$x \leq y$ if and only if $x \vee y =y$$x <y$ means $x \leq y$ but $x \neq y$$x \geq y$ means $y \leq x$ a...
Arjun
1.7k
views
Arjun
asked
Jan 2, 2019
Unknown Category
ugcnetcse-dec2018-paper2
+
–
0
votes
2
answers
132
UGC NET CSE | December 2018 | Part 2 | Question: 99
Consider the sentence below: There is a country that borders both India and Nepal Which of the following represents the above sentence correctly? ... $\exists c \text{ Border}( \text{Country} (c ), \text{India} \wedge \text{Nepal})$
Consider the sentence below:“There is a country that borders both India and Nepal”Which of the following represents the above sentence correctly?...
Arjun
1.7k
views
Arjun
asked
Jan 2, 2019
Unknown Category
ugcnetcse-dec2018-paper2
+
–
0
votes
1
answer
133
KERALA_PSC Predict content of PC and SP
At present the contents of SP and PC of a 8085 microprocessor are F000h and 2400h respectively. What will be the content after CALL E000h?
At present the contents of SP and PC of a 8085 microprocessor are F000h and 2400h respectively.What will be the content after CALL E000h?
sh!va
1.7k
views
sh!va
asked
Jul 7, 2016
2
votes
1
answer
134
Regarding NET Paper 3
I want 2 clarify that NET Paper 3 has been divided into 2 parts: Unlike NET CS Paper III-A Core Group and Paper III- B (Elective or Optional) So is it like questions from Core group be a compulsion and the second part which comprises of Elective/Optional ... part. Shud I be going 4 some chosen elective or prepare all subjects. Please clear d doubt. :). Thanks in advance. :)
I want 2 clarify that NET Paper 3 has been divided into 2 parts:Unlike NET CS Paper III-A Core Group and Paper III- B (Elective or Optional)So is it like questions from C...
Devshree Dubey
1.7k
views
Devshree Dubey
asked
Sep 29, 2016
0
votes
1
answer
135
Uttrakhand Asst. Professor Exam-67
System testing performed by the development team is called ______ whereas the system testing performed by a friendly set of customers is called ______ $\beta$ -testing , acceptance testing $\alpha $- testing , acceptance testing $\alpha $- testing, $\beta$ -testing $\beta$ -testing, $\alpha $- testing
System testing performed by the development team is called ______ whereas the system testing performed by a friendly set of customers is called ______$\beta$ -testing , a...
gatecse
1.7k
views
gatecse
asked
Mar 2, 2018
Unknown Category
uttarakhand-asst-prof-2018
is&software-engineering
+
–
0
votes
1
answer
136
UGC NET CSE | November 2017 | Part 2 | Question: 21
Consider an array representation of an $n$ element binary heap where the elements are stored from index $1$ to index $n$ of the array. For the element stored at index $i$ of the array $(i \leq n)$, the index of the parent is $\text{floor} ((i+1)/2)$ $\text{ceiling} ((i+1)/2)$ $\text{floor} (i/2)$ $\text{ceiling} (i/2)$
Consider an array representation of an $n$ element binary heap where the elements are stored from index $1$ to index $n$ of the array. For the element stored at index $i$...
Arjun
1.7k
views
Arjun
asked
Nov 5, 2017
Unknown Category
ugcnetcse-nov2017-paper2
+
–
0
votes
1
answer
137
what is average access time for a drum rotating at 4000 revolutions per minute
mudasirdar
1.7k
views
mudasirdar
asked
May 19, 2016
0
votes
1
answer
138
Uttrakhand Asst. Professor Exam-20
Which agent enables the deliberation about the computational entities and actions ? Hybrid Reflective Relational None of the above
Which agent enables the deliberation about the computational entities and actions ?HybridReflectiveRelationalNone of the above
gatecse
1.7k
views
gatecse
asked
Mar 2, 2018
Unknown Category
uttarakhand-asst-prof-2018
artificial-intelligence
+
–
1
votes
3
answers
139
UGC NET CSE | November 2017 | Part 2 | Question: 43
Which of the following is not a key issue stressed by an agile philosophy of software engineering? The importance of self-organizing teams as well as communication and collaboration between team members and customers Recognition that ... on rapid delivery of software that satisfies the customer Having a separate testing phase after a build phase
Which of the following is not a key issue stressed by an agile philosophy of software engineering?The importance of self-organizing teams as well as communication and col...
Arjun
1.6k
views
Arjun
asked
Nov 5, 2017
Unknown Category
ugcnetcse-nov2017-paper2
+
–
0
votes
1
answer
140
time complexity of the given loop
Please tell me the time complexity of fun():- int fun(int n) { int count = 0; for (int i = n; i > 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count; } According to me, it is the summation of n+(n/2)+(n ... be (2^n) - 1. Then what's the time complexity?? In the answer its given O(n). Is it correct ?? Please tell if I am missing some concept.
Please tell me the time complexity of fun():- int fun(int n) { int count = 0; for (int i = n; i 0; i /= 2) for (int j = 0; j < i; j++) ...
kamal250j
1.6k
views
kamal250j
asked
Dec 12, 2016
Unknown Category
programming-in-c
time-complexity
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
12
...
44
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register