Dark Mode

Questions by shipra tressa

1 vote

2 answers

1

DISCRETE MATHEMATICS
Determine which one of the following is a partition of the set R of real numbers. a.[{x:x>4},{x:x<5}] b.[{x:x>0},{0},{x:x<0}] c.[{x:x^2>11},{x:x^2<11}] d.none

asked in Set Theory & Algebra Dec 28, 2018

346 views

0 votes

1 answer

2

combinatorics
What is the sum of the terms in the nth bracket of the series (1), (2,3,4), (5,6,7,8,9) …? (2n-1)^2 (4n+n-1)^3 (n-1)^3+n^3 n^3+(n+1)^3

asked in Combinatory Dec 27, 2018

164 views

0 votes

1 answer

3

Theory of computation
Let L={aba}. Prefix and suffix operations over the language L is used to perform the following. X=(prefix(L) intersection suffix (L))/L Quotient operation (/) is also used in the above.how many strings exist in the language X?

asked in Theory of Computation Dec 21, 2018

702 views

0 votes

1 answer

4

graph theory
in a directed graph if there is a directed path from any node u to v or vice versa for any pair of nodes of the graph ,the graph is? a. weakly connected unilaterally connected strongly connected disconnected

asked in Graph Theory Dec 14, 2018

779 views

0 votes

1 answer

5

merge sort
n sorted subarrays each of size log n. find single sorted array with all elements.find time complexity

asked in Algorithms Sep 15, 2018

286 views

0 votes

1 answer

6

Discrete mathematics
What is a discrete set?

asked in Mathematical Logic Sep 1, 2018

649 views

0 votes

1 answer

7

Algorithms
what is space complexity of an algo? and what is the number of function calls in general?

asked in Algorithms Aug 31, 2018

183 views

0 votes

0 answers

8

Toc prefixes
What is init operation?

asked in Theory of Computation Aug 16, 2018

109 views

0 votes

2 answers

9

nfa to dfa
Consider the following NFA for ∑={ g,a,t,e}.Find the number of states in equivalent minimal dfa. a)4 b)5 c)6 d)8

asked in Theory of Computation Aug 16, 2018

996 views

0 votes

1 answer

10

Dynamic programming
Given a sequence of n real numbers a1,a2,a3...an then to find contiguous subsequence ai,ai+1,ai+2....aj. Such that it's sum is maximum. How much time the above problem will take if you use dynamic programming?

asked in Algorithms Jul 17, 2018

1.1k views

1 vote

0 answers

11

Time complexity
D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3 What are the number of multiplications in this code

asked in Algorithms Jun 23, 2018

149 views

2 votes

1 answer

12

Algorithm
Which of the given options provides the increasing order of asymptotic complexity of functions $f1$, $f2$, $f3$ and $f4$? $f1(n) = 2^n \\ f2(n) = n^{(3/2)} \\ f3(n) = nlogn \\ f4(n) = n^{(logn)}$ How $n^{3/2}$ is greater than $n^{logn}$

asked in Algorithms Jun 18, 2018

1.3k views

3 votes

2 answers

13

Engineering mathematics
Standard books required for linear algebra and calculus for gate syllabus ?

asked in Linear Algebra Aug 18, 2017

511 views

1 vote

0 answers

14

Discrete mathematics
Proofs questions are asked in mathematical logic gate?

asked in Mathematical Logic Aug 11, 2017

264 views

4 votes

0 answers

15

General Doubt
what should i study from standard books? is it sufficient to solve the examples or should i study all the theory part and do all the exercises?

asked in GATE Aug 10, 2017

175 views