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 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?
answered
in
Set Theory & Algebra
Jan 26, 2019
1.0k
views
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
answered
in
Programming in C
Jan 26, 2019
270
views
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
answered
in
Algorithms
Dec 13, 2018
425
views
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.
answered
in
Operating System
Nov 19, 2018
2.5k
views
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?
answered
in
Algorithms
Jul 30, 2018
1.4k
views
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
answered
in
Set Theory & Algebra
Jun 3, 2018
2.1k
views
tifr2011
set-theory&algebra
set-theory
1
vote
7
Operating system
Variable length partition schema suffers from internal fragmentation????
answered
in
Operating System
Jun 2, 2018
1.1k
views
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.
answered
in
Algorithms
May 18, 2018
4.4k
views
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)
answered
in
Programming in C
May 7, 2018
918
views
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
answered
in
Operating System
Apr 25, 2018
2.5k
views
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
answered
in
Computer Networks
Nov 17, 2017
295
views
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 .
answered
in
Programming in C
Nov 2, 2017
1.1k
views
0
votes
13
cache miss
answered
in
CO and Architecture
Oct 25, 2017
702
views
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
answered
in
Computer Networks
Oct 19, 2017
11.6k
views
gatecse-2007
computer-networks
ethernet
manchester-encoding
normal
out-of-gate-syllabus
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.7k
users
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation