Dark Mode

Recent activity by shaurya vardhan

2 answers

1

GATE CSE 2013 | Question: 47
Which one of the following is NOT logically equivalent to $¬∃x(∀ y (α)∧∀z(β ))$ ? $∀ x(∃ z(¬β )→∀ y(α))$ $∀x(∀ z(β )→∃ y(¬α))$ $∀x(∀ y(α)→∃z(¬β ))$ $∀x(∃ y(¬α)→∃z(¬β ))$

commented in Mathematical Logic Jan 30, 2018

9.6k views

3 answers

2

Regular Expression
Let L be a language defined as follows: L={w∈{a,b}* | every two a^' s in w are separated by even number of b' s} a)(bb)* a(bb)* a(bb)*+ϵ b) (b* a(bb)* ab*)* c) (b+abb)* (ϵ+ab)* d)none of the above the answer is none of the ... we can take b=0 ,. but i want to know .. what if b>0 . which actually makes more sense since they are asking about "separation" of two a's.

answer selected in Theory of Computation Jan 24, 2018

1.2k views

12 answers

3

GATE CSE 2014 Set 1 | Question: 42
Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3 Half of the product of the $3$ consecutive integers. One-third of the product of the $3$ consecutive integers. One-sixth of the product of the $3$ consecutive integers. None of the above.

commented in Algorithms Jan 23, 2018

26.9k views

1 answer

4

Test by Bikram | Mock GATE | Test 3 | Question: 36
Consider the following regular languages given below: L1 : Languages that accept strings over $\sum \left (a,b \right )$ , such that length of string is greater than $1$, but multiples of $3$. L2 : Languages that accept strings over $\sum \left (a,b \right )$ ... ? $n1 = n3 < n2$ $n1 < n3 < n2$ $n3 < n1 < n2$ $n2 < n1 < n3$

commented in GATE Jan 2, 2018

279 views

5 answers

5

GATE CSE 2014 Set 1 | Question: 4
Consider the following system of equations: $3x + 2y = 1 $ $4x + 7z = 1 $ $x + y + z = 3$ $x - 2y + 7z = 0$ The number of solutions for this system is ______________

commented in Linear Algebra Jan 1, 2018

9.7k views

2 answers

6

question,
In CRC, if the degree of Generator polynomial is n, then the number of bits in divisor is?

commented in Computer Networks Dec 30, 2017

1.2k views

1 answer

7

Test by Bikram | Mock GATE | Test 3 | Question: 35
Consider the following set of messages with their frequencies: ... The percentage improvement for total binary stream transmission using Huffman Encoding over simple encoding is _______ %.

commented in GATE Dec 29, 2017

430 views

1 answer

8

general C programming doubt
How to work on such question ? Answer is : 19 #include <stdio.h> int main() { int i = 4, ans; ans = ++i + ++i + ++i; printf("%d\n", ans); return 0; }

answered in Programming Dec 20, 2017

268 views

0 answers

9

Serial Schedules
LINKED QUESTION: Answers to both are 10 . In general , what is the exact way to calculate number of serial schedules conflict and view equivalent to the given schedule.

commented in Databases Dec 11, 2017

99 views

0 answers

10

TEST SERIES - SQL
You executed the following SQL statements in the given order: CREATE TABLE orders (order_id NUMBER(3) PRIMARY KEY, order_date DATE, customer_idnumber(3)); INSERT INTO orders VALUES (100,'10-mar-2007',222); ALTER TABLE orders MODIFY order_date NOT NULL ... All the statements up to the ALTER TABLE statement would be committed and the outcome of UPDATE statement would be rolled back.

asked in Databases Dec 11, 2017

307 views

1 answer

11

MadeEasy Test Series: Databases - Er Diagram
In the solution they have merged E1 R4 E4 , E2 R3 E3 R5 , R6 E5. MY DOUBT IS , why cant we only merge R4 E4 instead of E1 R4 E4. since there is total participation on the E4 side of the relation and it would also decrease the number of attributes .

comment edited in Databases Dec 4, 2017

817 views

3 answers

12

relational algebra
Consider the following schema: Student (Sid, Sname, age) Course Info (Cid, Cname, Instructor SSN) Enroll (Sid, Cid, grade). The relational algebra expression for “find the Cid’s of courses enrolled by two different students” (no options)

asked in Databases Dec 3, 2017

5.3k views

4 answers

13

GATE CSE 2015 Set 1 | Question: 27
Consider the following relation: ... P WHERE S.Roll_No= P.Roll_No GROUP BY S.STUDENT_Name The numbers of rows that will be returned by the SQL query is_________________.

commented in Databases Nov 27, 2017

12.8k views

5 answers

14

GATE CSE 2005 | Question: 77, ISRO2016-55
The relation book (title, price) contains the titles and prices of different books. Assuming that no two books have the same price, what does the following SQL query list? select title from book as B where (select count(*) from ... books Title of the fifth most inexpensive book Title of the fifth most expensive book Titles of the five most expensive books

commented in Databases Nov 27, 2017

25.2k views

1 answer

15

GATE CSE 2004 | Question: 13
Let $R_1 \left(\underline{A}, B, C\right)$ and $R_2\left(\underline{D}, E \right) $ be two relation schema, where the primary keys are shown underlined, and let C be a foreign key in $R_1$ referring to $R_2$. Suppose there is no violation of the above ... $\Pi_D \left(r_1 \bowtie_{C \neq D}r_2\right)$ $\Pi_C \left(r_1 \bowtie_{C = D}r_2\right)$

commented in Databases Nov 25, 2017

5.4k views

6 answers

16

GATE CSE 2008 | Question: 82
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is $2$ $3$ $4$ $5$

commented in Databases Nov 23, 2017

19.9k views

9 answers

17

GATE CSE 2013 | Question: 44
Consider the following operation along with Enqueue and Dequeue operations on queues, where $k$ is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m – 1 } } What is the worst case time complexity of a sequence of $n$ queue operations on an initially empty queue? $Θ(n)$ $Θ(n + k)$ $Θ(nk)$ $Θ(n^2)$

