Register
Filter

Questions by Devwritt

3 votes
4 answers
1
ME test series DFA states
The number of states in minimal DFA for strings starting with $ab^{2}$ and ending with $b$ over the alphabet $\left \{ a,b \right \}$ is__________. // doubt: minimal string should be $ abb $ right?
The number of states in minimal DFA for strings starting with $ab^{2}$ and ending with $b$ over the alphabet $\left \{ a,b \right \}$ is__________.// doubt: minimal strin...
0 votes
0 answers
2
UGC NET CSE | November 2017 | Part 2 | Question: 8
1 votes
0 answers
3
GradeUp - ISRO Test
Please check once , i think they consider priority only for same arrival time
Please check once , i think they consider priority only for same arrival time
0 votes
1 answer
4
Testbook Test Series: CO & Architecture - Cache Memory
If a 16-way Set Associative cache is made up of 64 bit words , 16 words per line and 8192 sets, How big is the cache in Megabytes ?
If a 16-way Set Associative cache is made up of 64 bit words , 16 words per line and 8192 sets,How big is the cache in Megabytes ?
0 votes
1 answer
5
Computer Organization- Memory Addressing
For 16 bit address-bus, if an 8 K RAM chip is selected when $A_{13}, A_{14}$ and $A_{15}$ address bits are all one, then what is the range of the memory address? Options - a) 2 b) 3 c) 4 d) 5
For 16 bit address-bus, if an 8 K RAM chip is selected when $A_{13}, A_{14}$ and $A_{15}$ address bits are all one, then what is the range of the memory address?Options -...
0 votes
1 answer
6
GATEBOOK TEST
1 votes
3 answers
7
GATEBOOK TEST
1 +2(1/2) +3(1/4)+ 4(1/8)+ .............. = ? getting 2 please check
1 +2(1/2) +3(1/4)+ 4(1/8)+ .............. = ?getting 2 please check
0 votes
0 answers
8
Made easy Test Series 2017 Proposition Logic
Please explain in simple words as i always face problem in such type of questions-
Please explain in simple words as i always face problem in such type of questions-
0 votes
1 answer
9
Made Easy MOCK-1- 52
It can accepts aa and/or bb . Please check?
It can accepts aa and/or bb .Please check?
0 votes
0 answers
10
Made Easy MOCK-1 Question
1 votes
1 answer
11
MadeEasy CBT 2017: Programming & DS - Trees
1 votes
0 answers
12
Hashing problem - please help
0 votes
0 answers
13
Computer Organization doubt
0 votes
1 answer
14
TOC epsilon closure doubt
Please explain?
Please explain?
0 votes
0 answers
15
Digital Problem - Why we take 8 flip flops . Why not 9?
0 votes
1 answer
16
PnC Problem - How to start such type of problems
0 votes
1 answer
17
Discrete Maths Problem .
0 votes
0 answers
18
binary search tree
0 votes
0 answers
19
Algorithms Problem
0 votes
0 answers
20
Digital problem , Made easy problem
Page: