Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Na462
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Na462
2
votes
1
MadeEasy Test Series: Set Thoery & Algebra - Partial Order
Let Q denote the set of rational numbers and S = {x | x belongs N ; N; x>=10} Consider the Following POSETs I. (Q ∩ [0, 1], ≤) II. (S, ≤) Which of the above POSETs are well ordered?
Let Q denote the set of rational numbers and S = {x | x belongs N ; N; x>=10}Consider the Following POSETsI. (Q ∩ [0, 1], ≤)II. (S, ≤)Which of the above POSETs are ...
1.1k
views
answered
Jan 26, 2019
Set Theory & Algebra
set-theory&algebra
partial-order
made-easy-test-series
+
–
3
votes
2
made easy
Consider the following C program: Which of the following represents output of above C program? A)1, 0 B)2, 0 C)1, 1 D)2, 1
Consider the following C program: Which of the following represents output of above C program?A)1, 0B)2, 0C)1, 1D)2, 1
275
views
answered
Jan 26, 2019
0
votes
3
which DFS algorithm to follow?
there are multiple algorithm of DFS available and i cant figure out which one to follow for solving question asking for the nodes which aren't pushed into the stack or the nodes which are pushed more than once, Tried to figure out from ... , https://gateoverflow.in/98484/dfs-using-stack https://gateoverflow.in/161225/dfs-number-of-nodes-not-pushed-into-the-stack
there are multiple algorithm of DFS available and i cant figure out which one to follow for solving question asking for the nodes which aren’t pushed into the stack or ...
430
views
answered
Dec 13, 2018
Algorithms
depth-first-search
algorithms
graph-algorithm
+
–
0
votes
4
Thrashing
Q. Consider Global Replacement policy is used for page replacement. Which of the following statement is correct - S1 - Increase in the degree of multiprogramming beyond a certain point leads to thrashing. S2 - Thrashing beyond a certain point leads to ... ready queue decreases. As a result, CPU utilization drops and scheduler tries to increase the degree of multiprogramming even more.
Q. Consider Global Replacement policy is used for page replacement. Which of the following statement is correct -S1 - Increase in the degree of multiprogramming beyond a ...
2.6k
views
answered
Nov 19, 2018
Operating System
operating-system
thrashing
+
–
0
votes
5
sorting
When the recurrence relation for both are same , why they both getting different result? Q1. In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort? ANSWER: recurrence ... is If for first case it is N(log3/2N) then for second case also it should be N(log4/3N) BUT its not. WHY?
When the recurrence relation for both are same , why they both getting different result?Q1. In a modified merge sort, the input array is splitted at a position one-third ...
1.4k
views
answered
Jul 29, 2018
Algorithms
algorithms
sorting
time-complexity
+
–
0
votes
6
TIFR CSE 2011 | Part B | Question: 23
Suppose $(S_{1}, S_{2},\ldots,S_{m})$ is a finite collection of non-empty subsets of a universe $U.$ Note that the sets in this collection need not be distinct. Consider the following basic step to be performed on this sequence. While there exist ... finite universe $U$ and a choice of $S_{i}$ and $S_{j}$ in each step such that the process does not terminate
Suppose $(S_{1}, S_{2},\ldots,S_{m})$ is a finite collection of non-empty subsets of a universe $U.$ Note that the sets in this collection need not be distinct. Consider ...
2.1k
views
answered
Jun 3, 2018
Set Theory & Algebra
tifr2011
set-theory&algebra
set-theory
+
–
1
votes
7
Operating system
Variable length partition schema suffers from internal fragmentation????
Variable length partition schema suffers from internal fragmentation????
1.2k
views
answered
Jun 2, 2018
2
votes
8
Time complexity
Which of the following sorting algorithm has almost the same worst case and best case complexity? 1- Quick Sort 2- Merge Sort 3- Shell Sort 4- Heap Sort PS: Is it heap or shell, I am confused. Please clarify me.
Which of the following sorting algorithm has almost the same worst case and best case complexity?1- Quick Sort2- Merge Sort3- Shell Sort4- Heap Sort PS: Is it heap or sh...
4.4k
views
answered
May 18, 2018
Algorithms
time-complexity
+
–
0
votes
9
Balanced binary search tree
A balanced binary search tree of n nodes,the number of steps needed to find and remove the 9th largest element in the worst case? (Please mention the algorithm followed)
A balanced binary search tree of n nodes,the number of steps needed to find and remove the 9th largest element in the worst case?(Please mention the algorithm followed)
933
views
answered
May 7, 2018
Programming in C
data-structures
binary-search-tree
+
–
0
votes
10
ISRO2018-61
The Operating System of a computer may periodically collect all the free memory space to form contiguous block of free space. This is called: Concatenation Garbage Collection Collision Dynamic Memory Allocation
The Operating System of a computer may periodically collect all the free memory space to form contiguous block of free space. This is called:ConcatenationGarbage Collecti...
2.6k
views
answered
Apr 25, 2018
Operating System
isro2018
memory-management
operating-system
+
–
0
votes
11
#Gate #ComputerNetwork
which edition i will follow for computer networks by tanenbaum? which is the current edition
which edition i will follow for computer networks by tanenbaum?which is the current edition
300
views
answered
Nov 17, 2017
Computer Networks
normal
+
–
0
votes
12
Programming
#include<stdio.h> int main() { Float x=0.5; if(x==0.5) Printf("if"); else if(x==0.5f) Printf("else if"); } Explain the code line by line .
#include<stdio.h>int main(){ Float x=0.5;if(x==0.5)Printf("if");else if(x==0.5f)Printf("else if");}Explain the code line by line .
1.1k
views
answered
Nov 2, 2017
0
votes
13
cache miss
715
views
answered
Oct 25, 2017
18
votes
14
GATE CSE 2007 | Question: 19
In Ethernet when Manchester encoding is used, the bit rate is: Half the baud rate Twice the baud rate Same as the baud rate None of the above
In Ethernet when Manchester encoding is used, the bit rate is:Half the baud rateTwice the baud rateSame as the baud rateNone of the above
11.6k
views
answered
Oct 19, 2017
Computer Networks
gatecse-2007
computer-networks
ethernet
manchester-encoding
normal
out-of-gate-syllabus
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register