Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
GateAspirant999
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by GateAspirant999
0
votes
1
answer
61
Problem on Contiguous Memory allocation
There are 5 processes in a job queue Process Memory Required Time P1 600kb 10 ms P2 1000kb 5 ms P3 300kb 20 ms P4 700kb 8 ms P5 500kb 15 ms Memory is byte addressable If the size of the memory is 2000 kb and contiguous memory allocation is used, then after ... which processes will be in memory? (A) P4,P5 only (B) P1, P2 only (C) P3, P4 only (D) None of these
There are 5 processes in a job queueProcessMemoryRequired TimeP1600kb10 msP21000kb5 msP3300kb20 msP4700kb 8 msP5500kb15 msMemory is byte addressableIf the size of the mem...
2.1k
views
asked
May 29, 2016
Algorithms
operating-system
time-complexity
+
–
0
votes
1
answer
62
Improvemet on bubble sort
Which of the following can make for an improved version of bubble sort? (A) Traverse the array left to right during odd passes and right to left during even passes, in bubble sort (B) Divide the array into smaller arrays, apply quick sort on each of the ... array (C) Store the addresses to be swapped in a separate array and make all the swaps at one go (D) None of these
Which of the following can make for an improved version of bubble sort?(A) Traverse the array left to right during odd passes and right to left during even passes, in bub...
873
views
asked
May 28, 2016
Algorithms
sorting
algorithms
+
–
1
votes
1
answer
63
Order statistics problem
Does this question makes sense to you? Its asked in algorithms section. Though quick googling says its all about statistics. Or I am making mistake and it is indeed part of Algorithms? Is it even in the syllabus? The ith order statistics can be selected from an array of n elements in a minimum time that is: (A) O(n) (B) O(log n) (C) O(n log n) (D) None of these
Does this question makes sense to you? Its asked in algorithms section. Though quick googling says its all about statistics. Or I am making mistake and it is indeed part ...
1.0k
views
asked
May 26, 2016
Algorithms
algorithms
time-complexity
+
–
1
votes
1
answer
64
quick sort partition procedure
Is below question and its answer correct? Or its just kind of rubbish? After one pass through the partition procedure of quick sort array stand as below: 2,1,4,5,9,7,8,10 How many possible pivots can you find in the array? (A) 1 (B) 2 (C) 3 ... once run, one element is at its final position. So if that it is the question shouldn't be the answer (A)? Am I wrong?
Is below question and its answer correct? Or its just kind of rubbish?After one pass through the partition procedure of quick sort array stand as below:2,1,4,5,9,7,8,10H...
1.6k
views
asked
May 19, 2016
Algorithms
algorithms
quick-sort
numerical-answers
+
–
1
votes
1
answer
65
Quadratic sorts behavior
Is below problem meaningful? I am not able to get any logic behind it. Either am missing something or the problem is real crap. Suppose one is applying a particular quadratic sorting algorithm to an array of integers. After four iterations the array ... ? Selection sort that selects the largest element in each iteration Insertion sort i or ii ii only ii only None of these
Is below problem meaningful? I am not able to get any logic behind it. Either am missing something or the problem is real crap.Suppose one is applying a particular quadra...
670
views
asked
May 19, 2016
Algorithms
algorithms
sorting
+
–
0
votes
2
answers
66
Time complexity of the nested for loop function
What is the time complexity of the following function: function(n) { for(i = 0; i < n; i = i*2) { for(j = 0; j < i; j++) { printf("*"); } } }
What is the time complexity of the following function: function(n) { for(i = 0; i < n; i = i*2) { for(j = 0; j < i; j++) { printf("*"); } } }
1.8k
views
asked
May 11, 2016
Algorithms
algorithms
time-complexity
+
–
2
votes
1
answer
67
Time compexity of the recurrence relation
How can we compute the $\Theta$ time complexity of the following recurrence relation: $T(n)=T(n/2)+T(n/4)+T(n/8)+n$
How can we compute the $\Theta$ time complexity of the following recurrence relation:$T(n)=T(n/2)+T(n/4)+T(n/8)+n$
402
views
asked
May 9, 2016
Algorithms
recurrence-relation
algorithms
time-complexity
+
–
0
votes
2
answers
68
Asymptotic comparison of functions
How will you perform asymptotic comparison of the following three functions: 1. $\log{n}$, 2. $(\log{n})^c$ and 3. $\sqrt{n}$ Obviously $\log{n} < (\log{n})^c$. But where $\sqrt{n}$ fits?
How will you perform asymptotic comparison of the following three functions:1. $\log{n}$,2. $(\log{n})^c$ and3. $\sqrt{n}$Obviously $\log{n} < (\log{n})^c$. But where ...
1.5k
views
asked
May 4, 2016
Algorithms
algorithms
asymptotic-notation
+
–
1
votes
1
answer
69
Facts about AVL tree
Which of the following is false? A. Maximum height of an AVL tree of n nodes is 1.44 log2n ​B. Insertion of an element into an AVL tree requires at most a double rotation C. Deletion of an element may require O(log n) rotation D. None of these
Which of the following is false?A. Maximum height of an AVL tree of n nodes is 1.44 log2n​B. Insertion of an element into an AVL tree requires at most a double rot...
1.4k
views
asked
Apr 26, 2016
DS
data-structures
avl-tree
+
–
1
votes
1
answer
70
Postorder traversal after creating AVL tree
The tree given is as follows: 30 / \ 12 45 \ 18 Insert: 10,15,40,20,22 Which one of the following is the postorder traversal of the resultant tree? (A) 10,15,13,20,22,30,45,40,18 (B) 10,15,12,20,30,22,45,40,18 (C) 10,15,12,20,30,22,45,18,40 (D) None of these
The tree given is as follows: 30 / \ 12 45 \ 18 Insert: 10,15,40,20,22Which one of the following is the postorder tr...
5.1k
views
asked
Apr 23, 2016
DS
data-structures
avl-tree
binary-search-tree
+
–
1
votes
4
answers
71
AVL Tree insertion
The tree given is as follows: 40 / \ 35 53 / \ 20 60 How many rotations are required for insertion of elements 30,55,45,65,42 in above tree. (A) 2 (B) 3 (C) 4 (D) None of these
The tree given is as follows: 40 / \ 35 53 / \ 20 60 How many rotations are required for insertion of elements 30,55,45,6...
3.7k
views
asked
Apr 23, 2016
DS
data-structures
avl-tree
+
–
Page:
« prev
1
2
3
4
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register