Dark Mode

Questions by Parshu gate

0 votes

0 answers

1

Computer Networks
How do we calculate the time in this scenario

asked in Computer Networks Oct 20, 2021

136 views

0 votes

1 answer

2

Is the college predictor for 2018 open?
Is the college predictor for 2018 open?

asked in Others Feb 16, 2018

5.9k views

1 vote

0 answers

3

asked in Theory of Computation Jan 21, 2018

202 views

1 vote

0 answers

4

closure properties

asked in Theory of Computation Jan 21, 2018

185 views

2 votes

0 answers

5

binary search tree

asked in Programming Jan 20, 2018

237 views

1 vote

1 answer

6

P- Problem
What does this mean??

asked in Theory of Computation Jan 20, 2018

190 views

3 votes

0 answers

7

time complexity

asked in Algorithms Jan 12, 2018

340 views

2 votes

1 answer

8

prime implicants and EPI

asked in Digital Logic Jan 8, 2018

312 views

2 votes

0 answers

9

how to identify language accepted by PDA

asked in Theory of Computation Jan 8, 2018

217 views

2 votes

1 answer

10

Regular expressions confusion
HOW TO SOLVE THESE TYPE OF QUESTIONS?

asked in Theory of Computation Jan 8, 2018

179 views

2 votes

0 answers

11

asked in Digital Logic Jan 6, 2018

168 views

2 votes

0 answers

12

disk capacity and no of sectors

asked in Databases Jan 6, 2018

466 views

1 vote

0 answers

13

class of languages

asked in Theory of Computation Jan 6, 2018

222 views

1 vote

0 answers

14

context free grammar

asked in Theory of Computation Jan 6, 2018

1.3k views

1 vote

0 answers

15

equivalence classes

asked in Theory of Computation Jan 6, 2018

527 views

1 vote

0 answers

16

IEEE 754
In IEEE double precision format, the sum of the largest and 2nd largest implicit fractional numbers is

asked in Digital Logic Jan 5, 2018

787 views

1 vote

0 answers

17

turing machines
consider a language which contains encodings of all DFA’s together with strings that the DFA’s accept. LDFA={ 〈B,w〉 | B is a DFA that accepts input string w} Assume LDFA ≤m Lx, i.e. Problem LDFA is polynomial time reducible to problem Lx. Lx must be regular Lx must be undecidable Lx must be decidable

asked in Theory of Computation Jan 5, 2018

357 views

4 votes

1 answer

18

multilevel paging
Consider a 32-bit computer with page size 2KB and physical memory of 32 GB. Each virtual page has additional 8 bits for hardware control. The computer has a two-level page table. The minimum number of bits in second level page table entry is ____

asked in Operating System Jan 5, 2018

749 views

1 vote

1 answer

19

max heap with binary search

asked in DS Jan 3, 2018

1.3k views

1 vote

0 answers

20

insertion sort with binary search

asked in Algorithms Jan 3, 2018

320 views

Page:

1
2
3
4
5
6
...
15
next »