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 VS
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by VS
2
votes
2
answers
1
Merge Sort
Let A,B,C,D,E are sorted sequences having length 70,74,80,85,102 respectively.They are merged into a single sequence by merging together two sequences at a time.The minimum number of comparisons that will be needed by algorithm in best case for going merging is _________.
asked
in
Algorithms
Jan 30, 2018
4.3k
views
merge-sort
algorithms
numerical-answers
2
votes
1
answer
2
Identify class of the language
L={ xy | x,y$\epsilon$ (a+b)*, na(x) = nb(y) }
asked
in
Theory of Computation
Jan 24, 2018
561
views
theory-of-computation
1
vote
0
answers
3
Aptitude
asked
in
Quantitative Aptitude
Jan 24, 2018
506
views
1
vote
0
answers
4
Stack algorithm
Is Most Recently Used (MRU) Page replacement algorithm a 'Stack Algorithm' i.e. it doesn't suffer from Belady's Anomaly ?
asked
in
Operating System
Jan 23, 2018
1.1k
views
operating-system
al
3
votes
2
answers
5
#Conflict Misses
A byte addressable computer has a small data cache capable of holding 16 32-bit words. Each cache block consist of four 32 bits words. For the following sequence of main memory addresses (in hexadecimal). The conflict miss if 2-way set associative LRU cache is used is ________. 100, 108, 114, 1C7, 128, 1B5, 100, 108, 1C7
asked
in
CO and Architecture
Jan 20, 2018
1.1k
views
cache-memory
co-and-architecture
3
votes
0
answers
6
CSL or not ?
L={ (an)m bn | n,m>=1 }
asked
in
Theory of Computation
Jan 20, 2018
558
views
theory-of-computation
2
votes
1
answer
7
Resource Allocation
Consider a scenario where 3 processes P1, P2 and P3 are sharing x resources of the same type. The maximum need of the three processes is 4, 8, 6. It is also known that the maximum combined need of both processes P1 and P2 at a time is 9 and they always execute only in combined manner. Then the value of x is ___
asked
in
Operating System
Jan 20, 2018
5.2k
views
operating-system
1
vote
0
answers
8
Dynamic programming
Consider the following recursive function which is used by dynamic programming: T(n)= 0 ;if n<1 = 1;if n=1 =T(n-1)+T(n-2)+1 ;if n>1 Assume for every function call T(i) it checks the table first, if its value is already ... of n' so that overflow cannot occur ________. (Assume system allocate 4 byte to each stack entry which is sufficient for storing required data.)
asked
in
Algorithms
Jan 19, 2018
1.1k
views
algorithms
dynamic-programming
0
votes
0
answers
9
Min. #Tables
.......
asked
in
Databases
Jan 17, 2018
549
views
databases
2
votes
0
answers
10
Weighted undirected graph
Consider a Weighted undirected graph connected with 'V' vertices and 'E' edges.What is the worst case time complexity to check if 2 particular vertices 'x' and 'y' are present in the graph, if present then calculate the minimum distance between them?
asked
in
Algorithms
Jan 17, 2018
1.1k
views
algorithms
2
votes
1
answer
11
Hamiltonian Graph
A complement of a cyclic graph on 5 vertices , has an Hamiltonian circuit . (True/False)
asked
in
Mathematical Logic
Jan 16, 2018
1.2k
views
graph-theory
discrete-mathematics
4
votes
1
answer
12
Theads
True/False : 1)Several threads can share same physical address space. 2)Several threads can share same virtual address space.
asked
in
Operating System
Jan 16, 2018
1.7k
views
operating-system
threads
5
votes
1
answer
13
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)
asked
in
Programming in C
Jan 14, 2018
973
views
data-structures
binary-search-tree
1
vote
0
answers
14
Logical shift
a) Shifting a Unsigned integer right by one bit, and filling from the left with 0, is always equivalent to dividing by 2. (True/False) b) Shifting a Unsigned integer left by one bit, and filling from the right with 0, is always equivalent to multiplying by 2. (True/False)
asked
in
CO and Architecture
Jan 13, 2018
664
views
co-and-architecture
1
vote
1
answer
15
Cartesian Product
Suppose L = { {} } , N = {1, 2, 3}. Now what does the set N × L contain ?
asked
in
Set Theory & Algebra
Jan 12, 2018
490
views
discrete-mathematics
2
votes
1
answer
16
Contingency or Not ?
~ $\forall$ x [ P(x) -> (Q(x) v P(x) ) ]
asked
in
Mathematical Logic
Jan 11, 2018
689
views
propositional-logic
mathematical-logic
1
vote
1
answer
17
Starvation
I am confused with what exactly Starvation mean ? AFAIK Considering Process Scheduling eg SRTF and SJF , Starvation can be considered when some process is getting preempted by other high priority processes and hence not getting a chance to execute on CPU and ... do we consider a Single processor system or a Multiprocessor i.e. when we have multiple processing cores or CPUs available?
asked
in
Operating System
Jan 8, 2018
727
views
operating-system
starvation
self-doubt
2
votes
2
answers
18
CSMA/CD
In standard ethernet with transmission rate of 20 Mbps, the length of the cables is 2500 m and the size of frame is 512 bits. The propagation speed of a signal in a cable is 2 × 108 m/s. The percentage of the time channel is idle or not used by a station is _________ (in approximate integer value).
asked
in
Computer Networks
Jan 6, 2018
4.8k
views
computer-networks
csma-cd
3
votes
1
answer
19
TCP Congestion Control
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 KB and the threshold at the start of first transmission is 24 KB. Assume that 3 duplicate ACK are received during the 5th transmission what is the congestion window size at the end of 10th transmission?
asked
in
Computer Networks
Jan 6, 2018
1.3k
views
computer-networks
congestion-control
3
votes
2
answers
20
BST(Test Series)
Consider a Binary Search Tree is created using element 1 to n in following order: 3, 2, 1, 6, 5, 4, 9, 8, 7, 12, 11, 10, ....., n – 3, n – 4, n – 5, n – 2, n – 1, n What is the worst time complexity of searching a number in the Binary Search Tree?
asked
in
DS
Jan 3, 2018
808
views
data-structures
binary-search-tree
made-easy-test-series
Page:
1
2
3
4
next »
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
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...