Recent activity by tusharforever / GATE Overflow for GATE CSE

3 answers

1

GATE CSE 2021 Set 1 | Question: 40
Define $R_n$ to be the maximum amount earned by cutting a rod of length $n$ meters into one or more pieces of integer length and selling them. For $i>0$, let $p[i]$ denote the selling price of a rod whose length is $i$ meters. ... $R_7=18$ $R_7=19$ $R_7$ is achieved by three different solutions $R_7$ cannot be achieved by a solution consisting of three pieces

Define $R_n$ to be the maximum amount earned by cutting a rod of length $n$ meters into one or more pieces of integer length and selling them. For $i>0$, let $p[i]$ denot...

8.5k views

commented Feb 19, 2021

6 answers

2

GATE CSE 2003 | Question: 82, ISRO2009-1
The subnet mask for a particular network is $255.255.31.0.$ Which of the following pairs of $\text{IP}$ addresses could belong to this network? $172.57.88.62$ and $172.56.87.23$ $10.35.28.2$ and $10.35.29.4$ $191.203.31.87$ and $191.234.31.88$ $128.8.129.43$ and $128.8.161.55$

The subnet mask for a particular network is $255.255.31.0.$ Which of the following pairs of $\text{IP}$ addresses could belong to this network?$172.57.88.62$ and $172.56....

29.6k views

answered Nov 3, 2018

1 answer

3

Ace Test Series: DBMS - Canonical Cover In FD

2.5k views

commented Oct 30, 2018

1 answer

4

TANCET 2016 TOC

237 views

commented Oct 23, 2018

1 answer

5

TANCET 2016 VIRTUAL MEMORY

169 views

answered Oct 23, 2018

5 answers

6

GATE CSE 2003 | Question: 53
A single tape Turing Machine $M$ has two states $q0$ and $q1$, of which $q0$ is the starting state. The tape alphabet of $M$ is $\{0, 1, B\}$ and its input alphabet is $\{0, 1\}$. The symbol $B$ is the blank symbol used to indicate end of an input ... halt on any string in $(00+1)^*$ $M$ halts on all strings ending in a $0$ $M$ halts on all strings ending in a $1$

A single tape Turing Machine $M$ has two states $q0$ and $q1$, of which $q0$ is the starting state. The tape alphabet of $M$ is $\{0, 1, B\}$ and its input alphabet is $\...

12.1k views

answered Oct 22, 2018

5 answers

7

ISI2014-PCB-CS-4b
Consider the following statement: $\text{ For all languages }L \subseteq \{0, 1\}^*, \text{ if }L^* \text{ is regular then L is regular.}$ Is the above statement true? Justify your answer.

Consider the following statement:$\text{ For all languages }L \subseteq \{0, 1\}^*, \text{ if }L^* \text{ is regular then L is regular.}$Is the above statement true? Just...

2.0k views

answer edited Oct 21, 2018

9 answers

8

GATE CSE 1991 | Question: 17,b
Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many states does the minimized equivalent deterministic finite automaton have? Justify your answer briefly?

Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many s...

13.8k views

commented Oct 17, 2018

0 answers

9

Access Time Doubt
#OS After going through some previous year questions on.. I found that in gate we have to use simultaneous access of memory instead of hierarchical access But i have a small doubt regarding 2 questions In Simultaneous EMAT = TLB hit(tlb access) + Tlb miss(n* ... that in first question exact abswer should be 64ns as option is not matching so we have taken as 65ns Is it correct??

#OSAfter going through some previous year questions on.. I found that in gate we have to use simultaneous access of memory instead of hierarchical access But i have a sma...

294 views

asked Jul 31, 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