# Most viewed questions in Others

1 vote
1
What is the result of the expression(1&2)+(3/4)? 1 2 3 0
1 vote
2
3
In link state routing algorithm after construction of link state packets, new routes are computed using: DES algorithm Dijkstra’s algorithm RSA algorithm Packets
1 vote
4
Convert the octal number 0.4051 into its equivalent decimal number (1) 0.5100098 (2) 0.2096 (3) 0.52 (4) 0.4192
1 vote
5
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
6
What deletes the entire file except the file structure ? ERASE DELETE ZAP PACK
1 vote
7
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
1 vote
8
How to prepare for barc interview. Plz share your experience..
1 vote
9
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?
10
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.
11
Dijkstra’s algorithm is based on Divide and conquer paradigm Dynamic programming Greedy approach Backtracking paradigm
12
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
13
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)$
14
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
15
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
16
1 vote
17
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
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$
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