Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
akash.dinkar12
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by akash.dinkar12
2
answers
1
GATE2019 EC: GA-1
The strategies that the company ________ to sell its products _______ house-to-house marketing. use, includes uses, include used, includes uses, including
The strategies that the company ________ to sell its products _______ house-to-house marketing.use, includesuses, includeused, includesuses, including
2.7k
views
commented
Dec 9, 2019
Verbal Aptitude
gate2019-ec
general-aptitude
verbal-aptitude
english-grammar
+
–
1
answer
2
Turing Machine
S1: Can a Turing machine ever write a blank symbol on its tape. S2: Any Turing machine must have at least two states which of above statements are true???
S1: Can a Turing machine ever write a blank symbol on its tape.S2: Any Turing machine must have at least two stateswhich of above statements are true???
1.8k
views
edited
Nov 10, 2019
2
answers
3
Turing Machine-Techtud
If Turing Machine input tape length,restricted to input length, then the language accepted by Turing Machine $A)$ Regular Language $B)$ CFL $C)$ CSL $D)$ None Ans given CSL but I thought it should be regular then what is difference between input restricted and constant size tape? https://gateoverflow.in/26653/gate1991-17-a Plz confirm what is correct?
If Turing Machine input tape length,restricted to input length, then the language accepted by Turing Machine $A)$ Regular Language$B)$ CFL$C)$ CSL$D)$ NoneAns given CSL b...
1.4k
views
comment edited
Nov 1, 2019
Theory of Computation
turing-machine
theory-of-computation
+
–
1
answer
4
ISI2018-MMA-26
Let $C_i(i=0,1,2...n)$ be the coefficient of $x^i$ in $(1+x)^n$.Then $\frac{C_0}{2} – \frac{C_1}{3}+\frac{C_2}{4}-\dots +(-1)^n \frac{C_n}{n+2}$ is equal to $\frac{1}{n+1}\\$ $\frac{1}{n+2}\\$ $\frac{1}{n(n+1)}\\$ $\frac{1}{(n+1)(n+2)}$
Let $C_i(i=0,1,2...n)$ be the coefficient of $x^i$ in $(1+x)^n$.Then $\frac{C_0}{2} – \frac{C_1}{3}+\frac{C_2}{4}-\dots +(-1)^n \frac{C_n}{n+2}$ is equal to$\frac{1}{n+...
1.8k
views
answer selected
Oct 15, 2019
Combinatory
isi2018-mma
engineering-mathematics
discrete-mathematics
generating-functions
+
–
2
answers
5
TIFR2010-Maths-A-1
A cyclic group of order 60 has 12 Generators 15 Generators 16 Generators 20 Generators
A cyclic group of order 60 has12 Generators15 Generators16 Generators20 Generators
4.4k
views
answer edited
Oct 13, 2019
Set Theory & Algebra
tifrmaths2010
group-theory
+
–
0
answers
6
Fermat's theorem
plz explain this.
plz explain this.
553
views
comment edited
Oct 13, 2019
2
answers
7
GATE IT 2008 | Question: 68
Which of the following statements are TRUE? S1: TCP handles both congestion and flow control S2: UDP handles congestion but not flow control S3: Fast retransmit deals with congestion but not flow control S4: Slow start mechanism deals with both congestion and flow control $S1$, $S2$ and $S3$ only $S1$ and $S3$only $S3$and $S4$ only $S1$, $S3$ and $S4$ only
Which of the following statements are TRUE?S1: TCP handles both congestion and flow controlS2: UDP handles congestion but not flow controlS3: Fast retransmit deals wit...
15.8k
views
answer edited
Oct 3, 2019
Computer Networks
gateit-2008
computer-networks
network-protocols
normal
+
–
11
answers
8
GATE CSE 2019 | Question: 45
A certain processor deploys a single-level cache. The cache block size is $8$ words and the word size is $4$ bytes. The memory system uses a $60$-MHz clock. To service a cache miss, the memory controller first takes $1$ cycle to accept ... for the memory system when the program running on the processor issues a series of read operations is ______$\times 10^6$ bytes/sec.
A certain processor deploys a single-level cache. The cache block size is $8$ words and the word size is $4$ bytes. The memory system uses a $60$-MHz clock. To service a ...
20.2k
views
comment edited
Sep 27, 2019
CO and Architecture
gatecse-2019
numerical-answers
co-and-architecture
cache-memory
2-marks
+
–
4
answers
9
ISI2018-MMA-12
The rank of the matrix $\begin{bmatrix} 1 &2 &3 &4 \\ 5& 6 & 7 & 8 \\ 6 & 8 & 10 & 12 \\ 151 & 262 & 373 & 484 \end{bmatrix}$ $1$ $2$ $3$ $4$
The rank of the matrix$\begin{bmatrix} 1 &2 &3 &4 \\ 5& 6 & 7 & 8 \\ 6 & 8 & 10 & 12 \\ 151 & 262 & 373 & 484 \end{bmatrix}$$1$$2$$3$$4$
1.5k
views
answer selected
Sep 24, 2019
Linear Algebra
isi2018-mma
engineering-mathematics
linear-algebra
rank-of-matrix
+
–
2
answers
10
Test by Bikram | Mock GATE | Test 4 | Question: 60
5 9 15 16 29 ? 49 89 147 $\begin{array}{|c|c|c|} \hline 5 & 9 & 15 \\ \hline 16 & 29 & ? \\ \hline 49 & 89 & 147 \\ \hline \end{array}$ The missing number is ________.
59 151629 ?4989 147 $$\begin{array}{|c|c|c|} \hline 5 & 9 & 15 \\ \hline 16 & 29 & ? \\ \hline 49 & 89 & 147 \\ \hline \end{array}$$The missing number is ________.
395
views
answer edited
Aug 21, 2019
GATE
tbb-mockgate-4
numerical-answers
analytical-aptitude
logical-reasoning
+
–
3
answers
11
GATE IT 2008 | Question: 35
Which of the following languages is (are) non-regular? $L_1 = \{0^m1^n \mid 0 \leq m \leq n \leq 10000\}$ $L_2 = \{w \mid w $ reads the same forward and backward$\}$ $L_3 = \{w \in \{0, 1\} ^* \mid w$ contains an even number of 0's and an even number of 1's$\}$ $L_2$ and $L_3$ only $L_1$ and $L_2$ only $L_3$ only $L_2$ only
Which of the following languages is (are) non-regular?$L_1 = \{0^m1^n \mid 0 \leq m \leq n \leq 10000\}$$L_2 = \{w \mid w $ reads the same forward and backward$\}$$L_3 = ...
7.2k
views
comment edited
Aug 11, 2019
Theory of Computation
gateit-2008
theory-of-computation
normal
regular-language
+
–
5
answers
12
General Doubt
the complement of every context-free language is recursive ? or recursive enumerable? or both?
the complement of every context-free language is recursive ? or recursive enumerable? or both?
13.2k
views
edited
Jul 31, 2019
Theory of Computation
general-topic-doubt
theory-of-computation
closure-property
+
–
1
answer
13
Analysis Of Prims Algorithm Time Complexity
Explain Prims Algorithm Analysis Of Time Complexity How does $\mathcal{O}(VlogV + ElogV)=\mathcal{O}(ElogV)$
Explain Prims AlgorithmAnalysis Of Time ComplexityHow does $\mathcal{O}(VlogV + ElogV)=\mathcal{O}(ElogV)$
2.5k
views
answer edited
Jul 11, 2019
Algorithms
algorithms
prims-algorithm
time-complexity
+
–
8
answers
14
GATE CSE 2017 Set 1 | Question: 02
Consider the first-order logic sentence $F:\forall x(\exists yR(x,y))$. Assuming non-empty logical domains, which of the sentences below are implied by $F$? $\exists y(\exists xR(x,y))$ $\exists y(\forall xR(x,y))$ $\forall y(\exists xR(x,y))$ $¬\exists x(\forall y¬R(x,y))$ IV only I and IV only II only II and III only
Consider the first-order logic sentence $F:\forall x(\exists yR(x,y))$. Assuming non-empty logical domains, which of the sentences below are implied by $F$?$\exists y(\ex...
17.1k
views
answer edited
Jul 7, 2019
Mathematical Logic
gatecse-2017-set1
mathematical-logic
first-order-logic
+
–
3
answers
15
Galvin Edition 9 Exercise 4 Question 15 (Page No. 193)
Consider the following code segment: pid t pid; pid = fork(); if (pid == 0) { /* child process */ fork(); thread create( . . .); } fork(); a. How many unique processes are created? b. How many unique threads are created?
Consider the following code segment:pid t pid; pid = fork(); if (pid == 0) { /* child process */ fork(); thread create( . . .); } fork();a. How many unique processes are ...
893
views
edited
Jul 2, 2019
Operating System
galvin
operating-system
threads
programming
+
–
1
answer
16
Self Doubt: CO & Architecture - Microprogramming
Difference between Horizontal Microprogramming and Vertical Microprogramming Plz explain in detail for GATE point of view only.
Difference between Horizontal Microprogramming and Vertical Microprogramming Plz explain in detail for GATE point of view only.
4.0k
views
edited
Jul 2, 2019
CO and Architecture
co-and-architecture
microprogramming
horizontal-microprogramming
+
–
2
answers
17
Horizontal Microprogramming
To represent $256$ control signals in horizontal microprogramming, then the number of bits requires is ___________ $7$ $8$ $128$ $256$ Plz, explain in detail. how the answer would change if horizontal microprogramming is replaced with vertical microprogramming. And what is the difference between horizontal microprogramming and vertical microprogramming?
To represent $256$ control signals in horizontal microprogramming, then the number of bits requires is ___________$7$$8$$128$$256$Plz, explain in detail. how the answer w...
2.4k
views
edited
Jul 2, 2019
CO and Architecture
co-and-architecture
microprogramming
horizontal-microprogramming
+
–
10
answers
18
GATE IT 2006 | Question: 85
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored in ascending order of these primary keys as given in the tables. No indexing is available in the database. ... key, then $n$ lies in the range: $36 - 40$ $44 - 48$ $60 - 64$ $100 - 104$
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored ...
22.2k
views
edited
Jul 2, 2019
Databases
gateit-2006
databases
sql
normal
+
–
3
answers
19
Ace test series question on number of spanning trees possible
951
views
answer edited
Jul 2, 2019
Algorithms
spanning-tree
numerical-answers
ace-test-series
+
–
3
answers
20
GATE CSE 1990 | Question: 2-viii
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{|ll|ll|} \hline (a) & \text{A heap construction} & (p) & \ \Omega(n\log_{10}n) \\\hline (b) & \text{Construct...
5.0k
views
comment edited
Jul 2, 2019
DS
gate1990
match-the-following
data-structures
binary-heap
+
–
9
answers
21
GATE CSE 2016 Set 1 | Question: 38
Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$ ... integer value of $x$, for which at least one shortest path between some pair of vertices will contain the edge with weight $x$ is ___________.
Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$. W=$\begin{bmatrix} 0&2 &8 &...
23.7k
views
answer edited
Jul 1, 2019
DS
gatecse-2016-set1
data-structures
graph-theory
normal
numerical-answers
+
–
3
answers
22
GATE CSE 1998 | Question: 1.7
Let $R_1$ and $R_2$ be two equivalence relations on a set. Consider the following assertions: $R_1 \cup R_2$ is an equivalence relation $R_1 \cap R_2$ is an equivalence relation Which of the following is correct? Both assertions are true Assertions (i) is true ... (ii) is not true Assertions (ii) is true but assertions (i) is not true Neither (i) nor (ii) is true
Let $R_1$ and $R_2$ be two equivalence relations on a set. Consider the following assertions:$R_1 \cup R_2$ is an equivalence relation$R_1 \cap R_2$ is an equivalence rel...
12.3k
views
answer edited
Jul 1, 2019
Set Theory & Algebra
gate1998
set-theory&algebra
relations
normal
+
–
1
answer
23
Dijkstra algorithm
Let $G(V,E)$ an undirected graph with positive edge weights. Dijkstra single source shortest path algorithm can be implemented using sorted linked list data structure. What will be time complexity? $O(|V|^2)$ $O(|V|^3)$ $O(|V|log|V|)$
Let $G(V,E)$ an undirected graph with positive edge weights. Dijkstra single source shortest path algorithm can be implemented using sorted linked list data structure. Wh...
2.5k
views
edited
Jul 1, 2019
Algorithms
dijkstras-algorithm
+
–
0
answers
24
MadeEasy Test Series: Operating System - Process Schedule
344
views
edited
Jul 1, 2019
Operating System
made-easy-test-series
operating-system
process-scheduling
+
–
0
answers
25
ME-OS TEST:Dynamic Priority Scheduling
Anyone please check this
Anyone please check this
496
views
closed
Jul 1, 2019
Operating System
operating-system
test-series
process-scheduling
+
–
3
answers
26
Model Question IISc CDS CS Written Test Sample question
Anand is preparing a pizza with 8 slices, and he has 10 toppings to put on the pizza. He can put only one topping on each slice but can use the same topping on zero or more slices. In how many unique ways can he prepare the slices so that the same topping is not used in adjacent slices?
Anand is preparing a pizza with 8 slices, and he has 10 toppings to put on the pizza. He can put only onetopping on each slice but can use the same topping on zero or mor...
1.7k
views
answer edited
Jun 30, 2019
Combinatory
iisc
cds
+
–
6
answers
27
GATE CSE 2016 Set 1 | Question: 40
$G=(V, E)$ is an undirected simple graph in which each edge has a distinct weight, and $e$ is a particular edge of $G$. Which of the following statements about the minimum spanning trees $(MSTs)$ of $G$ is/are TRUE? If $e$ is the lightest edge of some ... some cycle in $G$, then every MST of $G$ excludes $e$. I only. II only. Both I and II. Neither I nor II.
$G=(V, E)$ is an undirected simple graph in which each edge has a distinct weight, and $e$ is a particular edge of $G$. Which of the following statements about the minimu...
26.0k
views
answer edited
Jun 30, 2019
Algorithms
gatecse-2016-set1
algorithms
spanning-tree
normal
+
–
8
answers
28
GATE CSE 2017 Set 1 | Question: 37
Consider the context-free grammars over the alphabet $\left \{ a, b, c \right \}$ given below. $S$ and $T$ are non-terminals. $G_{1}:S\rightarrow aSb \mid T, T \rightarrow cT \mid \epsilon$ ... is Finite Not finite but regular Context-Free but not regular Recursive but not context-free
Consider the context-free grammars over the alphabet $\left \{ a, b, c \right \}$ given below. $S$ and $T$ are non-terminals.$G_{1}:S\rightarrow aSb \mid T, T \rightarrow...
12.0k
views
answer edited
Jun 30, 2019
Theory of Computation
gatecse-2017-set1
theory-of-computation
context-free-language
identify-class-language
normal
+
–
1
answer
29
max min
Simple linear search to find max min algo maxmin(a,n,max,min) { max=min=a[1]; for i=2 to n do { if a[i]>max then max:=a[i]; else if a[i]<min then min:=a[i]; } } 1.Average case complexity of the above algo given that the first if conditions fails for n/2 elements 2.Average case complexity of the above algo if the first condition fails 1/2 times plz xplain
Simple linear search to find max min algomaxmin(a,n,max,min) { max=min=a ; for i=2 to n do { if a[i]>max then max:=a[i]; else if a[i]<min then min:=a[i]; } }1.Average cas...
1.2k
views
answer edited
Jun 30, 2019
Algorithms
algorithms
time-complexity
easy
+
–
3
answers
30
Self Doubt: Permutations & Combinations
How many solutions are there to the equation $x+y+z=17$ in positive integers? $120$ $171$ $180$ $121$
How many solutions are there to the equation $x+y+z=17$ in positive integers?$120$$171$$180$$121$
3.3k
views
edited
Jun 30, 2019
Combinatory
self-doubt
combinatory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register