Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Phlegmatic
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Phlegmatic
3
answers
1
Made easy work book
How to solve T (n)=T (sqrt n)+ n
answered
in
Algorithms
Jun 22, 2018
343
views
master-theorem
recurrence-relation
made-easy-booklet
15
answers
2
GATE CSE 2007 | Question: 15, ISRO2016-26
Consider the following segment of C-code: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$
answer selected
in
Algorithms
Jun 22, 2018
26.4k
views
gatecse-2007
algorithms
time-complexity
normal
isro2016
1
answer
3
Self-Doubt
What will be the time-complexity of the following ? for(i=1;i<=n;i=i*2) { for(j=0;j<i;j++) { count++; } }
commented
in
Algorithms
Jun 21, 2018
223
views
time-complexity
1
answer
4
Self-Doubt
What is the time-complexity of Enqueue and Dequeue operations when Queue is implemented using linked list? What is the time complexity of inserting a element in single linked list ?
commented
in
DS
Jun 21, 2018
935
views
1
answer
5
Virtual Memory
A demand paging system takes 250 time units to service a page fault and 450 time units to replace a dirty page. Memory access time is 10 time units. The probability of page faults is 0.3. In case of a page fault, the probability of page being dirty is 0.06. The average access time is ?
commented
in
Operating System
Jun 16, 2018
172
views
3
answers
6
Time Complexity
What is the time complexity of the following code? for(i=n;i>=1;) i=i/2;
answered
in
Algorithms
Jun 11, 2018
264
views
algorithms
time-complexity
1
answer
7
Self-Doubt
asked
in
Algorithms
Jun 9, 2018
123
views
algorithms
asymptotic-notations
test-series
3
answers
8
Self-Doubt
int main() { int i; for(i=1;i<=n;i++) f(i); } void f(int n) { int A[n]; int j; for(j=1;j<=n;j++) cout<<j; } What will be the time and space complexity of the following code snippet ?
answer selected
in
Algorithms
Jun 8, 2018
264
views
algorithms
time-complexity
space-complexity
2
answers
9
Self-Doubt
What will be the solution of the following recurrence? $T(n)=3T\sqrt{n}+\log(n)$
commented
in
Algorithms
Jun 8, 2018
417
views
algorithms
recurrence-relation
1
answer
10
Self-Doubt
In a circular linked list last node points to the : $Head$ $Tail$ $First Node$
answer selected
in
Programming
May 28, 2018
832
views
data-structures
circular-linked-list
linked-list
2
answers
11
Self-Doubt
Convert this infix expression to postfix form ? $3*log(x+1)*\dfrac{a}{2}$
commented
in
Programming
May 28, 2018
268
views
data-structures
compiler-design
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
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
Recent Posts
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Recommend test series??
pressman pdf/ geeksforgeeks
where to study software engineering for BARC
+1
1200/1000 = 1.2