Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by prasitamukherjee
2
votes
1
Set theory
Let S be a set of n elements and let p(S) be its power set. Then find total number of ordered pairs such that $s1 \cap s2 = \phi$ where s1 & s2 are subset of p(s)
Let S be a set of n elements and let p(S) be its power set. Then find total number of ordered pairs such that $s1 \cap s2 = \phi$ where s1 & s2 are subset of p(s)
483
views
answered
Apr 3, 2017
Set Theory & Algebra
set-theory&algebra
set-theory
+
–
5
votes
2
Count(*) when one of the tuple has null values in all column?
Ideally Count(*) will count no of rows in which atleast one column is Non NULL otherwise discard that row. Is this statement true? But when I am trying practically it is returning the count including the null tuple where all columns ... // Returning 2 rows which is correct select count(*) from stud; // Returning 4 rows. Is this correct?
Ideally Count(*) will count no of rows in which atleast one column is Non NULL otherwise discard that row. Is this statement true?But when I am trying practically it is ...
1.5k
views
answered
Feb 12, 2017
Databases
databases
sql
+
–
0
votes
3
Gate 2017 Set-1 Min Reg/Nor gates
Could somone pls confirm what is the ans for min NOR gates and min number of Registers? Also what was the marks distribution for Memory Leal/Malloc DS question?
Could somone pls confirm what is the ans for min NOR gates and min number of Registers?Also what was the marks distribution for Memory Leal/Malloc DS question?
487
views
answered
Feb 12, 2017
Digital Logic
digital-logic
co-and-architecture
+
–
0
votes
4
GATE 2017 Set 2 - COA
In Gate 2017 Afternoon session there was a que where they asked for Tag Size in bit. So in this que tag bit was 18 . But to calculate tag size i think we should multiply it with number of Lines i.e 18*29 Note : No. of Lines was given in que. Is my approach is right?
In Gate 2017 Afternoon session there was a que where they asked for Tag Size in bit.So in this que tag bit was 18 .But to calculate tag size i think we should multiply it...
1.5k
views
answered
Feb 12, 2017
CO and Architecture
cache-memory
+
–
0
votes
5
Gate 2017 Set-1 first order logic
Consider following first order logic $\forall x ( \exists y R( x, y ) )$ is equivalent to 1) $\exists y ( \exists x R( x, y ) )$ 2) $\exists y ( \forall x R( x, y ) )$ 3) $\forall y ( \exists x R( x, y ) )$ 4) $\neg \exists x ( \forall y \neg R(x,y) )$ Note: Not sure in the question was it equivalent to or which of these are implied by
Consider following first order logic$\forall x ( \exists y R( x, y ) )$ is equivalent to1) $\exists y ( \exists x R( x, y ) )$2) $\exists y ( \forall x R( x, y ) )$3) $\f...
2.3k
views
answered
Feb 12, 2017
Mathematical Logic
discrete-mathematics
first-order-logic
+
–
9
votes
6
GATE CSE 2017 Set 1 | Question: 48
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i \right ]$ is $1$ by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is ____________.
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i ...
22.0k
views
answered
Feb 12, 2017
Algorithms
gatecse-2017-set1
algorithms
normal
numerical-answers
searching
+
–
13
votes
7
GATE CSE 2017 Set 1 | Question: 6
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are: Note: The height of a tree with a single node is $0$. $4$ and $15$ respectively. $3$ and $14$ respectively. $4$ and $14$ respectively. $3$ and $15$ respectively.
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are:Note: The height of a tree with a single node is $0$.$4$ and $15$ res...
16.9k
views
answered
Feb 12, 2017
DS
gatecse-2017-set1
data-structures
binary-search-tree
easy
+
–
6
votes
8
GATE CSE 2017 Set 1 | Question: 44
In a RSA cryptosystem, a participant $A$ uses two prime numbers $p = 13$ and $q = 17$ to generate her public and private keys. If the public key of $A$ is $35$, then the private key of $A$ is __________ .
In a RSA cryptosystem, a participant $A$ uses two prime numbers $p = 13$ and $q = 17$ to generate her public and private keys. If the public key of $A$ is $35$, then the ...
24.1k
views
answered
Feb 12, 2017
Computer Networks
gatecse-2017-set1
network-security
computer-networks
rsa-security-networks
out-of-gate-syllabus
numerical-answers
normal
+
–
2
votes
9
Linked list time complexity
Given two singly linked list of size n. The time complexity of computing the union and intersection of two linked list is. a) O(n) and O(nlogn) b) O(n) and O(n) c) O(nlogn) and O(nlogn) d) O(nlogn) and O(n)
Given two singly linked list of size n. The time complexity of computing the union and intersection of two linked list is.a) O(n) and O(nlogn)b) O(n) and O(n)c) O(nlogn) ...
1.7k
views
answered
Feb 8, 2017
Algorithms
algorithms
time-complexity
+
–
0
votes
10
maxima minima made easy
Consider the function f (x) = sin x in the interval X<--[pi/4, 7pi/4]. The number of location/s of the local minima are __________ .
Consider the function f (x) = sin x in the interval X< [pi/4, 7pi/4]. The number of location/s of the local minima are __________ .
658
views
answered
Feb 8, 2017
1
votes
11
7th smallest element in a Min-Heap
In a min-heap with n elements 1). The 7th smallest element can be found in time, if duplicates are allowed ? 2). The 7th distinct smallest element can be found in time, If duplicates are allowed ?
In a min-heap with n elements1). The 7th smallest element can be found in time, if duplicates are allowed ?2). The 7th distinct smallest element can be found in time, I...
4.0k
views
answered
Sep 5, 2016
DS
data-structures
binary-heap
time-complexity
+
–
0
votes
12
fill in the blank
foreign bank have stopped ________ in india a. to open b. for opening c. opening d open
foreign bank have stopped ________ in indiaa. to openb. for openingc. openingd open
807
views
answered
Sep 3, 2016
Verbal Aptitude
verbal-aptitude
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register