commented in DS Nov 19, 2017

25.1k views

8 answers

18

GATE CSE 2000 | Question: 1.14
Consider the following nested representation of binary trees: $(X \ Y \ Z)$ indicates $Y$ and $Z$ are the left and right subtrees, respectively, of node $X$. Note that $Y$ and $Z$ may be $NULL$ ... $(1 \ (2 \ 3 \ 4) \ (5 \ 6 \ 7))$ $(1 \ (2 \ 3 \ NULL) \ (4 \ 5))$

answered in DS Nov 16, 2017

8.2k views

4 answers

19

GATE CSE 2000 | Question: 1.6
The number $43$ in $2's$ complement representation is $01010101$ $11010101$ $00101011$ $10101011$

answered in Digital Logic Nov 16, 2017

9.7k views

5 answers

20

GATE IT 2007 | Question: 31
Consider the C program given below : #include <stdio.h> int main () { int sum = 0, maxsum = 0, i, n = 6; int a [] = {2, -2, -1, 3, 4, 2}; for (i = 0; i < n; i++) { if (i == 0 || a [i] < 0 || a [i] < a [ ... } if (sum > maxsum) maxsum = sum ; printf ("%d\n", maxsum); } What is the value printed out when this program is executed? $9$ $8$ $7$ $6$

commented in Programming Nov 15, 2017

8.4k views

2 answers

21

GATE2013 EE: GA-6
What is the chance that a leap year, selected at random, will contain $53$ Saturdays? $2/7$ $3/7$ $1/7$ $5/7$

answered in Quantitative Aptitude Nov 14, 2017

992 views

2 answers

22

CMI2012-A-06
A basket of fruit is being arranged out of apples, bananas, and oranges. What is the smallest number of pieces of fruit that should be put in the basket in order to guarantee that either there are at least $8$ apples or at least $6$ bananas or at least $9$ oranges? $9$ $10$ $20$ $21$

commented in Quantitative Aptitude Nov 14, 2017

1.4k views

3 answers

23

GATE2014 EC-1: GA-7
For submitting tax returns, all resident males with annual income below Rs $10$ lakh should fill up Form $P$ and all resident females with income below Rs $8$ lakh should fill up Form $Q$. All people with incomes above Rs $10$ ... Rs $9$ lakh A non-resident male with annual income Rs $16$ lakh A non-resident female with annual income Rs $16$ lakh

answered in Verbal Aptitude Nov 10, 2017

1.6k views

0 answers

24

Longest Common Sub sequence
We wish to find the longest common palindromic subsequence in a string. Read the above code snippet and choose the missing statements. a)S1: DP[i][j]=0; S2: DP[i][j] =1+DP[i+1][j-1] S3: DP[i+1][j] ,DP[i][j-1] b) DP[i][j]=0; S2: DP[i][j] =2+DP[i+1][j-1] S3: DP[i][j] ,DP[i+1] ... 1][j] ,DP[i][j-1] d) S1: DP[i][j]=1; S2: DP[i][j] =2+DP[i+1][j-1] S3: DP[i+1][j] ,DP[i+1][j-1]

asked in Algorithms Nov 6, 2017

397 views

1 answer

25

Time Complexity
$T(n)=4 T(n/2) + n^2 \sqrt{2}$ I have solved this by back substitution .. and it forms equations of the form $4k T(n/2k) + k n^2 \sqrt 2$ its giving time complexity as n2 + n2 log2n the answer is Theta(n2.5). i have two questions .. a) how can we get Theta(n2.5). b) is n2 log2n Asymptotically faster than n2 ?

commented in Algorithms Nov 6, 2017

1.0k views

1 answer

26

Bellman Ford
A pseudo code for Bellman Ford where each edge is relaxed k times where k>=1. Let the graph G be a simple connected and undirected graph . Let number of vertices be V, and number of edges be E . int i=1; for( i=1;i<=k;i++) { For each edge (u,v) ... . (ii) For proper running of the algorithm k can be equal to V-1. (iii) For proper running of the algorithm k must be equal to E.

asked in Algorithms Nov 6, 2017

721 views

3 answers

27

GATE CSE 2009 | Question: 54
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths $m$ and $n$, respectively with indexes of $X$ and $Y$ starting from $0$. We wish to find the length of ... $L[M, N]$. $L[p, q]$ needs to be computed before $L[r, s]$ if either $p<r$ or $q < s$.

commented in Algorithms Nov 6, 2017

11.1k views

6 answers

28

GATE IT 2007 | Question: 26
Consider $n$ jobs $J_1, J_2 \dots J_n$ such that job $J_i$ has execution time $t_i$ and a non-negative integer weight $w_i$ ... the jobs? Non-decreasing order of $t_i$ Non-increasing order of $w_i$ Non-increasing order of $w_it_i$ Non-increasing order of $w_i/t_i$

commented in Operating System Nov 5, 2017

11.9k views

3 answers

29

SPACE COMPLEXITY

answered in Algorithms Nov 4, 2017

502 views

2 answers

30

test series
To merge two lists of size m and n, how many comparisons we need to perform in the worst case and best case respectively ? a) m+n-1 and m+n-1 b)m+n+1 and max(m,n) c)max(m,n) and min(m,n) d)m+n-1 and min(m,n) can someone give the worst case and best case with examples ?

commented in Algorithms Nov 4, 2017

2.7k views