Dark Mode

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.

asked in Job Queries Jun 17, 2017

5.4k views

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.

asked in Mathematical Logic Feb 1, 2017

170 views

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

asked in Compiler Design Feb 1, 2017

319 views

1 vote

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.

asked in Algorithms Feb 1, 2017

642 views

1 vote

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

asked in Databases Feb 1, 2017

1.2k views

1 vote

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

asked in Operating System Feb 1, 2017

357 views

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

asked in Theory of Computation Feb 1, 2017

236 views

0 votes

1 answer

8

Programming problem : Test Series

asked in Programming in C Feb 1, 2017

311 views

0 votes

1 answer

9

CFL - Problem Test Series
L={a^n b^k, n <= k <=2n} 1.CFL 2.Non CFL

asked in Theory of Computation Jan 30, 2017

394 views

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.

asked in Theory of Computation Jan 20, 2017

302 views

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.

asked in Graph Theory Jan 20, 2017

4.0k views

1 vote

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.

asked in Mathematical Logic Oct 19, 2016

266 views

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

asked in DS Jul 13, 2016

778 views