Dark Mode

Questions by __

0 votes

0 answers

1

do I have to apply separately for exam I already for it with the thought of Inclusion of gate score

asked in IS&Software Engineering Feb 13, 2017

345 views

0 votes

0 answers

2

#nlc payment
@ arjun sir for nlc application i have done sbi collect payment 2 days before but still nlc is showing fee paid status as not paid what to do now

asked in Graph Theory Jan 15, 2017

463 views

0 votes

1 answer

3

daa doubt
how to decide height , depth and level of tree and no. of internal nodes in tree some books take root as internal node height as no. of edges b/w root and leaf(longest path), some take level starting from root as 0

asked in DS Sep 2, 2016

267 views

2 votes

3 answers

4

doubt | ER Diagram
wat does arrow represent in er diagram when can we many to one or one to many by seeing arrows

asked in Databases Sep 2, 2016

2.0k views

0 votes

1 answer

5

daa
The conventional way of multiplying two n-bit integers requires O(n2) time. There are much better ways of multiplying long integers, based on a divide-and-conquer approach. For example, we can break each n-bit integer into n/2-bit halves, and produce the result by making 3 recursive calls to n/2-bit multiplications ... of some sort. a) x=53; y=12. b) x=44; y=11. c) x=40; y=10. d) x=27; y=8.

asked in Algorithms Sep 2, 2016

363 views

1 vote

0 answers

6

dag
Here is a sequence of twelve array assignments and references: r = a[i] s = a[j] t = a[i] a[j] = b u = a[i] v = a[j] a[j] = c w = a[i] x = a[j] y = a[i] z = a[j] a[j] = b Construct the DAG for these instructions. Which of the following pairs of variables label the same node of the DAG? a) t and u b) r and s c) w and y d) t and s

asked in Compiler Design Sep 2, 2016

558 views

1 vote

1 answer

7

toc
Find minimized finite automata which recognizes the below languages, separately by m1 and m2 over binary strings as input, then find the number of states in each of the following. L1:L2 is a language, which contains a set of strings which produces a remainder 1', when ... m2 contains 8 states (c) m1 contains 3 states and m2 contains 9 states (d) m1 contains 4 states and m2 contains 9 states

asked in Unknown Category Sep 1, 2016

354 views

3 votes

1 answer

8

toc
10. Consider the following languages: L ne = {〈M〉│L(M) ≠ ф } L e = {〈M〉│L(M) = ф } where 〈M〉 denotes encoding of a Turning machine M Then which one of the following is true? (a) Lne is r.e. but not recursive and Le is not r.e. (b) Both are not r.e. (c) Both are recursive (d) Le is r.e. but not recursive and Lne is not r.e.

asked in Unknown Category Sep 1, 2016

1.3k views

1 vote

1 answer

9

toc minimal dfa
. Find minimized finite automata which recognizes the below languages, separately by m1 and m2 over binary strings as input, then find the number of states in each of the following. L1:L2 is a language, which contains a set of strings which produces a remainder ... contains 8 states (c) m1 contains 3 states and m2 contains 9 states (d) m1 contains 4 states and m2 contains 9 states

asked in Theory of Computation Sep 1, 2016

844 views

0 votes

0 answers

10

# gateforumsectional test

asked in Computer Networks Jun 28, 2016

188 views