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 Soumya29
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Soumya29
4
answers
1
GATE CSE 2019 | Question: 33
Assume that in a certain computer, the virtual addresses are $64$ bits long and the physical addresses are $48$ bits long. The memory is word addressible. The page size is $8$ kB and the word size is $4$ bytes. The Translation Look-aside Buffer (TLB) in the address translation path ... TLB miss? $16 \times 2^{10}$ $256 \times 2^{10}$ $4 \times 2^{20}$ $8 \times 2^{20}$
answered
in
Operating System
Feb 7, 2019
21.4k
views
gatecse-2019
operating-system
virtual-memory
2-marks
0
answers
2
MADE EASY TEST SERIES
Consider the counter circuit and propagation delay table shown below: (Assume all the devices are ideal except for some propagation delay). What is the maximum clock frequency that can be applied to the above counter? A) 125 kHz B)100 kHz C)200 kHz D)142.85 kHz
commented
in
Digital Logic
Jan 27, 2019
555
views
1
answer
3
Ace Test Series: Compilers - Parsers
comment edited
in
Compiler Design
Jan 26, 2019
1.3k
views
compiler-design
lr-parser
ace-test-series
4
answers
4
GATE CSE 2005 | Question: 9
The following is the Hasse diagram of the poset $\left[\{a,b,c,d,e\},≺\right]$ The poset is : not a lattice a lattice but not a distributive lattice a distributive lattice but not a Boolean algebra a Boolean algebra
comment edited
in
Set Theory & Algebra
Jan 19, 2019
9.1k
views
gatecse-2005
set-theory&algebra
lattice
normal
2
answers
5
Test by Bikram | Mock GATE | Test 4 | Question: 11
The number $0.085$ represented in $IEEE-754$ single-precision format will be: $0 01111011 01111100001010001111011$ $0 01111011 01011100001010001111011$ $0 01111011 01010100001010000111011$ $0 01111011 01111100001010001111011$
answer selected
in
GATE
Jan 18, 2019
554
views
tbb-mockgate-4
digital-logic
number-system
ieee-representation
1
answer
6
Group Theory
I was trying to find the chapter on Group Theory in Kenneth Rosen, but it's not there. Can anyone recommend me the best source for this ?
commented
in
GATE
Jan 18, 2019
2.1k
views
3
answers
7
GATE CSE 2008 | Question: 55
An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if The SLR(1) parser for G has S-R conflicts The LR(1) parser for G has S-R conflicts The LR(0) parser for G has S-R conflicts The LALR(1) parser for G has reduce-reduce conflicts
commented
in
Compiler Design
Jan 17, 2019
15.6k
views
gatecse-2008
compiler-design
parsing
normal
12
answers
8
GATE CSE 2005 | Question: 80
Consider the following data path of a $\text{CPU}.$ The $\text{ALU},$ the bus and all the registers in the data path are of identical size. All operations including incrementation of the $\text{PC}$ and the $\text{GPRs}$ are to be carried out in ... $2$ $3$ $4$ $5$
comment edited
in
CO and Architecture
Jan 14, 2019
23.8k
views
co-and-architecture
normal
gatecse-2005
data-path
machine-instruction
1
answer
9
Test by Bikram | Mock GATE | Test 1 | Question: 38
A radix sort is to be used to sort the file of non-negative integers shown below into ascending order. What would the order of the numbers be after one pass of the algorithm? $12$ $37$ $42$ $9$ $5$ $7$ $50$ $40$ $45$ $92$ $12$ $37$ $42$ $40$ $45$ $5$ $50$ $7$ ... $12$ $42$ $92$ $5$ $45$ $37$ $7$ $9$ $40$ $50$ $12$ $42$ $92$ $5$ $45$ $7$ $37$ $9$
answer selected
in
GATE
Jan 8, 2019
489
views
tbb-mockgate-1
sorting
radix-sort
algorithms
1
answer
10
Testbook Test Series: Operating System - Process Synchronization
Que- Consider the following statements about the dining philosopher problem. 1. There should be at least 6 chopsticks to avoid deadlock for 6 philosophers. 2. If the asymmetric solution is implemented then $1^{st}$ philosopher picks up her right ... above statement is correct? a. Only 1 b. Only 2 c. Both I and II d. None of the above
commented
in
Operating System
Jan 7, 2019
764
views
testbook-test-series
operating-system
process-synchronization
0
answers
11
Testbook Test Series: Theory of Computation - Minimal State Automata
$Que-$ The minimum number of states in the $NFA$ for the regular expression $(a + a(b + aa)*b)* a(b + aa)*a$ is ______. Approach ?
commented
in
Theory of Computation
Jan 6, 2019
548
views
testbook-test-series
theory-of-computation
minimal-state-automata
1
answer
12
Testbook Test Series: Computer Networks - Stop And Wait
$Que-$ A sender uses a Stop-and-Wait protocol for transmission of $8000 \ K-bits$ size frames on a $1Gbps$ satellite channel with a propagation delay of $400 \ ms$. What will be the link utilization (%) if a probability of single frame error is $0.001?$ $\text{Note – Here Frame size is 8000 K- bits i.e 8}*10^6 \ bits$
commented
in
Computer Networks
Jan 6, 2019
572
views
testbook-test-series
computer-networks
stop-and-wait
3
answers
13
GATE IT 2004 | Question: 60
Choose the correct option to fill the $?1$ and $?2$ so that the program prints an input string in reverse order. Assume that the input string is terminated by a new line character. #include <stdio.h> void wrt_it (void); int main (void) { printf("Enter Text"); ... $putchar(c);$ $?1$ is $(c = getchar()) ! =$ '\n' $?2$ is $putchar(c);$
commented
in
Programming in C
Jan 3, 2019
5.6k
views
gateit-2004
programming
programming-in-c
normal
1
answer
14
Test by Bikram | Databases | Test 2 | Question: 6
Decompose the following table into BCNF: $R(ABCD)$ $A \rightarrow C$ $C \rightarrow A$ $AB \rightarrow D$ The result is: (AC) (ABD) (AC) (CBD) (AB)(BAD) Both (A) & (B)
answer selected
in
Databases
Dec 31, 2018
630
views
tbb-dbms-2
databases
database-normalization
2
answers
15
GATE CSE 2013 | Question: 35
Consider the following relational schema. Students(rollno: integer, sname: string) Courses(courseno: integer, cname: string) Registration(rollno: integer, courseno: integer, percent: real) Which of the following queries are equivalent to this query in English? Find the distinct names of ... I, II, III and IV I, II and III only I, II and IV only II, III and IV only
commented
in
Databases
Dec 29, 2018
14.9k
views
gatecse-2013
databases
sql
relational-calculus
normal
0
answers
16
made easy 2018
The number of positive number which divides either 2700 or 9000 are _________? i am getting 20
commented
in
Combinatory
Dec 26, 2018
878
views
11
answers
17
GATE IT 2007 | Question: 24
A depth-first search is performed on a directed acyclic graph. Let $d[u]$ denote the time at which vertex $u$ is visited for the first time and $f[u]$ the time at which the DFS call to the vertex $u$ terminates. Which of the following statements is always TRUE for all edges $(u, v)$ in the graph ? $d[u] < d[v]$ $d[u] < f[v]$ $f[u] < f[v]$ $f[u] > f[v]$
commented
in
Algorithms
Dec 25, 2018
13.4k
views
gateit-2007
algorithms
graph-algorithm
normal
graph-search
depth-first-search
0
answers
18
Self Doubt
L= {a*b*c* – (a^nb^nc^n : n>=0)} Explain whether it is Regular, CFL,DCFL.,CSL
comment edited
in
Theory of Computation
Dec 25, 2018
614
views
1
answer
19
ACE Test Series
commented
in
Theory of Computation
Dec 23, 2018
757
views
1
answer
20
MadeEasy Subject Test 2018: Theory Of Computation - Context Free Language
L = { $a^{nm}b^{n} | n,m\geq 1$ } L is DCFL OR L is CFL but not DCFL OR L is not CFL which one is true ?
commented
in
Theory of Computation
Dec 23, 2018
1.3k
views
made-easy-test-series
theory-of-computation
context-free-language
0
answers
21
B+ Tree _ 40q
Calculate the order of B+ tree internal node and leaf node respectively if the disk block size is 512 Bytes. Assume that block pointer, record pointer and key field are of 7B, 8B, and 10B respectively (A) 30,29 (B) 31,30 (C) 29,28 (D) 32,31
commented
in
Databases
Dec 22, 2018
627
views
2
answers
22
MadeEasy Test Series: Theory Of Computation - Grammar
i thought that it is the language where both start and end symbols are same and i got 65 but the ans is 29
answer selected
in
Theory of Computation
Dec 22, 2018
323
views
made-easy-test-series
theory-of-computation
grammar
1
answer
23
Self Doubt
A 1*0(0+1)* B (0+1)*01* Both RE are not equivalent right ?
commented
in
Theory of Computation
Dec 21, 2018
371
views
0
answers
24
Functional Dependency
Consider a relation R(ABCD) with functional dependency F:{ AD → B, AB → C }. Is AB → C partial or total dependency?
commented
in
Databases
Dec 20, 2018
604
views
databases
0
answers
25
Made-easy-test-series
This program will give lexical error or not? Int main() { Int a = 09; /* Hello world */ } In the solution it is written that this program will give lexical error because integer has been assigned an invalid octal. Is this problem comes under lexical error?
commented
in
Compiler Design
Dec 18, 2018
1.1k
views
0
answers
26
Self doubt- Propositional Logic
Que. Consider domain is the set of all people in the world. $F(x,y) =x \text{ is the friend of y}.$ Represent each of the following sentences using first-order logic statements $1.$ Every person has $at most \ 2$ friends. $2.$ Every person has $exactly \ 2$ ... $3. \forall x \exists y_1\exists y_2(F(x,y_1) \wedge F(x,y_2) \wedge (y_1 \neq y_2))$ Please verify.
commented
in
Mathematical Logic
Dec 16, 2018
606
views
discrete-mathematics
first-order-logic
propositional-logic
1
answer
27
Ace Test Series
I think the answer is b) and in their solution also they are saying it b) but in option c) is correct. Can anyone confirm?
commented
in
Theory of Computation
Dec 10, 2018
257
views
3
answers
28
GATE CSE 2005 | Question: 12, ISRO2009-64
Let $f(x)$ be the continuous probability density function of a random variable $x$, the probability that $a < x \leq b$, is : $f(b-a)$ $f(b) - f(a)$ $\int\limits_a^b f(x) dx$ $\int\limits_a^b xf (x)dx$
commented
in
Probability
Dec 8, 2018
11.4k
views
gatecse-2005
probability
random-variable
easy
isro2009
2
answers
29
ME Test Series
Two dice are thrown simultaneously. The expected sum of the numbers shown up is?
answer selected
in
Mathematical Logic
Dec 8, 2018
1.1k
views
0
answers
30
Self Doubt- Quick Sort
Que - Consider the recursive quicksort algorithm with random pivoting . That is, in each recursive call, a pivot is chosen uniformly at random from the sub-array being sorted. When this randomized algorithm is applied to an array of size n all whose elements are distinct, what is the probability ... - $\frac{2}{n}+(\frac{1}{n}*\frac{2}{n-1}) = \frac{2}{n-1} $ Please verify.
asked
in
Algorithms
Dec 3, 2018
1.0k
views
algorithms
quick-sort
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:...