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 Chaitrasj
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Chaitrasj
1
vote
3
answers
1
Model Question IISc CDS CS Written Test Sample question
Anand is preparing a pizza with 8 slices, and he has 10 toppings to put on the pizza. He can put only one topping on each slice but can use the same topping on zero or more slices. In how many unique ways can he prepare the slices so that the same topping is not used in adjacent slices?
asked
in
Combinatory
Mar 11, 2019
1.1k
views
iisc
cds
0
votes
1
answer
2
Self doubt- Min no of NOR gates
What is the minimum number of 2 input NOR gates required to realise: F(A,B,C) = (A'+B')(B'+C')(C'+A') Case 1- Compliments of A,B,C are not available Case 2- Compliments of A,B,C are available
asked
in
Digital Logic
Feb 1, 2019
435
views
0
votes
0
answers
3
Made easy CBT2
$R_2(A)$W_1(B)$W_1(C)$R_3(B)$R_2(B)$R_1(A)$C_1$R_2(C)$C_2$W_3(A)$C_3$ Is this schedule allowed under 2PL?
asked
in
Databases
Jan 26, 2019
141
views
0
votes
0
answers
4
Ace Academy Test series
If a 2 regular graph G has a perfect matching, then which of the following is NOT true? 1. G is a cycle graph 2. Chromatic number of G is 2 3. Every component of G is even cycle 4. G is a bipartite graph
asked
in
Graph Theory
Jan 16, 2019
203
views
0
votes
2
answers
5
ME- CBT1
Can anyone explain how this is to be solved?
asked
in
Graph Theory
Jan 14, 2019
305
views
0
votes
0
answers
6
ME- CBT1
asked
in
CO and Architecture
Jan 14, 2019
313
views
co-and-architecture
addressing-modes
0
votes
0
answers
7
Ace Academy Test series
Consider the multi selection problem: Given a set 'S' of n elements and set 'K' of 'r' ranks $K_{1}$, $K_{2}$, ....$K_{r}$. Find the $K_1^{th}$, $K_2^{th}$, ....$K_r^{th}$ ... The time complexity of the most efficient algorithm to solve this problem is A. O(n.r) B. O($n^2$.log r) C. O(n) D. O(n.log r)
asked
in
Algorithms
Jan 11, 2019
239
views
0
votes
0
answers
8
Time complexity
What would be the answer for this? As per my analysis, i think it's D. big omega (n). We can't say B. O(n), because g's upper bound is f, and f's lower bound is n, so definitely f can go above n, say n log n, so if we say g as O(n) it's incorrect ... can't say because f has lower bound n, but g can go below n say log n, Since big oh and big Omega r not n, so not even theta of n.
asked
in
Algorithms
Nov 29, 2018
207
views
time-complexity
descriptive
0
votes
0
answers
9
Self doubt- Undecidability
L={TM | TM accepts only '11'} A.Is this language an REL? B. Is the complement of L REL or not REL? If REL is it Decidable or Semidecidable? I think there is no logic to reject other string apart from '11', hence we cannot show in output ... inputs so I think L is not REL please somebody verify. But i have doubt in complement of this language is it REL or not REL? Thanks
asked
in
Theory of Computation
Nov 25, 2018
338
views
0
votes
1
answer
10
When to use word access time and when to use block access time in access time calculation.
Hello, I came across this question when practicing from a gate app. My question is here simultaneous access is used and hence we are transferring from cache to cpu if hit or main memory to ... is needed. Added the image of question. Thanks https://gateoverflow.in/?qa=blob&qa_blobid=13957411914537045045
asked
in
CO and Architecture
Oct 4, 2018
86
views
co-and-architecture
cache-memory
effective-memory-access
write-through
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
Delhi Subordinate Services Selection Board
IIT GATE Admission Online Form 2023
All about M.Tech. and Research Admissions at IITP
IIT JAM Admission Online Form 2023
All about M.Tech. and Research Admissions at IITGn
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.4k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.3k)
Admissions
(644)
Exam Queries
(836)
Tier 1 Placement Questions
(17)
Job Queries
(72)
Projects
(9)
Unknown Category
(851)
Recent Blog Comments
The spreadsheet is up to date.
Can somebody give the details of how many topic...
@kabir5454 Anyway you should not be looking for...
General boys be like " Hum kya kare ab parhai...
14 backlogs to top 100