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
Answers by Soumya29
100
votes
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
7
votes
2
PI and EPI in case of Don't care
Consider the below function $f=\sum m(0,1,2,5,8,15)+d(6,7,10)$ In this Prime Implicant count comes-7 and Essential Prime Implicant Count comes 2. Please verify.
answered
in
Digital Logic
Aug 16, 2018
5.4k
views
digital-logic
6
votes
3
probability question
Consider 'A is a set containing n elements. A subset 'P' of 'A' is chosen at random The set 'A' is reconstructed by replacing the elements of 'A'. A subset 'Q' of 'A' is again chosen at random. What is the probability that 'P' and 'Q' have no common element?
answered
in
Probability
Aug 9, 2018
823
views
probability
3
votes
4
MadeEasy Test Series: General Aptitude - Verbal Ability
Consider there are two tribes living on the Island: Knights and knaves. Knights always tell truth while Knaves always tells lie. Suppose we counter two random people A and B, upon asking a question to A', A says If B is Knight then I am a Knave . ... Knave b.) A is Knave and B is Knave c.) Both A and B are Knight d.) Both A and B are Knave
answered
in
Verbal Aptitude
Aug 6, 2018
569
views
made-easy-test-series
general-aptitude
verbal-aptitude
8
votes
5
Ace algorithms
What is the time complexity? int i,j,k,x=0; for(i=1;i<=n;i++) for(j=1;j<=i*i;j++) { if (j mod i ==0) for(k=1;k<=j;k++) x=x+10; }
answered
in
Algorithms
Aug 3, 2018
793
views
time-complexity
ace-test-series
1
vote
6
Minterm
I had a slight doubt as regards with Minterm. How the output is 1 in the truth table values of the minterms?Please explain in detail.
answered
in
Digital Logic
Jul 19, 2018
767
views
digital-logic
4
votes
7
Kenneth Rosen Edition 6th Exercise 6.6 Question 11 (Page No. 457)
In how many different ways can seven different jobs be assigned to four different employees so that each employee is assigned at least one job and the most difficult job is assigned to the best employee? I got the first ... 4 elements. But how to deal with the second part that most difficult job is assigned to the best employee?
answered
in
Combinatory
Jun 28, 2018
2.7k
views
discrete-mathematics
inclusion-exclusion
kenneth-rosen
combinatory
2
votes
8
combinatorics
let say there are three elements in a set {1,2,3}.find total #of 4 digit no. which are neither non decreasing nor non increasing.
answered
in
Combinatory
Jun 28, 2018
470
views
combinatory
1
vote
9
Rosen (Nested Quantifiers)
If we think about nested quantifiers as nested loops ∀x((F (x) ∧ P(x)) → ∃yM(x, y)) for this then when we are iterating for outer loop x and we find the LHS to be true then only iterate in internal loop of y whether she is ... (x, y) } } We are making unnecessary comparisons here. So how could we move that existential quantifier in beginning? What is null quantification?
answered
in
Mathematical Logic
Jun 25, 2018
1.3k
views
3
votes
10
Kenneth Rosen Edition 6th Exercise 5.1 Question 23c (Page No. 345)
How many strings of three decimal digits can be formed such that they have exactly two digits that are 4's. My approach as to select 2 positions for these 4's in $\binom{3}{2}$ ways and the last bit will have 10 choices.Now I can permute ... should be $\binom{3}{2}$ * 10*$\frac{3!}{2!}$ = 90. But the answer is 27. How?
answered
in
Combinatory
Jun 23, 2018
296
views
kenneth-rosen
discrete-mathematics
combinatory
1
vote
11
pipelining
A CPU has five-stage pipeline where each stage takes 1ns, 2ns, 1.5ns, 3ns, 2.5ns. Instruction fetch happens in the first stage of the pipeline. Branch instructions are not overlapped. i.e., the instruction after the branch is not fetched ... one clock cycle. 30% of the instructions are conditional branches. Find the average execution time of the program for 1200 instructions is ________
answered
in
CO and Architecture
Jun 8, 2018
1.2k
views
1
vote
12
set theory
How many relation possible with $n$ elements of a set which are symmetric but not antisymmetric ?
answered
in
Set Theory & Algebra
Jun 5, 2018
597
views
engineering-mathematics
discrete-mathematics
set-theory&algebra
9
votes
13
Find the language
1)$L_{1}=\left \{ a^{2^{n}} \right \}$ where n is a positive integer. Is it Reguler, CFL or CSL? 2)$L_{2}=\left \{ (a^{n})^{m}.b^{n}|n,m\geq 1 \right \}$ Is it Regular CFL or CSL?
answered
in
Theory of Computation
Jun 3, 2018
2.2k
views
theory-of-computation
4
votes
14
Addressing mode
answered
in
CO and Architecture
May 27, 2018
1.0k
views
addressing-modes
clock-cycles
11
votes
15
Fork Output
#include<stdio.h> #include<sys/types.h> #include<unistd.h> void forkexample() { int x = 1; if (fork() == 0) printf("Child has x = %d\n", ++x); else printf("Parent has x = %d\n", --x); } int main() { forkexample(); return 0; ... = 2 (or) Child has x = 2 Parent has x = 0 I guess both because we dont know who will return first parent or child is it ?
answered
in
Operating System
May 25, 2018
4.0k
views
operating-system
fork-system-call
5
votes
16
kenneth rosen chapter 5 exercise 5.5 ques 51
How many ways are there to distribute six distinguishable objects into four indistinguishable objects so that each of the boxes contain at least one object?? Plss tell how to solve questions based on distributing Distinguishable objects ... boxes and Indistinguishable objects into indistinguishable boxes. I am not able to solve problem based on these.
answered
in
Combinatory
May 17, 2018
1.9k
views
0
votes
17
SELF DOUBT
it is confirmed that every LL(1) is LR(1) i.e CLR(1),but i want to know that is every LL(1) grammar is also LALR????? becz LALR is subset of CLR(1).
answered
in
Compiler Design
May 17, 2018
295
views
compiler-design
parsing
lr-parser
ll-parser
3
votes
18
question of type where propagation delay is given
answered
in
Digital Logic
May 15, 2018
2.9k
views
7
votes
19
Set Theory
How to distinguish between countably finite , countably infinite , uncountably infinite set? for reference see this ques:https://gateoverflow.in/36654/why-set-of-all-functions-f-n-0-1-is-uncountably-infinite
answered
in
Set Theory & Algebra
May 15, 2018
1.2k
views
discrete-mathematics
set-theory&algebra
set-theory
engineering-mathematics
4
votes
20
IISc CDS(MTech -R)
There are 12 pair of shoes, what is the probability that atleast one complete pair of shoes are present if 4 shoes are selected at random?
answered
in
Probability
May 4, 2018
1.2k
views
iisc
cds
probability
mtechr
11
votes
21
Connected Components
My Doubt is :- 1. If n vertices are there and p are the connected components then total n-p edges will be there. 2. In a simple graph with n vertices and p connected components there are atmost (n-p)(n-p+1)/2 number of edges Now which to ... the answer. Solution of made easy:- (Please tell how did they approached the question and which way is the best way to do such questions)
answered
in
Graph Theory
May 2, 2018
6.9k
views
graph-theory
graph-connectivity
1
vote
22
#Rosen Mathematics Question
Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, and the ordering of elements of U has the elements in increasing order; that is, ai = i. What bit strings represent the subset of all odd integers in U, the subset of all even integers in U, and the subset of integers not exceeding 5 in U?
answered
in
Mathematical Logic
May 1, 2018
2.4k
views
discrete-mathematics
7
votes
23
ISI 2014 PCB A2
Let $m$ and $n$ be two integers such that $m \geq n \geq 1.$ Count the number of functions $f : \{1, 2, \ldots , n\} \to \{1, 2, \ldots , m\}$ of the following two types: strictly increasing; i.e., whenever $x < y, f(x) < f(y),$ and non-decreasing; i.e., whenever $x < y, f(x) ≤ f(y).$
answered
in
Set Theory & Algebra
May 1, 2018
1.8k
views
isi2014
set-theory&algebra
functions
4
votes
24
Computability
Why????
answered
in
Mathematical Logic
May 1, 2018
438
views
2
votes
25
TOC regular language
L={a^n b^n :n>=1} and R = (a+b)^* L union R is going to be regular or not regular plzz give reason L is not regular if N leads to infinity then how it can be regular ..........
answered
in
Theory of Computation
May 1, 2018
399
views
regular-language
1
vote
26
C Programming
main() { if(fork()>0) sleep(100); } The given code results in the creation of: I) an orphan process II) a zombie process III) a process that executes forever IV) None of these Can someone explain this?
answered
in
Programming in C
Apr 30, 2018
9.8k
views
programming-in-c
programming
output
fork-system-call
8
votes
27
Minimum Spanning Tree
1) Kruskal Algorithm 2) Prims Algorithm 3) Dijkstra Algorithm 4) Bellman Ford Algorithm 5) Floyd Warshall Algorithm Among these which one works for only i) Positive edge weight ii) Negative edge weight iii) Negative weight cycle
answered
in
Algorithms
Apr 30, 2018
3.1k
views
minimum-spanning-tree
algorithms
graph-algorithm
6
votes
28
Counting
Show that, in a grid, the number of paths from $(0,0)$ to $(n,n)$ which does not cross ( it could touch ) the line $x = y$ is \begin{align*} \frac{1}{1+n}\binom{2\cdot n}{n} = \binom{2\cdot n}{n} - \binom{2\cdot n}{n-1} \end{align*} After that, show the number of balanced paranthesis strings of length $2n$ is same as the above result.
answered
in
Set Theory & Algebra
Apr 30, 2018
2.5k
views
counting
combinatorics-iitb
6
votes
29
IIT KANPUR SAMPLE PAPER 2018
A symmetric matrix X is said to be diagonalizable if we can express it as X = P DP −1 where P is an invertible matrix and D is a diagonal matrix. For a diagonalizable matrix X, how many matrix multiplications would be required to compute X4 = X ∗ X ∗ X ∗ X? Why?
answered
in
Mathematical Logic
Apr 30, 2018
454
views
Page:
1
2
3
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:...