Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Harsh181996
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Harsh181996
6
votes
1
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 ______.
answered
in
Mathematical Logic
Jun 4, 2017
624
views
tbb-mathematics-2
numerical-answers
4
votes
2
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$
answered
in
Mathematical Logic
Jun 2, 2017
358
views
tbb-mathematics-2
4
votes
3
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 ______.
answered
in
Mathematical Logic
Jun 2, 2017
382
views
tbb-mathematics-2
numerical-answers
3
votes
4
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 _________ .
answered
in
Algorithms
May 31, 2017
399
views
tbb-algorithms-2
numerical-answers
3
votes
5
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 ______.
answered
in
Algorithms
May 31, 2017
481
views
tbb-algorithms-2
numerical-answers
2
votes
6
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$
answered
in
Algorithms
May 31, 2017
222
views
tbb-algorithms-2
2
votes
7
Algorithms Basic Question
answered
in
Algorithms
Apr 11, 2017
431
views
time-complexity
algorithms
0
votes
8
iisc admission
when does iisc call candidates for mtech(res) interview? is it later after the mtech interviews?
answered
in
IISc/IITs
Apr 10, 2017
506
views
iisc
iisc-interview
admission-gate2017
1
vote
9
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$
answered
in
GATE
Mar 13, 2017
301
views
tbb-mockgate-3
data-structures
tree
counting
3
votes
10
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 ______.
answered
in
GATE
Mar 13, 2017
424
views
tbb-mockgate-3
numerical-answers
operating-system
process-synchronization
semaphore
7
votes
11
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 ______.
answered
in
Linear Algebra
Mar 13, 2017
605
views
tbb-mockgate-3
numerical-answers
engineering-mathematics
linear-algebra
eigen-value
4
votes
12
Test by Bikram | Mock GATE | Test 3 | Question: 18
The cardinality of a multi-set with the letters $’MALAYALAM’$ is _____.
answered
in
GATE
Mar 13, 2017
425
views
tbb-mockgate-3
numerical-answers
discrete-mathematics
set-theory&algebra
set-theory
20
votes
13
GATE CSE 2017 Set 1 | Question: GA-7
Six people are seated around a circular table. There are at least two men and two women. There are at least three right-handed persons. Every woman has a left-handed person to her immediate right. None of the women are right-handed. The number of women at the table is $2$ $3$ $4$ Cannot be determined
answered
in
Analytical Aptitude
Feb 14, 2017
8.0k
views
gatecse-2017-set1
analytical-aptitude
round-table-arrangement
2
votes
14
GateBook Mock-Test-2
Suppose datagrams are limited to 1,500 bytes (including header) between source Host A and destination Host B. Assuming a 20-byte IP header and a 20-byte TCP header, how many datagrams would be required to send an MP3 consisting of 4 million bytes?
answered
in
Computer Networks
Feb 8, 2017
7.5k
views
computer-networks
gatebook-mt2
ip-packet
173
votes
15
GATE CSE 2007 | Question: 50
An array of $n$ numbers is given, where $n$ is an even number. The maximum as well as the minimum of these $n$ numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed? At least $2n-c$ comparisons, for ... $c$ are needed. At most $1.5n-2$ comparisons are needed. At least $n\log_2 n$ comparisons are needed None of the above
answered
in
Algorithms
Feb 5, 2017
29.4k
views
gatecse-2007
algorithms
time-complexity
easy
2
votes
16
YACC-
in case of shift-reduce and R-R conflict, which is favored by YACC?
answered
in
Compiler Design
Feb 3, 2017
479
views
compiler-design
parsing
lr-parser
descriptive
5
votes
17
Test by Bikram | Mock GATE | Test 2 | Question: 27
Let $T$ be a depth-first search tree of a connected undirected graph $G$. For each vertex $v$ of $T$, Let pre$\left ( v \right )$ be the number of nodes visited up to and including $v$ during a preorder traversal of $T$ ... is the lowest common ancestor of $u$ and $v$ in $T$, then $w = u$. II only III only I and II II and III
answered
in
GATE
Feb 1, 2017
807
views
tbb-mockgate-2
data-structures
graph-algorithms
depth-first-search
4
votes
18
Test by Bikram | Mock GATE | Test 2 | Question: 6
The designers of a cache system wants to reduce the number of cache misses that occur in a certain group of programs. Which of the following statements is/are correct regarding what designers can do? If compulsory misses are most common, then ... provide more flexibility when a collision occurs. I, II, and III I and II only II and III only III only
answered
in
GATE
Jan 31, 2017
594
views
tbb-mockgate-2
co-and-architecture
cache-memory
5
votes
19
Test by Bikram | Mock GATE | Test 1 | Question: 37
A pulse train with a frequency of $1$ $MHz$ is counted using a modulo $1024$ ripple counter built with $J-K$ flip flops. For proper operation of the counter, the maximum permissible propagation delay per flip flop stage is: $10 \: nsec$ $100 \: nsec$ $1000 \: nsec$ $100 \: microsec$
answered
in
GATE
Jan 23, 2017
992
views
tbb-mockgate-1
ripple-counter-operation
digital-counter
digital-logic
1
vote
20
Test by Bikram | Operating Systems | Test 2 | Question: 5
Let us initialize counting semaphore $X$ to $5$. Assume that processes $P_i$ where $i= 1$ to $15$ are coded as follows. while (1) { P (x); { critical section } V (x); } and suppose that $P_{16}$ is coded as follows: ... { critical section } P (x); } The number of processes can be in the critical section at most at any point of time is ______
answered
in
Operating System
Jan 19, 2017
812
views
tbb-os-2
numerical-answers
process-synchronization
1
vote
21
Test by Bikram | Databases | Test 1 | Question: 19
Which is the best file organization when data is frequently added or deleted from a file? Sequential Direct Index sequential None of the above
answered
in
Databases
Jan 17, 2017
414
views
tbb-dbms-1
3
votes
22
Test by Bikram | Compiler Design | Test 1 | Question: 12
Read the below mentioned grammar: $S \rightarrow X$ $X \rightarrow YX \mid \epsilon$ $Y \rightarrow aY \mid b$ This grammar is NOT: $LALR$ $LR (0)$ $LR(1)$ None of the above
answered
in
Compiler Design
Jan 13, 2017
414
views
tbb-cd-1
compiler-design
grammar
1
vote
23
Travelling Salesman Problem
A)250 B)300 C)550 D)375
answered
in
Algorithms
Jan 5, 2017
4.9k
views
graph-algorithms
test-series
111
votes
24
GATE CSE 2012 | Question: 45
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the threshold at the start of the first transmission is $8$ MSS. Assume that a timeout occurs during ... Find the congestion window size at the end of the tenth transmission. $8$ MSS $14$ MSS $7$ MSS $12$ MSS
answered
in
Computer Networks
Dec 4, 2016
38.3k
views
gatecse-2012
computer-networks
congestion-control
normal
124
votes
25
GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
answered
in
Algorithms
Nov 28, 2016
54.0k
views
gatecse-2014-set1
algorithms
numerical-answers
normal
maximum-minimum
2
votes
26
TIFR CSE 2014 | Part B | Question: 11
Consider the following recurrence relation: $T\left(n\right)= \begin{cases} T\left(\frac{n}{k}\right)+ T\left(\frac{3n}{4}\right)+ n & \text{if } n \geq 2 \\ 1& \text{if } n=1 \end{cases}$ Which of the following statements is FALSE? $T(n)$ is $O(n^{3/2})$ ... $k=4$. $T(n)$ is $O(n \log n)$ when $k=5$. $T(n)$ is $O(n)$ when $k=5$.
answered
in
Algorithms
Nov 14, 2016
5.6k
views
tifr2014
algorithms
recurrence-relation
15
votes
27
GATE CSE 2000 | Question: 1.21
Let $m[0]\ldots m[4]$ be mutexes (binary semaphores) and $P[0]\ldots P[4]$ be processes. Suppose each process $P[i]$ executes the following: wait (m[i]); wait (m(i+1) mod 4]); ........... release (m[i]); release (m(i+1) mod 4]); This could cause Thrashing Deadlock Starvation, but not deadlock None of the above
answered
in
Operating System
Sep 10, 2016
21.9k
views
gatecse-2000
operating-system
process-synchronization
normal
1
vote
28
TIFR CSE 2014 | Part B | Question: 7
Which of the following statements is TRUE for all sufficiently large $n$? $\displaystyle \left(\log n\right)^{\log\log n} < 2^{\sqrt{\log n}} < n^{1/4}$ $\displaystyle 2^{\sqrt{\log n}} < n^{1/4} < \left(\log n\right)^{\log\log n}$ ... $\displaystyle 2^{\sqrt{\log n}} < \left(\log n\right)^{\log\log n} < n^{1/4}$
answered
in
Algorithms
Aug 6, 2016
4.0k
views
tifr2014
algorithms
time-complexity
1
vote
29
True/False
(logn)1/2=O(loglogn)
answered
in
Algorithms
Aug 6, 2016
1.4k
views
asymptotic-notation
1
vote
30
which function has higher growth rate among $n^3$ and $(\log n)!$ ?
According to me $n^3$ should be asymptotically greater since $(\log n)!$ is computed like $\log n$ will be a small constant less than $n$ and when I calculate its factorial it will obviously be less than $n^3$.
answered
in
Algorithms
Aug 6, 2016
877
views
asymptotic-notation
Page:
1
2
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...