Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Harsh181996
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Harsh181996
2
answers
1
Test by Bikram | Mathematics | Test 2 | Question: 5
Let $G$ be a graph of order $8$ in which every vertex has equal degree $D$. In order to guarantee that $G$ is connected, the minimum value of $D$ must be ____________
Let $G$ be a graph of order $8$ in which every vertex has equal degree $D$. In order to guarantee that $G$ is connected, the minimum value of $D$ must be ____________
714
views
commented
Jun 4, 2017
Graph Theory
tbb-mathematics-2
numerical-answers
graph-theory
+
–
2
answers
2
Test by Bikram | Mathematics | Test 2 | Question: 12
The total number of functions from the set $\{1,2,3,4, \dots ,10\}$ to the set $\{0,1\}$ that assign $1$ to exactly one of the positive integers less than $10$ are ______.
The total number of functions from the set $\{1,2,3,4, \dots ,10\}$ to the set $\{0,1\}$ that assign $1$ to exactly one of the positive integers less than $10$ are ______...
584
views
answered
Jun 4, 2017
Mathematical Logic
tbb-mathematics-2
numerical-answers
+
–
1
answer
3
Test by Bikram | Mathematics | Test 2 | Question: 6
If $A$ is a $4$ rowed square matrix such that $\mid A \mid = 4$, then $\text{adj (adj } A)$ is equal to _____. $2A$ $4A$ $8A$ $16A$
If $A$ is a $4$ rowed square matrix such that $\mid A \mid = 4$, then $\text{adj (adj } A)$ is equal to _____.$2A$$4A$$8A$$16A$
341
views
answered
Jun 2, 2017
Mathematical Logic
tbb-mathematics-2
+
–
3
answers
4
Test by Bikram | Mathematics | Test 2 | Question: 2
The total number of vertices in a graph is $n = 6$. The maximum number of possible edges (so that the graph remains disconnected) is ______.
The total number of vertices in a graph is $n = 6$.The maximum number of possible edges (so that the graph remains disconnected) is ______.
363
views
answered
Jun 2, 2017
Mathematical Logic
tbb-mathematics-2
numerical-answers
+
–
1
answer
5
Test by Bikram | Mathematics | Test 2 | Question: 8
There are three divisions of employees and each category has $5$ employees. The total number of ways a team of $8$ employees can be formed (where at least $2$ members from each division must be included in the team) is _________.
There are three divisions of employees and each category has $5$ employees. The total number of ways a team of $8$ employees can be formed (where at least $2$ members fro...
431
views
commented
Jun 2, 2017
Mathematical Logic
tbb-mathematics-2
numerical-answers
+
–
3
answers
6
Test by Bikram | Algorithms | Test 2 | Question: 2
Find the time complexity of the function function( int n) { int i=1; while( i<n) { int j=n; while( j>0) j=j/2; i=2*i; } } $O(\log n)$ $O(n^2 \log n )$ $O(\log 2 n)$ $O( \log n^2 )$
Find the time complexity of the functionfunction( int n) { int i=1; while( i<n) { int j=n; while( j>0) j=j/2; i=2*i; } }$O(\log n)$$O(n^2 \log n )$$O(\log 2 n)$$O( \log n...
888
views
commented
Jun 1, 2017
Algorithms
tbb-algorithms-2
+
–
1
answer
7
Test by Bikram | Algorithms | Test 2 | Question: 20
Consider the following Graph G: The number of minimum cost spanning trees using Kruskal's Algorithm is _________ .
Consider the following Graph G: The number of minimum cost spanning trees using Kruskal's Algorithm is _________ .
385
views
answered
May 31, 2017
Algorithms
tbb-algorithms-2
numerical-answers
+
–
2
answers
8
Test by Bikram | Algorithms | Test 2 | Question: 4
What will be the running-time of Dijkstra's single source shortest path algorithm, if the graph $G(V,E)$ is stored in the form of an adjacency list and binary heap is used? $O (\mid V \mid 2)$ $O (\mid V \mid \log \mid V \mid)$ $O ( ( \mid E \mid+\mid V \mid ) \log \mid V \mid )$ $O( \log \mid V \mid )$
What will be the running-time of Dijkstra's single source shortest path algorithm, if the graph $G(V,E)$ is stored in the form of an adjacency list and binary heap is use...
1.2k
views
commented
May 31, 2017
Algorithms
tbb-algorithms-2
+
–
3
answers
9
Test by Bikram | Algorithms | Test 2 | Question: 24
Given $n$ number of linearly ordered distinct elements, what will be the worst case time complexity to find $p$-th smallest element $(1 \leq p \leq n)$ from these $n$ elements when $n > 50$? $O(n \log n)$ $O(n^2)$ $O(n)$ $O(\log n)$
Given $n$ number of linearly ordered distinct elements, what will be the worst case time complexity to find$p$-th smallest element $(1 \leq p \leq n)$ from these $n$ elem...
687
views
commented
May 31, 2017
Algorithms
tbb-algorithms-2
+
–
2
answers
10
Test by Bikram | Algorithms | Test 2 | Question: 27
The total number of LCS (Longest Common Subsequences) of $P = abcd123$ and $Q= badc321$ that can be formed are ______.
The total number of LCS (Longest Common Subsequences) of $P = abcd123$ and $Q= badc321$ that can be formed are ______.
454
views
answered
May 31, 2017
Algorithms
tbb-algorithms-2
numerical-answers
+
–
2
answers
11
Test by Bikram | Algorithms | Test 2 | Question: 23
Matrix multiplication is associative and MCS ( matrix chain multiplication ) uses the following matrices: $\begin{array} \text{M1} & 10^* 100 \\ M2 & 100^* 5 \\ M3 & 5^* 50 \\ M4 & 50^* 1 \end{array}$ The number of orderings that are possible to compute $M1 \ M2 \ M3 \ M4$ are _________.
Matrix multiplication is associative and MCS ( matrix chain multiplication ) uses the following matrices:$\begin{array} \text{M1} & 10^* 100 \\ M2 & 100^* 5 \\ M3 & 5^* ...
533
views
commented
May 31, 2017
Algorithms
tbb-algorithms-2
numerical-answers
+
–
1
answer
12
Test by Bikram | Algorithms | Test 2 | Question: 21
The number of comparisons required to find the maximum and minimum element in an array $A[n]$ using Divide and Conquer method is: $(3n/2)+ 2$ $(3n/2) - 2$ $3n$ $3n/2$
The number of comparisons required to find the maximum and minimum element in an array $A[n]$ using Divide and Conquer method is:$(3n/2)+ 2$$(3n/2) - 2$$3n$$3n/2$
214
views
answered
May 31, 2017
Algorithms
tbb-algorithms-2
+
–
3
answers
13
CSL and Regular language
if L1 = { anbncn | n>= 0 } and L2 = { anbmck | k,n,m>=0} L1 is CSL and L2 is regular. Now L3 = L1.(L2)*. Is L3 is regualar or CSL?
if L1 = { anbncn | n>= 0 } and L2 = { anbmck | k,n,m>=0}L1 is CSL and L2 is regular.Now L3 = L1.(L2)*.Is L3 is regualar or CSL?
3.1k
views
commented
May 15, 2017
Theory of Computation
theory-of-computation
context-sensitive
regular-language
+
–
1
answer
14
IIITH-PGEE 2017
Consider 3 card one having both side painted red another having both side printed black and last having one side black and another side red, 3 cards are put in a hat and are mixed properly, now one card in picked and put down on table, its face up color is red what is probability that another side will be black.
Consider 3 card one having both side painted red another having both side printed black and last having one side black and another side red, 3 cards are put in a hat and ...
1.4k
views
comment edited
May 6, 2017
Probability
iiith-pgee
probability
+
–
0
answers
15
theory of computation
233
views
commented
Apr 12, 2017
Theory of Computation
theory-of-computation
+
–
1
answer
16
Algorithms Basic Question
414
views
answer edited
Apr 12, 2017
Algorithms
time-complexity
algorithms
+
–
3
answers
17
Test by Bikram | Operating Systems | Test 2 | Question: 29
In a paged memory, the page hit ratio is $0.35$. The time required to service the page fault is $100$ ns. Time required to access a page in primary memory is $10$ ns. The average time required to access a page is ________ ns
In a paged memory, the page hit ratio is $0.35$. The time required to service the page fault is $100$ ns. Time required to access a page in primary memory is $10$ ns.The ...
1.0k
views
commented
Apr 11, 2017
Operating System
tbb-os-2
numerical-answers
+
–
1
answer
18
iisc admission
when does iisc call candidates for mtech(res) interview? is it later after the mtech interviews?
when does iisc call candidates for mtech(res) interview?is it later after the mtech interviews?
502
views
answered
Apr 10, 2017
IISc/IITs
iisc
iisc-interview
admission-gate2017
+
–
5
answers
19
CIL17
2.4k
views
commented
Apr 10, 2017
1
answer
20
IIT K interview dates
IIT K will be conducting interview/written tests around May 14-16 and I have semester exams during that time. How am I supposed to attend the process? Will they change dates because many students may face this issue? Please someone answer. IIT K is the best option I have.
IIT K will be conducting interview/written tests around May 14-16 and I have semester exams during that time. How am I supposed to attend the process? Will they change da...
742
views
commented
Mar 29, 2017
1
answer
21
Discrete Probability Doubt
Consider a group of k people. Assume that each person's birthday is drawn uniformly at random from the 365 possibilities. (And ignore leap years.) What is the smallest value of ksuch that the expected number of pairs of distinct people with the same birthday is at least one?
Consider a group of k people. Assume that each person's birthday is drawn uniformly at random from the 365 possibilities. (And ignore leap years.) What is the smallest va...
1.3k
views
answer selected
Mar 18, 2017
Combinatory
discrete-mathematics
probability
+
–
1
answer
22
Test by Bikram | Mock GATE | Test 3 | Question: 36
Consider the following regular languages given below: L1 : Languages that accept strings over $\sum \left (a,b \right )$ , such that length of string is greater than $1$, but multiples of $3$. L2 : Languages that accept strings over $\sum \left (a,b \right )$ ... ? $n1 = n3 < n2$ $n1 < n3 < n2$ $n3 < n1 < n2$ $n2 < n1 < n3$
Consider the following regular languages given below: L1 : Languages that accept strings over $\sum \left (a,b \right )$ , such that length of string is greater than $1$,...
467
views
commented
Mar 13, 2017
GATE
tbb-mockgate-3
theory-of-computation
finite-automata
minimal-state-automata
+
–
2
answers
23
Test by Bikram | Mock GATE | Test 3 | Question: 21
A ternary tree is a tree in which every internal node has exactly three children. The number of leaves in a ternary tree with $’z’$ internal nodes is _______. $2$\left ( z+1 \right )$+ 3$ $2z$ $3z$ $2z + 1$
A ternary tree is a tree in which every internal node has exactly three children.The number of leaves in a ternary tree with $’z’$ internal nodes is _______.$2$$\left...
289
views
answered
Mar 13, 2017
GATE
tbb-mockgate-3
data-structures
tree
counting
+
–
3
answers
24
csma/cd
Two csma/cd stations are trying to send frames..After each frame is sent they contend for channel using backoff exponential algorithm?What is probability that contention ends on round k?
Two csma/cd stations are trying to send frames..After each frame is sent they contend for channel using backoff exponential algorithm?What is probability that contention ...
2.6k
views
commented
Mar 13, 2017
Computer Networks
computer-networks
csma-cd
+
–
1
answer
25
Test by Bikram | Mock GATE | Test 3 | Question: 48
The following five concurrent processes operate on counting semaphore variable $\left ( S \right )$, which is initialized to $0$. P1 : wait$\left ( s \right )$ ; $cs$ ; signal$\left ( s \right )$ ; P2 : wait$\left ( s \right )$ ; $cs$ ; ... signal$\left ( s \right )$ ; $cs$ ; wait $\left ( s \right )$; The maximum possible value of $S$ is ______.
The following five concurrent processes operate on counting semaphore variable $\left ( S \right )$, which is initialized to $0$.P1 : wait$\left ( s \right )$ ; $cs$ ...
400
views
answered
Mar 13, 2017
GATE
tbb-mockgate-3
numerical-answers
operating-system
process-synchronization
semaphore
+
–
1
answer
26
Test by Bikram | Mock GATE | Test 3 | Question: 54
Consider a matrix: $A =$ $\begin{bmatrix} 6 & 10\\ -2&-3 \end{bmatrix}$ The trace of $A^{10}$ is ______.
Consider a matrix: $A =$ $\begin{bmatrix} 6 & 10\\ -2&-3 \end{bmatrix}$ The trace of $A^{10}$ is ______.
586
views
answered
Mar 13, 2017
Linear Algebra
tbb-mockgate-3
numerical-answers
engineering-mathematics
linear-algebra
eigen-value
+
–
1
answer
27
Test by Bikram | Mock GATE | Test 3 | Question: 39
The register $’V’$ contains the value $’500’$. The index register contains the value $’100’$. The address field value of an indexed addressing mode instruction to make it same as a register indirect mode instruction is ___________.
The register $’V’$ contains the value $’500’$. The index register contains the value $’100’$.The address field value of an indexed addressing mode instruction...
406
views
commented
Mar 13, 2017
GATE
tbb-mockgate-3
numerical-answers
co-and-architecture
addressing-modes
+
–
1
answer
28
Test by Bikram | Mock GATE | Test 3 | Question: 14
We write a new algorithm by considering the fact that number of comparisons required by Selection Sort can be reduced by considering elements in pairs and finding the minimum and maximum element at the same time. What will be the time complexity of the new algorithm for comparisons of Selection Sort? $O/2$ $O(n)/4$ $O(n)$ $O$(\log n)$
We write a new algorithm by considering the fact that number of comparisons required by Selection Sort can be reduced by considering elements in pairs and finding the min...
587
views
commented
Mar 13, 2017
GATE
tbb-mockgate-3
algorithms
sorting
algorithm-design
+
–
3
answers
29
Test by Bikram | Mock GATE | Test 3 | Question: 64
A radio is available at $\text{₹} 27780/-$ cash price, or three equal annual installments at $15\%$ per annum under $CI$ compounding annually. Each installment amount, therefore, is ₹ _______.
A radio is available at $\text{₹} 27780/-$ cash price, or three equal annual installments at $15\%$ per annum under $CI$ compounding annually. Each installment amount, ...
718
views
commented
Mar 13, 2017
GATE
tbb-mockgate-3
numerical-answers
quantitative-aptitude
compound-interest
asymptotic-notation
+
–
1
answer
30
Test by Bikram | Mock GATE | Test 3 | Question: 18
The cardinality of a multi-set with the letters $’MALAYALAM’$ is _____.
The cardinality of a multi-set with the letters $’MALAYALAM’$ is _____.
412
views
answered
Mar 13, 2017
GATE
tbb-mockgate-3
numerical-answers
discrete-mathematics
set-theory&algebra
set-theory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register