Recent activity by Himanshu Kashyap / GATE Overflow for GATE CSE

1 answer

1

UDP Socket
Why UDP cannot communicate with multiple peers simultaneously, while it can connect twice to an already connected UDP socket?

Why UDP cannot communicate with multiple peers simultaneously, while it can connect twice to an already connected UDP socket?

432 views

answered Oct 23, 2019

6 answers

2

TIFR CSE 2016 | Part B | Question: 7
Let $n = m!$. Which of the following is TRUE? $m = \Theta (\log n / \log \log n)$ $m = \Omega (\log n / \log \log n)$ but not $m = O(\log n / \log \log n)$ $m = \Theta (\log^2 n)$ $m = \Omega (\log^2 n)$ but not $m = Ο(\log^2 n)$ $m = \Theta (\log^{1.5} n)$

Let $n = m!$. Which of the following is TRUE?$m = \Theta (\log n / \log \log n)$$m = \Omega (\log n / \log \log n)$ but not $m = O(\log n / \log \log n)$$m = \Theta (\log...

6.2k views

commented Aug 6, 2019

7 answers

3

GATE CSE 2014 Set 3 | Question: 41
Consider the pseudocode given below. The function $DoSomething()$ takes as argument a pointer to the root of an arbitrary tree represented by the $leftMostChild-rightSibling$ representation. Each node of the tree is of type $treeNode$. typedef struct ... height of the tree. number of nodes without a right sibling in the tree. number of leaf nodes in the tree

Consider the pseudocode given below. The function $DoSomething()$ takes as argument a pointer to the root of an arbitrary tree represented by the $leftMostChild-rightSibl...

20.0k views

answered Jul 30, 2019

1 answer

4

made easy test series

456 views

asked Jan 21, 2019

1 answer

5

PIPELINING
Consider the following sequence of instructions executed on the five-stage pipelined processor: LW $1, 30($6) ADD $2, $4, $2 ADD $1, $3, $5 SW $2, 20($4) ADD $1, $1, $4 Assuming there is no forwarding, calculate the number of clock cycles needed to execute above program ?

Consider the following sequence of instructions executed on the five-stage pipelined processor:LW $1, 30($6)ADD $2, $4, $2ADD $1, $3, $5SW $2, 20($4)ADD $1, $1, $...

781 views

asked Jan 16, 2019

0 answers

6

MadeEasy Test Series 2019: Databases - Relational Algebra
PLEASE EXPLAIN WHEATHER IT WOULD BE SOME EC DEPARMENT OR ALL EC DEPARTMENT I THINK ALL BECOZ IT IS SELECTION EID OF STUDENT WHO HAVE NOT ENROLLED IN ANY COURSE OF EC

PLEASE EXPLAIN WHEATHER IT WOULD BE SOME EC DEPARMENT OR ALL EC DEPARTMENT I THINK ALL BECOZ IT IS SELECTION EID OF STUDENT WHO HAVE NOT ENROLLED IN ANY COURSE OF EC

678 views

commented Jan 12, 2019

1 answer

7

GATE Overflow | Mock GATE | Test 1 | Question: 58
Let $f(A, B, C, D)=\Pi (2, 3, 5, 9, 11, 12, 13)$ The total number of prime implicants and essential prime implicants are denoted by $P$ and $Q$ respectively. What is the value $Q \% P$ where $'\%'$ denotes the modulo operator?

Let $f(A, B, C, D)=\Pi (2, 3, 5, 9, 11, 12, 13)$The total number of prime implicants and essential prime implicants are denoted by $P$ and $Q$ respectively. What is the v...

1.9k views

commented Jan 3, 2019

1 answer

8

MadeEasy Test Series: Operating System - Process Schedule
Consider that we have a multi-programmed computer in which each job has identical characteristics i.e. in one computation period T for a job, half the time is spent in I/O and the other half in CPU activity. Each job runs for a total of ... with processor operation, then what is the average Turn Around Time? 1.(2n-1)+0.75 2.(n-1)+0.75

Consider that we have a multi-programmed computer in which each job has identical characteristics i.e. in one computation period T for a job, half the time is spent in I/...

1.3k views

answer selected Nov 24, 2018

1 answer

9

Derangements
How many ways we can put 5 letters L1, L2, L3, L4, L5 in 5 envelopes e1, e2, e3, e4 and e5 (at 1 letter per envelope) so that i. no letter is correctly placed? ii. at least 1 letter is correctly placed? iii. exactly 2 letters are correctly placed? iv. at most 1 letter is correctly placed? v. at least 1 letter is wrongly placed? vi. exactly 1 letter is wrongly placed?

How many ways we can put 5 letters L1, L2, L3, L4, L5 in 5 envelopes e1, e2, e3, e4 and e5 (at 1 letter per envelope) so thati. no letter is correctly placed?ii. at least...

2.9k views

commented Oct 18, 2018

2 answers

10

#OS process synchronization
What happens if we run the following program? int main() { int sem; sem = screate(1); //Semaphore is created and is initialized to 1 fork (); Wait(sem); printf(―Gate ―); Signal(sem); return 0; } (A) Starvation occurs (B) Deadlock occurs (C) Both processes enter critical section simultaneously (D) ―Gate Gate―will be the output

What happens if we run the following program?int main(){int sem;sem = screate(1); //Semaphore is created and is initialized to 1fork ();Wait(sem);printf(―Gate ―);Sign...

845 views

answered Sep 30, 2018

1 answer

11

Virtual address space
A one-to-one mapping of the entire physical address space to a process's virtual address space is a correct address translation solution. True/False. Explain.

A one-to-one mapping of the entire physical address space to a process's virtual address space is a correct address translation solution. True/False. Explain.

513 views

answered Sep 29, 2018

1 answer

12

Decidable / Undecidable
Given a regular language, does the language contain any string at all. Given a regular language, does the language contain infinite number of strings. Given a recursive language, does the language contain infinite number of strings. Given a recursive language, does the language contain any string at all.

Given a regular language, does the language contain any string at all. Given a regular language, does the language contain infinite number of strings.Given a recursive la...

454 views

answered Sep 22, 2018

1 answer

13

Main memory

240 views

commented Aug 3, 2018

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