Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
neha.i
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by neha.i
0
votes
1
ISI 2016 PCB C4
Commodity items have some positive or negative changes in their prices each week. Each trading company picks a portfolio of com- modity items, that is, they have one or more items and they own some non-zero quantity of each one. The database table for this ... other items and there exists at least one company selling that item only (i.e., not selling any other item) in that week
Commodity items have some positive or negative changes in theirprices each week. Each trading company picks a portfolio of com-modity items, that is, they have one or mor...
580
views
answered
May 9, 2017
Databases
databases
nested-query-with-correlation
query
sql
+
–
17
votes
2
ISI 2004 MIII
In how many ways can three person, each throwing a single die once, make a score of $11$ $22$ $27$ $24$ $38$
In how many ways can three person, each throwing a single die once, make a score of $11$$22$$27$$24$$38$
2.8k
views
answered
Apr 3, 2017
Combinatory
combinatory
isi2004
+
–
1
votes
3
Rosen (relation)
How many relations are there on the set {a, b, c, d} that contain the pair (a, a)?
How many relations are there on the set {a, b, c, d}that contain the pair (a, a)?
330
views
answered
Mar 31, 2017
0
votes
4
ISRO 2016 Probability [Mech]
A and B are two candidates appearing for an interview by a company. The probability that A is selected is 0.5 and the probability that both A and B are selected is at most 0.3. The probability of B getting selected is (a) 0.9 (b) 0.3 (c) 0.6 (d) 0.5
A and B are two candidates appearing for an interview by a company. The probability that A is selected is 0.5 and the probability that both A and B are selected is at mos...
582
views
answered
Mar 8, 2017
Probability
engineering-mathematics
isro-mech
probability
+
–
0
votes
5
GATE Overflow | Data Structures | Test 1 | Question: 16
A program takes as input a binary tree (not necessarily balanced) with $n$ nodes and computes for each node, the no. of leaf nodes in the sub-tree rooted at that node. The worst case time complexity of the program is $\Theta(n)$ $\Theta(n \log n)$ $\Theta\left(n^2 \right)$ $\Theta\left(n^2 \log n \right)$
A program takes as input a binary tree (not necessarily balanced) with $n$ nodes and computes for each node, the no. of leaf nodes in the sub-tree rooted at that node. Th...
1.1k
views
answered
Nov 1, 2016
DS
go-ds-1
data-structures
binary-tree
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register