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 codingo1234
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by codingo1234
2
answers
1
Congestion Window 1.3
The initial congestion window size over a TCP is 1. If slow start algorithm is used and the size of congestion window incremented by 1 whenever an ACK is received i.e. after first rounda trip time congestion window size is 2 segments. Assume that connection never leaves slow start. The number of RTT’s to send 3999 segments are _______.
commented
in
Computer Networks
Jan 15, 2020
1.9k
views
8
answers
2
GATE CSE 2015 Set 2 | Question: 7
The minimum number of $\text{JK}$ flip-flops required to construct a synchronous counter with the count sequence $(0, 0, 1, 1, 2, 2, 3, 3, 0, 0, \ldots)$ is _______.
commented
in
Digital Logic
Jan 12, 2020
36.8k
views
gatecse-2015-set2
digital-logic
digital-counter
normal
numerical-answers
1
answer
3
carry look ahead adder vs ripple carry
$Exclusive-OR$ gate has a propagation delay of $10$ ns and that the $AND$ or $OR$ gates have a propagation delay of $5$ ns.What is the total propagation delay time in the four-bit adder.Assume $FAN-IN =2$ $1)$ ripple adder $2)$ carry look ahead adder
commented
in
Digital Logic
Jan 12, 2020
1.1k
views
digital-logic
8
answers
4
GATE IT 2008 | Question: 28
Consider the following Hasse diagrams. Which all of the above represent a lattice? (i) and (iv) only (ii) and (iii) only (iii) only (i), (ii) and (iv) only
commented
in
Set Theory & Algebra
Dec 12, 2019
15.0k
views
gateit-2008
set-theory&algebra
lattice
normal
1
answer
5
GB DSA-Test 4-Question 17
If Radix sort is used to sort an array of n integers which are in the range , where d is some function of input size, the time taken would be? (A) (B) (C) (D)
commented
in
Programming in C
Nov 28, 2019
3.2k
views
algorithms
sorting
radix-sort
time-complexity
3
answers
6
GATE CSE 2006 | Question: 30
For $s\in (0+1)^{*}$ let $d(s)$ denote the decimal value of $s ($e.g. $d (101) = 5 ).$ Let $L=\left \{ s\in (0+1)^*\mid d(s) \text{ mod } 5=2 \text{ and }d(s) \text{ mod } 7\neq 4 \right \}$Which ... following statements is true? $L$ is recursively enumerable, but not recursive $L$ is recursive, but not context-free $L$ is context-free, but not regular $L$ is regular
comment edited
in
Theory of Computation
Nov 21, 2019
7.6k
views
gatecse-2006
theory-of-computation
normal
identify-class-language
0
answers
7
MadeEasy Subject Test 2019: Theory of Computation - Regular Expressions
Which of the following RE are equivalent ? (a+b)*abb(a+b)* (a+b)*a(a+b)*bb(a+b)* (a+b)*ab(a+b)*b(a+b)*
commented
in
Theory of Computation
Nov 13, 2019
492
views
regular-language
theory-of-computation
made-easy-test-series
0
answers
8
MadeEasy Test Series : Regular Expression
Consider the following regular expressions: I. 0(0+1)* II. 0* 10*1(0 +1)* III (0+10)*(1+€) IV.[(0*10* 10*)* +0*]10* A language L whose regular expression is r is said to be reverse isomorphic if L(r)= L(r^R). How many of the above regular expressions are reverse isomorphic?
commented
in
Theory of Computation
Nov 13, 2019
940
views
made-easy-test-series
theory-of-computation
0
answers
9
MadeEasy Test Series: Theory of Computation- Indentify Class Language
$L^{*}-\{{\epsilon }\}=L^{+}$. True or False? (Given L is a language)
commented
in
Theory of Computation
Nov 13, 2019
658
views
regular-language
theory-of-computation
made-easy-test-series
0
answers
10
MadeEasy Subject Test 2019: Theory of Computation - Finite Automata
Consider the following NFA M , over the alphabet {a} let L(M) be the language accepted by the NFA M . let $M'$ ... $L (M' ) - L(M)) = phi$ $L (M' ) \cup L(M)) = phi$
commented
in
Theory of Computation
Nov 13, 2019
553
views
theory-of-computation
finite-automata
made-easy-test-series
10
answers
11
GATE CSE 2000 | Question: 2.17
Consider the following functions $f(n) = 3n^{\sqrt{n}}$ $g(n) = 2^{\sqrt{n}{\log_{2}n}}$ $h(n) = n!$ Which of the following is true? $h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)$ is not $O(f(n))$ $f(n)$ is $O(g(n))$
commented
in
Algorithms
Oct 4, 2019
22.8k
views
gatecse-2000
algorithms
asymptotic-notation
normal
1
answer
12
GATE 1997-2.7 Small change in given data
Consider the schema R = (S T U V) and the dependencies S → T, T → U, U → V and V → S. Let R = (R1 and R2) be a decomposition such that R1 ∩ R2 = ϕ. (In the actual gate question it was R1∩R2 ≠ ϕ) The decomposition is:- not in 2NF in 2NF but not 3NF in 3NF but not in 2NF in both 2NF and 3NF
commented
in
Databases
Sep 15, 2019
1.2k
views
usergate-1997
database-normalization
databases
2
answers
13
Made Easy Test Series: Database-Normalization
Consider the relation $R\left ( A,B,C,D,E \right )$ with functional dependencies $F=${ $A\rightarrow B$ $BC\rightarrow E$ $ED\rightarrow A$ } Number of additional relation required to convert it into lossless , dependency preserving $3NF$ decomposition is _____________ What is meaning of additional relation (Here no table mentioned previously)??
commented
in
Databases
Sep 13, 2019
1.3k
views
databases
made-easy-test-series
database-normalization
2
answers
14
#ACE_ACADEMY_DISCRETE_MATHS_BOOKLET.
Which of the following is not true? (a) Number of edge-disjoint Hamiltonian cycles in $K_7$ is $3$ (b) If $G$ is a simple graph with $6$ vertices and the degree of each vertex is at least $3$, then the Hamiltonian cycle exists in ... simple graph with $5$ vertices and $7$ edges, then the Hamiltonian cycle exists in $G$ Please help me understand all the options.
commented
in
Graph Theory
Sep 11, 2019
2.6k
views
discrete-mathematics
graph-theory
ace-booklet
0
answers
15
MadeEasy Full Length Test 2019: Databases - Er Diagram
Find minimum number of tables needed? Answer : (3) Can anyone please explain the answer and how to approach such complex er diagrams?
commented
in
Databases
Sep 8, 2019
902
views
databases
er-diagram
made-easy-test-series
1
answer
16
Made Easy Test Series:TOC-DFA
How many number of $DFA$ states(minimal DFA) required which accepts the language $L=\left \{ a^{n}:n=\text{3 or n>= 2m for all m>= 1} \right \}$ ___________ Answer will be $3$ or $6?$
commented
in
Theory of Computation
Sep 4, 2019
976
views
theory-of-computation
test-series
made-easy-test-series
1
answer
17
Ace Test Series: DBMS - SQL Query Output
commented
in
Databases
Sep 1, 2019
834
views
ace-test-series
databases
sql
1
answer
18
Ace Test Series: DBMS - Correlated Sql Query
According to me it should be – “Retrieve the names of all students with a lower rank, than all students with age < 18 ”
comment edited
in
Databases
Sep 1, 2019
1.3k
views
sql
databases
query
ace-test-series
1
answer
19
MadeEasy Test Series: Databases - Sql
i think neither of the queries can implement given specification. plz confirm!
commented
in
Databases
Sep 1, 2019
661
views
made-easy-test-series
databases
sql
1
answer
20
MadeEasy Subject Test: Databases - Sql
Please help,not able to decode this query
commented
in
Databases
Sep 1, 2019
1.1k
views
databases
made-easy-test-series
sql
8
answers
21
GATE CSE 2013 | Question: 26
The line graph $L(G)$ of a simple graph $G$ is defined as follows: There is exactly one vertex $v(e)$ in $L(G)$ for each edge $e$ in $G$. For any two edges $e$ and $e'$ in $G$, $L(G)$ has an edge between $v(e)$ and $v(e')$, if and only if ... planar graph is planar. (S) The line graph of a tree is a tree. $P$ only $P$ and $R$ only $R$ only $P, Q$ and $S$ only
commented
in
Graph Theory
Aug 28, 2019
19.1k
views
gatecse-2013
graph-theory
normal
graph-connectivity
2
answers
22
MadeEasy Test Series: Theory Of Computation - Finite Automata
How may Moore/Mealy m/c are possible with two states X & Y for the input alphabet {a, b} and output alphabet {0, 1} , where x is always the initial state?
commented
in
Theory of Computation
Aug 23, 2019
1.2k
views
made-easy-test-series
theory-of-computation
finite-automata
11
answers
23
GATE CSE 1999 | Question: 2.7, UGCNET-June2014-III: 25
Consider the schema $R=(S,T, U, V)$ and the dependencies $S \rightarrow T, T \rightarrow U, U \rightarrow V$ and $V \rightarrow S$. Let $R = (R1\text{ and } R2)$ be a decomposition such that $R1 \cap R2 \neq \phi$. The decomposition ... but not $\textsf{3NF}$ in $\textsf{3NF}$ but not in $\textsf{2NF}$ in both $\textsf{2NF}$ and $\textsf{3NF}$
commented
in
Databases
Jul 27, 2019
27.3k
views
gate1999
databases
database-normalization
normal
ugcnetjune2014iii
0
answers
24
#SELF DOUBT(WEAK ENTITY IN DBMS)
Can a weak entity depend on more than one strong entity?If yes then how does that exaclty work?
asked
in
Databases
Apr 8, 2019
243
views
databases
self-doubt
5
answers
25
GATE CSE 2015 Set 3 | Question: 34
For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time? ... First Come First Serve Non-preemptive Shortest job first Shortest Remaining Time Round Robin with Quantum value two
commented
in
Operating System
Mar 27, 2019
18.9k
views
gatecse-2015-set3
operating-system
process-scheduling
normal
4
answers
26
GATE CSE 2006 | Question: 32, ISRO2016-35
Consider the following statements about the context free grammar $G = \left \{ S \rightarrow SS, S \rightarrow ab, S \rightarrow ba, S \rightarrow \epsilon \right \} $ $G$ is ambiguous $G$ produces all strings with equal number of $a$'s ... combination below expresses all the true statements about $G$? I only I and III only II and III only I, II and III
commented
in
Compiler Design
Jan 23, 2019
28.7k
views
gatecse-2006
compiler-design
context-free-language
normal
isro2016
2
answers
27
View-equivalent serial schedule
Consider a schedule S: r1(A); W1(B); W1(C); r2(A); W2(B); W2(C); abort2; r3(A); W3(B); W3(C); C1; C3 How many view equivalent serial schedules are possible for the given schedule ? 2 4 3 5
comment edited
in
Databases
Jan 21, 2019
1.4k
views
9
answers
28
GATE CSE 2007 | Question: 34
Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of $n$ variables. What is the minimum size of the multiplexer needed? $2^n$ line to $1$ line $2^{n+1}$ line to $1$line $2^{n-1}$ line to $1$line $2^{n-2}$ line to $1$line
commented
in
Digital Logic
Jan 17, 2019
31.5k
views
gatecse-2007
digital-logic
normal
multiplexer
2
answers
29
GATE CSE 2002 | Question: 17
The following table refers to search items for a key in $B$-trees and $B^+$ ... $(2,11)$ and $(11,6)$ are now inserted into $R.$ What are the additional tuples that are inserted in $V$?
commented
in
Databases
Jan 16, 2019
5.7k
views
gatecse-2002
databases
b-tree
normal
descriptive
1
answer
30
GATE CSE 2002 | Question: 10
In a C program, an array is declared as $\text{float} \ A[2048]$. Each array element is $4 \ \text{Bytes}$ in size, and the starting address of the array is $0x00000000$. This program is run on a computer that has a direct ... ? Justify your answer briefly. Assume that the data cache is initially empty and that no other data or instruction accesses are to be considered.
commented
in
CO and Architecture
Jan 15, 2019
6.1k
views
gatecse-2002
co-and-architecture
cache-memory
normal
descriptive
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:...