Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
parthbkgadoya
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by parthbkgadoya
11
answers
1
GATE CSE 1994 | Question: 1.11
In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size $n \times n$, non-zero elements, (i.e elements of lower triangle) of each row are stored one after another, starting from the first row, the index of the ... is: $i+j$ $i+j-1$ $(j-1)+\frac{i(i-1)}{2}$ $i+\frac{j(j-1)}{2}$
In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size $n \times n$, non-zero eleme...
27.9k
views
commented
Jun 29, 2017
DS
gate1994
data-structures
array
normal
+
–
1
answer
2
GATE for Data Scientists and machine learning engineer
Hello everyone, I want to ask some questions related to data science and GATE. First, how to launch career in Data science field? What is role of GATE score in this career? Second, Which college/university has good data science ... . Thanks for reading such post. Please do answer and help someone like me. Thanks in advance for your answer.
Hello everyone,I want to ask some questions related to data science and GATE.First, how to launch career in Data science field? What is role of GATE score in this career?...
5.3k
views
asked
Jun 17, 2017
Job Queries
data-science
machine-learning
job
admissions
gatecse-2018
+
–
9
answers
3
GATE IT 2008 | Question: 44
When $n = 2^{2k}$ for some $k \geqslant 0$, the recurrence relation $T(n) = √(2) T(n/2) + √n$, $T(1) = 1$ evaluates to : $√(n) (\log n + 1)$ $√(n) \log n$ $√(n) \log √(n)$ $n \log √n$
When $n = 2^{2k}$ for some $k \geqslant 0$, the recurrence relation$T(n) = √(2) T(n/2) + √n$, $T(1) = 1$evaluates to :$√(n) (\log n + 1)$$√(n) \log n$$√(n) \log...
17.1k
views
commented
Feb 8, 2017
Algorithms
gateit-2008
algorithms
recurrence-relation
normal
+
–
2
answers
4
TestBook Test Series: Algorithms - Sorting
1.1k
views
answered
Feb 8, 2017
Algorithms
testbook-test-series
algorithms
sorting
+
–
12
answers
5
GATE CSE 2003 | Question: 64
Let S be a stack of size $n \geq1$. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform $n$ pop operations. Assume that Push and Pop operations take $X$ seconds each, and $Y$ seconds elapse between the end of one such ... S. The average stack-life of an element of this stack is $n(X+Y)$ $3Y+2X$ $n(X+Y)-X$ $Y+2X$
Let S be a stack of size $n \geq1$. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform $n$ pop operations. Assume th...
30.7k
views
commented
Feb 4, 2017
DS
gatecse-2003
data-structures
stack
normal
+
–
0
answers
6
DMGT doubt
How to solve matching problem? How to solve counting problem? How to solve first order logic problem? Thanks. Do help if possible.
How to solve matching problem?How to solve counting problem?How to solve first order logic problem?Thanks. Do help if possible.
167
views
asked
Feb 1, 2017
Mathematical Logic
mathematical-logic
discrete-mathematics
+
–
1
answer
7
Compiler design
G : Grammar S1 : Every LALR(1) G is LR(1). S2 : Every LR(1) G is LALR(1). S3: Some LL(1) is Regular. A. TFF B.TFT C. TTF D. FTT E. NONE
G : GrammarS1 : Every LALR(1) G is LR(1).S2 : Every LR(1) G is LALR(1).S3: Some LL(1) is Regular.A. TFF B.TFT C. TTF D. FTT E. NONE
312
views
asked
Feb 1, 2017
Compiler Design
compiler-design
parsing
lr-parser
+
–
1
answer
8
Algorithm Complexity problem
T(n) = 4T(sqrt(n)) + (logn)^5 Find Time complexity.(n=2^k) Give detailed answer , how to derive it.
T(n) = 4T(sqrt(n)) + (logn)^5Find Time complexity.(n=2^k)Give detailed answer , how to derive it.
621
views
asked
Feb 1, 2017
Algorithms
algorithms
time-complexity
master-theorem
+
–
2
answers
9
DBMS normalization concept problem
R(ABCDEF) FD set{ AB->CDE. CD->E, E->C } False statement? A. 2 NF decomposition possible B.3 NF decomposition possible C.BCNF decomposition possible D. ALL
R(ABCDEF)FD set{AB->CDE. CD->E, E->C}False statement?A. 2 NF decomposition possibleB.3 NF decomposition possibleC.BCNF decomposition possibleD. ALL
1.1k
views
asked
Feb 1, 2017
Databases
databases
+
–
1
answer
10
OS conceptual problem
In a system, there are 2 process and Round robin policy is employed. After some time one process gets completed, but another process is remaining with 6 unit burst time.Time Quantam is 2 unit. So, how many context switch occurs to complete this remaining process?(Ignore previous and last context switch.) A. 0 B. 2 C. 3 D. 4
In a system, there are 2 process and Round robin policy is employed. After some time one process gets completed, but another process is remaining with 6 unit burst time.T...
345
views
asked
Feb 1, 2017
Operating System
operating-system
+
–
1
answer
11
TOC Test Series
L1 and L2 Are Decidable. then L1 union L2 is (a)______ and L1 - L2 is(b) _________. a. Regular, cfl ,csl, rel. rec b. decidable, undecidable
L1 and L2 Are Decidable. then L1 union L2 is (a)______and L1 - L2 is(b) _________.a. Regular, cfl ,csl, rel. recb. decidable, undecidable
231
views
asked
Feb 1, 2017
Theory of Computation
theory-of-computation
+
–
1
answer
12
Programming problem : Test Series
307
views
asked
Feb 1, 2017
1
answer
13
CFL - Problem Test Series
L={a^n b^k, n <= k <=2n} 1.CFL 2.Non CFL
L={a^n b^k, n <= k <=2n}1.CFL2.Non CFL
371
views
asked
Jan 30, 2017
1
answer
14
Interesting Problem of TOC Test Series
Which of following Is closed under Homomorphism? A. Computable Enumerable Language B. Decidable Language C. DCFL D. CSL Explain Neatly.
Which of following Is closed under Homomorphism?A. Computable Enumerable LanguageB. Decidable LanguageC. DCFLD. CSL Explain Neatly.
292
views
asked
Jan 20, 2017
Theory of Computation
theory-of-computation
test-series
+
–
1
answer
15
Graph Theory Problem-Test Series
A Connected Graph has Cut edge, Then Graph has Cut vertex also. 1. True 2. False Choose Correct One.
A Connected Graph has Cut edge, Then Graph has Cut vertex also.1. True2. FalseChoose Correct One.
4.0k
views
asked
Jan 20, 2017
Graph Theory
graph-theory
engineering-mathematics
+
–
10
answers
16
GATE CSE 2010 | Question: 32
In the sequential circuit shown below, if the initial value of the output $Q_1Q_0$ is $00$. What are the next four values of $Q_1Q_0$? $11$, $10$, $01$, $00$ $10$, $11$, $01$, $00$ $10$, $00$, $01$, $11$ $11$, $10$, $00$, $01$
In the sequential circuit shown below, if the initial value of the output $Q_1Q_0$ is $00$. What are the next four values of $Q_1Q_0$? $11$, $10$, $01$, $00$$10$, $11$, $...
30.5k
views
commented
Jan 17, 2017
Digital Logic
gatecse-2010
digital-logic
circuit-output
normal
+
–
8
answers
17
GATE CSE 2007 | Question: 53
Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE? Both P and Q are true P is true and Q is false P is false and Q is true Both P and Q are false
Consider the following two statements:P: Every regular grammar is LL(1)Q: Every regular set has a LR(1) grammarWhich of the following is TRUE?Both P and Q are trueP is tr...
35.4k
views
commented
Dec 15, 2016
Compiler Design
gatecse-2007
compiler-design
grammar
normal
+
–
3
answers
18
GATE CSE 2014 Set 2 | Question: 28
A graphical HTML browser resident at a network client machine $Q$ accesses a static HTML webpage from a HTTP server $S$. The static HTML page has exactly one static embedded image which is also at $S$. Assuming no caching, which one of the following ... HTTP request from $Q$ to $S$ is sufficient, and this is possible without any TCP connection between $Q$ and $S$
A graphical HTML browser resident at a network client machine $Q$ accesses a static HTML webpage from a HTTP server $S$. The static HTML page has exactly one static embed...
6.8k
views
commented
Dec 8, 2016
Web Technologies
gatecse-2014-set2
web-technologies
html
easy
+
–
9
answers
19
GATE CSE 2014 Set 3 | Question: 25
Host A (on TCP/IP v4 network A) sends an IP datagram D to host B (also on TCP/IP v4 network B). Assume that no error occurred during the transmission of D. When D reaches B, which of the following IP header field(s) may be different from that of the original datagram ... $\text{ii}$ only $\text{ii}$ and $\text{iii}$ only $\text{i, ii}$ and $\text{iii}$
Host A (on TCP/IP v4 network A) sends an IP datagram D to host B (also on TCP/IP v4 network B). Assume that no error occurred during the transmission of D. When D reaches...
16.2k
views
commented
Dec 4, 2016
Computer Networks
gatecse-2014-set3
computer-networks
ip-packet
normal
+
–
5
answers
20
GATE CSE 2014 Set 2 | Question: 27
An IP machine $Q$ has a path to another $IP\ machine\ H$ via three $IP\ routers \ R1, R2,$ and $R3$. $Q-R1-R2-R3-H$ $H$ acts as an $\text{HTTP}\ server$, and $Q$ connects to $H$ via $\text{HTTP}$ and downloads a file. Session layer ... $R2$ alone? Only $I1$ and $I2$ Only $I1$ Only $I2$ and $I3$ Only $I3$ and $I4$
An IP machine $Q$ has a path to another $IP\ machine\ H$ via three $IP\ routers \ R1, R2,$ and $R3$.$Q-R1-R2-R3-H$$H$ acts as an $\text{HTTP}\ server$, and $Q$ connects t...
14.6k
views
commented
Dec 4, 2016
Computer Networks
gatecse-2014-set2
computer-networks
network-security
normal
out-of-gate-syllabus
+
–
3
answers
21
SPACE COMPLEXITY
991
views
commented
Dec 4, 2016
Algorithms
space-complexity
sorting
ace-test-series
+
–
8
answers
22
MadeEasy Test Series: Algorithms - Shortest Paths
Consider the following statements For every weighted graph and any two vertices $s$ and $t$, Bellman-Ford algorithm starting at $s$ will always return the shortest path to $t$. At the termination of the Bellman-ford algorithm, ... shortest path is found for a vertex for which shortest path is well-defined. Which of the above statements are true?
Consider the following statementsFor every weighted graph and any two vertices $s$ and $t$, Bellman-Ford algorithm starting at $s$ will always return the shortest path to...
4.2k
views
answered
Nov 2, 2016
Algorithms
made-easy-test-series
algorithms
shortest-path
descriptive
+
–
0
answers
23
Need of Concept Clarity
I want to understand Validity Check in First order logic. Also I want to have technique or specific way of how to approach or answer GATE question on this topic? Please give Pure explanation. Detailed Answer. It would be great help for GATE aspirants like me. Thanks in Advance.
I want to understand Validity Check in First order logic. Also I want to have technique or specific way of how to approach or answer GATE question on this topic?Please gi...
260
views
asked
Oct 19, 2016
Mathematical Logic
mathematical-logic
discrete-mathematics
first-order-logic
+
–
7
answers
24
GATE CSE 2014 Set 3 | Question: 24
A bit-stuffing based framing protocol uses an $\text{8-bit}$ delimiter pattern of $01111110.$ If the output bit-string after stuffing is $01111100101,$ then the input bit-string is: $0111110100$ $0111110101$ $0111111101$ $0111111111$
A bit-stuffing based framing protocol uses an $\text{8-bit}$ delimiter pattern of $01111110.$ If the output bit-string after stuffing is $01111100101,$ then the input bit...
22.2k
views
commented
Oct 11, 2016
Computer Networks
gatecse-2014-set3
computer-networks
error-detection
+
–
8
answers
25
how many process created?
Consider the following Pseudo code main() { int t1=0,t2=0,t3=0; t1=fork(); t2=fork(); if(t1!=0) { t3=fork(); printf("0"); } } Find the total number of processes that will be created by the above program execution.
Consider the following Pseudo codemain() { int t1=0,t2=0,t3=0; t1=fork(); t2=fork(); if(t1!=0) { t3=fork(); printf("0"); } }Find the total number of processes that will b...
9.1k
views
commented
Oct 10, 2016
Operating System
operating-system
fork-system-call
+
–
0
answers
26
GATE IT 2007 Tree Traversals
When searching for the key value 60 in a binary search tree, nodes containing the key values 10, 20, 40, 50, 70 80, 90 are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value 60? a) 35 b) 64 c) 128 d) 5040
When searching for the key value 60 in a binary search tree, nodes containing the key values 10, 20, 40, 50, 70 80, 90 are traversed, not necessarily in the order given. ...
771
views
commented
Jul 13, 2016
DS
binary-tree
data-structures
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register