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 nephron
0
votes
1
Relation
For $a,b\epsilon Real$ define $aRb$ iff $a^{2}+b^{2}>2$.Is it Reflexive, Symmetric or Transitive?
For $a,b\epsilon Real$ define $aRb$ iff $a^{2}+b^{2}>2$.Is it Reflexive, Symmetric or Transitive?
330
views
answered
Nov 3, 2018
Linear Algebra
relations
+
–
0
votes
2
Complexity!!!
Hello anyone can help me to find big O for this algorithm please.... f=1; x=3; for (int i = 1; i <= n; i*=2) for (int j = 1; j <= i * i; j++) if (i % j == 0) for (int k = 1; k <= j; k++) f=f*x;
Hello anyone can help me to find big O for this algorithm please.... f=1;x=3;for (int i = 1; i <= n; i*=2) for (int j = 1; j <= i * i; j++) if (i % j == 0) ...
305
views
answered
Oct 31, 2018
Algorithms
algorithms
time-complexity
+
–
1
votes
3
Self Doubt
<!--StartFragment --> void fun(int n, int arr[]) { int i = 0, j = 0; for(; i < n; ++i) while(j < n && arr[i] < arr[j]) j++; } In this question the inner loop runs n times at most because j is not ... wont the outer loop also run n times (incrementing and checking conditions in while) and making the total time complexity to be O(n2)?? <!--EndFragment -->
<! StartFragment >void fun(int n, int arr[]){ int i = 0, j = 0; for(; i < n; ++i) while(j < n && arr[i] < arr[j]) j++;} In this question the inne...
1.6k
views
answered
Oct 31, 2018
Algorithms
algorithms
time-complexity
+
–
0
votes
4
Algorithms Complexity
679
views
answered
Oct 31, 2018
Algorithms
algorithms
time-complexity
asymptotic-notation
+
–
1
votes
5
Doubt
n/100= Ω(n) Is this True or False explain
n/100= Ω(n)Is this True or False explain
2.0k
views
answered
Oct 31, 2018
Algorithms
algorithms
time-complexity
+
–
1
votes
6
gatebook
Q.1 int A(int n){ if(n==2) return 1; else{ for(int j=1;j<=n;j++) printf(" * "); return(A(√n)); } } Time complexity
Q.1 int A(int n){if(n==2) return 1;else{for(int j=1;j<=n;j++)printf(" * ");return(A(√n));}} Time complexity
336
views
answered
Oct 31, 2018
Algorithms
time-complexity
gatebook-test-series
+
–
0
votes
7
MIT ASSIGNMENT
FIND THE TIME COMPLEXITY int i=1,j; for(;i <= n;i + +) { for(j = i; j <= nlogn; j∗= 2) { sum++; } }
FIND THE TIME COMPLEXITYint i=1,j; for(;i <= n;i + +) { for(j = i; j <= nlogn; j∗= 2) { sum++; } }
851
views
answered
Oct 30, 2018
Algorithms
algorithms
time-complexity
mit-quiz
+
–
0
votes
8
MIT ASSIGNMENT
Find the complexity of the following function when called with some integer n: void foo(n) { int i,j,k,x=0; for (i=1 ; i <= n ; i++) for (j=1 ; j <= i * i ; j++) for ( k = 1 ; k <= j ; k++) { x=x+10; } }
Find the complexity of the following function when called with some integer n:void foo(n) { int i,j,k,x=0; for (i=1 ; i <= n ; i++) for (j=1 ; j <= i * i ; j++) for ( k ...
777
views
answered
Oct 30, 2018
Algorithms
algorithms
time-complexity
mit-quiz
+
–
0
votes
9
Masters Theorem
How can we apply Masters theorem to these equations : T(n) = 16*T(n/4) + n! and T(n) = 4*T(n/2) + cn Please explain the process.
How can we apply Masters theorem to these equations : T(n) = 16*T(n/4) + n!and T(n) = 4*T(n/2) + cnPlease explain the process.
1.7k
views
answered
Oct 30, 2018
Algorithms
master-theorem
time-complexity
algorithms
asymptotic-notation
recurrence-relation
+
–
0
votes
10
Made easy work book
How to solve T (n)=T (sqrt n)+ n
How to solve T (n)=T (sqrt n)+ n
551
views
answered
Oct 30, 2018
Algorithms
master-theorem
recurrence-relation
made-easy-booklet
+
–
1
votes
11
Can we solve the recurrence T(n) = T(n/2) + 2^n by masters theorem, if possible?
I was wondering whether the recurrence T(n) = T(n/2) + 2n could be solved by using master theorem, and what would be the way. I tried solving the recurrence but can't. There is no mention to it in CLRS book. Please help. Thanks in advance.
I was wondering whether the recurrence T(n) = T(n/2) + 2n could be solved by using master theorem, and what would be the way. I tried solving the recurrence but can't. Th...
19.7k
views
answered
Oct 30, 2018
Algorithms
recurrence-relation
algorithms
master-theorem
time-complexity
asymptotic-notation
+
–
5
votes
12
Pipeline : Number of RAW dependencies
Consider the below instructions executed on a 5 stage(IF,ID,EX,MA,WB) RISC pipeline with operand forwarding. I1: ADD R0,R1,R2 (R0=R1+R2) I2: SUB R3,R0,R2 I3:MUL R4,R3,R0 I4:DIV R5,R4,R0 How many RAW dependencies?
Consider the below instructions executed on a 5 stage(IF,ID,EX,MA,WB) RISC pipeline with operand forwarding.I1: ADD R0,R1,R2 (R0=R1+R2)I2: SUB R3,R0,R2I3:MUL R4,R3,R0I4:D...
2.3k
views
answered
Oct 23, 2018
CO and Architecture
data-hazards
hazards
co-and-architecture
pipelining
data-dependency
+
–
0
votes
13
Ip addressing
A Block contain 32 IP addresses. which of the following can be first address of the block ? and why? a. 201.55.16.16 b. 201.55.16.8 c. 201.55.16.160 d. 201.55.16.24
A Block contain 32 IP addresses. which of the following can be first address of the block ? and why?a. 201.55.16.16b. 201.55.16.8c. 201.55.16.160d. 201.55.16.24
7.6k
views
answered
Oct 23, 2018
Computer Networks
ip-addressing
computer-networks
+
–
0
votes
14
Sum of Data dependencies
$I_1 : MUL \ \ \ \ \ R_1, R_2, R_3$ // $R_1 \leftarrow R_2 \times R_3$ $I_2 : ADD \ \ \ \ \ R_4, R_4, R_1$ $I_3 : MUL \ \ \ \ \ R_1, R_5, R_6$ $I_4 : SUB \ \ \ \ \ R_4, R_4, R_1$ Sum of RAW, WAR and WAW dependencies is _____.
$I_1 : MUL \ \ \ \ \ R_1, R_2, R_3$ // $R_1 \leftarrow R_2 \times R_3$$I_2 : ADD \ \ \ \ \ R_4, R_4, R_1$$I_3 : MUL \ \ \ \ \ R_1, R_5, R_6$$I_4 : SUB...
786
views
answered
Oct 23, 2018
CO and Architecture
data-hazards
data-dependency
co-and-architecture
numerical-answers
+
–
2
votes
15
Aptitude: Number System
A man has two sons . To the elder he gave 5/11 of his property,to the younger 5/11 of remainder , the rest to his wife. Find the share of the sons if his wife gets Rs.3600? How to solve these type of questions in less Time (Any Trick) ?
A man has two sons . To the elder he gave 5/11 of his property,to the younger 5/11 of remainder , the rest to his wife. Find the share of the sons if his wife gets Rs.360...
1.2k
views
answered
Oct 22, 2018
Quantitative Aptitude
number-system
general-aptitude
+
–
2
votes
16
MadeEasy Test Series: Algorithms - Sorting
Consider the following scenario during insertion sort when the array looks like the following: {25,75,95,125,80,5,10} The number of comparisons that it will further take for the array to be completely sorted are______?
Consider the following scenario during insertion sort when the array looks like the following:{25,75,95,125,80,5,10}The number of comparisons that it will further take fo...
1.7k
views
answered
Oct 20, 2018
Algorithms
algorithms
sorting
made-easy-test-series
+
–
0
votes
17
MadeEasy Test Series: Algorithms - Time Complexity
Consider you are playing game of shooting balloon and you are expected to shoot n balloons in the board. If you are a sharp shooter(100% accuracy) and for every two balloons you are able to shoot, one new balloon is inserted into the board, then what is the time ... procedure if the board has to be emptied? (a) O(1) (b) O(n) (c) O(logn) (d) O(n2)
Consider you are playing game of shooting balloon and you are expected to shoot n balloons in the board. If you are a sharp shooter(100% accuracy) and for every two ballo...
1.8k
views
answered
Oct 20, 2018
Algorithms
algorithms
time-complexity
made-easy-test-series
+
–
0
votes
18
Please explain this
624
views
answered
Oct 1, 2018
Computer Networks
computer-networks
+
–
1
votes
19
Additive increase Multiplicative Decrease
Consider instance of TCP AIMD protocol where the Window size at start is cwnd = 2, and the threshold is ssthresh = 16. Timeout occurs during the transmission of 7th packet. What is the value of cwnd at the end of 14RTT ?
Consider instance of TCP AIMD protocol where the Window size at start is cwnd = 2, and the threshold is ssthresh = 16. Timeout occurs during the transmission of 7th packe...
1.1k
views
answered
Sep 24, 2018
Computer Networks
congestion-control
algorithms
computer-networks
+
–
0
votes
20
Computer Networks
In TCP checksum is mandatory but in UDP checksum is optional. Why ?
In TCP checksum is mandatory but in UDP checksum is optional. Why ?
1.7k
views
answered
Sep 24, 2018
Computer Networks
computer-networks
tcp
udp
+
–
0
votes
21
Probability
255
views
answered
Sep 16, 2018
1
votes
22
Operating system Process scheduling
Which of the Algorithm gives long average waiting time? (a) SJF (b) Round Robbin (c) FCFS (d) All of the above
Which of the Algorithm gives long average waiting time?(a) SJF (b) Round Robbin (c) FCFS (d) All of the above
1.1k
views
answered
Sep 16, 2018
Operating System
operating-system
process-scheduling
+
–
0
votes
23
#Self doubt
Answer is 4/14 or 4/13??
Answer is 4/14 or 4/13??
256
views
answered
Sep 13, 2018
1
votes
24
TESTBOOK TEST SERIES
678
views
answered
Sep 12, 2018
Algorithms
time-complexity
testbook-test-series
+
–
0
votes
25
Time complexity 14
955
views
answered
Sep 12, 2018
Algorithms
sorting
algorithms
time-complexity
test-series
+
–
0
votes
26
Algorithm 19
Why 2nd statement false
Why 2nd statement false
989
views
answered
Sep 12, 2018
Algorithms
minimum-spanning-tree
test-series
+
–
0
votes
27
probability
248
views
answered
Sep 10, 2018
Probability
probability
+
–
1
votes
28
made easy test series
which of the require the executing code to be in kernel mode. A)Performing a semaphore 'P' operation. B)Making a system call C)Disabling interrupt. D)Both b and c
which of the require the executing code to be in kernel mode.A)Performing a semaphore 'P' operation.B)Making a system callC)Disabling interrupt.D)Both b and c
724
views
answered
Sep 10, 2018
0
votes
29
Ace Test Series: Operating System - General Concept
A ____ can be used to prevent a user program from never returning control to the operating system.
A ____ can be used to prevent a user program from never returning control to the operating system.
649
views
answered
Aug 31, 2018
Operating System
ace-test-series
operating-system
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register