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
Questions by parthbkgadoya
5
votes
1
answer
1
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
+
–
0
votes
0
answers
2
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.
166
views
asked
Feb 1, 2017
Mathematical Logic
mathematical-logic
discrete-mathematics
+
–
0
votes
1
answer
3
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
310
views
asked
Feb 1, 2017
Compiler Design
compiler-design
parsing
lr-parser
+
–
1
votes
1
answer
4
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.
619
views
asked
Feb 1, 2017
Algorithms
algorithms
time-complexity
master-theorem
+
–
1
votes
2
answers
5
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
votes
1
answer
6
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...
343
views
asked
Feb 1, 2017
Operating System
operating-system
+
–
0
votes
1
answer
7
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
230
views
asked
Feb 1, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
1
answer
8
Programming problem : Test Series
305
views
asked
Feb 1, 2017
0
votes
1
answer
9
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
368
views
asked
Jan 30, 2017
0
votes
1
answer
10
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.
290
views
asked
Jan 20, 2017
Theory of Computation
theory-of-computation
test-series
+
–
0
votes
1
answer
11
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
+
–
1
votes
0
answers
12
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...
259
views
asked
Oct 19, 2016
Mathematical Logic
mathematical-logic
discrete-mathematics
first-order-logic
+
–
0
votes
0
answers
13
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. ...
768
views
asked
Jul 13, 2016
DS
binary-tree
data-structures
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register