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 Tauhin Gangwar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Tauhin Gangwar
0
votes
1
NIELIT 2016 MAR Scientist B - Section B: 16
A box contains $10$ screws, $3$ of which are defective. Two screws are drawn at random with replacement. The probability that none of two screws is defective will be $100\%$ $50\%$ $49\%$ None of these.
answered
in
Probability
Jul 21, 2020
659
views
nielit2016mar-scientistb
engineering-mathematics
probability
0
votes
2
#beautyofpie
There is two parallel lines and a matchstick. The constant distance between these two lines is equal to the the length of the matchstick. If the matchstick is dropped between the two lines randomly many times then what would be the probability that the matchstick would intersect the lines(any of it).The answer is .64 but I am not sure Please explain..
answered
in
Probability
Aug 5, 2016
293
views
5
votes
3
UGC NET CSE | December 2014 | Part 3 | Question: 50
How many disk blocks are required to keep list of free disk blocks in a $16$ GB hard disk with $1$ kB block size using linked list of free disk blocks ? Assume that the disk block number is stored in $32$ bits. $1024$ blocks $16794$ blocks $20000$ blocks $1048576$ blocks
answered
in
Operating System
Jul 29, 2016
4.9k
views
ugcnetcse-dec2014-paper3
operating-system
file-system
2
votes
4
UGC NET CSE | December 2014 | Part 3 | Question: 36
Suppose that we have numbers between $1$ and $1000$ in a binary search tree and we want to search for the number $365$. Which of the following sequences could not be the sequence of nodes examined ? $4, 254, 403, 400, 332, 346, 399, 365$ ... $927, 204,913, 242, 914, 247, 365$ $4, 401, 389, 221, 268, 384, 383, 280, 365$
answered
in
Programming
Jul 28, 2016
6.9k
views
ugcnetcse-dec2014-paper3
data-structures
binary-search-tree
8
votes
5
find TC : T(n)= 2T(n^1/2) + 1
find the TC
answered
in
Algorithms
Jul 28, 2016
19.3k
views
algorithms
recurrence-relation
descriptive
1
vote
6
UGC NET CSE | December 2014 | Part 3 | Question: 23
Given two languages : $L_{1}=\left\{(ab)^{n} a^{k} | n > k, k \geq 0\right\}$ $L_{2}=\left\{a^{n}b^{m} | n \neq m\right\}$ Using pumping lemma for regular language, it can be shown that $L_{1}$ is regular and $L_{2}$ is not ... and $L_{2}$ is regular. $L_{1}$ is regular and $L_{2}$ is regular. $L_{1}$ is not regular and $L_{2}$ is not regular.
answered
in
Theory of Computation
Jul 27, 2016
4.1k
views
ugcnetcse-dec2014-paper3
theory-of-computation
regular-language
0
votes
7
NYU computer science Assignment 9
Consider a system with a virtual address size of 64MB (2^26), a physical memory of size 2GB (2^31), and a page size of 1K (2^10). Under the target workload, 32 processes (2^5) are running; half of the processes are smaller than 8K ... )? What is the size of a single bottom-level page table entry (and why)? Compute the total space overhead for the entire system.
answered
in
CO and Architecture
Jul 25, 2016
594
views
co-and-architecture
2
votes
8
UGC NET CSE | September 2013 | Part 3 | Question: 37
The time complexity of reccurence relation T(n) = T(n/3) + T(2n/3) +O(n) is O(Ig n) O(n) O(n Ig n) O(n$^2$)
answered
in
Algorithms
Jul 25, 2016
995
views
ugcnetcse-sep2013-paper3
algorithms
time-complexity
recurrence-relation
1
vote
9
NPDA
How much memory does npda takes or has? As when we are taking npda for let's say ww^r.. Then we will be considering two pda at the same time.. Is it practical or theoretical.. Whts the case?
answered
in
Theory of Computation
Jul 21, 2016
810
views
pushdown-automata
theory-of-computation
2
votes
10
if the proposition all thieves are poor is false
If the propostion 'All thieves are poor' is false, which of the following propositions can be claimed certainly to be true? Some thieves are poor Some thieves are not poor No thief is poor No poor person is a thief
answered
in
Mathematical Logic
Jul 12, 2016
2.1k
views
propositional-logic
0
votes
11
Problem on hash table
A program that checks spelling works in the following way. A hash table has been defined in which each entry is a Boolean variable initialized to false. A hash function has been applied to each word in the dictionary, and the appropriate entry in the hash table has been set ... should increase with document size. (A) I only (B) II only (C) I and II only (D) II and III only
answered
in
Unknown Category
Jul 11, 2016
754
views
hashing
2
votes
12
which of the following problem is undecidable- Membership problem for CFL
Which of the following problem is undecidable Membership problem for CFL Membership problem for CSL Membership problem for regular set Membership problem for type 0 languages
answered
in
Theory of Computation
Jul 3, 2016
4.3k
views
2
votes
13
Kenneth Rosen Edition 6th Exercise 1.3 Example 19 (Page No. 39)
Can someone please explain the following solution. Ques: Show that ∀x(P(x) ∧ Q(x)) and ∀xP(x) ∧ ∀xQ(x) are logically equivalent (where the same domain is used throughout). This logical equivalence shows that we can distribute a universal quantifier over a ... Q(x)) is true. We can now conclude that ∀x(P(x) ∧ Q(x)) ≡ ∀xP(x) ∧ ∀xQ(x).
answered
in
Mathematical Logic
Jul 2, 2016
1.2k
views
kenneth-rosen
mathematical-logic
propositional-logic
1
vote
14
tautology
in third and fourth option,what does RHS means??here x is binded two times by universal quantifier inside and outside the bracket,,wht does that mean??
answered
in
Mathematical Logic
Jul 1, 2016
814
views
4
votes
15
Cfl
If L1 is CfL and L2 is CfL then state true or false?? i)L1-L2 is CSL ii)L1 intersection L2 is CSL.. Iii)L1 - L2 is Recursive iv)L1(compliment) is CSL Give the reason
answered
in
Theory of Computation
Jun 29, 2016
1.7k
views
theory-of-computation
4
votes
16
Choose the correct option?
Consider a computer system that has a cache with 512 blocks each of which can store 32 bytes.All addresses are byte addresses.Which Cache set will the memory address 0xFBFC map to if the cache is direct mapped (a)1DC (b)1CF (c)DF1 (d)DAC
answered
in
CO and Architecture
Jun 28, 2016
1.2k
views
1
vote
17
what is hit ratio?
In a 2 level memory, if the level 1 memory is 5 times faster than level 2 and its access time is 10ns less than avg access time.Let the level 1 memory access time is 20ns. (a.)0.7 (b.)0.75 (c.)0.86 (d.)0.96
answered
in
CO and Architecture
Jun 28, 2016
2.5k
views
3
votes
18
Function surjection and injection
Question Justify each option a)f and g are injection then gof is injection b) f and g are surjection then gof is surjection c) gof is onetoone then f is one to one d) gof is on to then g is onto How to solve this knd of problems in general ? Could someone explain it using simple english taking terms like domain and co-domain . instead of mathematical statements
answered
in
Set Theory & Algebra
Jun 27, 2016
532
views
functions
1
vote
19
GATE and general knowledge question
Check the validity of the argument "If Ram is married then he is sad. If he is sad then he does not watch TV.He doesnt watch TV.Therefore Ram is unmarried."
answered
in
Mathematical Logic
Jun 27, 2016
1.8k
views
2
votes
20
GATE DIscrete MAths
Show that the function f, g :R ->R defined as : , ∀ x ∈ ℝ are inverses of each other.
answered
in
Set Theory & Algebra
Jun 26, 2016
341
views
set-theory&algebra
functions
1
vote
21
Testbook Test Series: Operating System - Virtual Memory
answered
in
Operating System
Jun 25, 2016
494
views
testbook-test-series
operating-system
virtual-memory
2
votes
22
GATE CSE 1990 | Question: 2-ix
Match the pairs in the following questions: ...
answered
in
Compiler Design
Jun 25, 2016
11.7k
views
gate1990
match-the-following
compiler-design
compilation-phases
5
votes
23
mergesort
Given the following list of numbers: [21, 1, 26, 45, 29, 28, 2, 9, 16, 49, 39, 27, 43, 34, 46, 40] which answer illustrates the list to be sorted after 3 recursive calls to mergesort? [16, 49, 39, 27, 43, 34, 46, 40] [21,1] [21, 1, 26, 45] [21]
answered
in
Algorithms
Jun 24, 2016
3.6k
views
algorithms
merge-sort
2
votes
24
equivalence relation
let P(A) be the powerset of set A.and let R be the relation on P(A) such that S1 R S2 when S1 = S2.then the relation is: 1.reflexive 2.transitive and reflexive 3.reflexive and symmetric 4.equivlence relation here i am not getting one thing,relation ... that is s1 != s2 and hence there will not be any element in the reltion. I am confused with the language of the question.
answered
in
Set Theory & Algebra
Jun 24, 2016
719
views
9
votes
25
ISI2013-PCB-CS-5a
Suppose that an operating system provides two functions, $block()$ which puts the calling process on the blocked queue, and $wakeup(P)$ which moves process $P$ to the runnable queue if it is currently on the blocked queue (otherwise, its behaviour is unpredictable). Consider ... the initialisation of the semaphore(s), and the calls to $wait()$ and $signal()$ made by $A$ and $B$.
answered
in
Operating System
Jun 24, 2016
780
views
descriptive
isi2013-pcb-cs
operating-system
process-synchronization
8
votes
26
ISRO2011-73
Belady's anomaly means Page fault rate is constant even on increasing the number of allocated frames Page fault rate may increase on increasing the number of allocated frames Page fault rate may increase on decreasing the number of allocated frames Page fault rate may decrease on increasing the number of allocated frames
answered
in
Operating System
Jun 23, 2016
2.4k
views
isro2011
operating-system
page-replacement
page-fault
0
votes
27
PAGING PROBLEM
A processor uses 36 bit physical addresses and 32 bit virtual addresses, with a page frame size of 4 Kbytes. Each page table entry is of size 4 bytes. A three level page table is used for virtual to physical address translation, where the virtual ... , second and third level page tables are respectively. tHIS QUESTION HAS BEEN ASKED PREVIOUSLY ALSO..BUT PLS EXPLAIN WITH A GOOD FIGURE
answered
in
Operating System
Jun 23, 2016
1.8k
views
4
votes
28
MadeEasy Workbook: CO & Architecture - Pipelining
Below is the screenshot of the question. I found that answer of the Q.10 is 7 and I unable to understand Q.11. Please correct me in Q.10 and Please explain Q.11 meaning and answer.
answered
in
CO and Architecture
Jun 22, 2016
2.9k
views
made-easy-booklet
co-and-architecture
pipelining
14
votes
29
ISRO2014-77
What is the size of the physical address space in a paging system which has a page table containing 64 entries of 11 bit each (including valid and invalid bit) and a page size of 512 bytes? $2^{11}$ $2^{15}$ $2^{19}$ $2^{20}$
answered
in
Operating System
Jun 21, 2016
6.9k
views
isro2014
virtual-memory
paging
3
votes
30
Solve this Equation T(n) = 8T(n/2) + n^2 where (T(1) = 1)
answered
in
Algorithms
Jun 19, 2016
26.8k
views
algorithms
recurrence-relation
Page:
1
2
3
4
next »
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...
@Aakash_Bhardwaj all the best bro . For your...