menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Most viewed questions in Others

1 vote
2 answers
1
UGCNET-June2013-II: 8
What is the result of the expression(1&2)+(3/4)? 1 2 3 0
What is the result of the expression(1&2)+(3/4)? 1 2 3 0
asked Jul 14, 2016 in Others jothee 2.6k views
1 vote
3 answers
2
What can be the strategy to reduce negative marks in GATE?
asked Jan 13, 2016 in Others Soumyashree 2.6k views
0 votes
1 answer
3
UGCNET-DEC2016-II: 30
In link state routing algorithm after construction of link state packets, new routes are computed using: DES algorithm Dijkstra’s algorithm RSA algorithm Packets
In link state routing algorithm after construction of link state packets, new routes are computed using: DES algorithm Dijkstra’s algorithm RSA algorithm Packets
asked Feb 4, 2017 in Others Debasmita Bhoumik 2.6k views
1 vote
2 answers
4
Ugc net
Convert the octal number 0.4051 into its equivalent decimal number (1) 0.5100098 (2) 0.2096 (3) 0.52 (4) 0.4192
Convert the octal number 0.4051 into its equivalent decimal number (1) 0.5100098 (2) 0.2096 (3) 0.52 (4) 0.4192
asked Jan 23, 2017 in Study Resources Haritha 2.6k views
1 vote
2 answers
5
UGCNET-DEC2016-III: 30
A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token bucket is initially filled with 16 megabits. The maximum duration taken by X to transmit at full rate of 10 Mbps is ______ secs. 1 2 3 4
A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token bucket is initially filled with 16 megabits. The maximum duration taken by X to transmit at full rate of 10 Mbps is ______ secs. 1 2 3 4
asked Jan 31, 2017 in Others jothee 2.6k views
3 votes
2 answers
6
UGCNET-Dec2011-II: 21
What deletes the entire file except the file structure ? ERASE DELETE ZAP PACK
What deletes the entire file except the file structure ? ERASE DELETE ZAP PACK
asked Aug 17, 2016 in Others makhdoom ghaya 2.6k views
1 vote
1 answer
7
UGCNET-June2013-III: 25
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|} \hline \text{} & \text{$W_1$} & \textbf{$W_2$} & \textbf{$W_3$} & \textbf{$ ... 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|} \hline \text{} & \text{$W_1$} & \textbf{$W_2$} & \textbf{$W_3$} & \textbf{$W_4$} & \textbf{$W_5$} & \textbf{$ ... 76 80 90 96
asked Jul 16, 2016 in Others jothee 2.5k views
1 vote
2 answers
8
barc interview
How to prepare for barc interview. Plz share your experience..
How to prepare for barc interview. Plz share your experience..
asked Apr 15, 2016 in Others Nishu 2.5k views
1 vote
0 answers
9
GATE 18 RESPONSE SHEET
i am checking for my response sheet from 8pm.but is showing that their server has interal problem and not showing my response sheet...when this issue will be resolved?
i am checking for my response sheet from 8pm.but is showing that their server has interal problem and not showing my response sheet...when this issue will be resolved?
asked Feb 14, 2018 in Others dheeraj sawant 2.5k views
15 votes
1 answer
10
Where does GATE questions come from?
It is known that a pool of IIT/IISc professors make GATE questions. But how exactly are they made? I mean how does a Professor usually make a GATE question? I would like a detailed answer covering all possibilities including easy, normal and difficult questions.
It is known that a pool of IIT/IISc professors make GATE questions. But how exactly are they made? I mean how does a Professor usually make a GATE question? I would like a detailed answer covering all possibilities including easy, normal and difficult questions.
asked Oct 30, 2017 in Others Arjun 2.5k views
0 votes
2 answers
11
UGCNET-DEC2016-III: 35
Dijkstra’s algorithm is based on Divide and conquer paradigm Dynamic programming Greedy approach Backtracking paradigm
Dijkstra’s algorithm is based on Divide and conquer paradigm Dynamic programming Greedy approach Backtracking paradigm
asked Jan 31, 2017 in Others jothee 2.5k views
2 votes
2 answers
12
UGCNET-DEC2016-III: 23
Given the following two languages: $L_1 = \{a^n b^n \mid n \geq 0, \: n \neq 100\}$ $L_2 = \{ w \in \{a, b, c\}^* \mid n_a(w) = n_b (w) = n_c(w) \}$ Which of the following options is correct? Both $L_1$ ... $L_1$ is context free language, $L_2$ is not context free language $L_1$ is not context free language, $L_2$ is context free language
Given the following two languages: $L_1 = \{a^n b^n \mid n \geq 0, \: n \neq 100\}$ $L_2 = \{ w \in \{a, b, c\}^* \mid n_a(w) = n_b (w) = n_c(w) \}$ Which of the following options is correct? Both $L_1$ and $L_2$ are not ... and $L_2$ are context free language $L_1$ is context free language, $L_2$ is not context free language $L_1$ is not context free language, $L_2$ is context free language
asked Jan 31, 2017 in Others jothee 2.4k views
3 votes
4 answers
13
UGCNET-DEC2016-III: 31
The asymptotic upper bound solution of the recurrence relation given by $T(n) = 2T \bigr( \frac{n}{2} \bigl) +\frac{n}{lg \: n}$ is $O(n^2)$ $O(n \: lg \: n )$ $O(n \: lg \: lg \: n)$ $O(lg \: lg \: n)$
The asymptotic upper bound solution of the recurrence relation given by $T(n) = 2T \bigr( \frac{n}{2} \bigl) +\frac{n}{lg \: n}$ is $O(n^2)$ $O(n \: lg \: n )$ $O(n \: lg \: lg \: n)$ $O(lg \: lg \: n)$
asked Jan 31, 2017 in Others jothee 2.4k views
9 votes
3 answers
14
GATE Overflow Update
GATE Overflow was updated to Q2A 1.7.4 from Q2A 1.7.0. I hope many of the bugs would be gone now. This was a major upgrade as it also coincided with the server upgrade. Also, all the core hacks in Q2A was removed making GATE ... videos for critical topics which are not there in http://videos.gatecse.in Automatic advancement of users to editor post based on points earned
GATE Overflow was updated to Q2A 1.7.4 from Q2A 1.7.0. I hope many of the bugs would be gone now. This was a major upgrade as it also coincided with the server upgrade. Also, all the core hacks in Q2A was removed making GATE Overflow more ... Some videos for critical topics which are not there in http://videos.gatecse.in Automatic advancement of users to editor post based on points earned
asked Aug 8, 2016 in Others Arjun 2.4k views
3 votes
2 answers
15
UGCNET-June2011-II: 22
Given a binary tree whose inorder and preorder traversal are given by Inorder : EICFBGDJHK Preorder : BCEIFDGHJK The post order traversal of the above binary tree is I E F C G J K H D B I E F C J G K H D B I E F C G K J H D B I E F C G J K D B H
Given a binary tree whose inorder and preorder traversal are given by Inorder : EICFBGDJHK Preorder : BCEIFDGHJK The post order traversal of the above binary tree is I E F C G J K H D B I E F C J G K H D B I E F C G K J H D B I E F C G J K D B H
asked Aug 24, 2016 in Others makhdoom ghaya 2.4k views
1 vote
1 answer
17
UGCNET-Sep2013-II: 19
Find the number of ways to paint 12 offices so that 3 of them will be green, 2 of them pink, 2 of them yellow and the rest ones white. 55,440 1,66,320 4.790E+08 39,91,680
Find the number of ways to paint 12 offices so that 3 of them will be green, 2 of them pink, 2 of them yellow and the rest ones white. 55,440 1,66,320 4.790E+08 39,91,680
asked Jul 20, 2016 in Others jothee 2.3k views
3 votes
1 answer
18
UGCNET-June2015-III: 70
Consider the two class classification task that consists of the following points: Class $C_1$ : [1 1.5] [1 -1.5] Class $C_2$ : [-2 2.5] [-2 -2.5] The decision boundary between the two classes using single perceptron is given by: $x_1+x_2+1.5=0$ $x_1+x_2-1.5=0$ $x_1+1.5=0$ $x_1-1.5=0$
Consider the two class classification task that consists of the following points: Class $C_1$ : [1 1.5] [1 -1.5] Class $C_2$ : [-2 2.5] [-2 -2.5] The decision boundary between the two classes using single perceptron is given by: $x_1+x_2+1.5=0$ $x_1+x_2-1.5=0$ $x_1+1.5=0$ $x_1-1.5=0$
asked Aug 2, 2016 in Others jothee 2.3k views
2 votes
1 answer
19
UGCNET-DEC2016-III: 72
A neuron with inputs has the weight vector $\begin{bmatrix}0.2 & -0.1 & 0.1 \end{bmatrix}^T$ and a bias $\theta =0$. If the input vector is $X = \begin{bmatrix}0.2 & 0.4 & 0.2 \end{bmatrix}^T$. Then the total input to the neuron is: 0.20 1.0 0.02 -1.0
A neuron with inputs has the weight vector $\begin{bmatrix}0.2 & -0.1 & 0.1 \end{bmatrix}^T$ and a bias $\theta =0$. If the input vector is $X = \begin{bmatrix}0.2 & 0.4 & 0.2 \end{bmatrix}^T$. Then the total input to the neuron is: 0.20 1.0 0.02 -1.0
asked Feb 1, 2017 in Others jothee 2.3k views
1 vote
2 answers
20
UGCNET-DEC2016-II: 40
Distributed operating systems consist of: Loosely coupled O.S. software on a loosely coupled hardware Loosely coupled O.S. software on a tightly coupled hardware Tightly coupled O.S. software on a loosely coupled hardware Tightly coupled O.S. software on a tightly coupled hardware
Distributed operating systems consist of: Loosely coupled O.S. software on a loosely coupled hardware Loosely coupled O.S. software on a tightly coupled hardware Tightly coupled O.S. software on a loosely coupled hardware Tightly coupled O.S. software on a tightly coupled hardware
asked Jan 30, 2017 in Others Arjun 2.2k views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...