Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Rackson
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Rackson
1
votes
1
Problem on ages
The ratio of the ages of a husband and his wife when they got married was 6 : 5. 4 years and 6 years after their marriage they had their 1st and 2nd children. The sum of the present ages of the husband and wife is 6.4 times the sum of the present ages ... age of the family at present is 18.5 years. Find the ratio of the ages of the husband and wife when their second child was born.
The ratio of the ages of a husband and his wife when they got married was 6 : 5. 4 years and 6 years after their marriage theyhad their 1st and 2nd children. The sum of t...
1.4k
views
answered
Feb 14, 2019
Quantitative Aptitude
quantitative-aptitude
+
–
0
votes
2
#address lines
Memory=1GB 16 bit processor System is byte addressable How many address lines required? I think 30 should be the ans as though processor is of 16bit but system is byte addressable so it can address only 1 byte using 1 line. Please clarify.
Memory=1GB16 bit processorSystem is byte addressableHow many address lines required?I think 30 should be the ans as though processor is of 16bit but system is byte addre...
317
views
answered
Feb 4, 2019
CO and Architecture
co-and-architecture
+
–
0
votes
3
DS Made easy
659
views
answered
Jan 22, 2019
0
votes
4
Time complexity
559
views
answered
Jan 20, 2019
Algorithms
time-complexity
test-series
+
–
0
votes
5
Time complexity of the program
Consider the following function(n) { val=0; for i=1 to n { if(n<=10000) for j=1 to n for k=1 to n val = val + 1; else for j=1 to n val = val + 1; } } The running time of the above function can best be described by $T(n)=$____________ $A)\theta(n^{3}) $ $B)\theta(n^{2})$ $C)\theta(n)$ $D)\theta(1)$
Consider the following function(n) { val=0; for i=1 to n { if(n<=10000) for j=1 to n for k=1 to n val = val + 1; else for j=1 to n val = val + 1; } } The running time of ...
679
views
answered
Jan 20, 2019
Algorithms
algorithms
time-complexity
+
–
0
votes
6
Time Complexity of Code snippet
What will be the worst case time complexity for the following code segment? int count=0,N; for(i=0;i<N*2;i++){ for(j=0;j<i/3;i++){ for(k=0;k<j*j;k++){ count++; } } } Options: O(N^4) O(N^3) O(N^2) O(N)
What will be the worst case time complexity for the following code segment?int count=0,N; for(i=0;i<N*2;i++){ for(j=0;j<i/3;i++){ for(k=0;k<j*j;k++){ count++; } } }Option...
8.1k
views
answered
Jan 20, 2019
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
0
votes
7
MadeEasy Test Series: Graph Theory
How to solve such problems?
How to solve such problems?
570
views
answered
Jan 19, 2019
Graph Theory
made-easy-test-series
discrete-mathematics
graph-theory
+
–
0
votes
8
Time and Work
6. A team P of 20 engineers can complete work or task in 32 days. Another team Q of 16 engineers can complete same task in 30 days.Then the ratio of working capacity of 1 member of P to the 1 member of Q is a. 3 : 2 b. 4 : 3 c. 2 : 5 d. 3 : 5
6. A team P of 20 engineers can complete work or task in 32 days. Another team Q of 16 engineers can complete same task in 30 days.Then the ratio of working capacity of 1...
1.0k
views
answered
Jan 18, 2019
0
votes
9
Work and time
A can do piece of work in 30 days while Bonku alone can do it in 40 days. If they work together, how long will it take to complete the work?
A can do piece of work in 30 days while Bonku alone can do it in 40 days. If they work together, how long will it take to complete the work?
999
views
answered
Jan 16, 2019
0
votes
10
UGC NET CSE | December 2014 | Part 2 | Question: 02
A certain tree has two vertices of degree $4$, one vertex of degree $3$ and one vertex of degree $2$. If the other vertices have degree $1$, how many vertices are there in the graph ? $5$ $n – 3$ $20$ $11$
A certain tree has two vertices of degree $4$, one vertex of degree $3$ and one vertex of degree $2$. If the other vertices have degree $1$, how many vertices are there i...
15.9k
views
answered
Jan 15, 2019
DS
ugcnetcse-dec2014-paper2
data-structures
tree
+
–
0
votes
11
Z-score Probability Calculation
Pr( Z > 0 ) = ?? How to calculate it? Ans is 0.5. Do we use standard normal variate(Z) table? Do GATE provide such table?
Pr( Z 0 ) = ??How to calculate it? Ans is 0.5. Do we use standard normal variate(Z) table? Do GATE provide such table?
963
views
answered
Jan 12, 2019
Probability
engineering-mathematics
probability
z-score
+
–
0
votes
12
UPPCL AE 2018
300
views
answered
Jan 4, 2019
0
votes
13
Discreate Math logic
201
views
answered
Jan 4, 2019
Mathematical Logic
propositional-logic
+
–
0
votes
14
Aptitude and Ratio
Please Explain it
Please Explain it
364
views
answered
Dec 28, 2018
Quantitative Aptitude
quantitative-aptitude
+
–
0
votes
15
Cyclists_64q
Two cyclists M and N starts from A, B and travels forward to B and A respectively. Once they reach to B and A, they turn back and travel to their starting points. If they meet 36 km from A for the first time and 18 km from B for the second time, then find the ratio of speeds of M and N. (A) 2:3 (B) 3:2 (C) 4:5 (D) 5:4
Two cyclists M and N starts from A, B and travels forward to B and A respectively. Once they reach to B and A, they turn back and travel to their starting points. If they...
333
views
answered
Dec 26, 2018
1
votes
16
LCD_TV_65q
An LCD TV is available at Rs. 27780 cash price of three equal annual instalments at 15 per cent per annum under CI compounding annually. Find each instalment amount(in Rs.) (A) 10146 (B) 11123 (C) 13184 (D) 12167
An LCD TV is available at Rs. 27780 cash price of three equal annual instalments at 15 per cent per annum under CI compounding annually. Find each instalment amount(in Rs...
526
views
answered
Dec 26, 2018
0
votes
17
synchronization
does it guarantee mutual exclusion and deadlock prevention?
does it guarantee mutual exclusion and deadlock prevention?
870
views
answered
Dec 14, 2018
Operating System
process-synchronization
operating-system
critical-section
process
deadlock-prevention-avoidance-detection
+
–
1
votes
18
doubt
Why B-tree & B+ tree is used in database indexing instead of other tree like BST, Binary tree etc??
Why B-tree & B+ tree is used in database indexing instead of other tree like BST, Binary tree etc??
499
views
answered
Dec 13, 2018
Databases
databases
b-tree
+
–
1
votes
19
Self doubt
int main() { int a,b; a = 10; b = 11; printf(“%d %d”, a++,b--); } The number of tokens is
int main(){ int a,b; a = 10; b = 11; printf(“%d %d”, a++,b );}The number of tokens is
565
views
answered
Dec 12, 2018
Compiler Design
compiler-design
lexical-analysis
compiler-tokenization
+
–
0
votes
20
Printf
What is the output??
What is the output??
422
views
answered
Dec 12, 2018
0
votes
21
Conditional probability
2.5k
views
answered
Dec 10, 2018
Quantitative Aptitude
probability
+
–
0
votes
22
Testbook Test Series: Computer Networks - Sliding Window
packets are being transmitted using GB5 and here every 4th packet is lost.How many packets need to be transmitted to transmit 10 packets? my answr 18 given :20
packets are being transmitted using GB5 and here every 4th packet is lost.How many packets need to be transmitted to transmit 10 packets?my answr 18 given :20
2.3k
views
answered
Dec 9, 2018
Computer Networks
computer-networks
testbook-test-series
sliding-window
+
–
0
votes
23
GATE CSE 2017 Set 1 | Question: 40
Recall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: $S_1$: Random page replacement algorithm (where a page chosen at random is replaced) suffers from Belady's ... is true, $S_2$ is false $S_1$ is false, $S_2$ is true $S_1$ is false, $S_2$ is false
Recall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements:$S_1$: Random pa...
15.0k
views
answered
Dec 6, 2018
Operating System
gatecse-2017-set1
page-replacement
operating-system
normal
+
–
0
votes
24
GATE CSE 2017 Set 1 | Question: 28
The value of $\displaystyle \lim_{x\rightarrow 1} \frac{x^{7}-2x^{5}+1}{x^{3}-3x^{2}+2}$ is $0$ is $-1$ is $1$ does not exist
The value of $\displaystyle \lim_{x\rightarrow 1} \frac{x^{7}-2x^{5}+1}{x^{3}-3x^{2}+2}$is $0$is $-1$is $1$does not exist
6.0k
views
answered
Dec 6, 2018
Calculus
gatecse-2017-set1
calculus
limits
normal
+
–
0
votes
25
relational model
minimum no. of tables required....!!! How to do such question where aggregation generalization or specialization is involved
minimum no. of tables required....!!!How to do such question where aggregation generalization or specialization is involved
488
views
answered
Nov 29, 2018
Databases
databases
er-diagram
er-to-relational
relational-model
+
–
0
votes
26
Made Easy Workbook : Relational Model
What should be correct option for 1. and why...?
What should be correct option for 1. and why...?
707
views
answered
Nov 29, 2018
Databases
databases
er-diagram
er-to-relational
relational-model
+
–
0
votes
27
UGC NET CSE | July 2018 | Part 2 | Question: 67
A many-to-one relationship exists between entity sets $r_1$ and $r_2$. How will it be represented using functional dependencies if $Pk(r)$ denotes the primary key attribute of relation $r$? $Pk(r_1) \rightarrow Pk(r_2)$ ... $Pk(r_2) \rightarrow Pk(r_1) \text{ or } Pk(r_1) \rightarrow Pk(r_2)$
A many-to-one relationship exists between entity sets $r_1$ and $r_2$. How will it be represented using functional dependencies if $Pk(r)$ denotes the primary key attribu...
1.1k
views
answered
Nov 21, 2018
Databases
ugcnetcse-july2018-paper2
databases
rdbms
+
–
Page:
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register