Recent activity by abcd9982 / GATE Overflow for GATE CSE

1 answer

1

GATE Overflow Test Series | Databases | Test 1 | Question: 30
Consider a $1:1$ relationship and an ER model using it. Which of the following is/are correct for converting this relationship to a relational instance? (Mark all the appropriate options) If participation of both the entities are ... then we need $2$ relations If participation of both the entities are optional then we need $2$ relations

Consider a $1:1$ relationship and an ER model using it. Which of the following is/are correct for converting this relationship to a relational instance? (Mark all the app...

469 views

commented Oct 11, 2020

2 answers

2

GATE Overflow Test Series | Algorithms | Test 1 | Question: 29
Consider the following C function for arguments $m,n > 1$ int foo(int n, int m) { while (m != n) { if(m > n) m = m - n; else n = n - m; } return n; } Which of the following is/are true about the above ... $m,n.$ The space complexity of the function is $\Omega(\log (\min(m,n)))$

Consider the following C function for arguments $m,n 1$int foo(int n, int m) { while (m != n) { if(m n) m = m - n; else n = n - m; } return n; }Which of the following i...

564 views

commented Oct 11, 2020

2 answers

3

GATE Overflow Test Series | Algorithms | Test 1 | Question: 11
Given an array of $n$ elements, you have to design an algorithm to find the $k$ smallest elements in sorted order. The time complexity of the best such algorithm assuming comparison based sorting will be $O(k \log n)$ $\Theta(n + k \log k)$ $\Theta(n^2)$ $\Theta (n \log k)$

Given an array of $n$ elements, you have to design an algorithm to find the $k$ smallest elements in sorted order. The time complexity of the best such algorithm assuming...

629 views

commented Oct 11, 2020

5 answers

4

Made Easy Test Series:Binary Trees
Consider the following function height, to which pointer to the root node of a binary tree shown below is passed Note that max(a,b) defined by #define max(a,b) (a>b)?a:b. int height(Node *root) The output of the above code will be _________________

Consider the following function height, to which pointer to the root node of a binary tree shown below is passedNote that max(a,b) defined by #define max(a,b) (a>b)?a:b.i...

1.9k views

comment edited Jul 4, 2020

1 answer

5

Test by Bikram | Compiler Design | Test 1 | Question: 16
Consider the following grammars: $S \rightarrow aS \mid Sa \mid \in$ $E \rightarrow E +E \mid E^*E \mid id$ $A \rightarrow AA \mid (A) \mid a$ $S \rightarrow SS \mid AB, \ A \rightarrow Aa \mid a, \ B \rightarrow Bb \mid b$ These grammars are: Ambiguous Unambiguous Regular Inherently Ambiguous

Consider the following grammars:$S \rightarrow aS \mid Sa \mid \in$$E \rightarrow E +E \mid E^*E \mid id$$A \rightarrow AA \mid (A) \mid a$$S \rightarrow SS \mid AB, \ A...

525 views

commented Jun 13, 2020

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true