Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Abbas2131
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Abbas2131
1
answer
1
GATE 2019
I am getting 74.67 marks, and a score of about 866, will I get direct admission in IITK or IITB ?
I am getting 74.67 marks, and a score of about 866, will I get direct admission in IITK or IITB ?
847
views
asked
Feb 11, 2019
IISc/IITs
usergate2019
usermod
admissions
+
–
9
answers
2
GATE CSE 2019 | Question: 22
Two numbers are chosen independently and uniformly at random from the set $\{1,2,\ldots,13\}.$ The probability (rounded off to $3$ decimal places) that their $4\text{-bit}$ (unsigned) binary representations have the same most significant bit is ___________.
Two numbers are chosen independently and uniformly at random from the set $\{1,2,\ldots,13\}.$The probability (rounded off to $3$ decimal places) that their $4\text{-bit}...
19.8k
views
commented
Feb 7, 2019
Digital Logic
gatecse-2019
numerical-answers
digital-logic
number-representation
probability
1-mark
+
–
5
answers
3
GATE 2019
Let U = {1, 2, ..., n} and A = {(x, X), x ∈ X and X ⊆ U}. Consider the following two statements for |A|. (i) |A| = n*$\small 2^{n-1}$ (ii) |A|= Sigma(k=1 to n) k.(nCk) Which of the following is correct? (a) (i) only (b) (ii) only (c) Both (i) and (ii) (d) None of the above
Let U = {1, 2, ..., n} and A = {(x, X), x ∈ X and X ⊆ U}. Consider the following twostatements for |A|.(i) |A| = n*$\small 2^{n-1}$(ii) |A|= Sigma(k=1 to n) k.(nCk) W...
12.5k
views
commented
Feb 4, 2019
0
answers
4
Zeal Test Series 2019: Graph Theory - Degree Of Graph
A simple graph is one in which there are no self loops and each pair of distinct vertices is connected by at most one edge. Let G be a simple graph on 8 vertices such that there is a vertex of degree 1, a vertex of degree 2, a ... a vertex of degree 6 and a vertex of degree 7. Which of the following can be the degree of the last vertex ____ ?
A simple graph is one in which there are no self loops and each pair of distinct vertices is connected by at most one edge. Let G be a simple graph on 8 vertices such tha...
671
views
commented
Jan 2, 2019
Graph Theory
zeal
discrete-mathematics
graph-theory
degree-of-graph
zeal19
+
–
1
answer
5
UPPCL 2018AE
Suppose when there is cache “Miss” then memory Access is 30ns and when cache “Hit” then memory access time is 3ns if 80% is cache hit then effective memory access 9ns 8.4ns 3ns 9.10ns
Suppose when there is cache “Miss” then memory Access is 30nsand when cache “Hit” then memory access time is 3nsif 80% is cache hit then effective memory access9n...
1.3k
views
commented
Jan 2, 2019
CO and Architecture
co-and-architecture
cache-memory
effective-memory-access
+
–
1
answer
6
UPPCL 2018 AE
Let B1 is binary search tree initially empty then we insert the element in oder 1,2,3,4,5 . Let B2 is another binary search tree initially empty we insert the same element in reverse order difference between Rightmost element of B1 BST and Leftmost element of B2 BST 4 1 5 3
Let B1 is binary search tree initially empty then we insert the element in oder 1,2,3,4,5 .Let B2 is another binary search tree initially empty we insert the same elem...
337
views
answered
Dec 31, 2018
2
answers
7
UPPCL AE 2018:70
Consider the following grammar $\text{G:}$ $\text{P} \rightarrow \text{Q + R} \mid \text{Q - R} \mid \text{Q} \mid \text{R}$ $\text{Q} \rightarrow q \mid r$ $\text{R} \rightarrow r \mid s$ where $\text{P, Q,}$ and $\text{R}$ ... grammar $\text{G}$ Neither $\text{S1}$ nor $\text{S2}$ Only $\text{S1}$ Only $\text{S2}$ Both $\text{S1}$ and $\text{S2}$
Consider the following grammar $\text{G:}$$\text{P} \rightarrow \text{Q + R} \mid \text{Q – R} \mid \text{Q} \mid \text{R}$$\text{Q} \rightarrow q \mid r$$\text{R} \rig...
778
views
answered
Dec 31, 2018
Compiler Design
uppcl2018
compiler-design
parsing
ll-parser
+
–
0
answers
8
AAI JE IT 2018
Which is ur score on AAI JE IT
Which is ur score on AAI JE IT
490
views
comment edited
Dec 16, 2018
5
answers
9
TIFR CSE 2019 | Part B | Question: 2
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ? $8$ $16$ $32$ $64$ None of the above
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ?$8$$16$$32$$64$None of the above
4.4k
views
commented
Dec 9, 2018
Algorithms
tifr2019
algorithms
minimum-spanning-tree
+
–
0
answers
10
self doubt
Very Very Thankful to you if anyone solve it. Regular ∩ deterministic Context free Regular ∩ Context Free Regular ∩ Context Sensitive Regular ∩ Recursive Regular ∩ Recursive Enumerable Regular ∪ deterministic Context free Regular ∪ Context Free Regular ∪ Context Sensitive Regular ∪ Recursive Regular ∪ Recursive Enumerable
Very Very Thankful to you if anyone solve it.Regular ∩ deterministic Context freeRegular ∩ Context FreeRegular ∩ Context SensitiveRegular ∩ RecursiveRegular ∩ ...
331
views
commented
Nov 23, 2018
Theory of Computation
theory-of-computation
+
–
3
answers
11
Test by Bikram | Computer Organization and Architecture | Test 1 | Question: 11
A system has $3$ levels of cache i.e., $L_1, L_2$ and $L_3.$ The access times of $L_1,L_2$ and $L_3$ cache memories are $100$ ns/word, $150$ ns/word and $250$ ns/word, respectively. $L_1, L_2$ ... until a complete memory block gets transferred, what is the average access time? $103$ ns $220$ ns $150$ ns $135$ ns
A system has $3$ levels of cache i.e., $L_1, L_2$ and $L_3.$ The access times of $L_1,L_2$ and $L_3$ cache memories are $100$ ns/word, $150$ ns/word and $250$ ns/word, re...
989
views
commented
Oct 27, 2018
CO and Architecture
tbb-coa-1
co-and-architecture
cache-memory
multilevel-cache
+
–
0
answers
12
MADE EASY TOC
wha first one is not regular since c is not part of the alphabets we can extend c till w1 and w2 be either a or b. so it can be like first and last alphabet should be different which can be accepted by FA . so why 1st one is wrong please explain
wha first one is not regular since c is not part of the alphabets we can extend c till w1 and w2 be either a or b.so it can be like first and last alphabet should be diff...
814
views
commented
Oct 19, 2018
1
answer
13
MADE EASY CN
please explain this??
please explain this??
400
views
commented
Oct 19, 2018
0
answers
14
Kenneth Rosen Edition 6th Exercise 6.6 Question 5 (Page No. 457)
Find the number of primes less than 200 using the principle of inclusion–exclusion.
Find the number of primes less than 200 using the principle of inclusion–exclusion.
1.4k
views
commented
Sep 22, 2018
Combinatory
kenneth-rosen
discrete-mathematics
combinatory
inclusion-exclusion
+
–
4
answers
15
Demand Paging
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% memory access time = 75 ns swap page time = 500,000 ns 75% of pages are dirty OS uses a 3 level page table What is the effective access time (EAT) if we assume the page fault rate is 15% ?
Suppose:TLB lookup time = 20 nsTLB hit ratio = 80%memory access time = 75 nsswap page time = 500,000 ns75% of pages are dirtyOS uses a 3 level page tableWhat is the effec...
4.5k
views
commented
Sep 6, 2018
Operating System
operating-system
demand-paging
memory-management
multilevel-paging
+
–
1
answer
16
How does sizeof() operator work for multidimensional array ?
If I have an array : int a[2][3][4] ; How to evaluate below Outputs ? 1. sizeof(*a) 2.sizeof(**a) 3. sizeof(a) Please explain precisely .
If I have an array :int a [3][4] ; How to evaluate below Outputs ? 1. sizeof(*a) 2.sizeof( a) 3. sizeof(a) Please explain precisely .
1.7k
views
commented
Aug 21, 2018
Programming in C
programming-in-c
sizeof-operator
+
–
3
answers
17
Time Complexity
What is the time complexity of the following? for(i=0; i < n *n ; i = i *i) print("*");
What is the time complexity of the following?for(i=0; i < n *n ; i = i *i)print("*");
735
views
commented
Aug 10, 2018
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
2
answers
18
secondary memory
consider a disk pack with the following: 16 surfaces 128 tracks/surface 256 sectors/track 512 bytes/sectors (consider that each surface has 1 read/write head) The disk is rotating at 3600 rpm. What is the data transfer rate ?
consider a disk pack with the following:16 surfaces128 tracks/surface256 sectors/track512 bytes/sectors(consider that each surface has 1 read/write head)The disk is rotat...
656
views
answered
Aug 9, 2018
2
answers
19
Forouzon
An ISP is granted a block of addresses starting with 120.60.4.0/22. The ISP wants to distribute these blocks to 100 organizations with each organization receiving just eight addresses. Design the subblocks and give the slash notation for each subblock. Find out how many addresses are still available after these allocations.
An ISP is granted a block of addresses starting with 120.60.4.0/22. The ISP wants to distribute these blocks to 100 organizations with each organization receiving just ei...
12.0k
views
commented
Aug 5, 2018
6
answers
20
#DBMS ER Model - Minimum Number of tables
What are minimum number of tables required for the following given ER models such that they satisfy 1NF ?
What are minimum number of tables required for the following given ER models such that they satisfy 1NF ?
2.2k
views
asked
Jul 30, 2018
Databases
databases
er-diagram
er-to-relational
relational
+
–
3
answers
21
Question on hamming code with even parity
Please check how the correct answer is B.
Please check how the correct answer is B.
5.0k
views
commented
Jun 19, 2018
Computer Networks
computer
computer-networks
hamming-code
+
–
6
answers
22
Deadlock
Consider two processes P1 and P2, each needed 3 resources 1, 2 and 3 in a database. If each processes ask them in any order, then the number of ways possible in which system is guaranteed to be deadlock free ________. Given answer is 6. I am getting 12.
Consider two processes P1 and P2, each needed 3 resources 1, 2 and 3 in a database. If each processes ask them in any order, then the number of ways possible in which sy...
5.6k
views
answered
Jun 9, 2018
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
3
answers
23
GATE IT 2007 | Question: 37
Consider a Direct Mapped Cache with 8 cache blocks (numbered $0-7$). If the memory block requests are in the following order $3, 5, 2, 8, 0, 63, 9,16, 20, 17, 25, 18, 30, 24, 2, 63, 5, 82,17, 24.$ Which of the following memory blocks will not be in the cache at the end of the sequence ? $3$ $18$ $20$ $30$
Consider a Direct Mapped Cache with 8 cache blocks (numbered $0-7$). If the memory block requests are in the following order$3, 5, 2, 8, 0, 63, 9,16, 20, 17, 25, 18, 30, ...
7.8k
views
commented
May 24, 2018
CO and Architecture
gateit-2007
co-and-architecture
cache-memory
normal
+
–
0
answers
24
#TOC- Undecidability
In this lecture by Shai Simonson : https://youtu.be/77OG6ziPMu4 At 33:04 he mentions that "A = CFL that does not accept $\sum^*$ " is Undecidable. Also, we already know that "A' = CFL that accept $\sum ^*$ " is Undecidable as well. so if A and A' both are Recursively Enumerable sets, then wouldn't that make A a recursive set ?
In this lecture by Shai Simonson : https://youtu.be/77OG6ziPMu4 At 33:04 he mentions that "A = CFL that does not accept $\sum^*$ " is Undecidable.Also, we already know th...
311
views
closed
Feb 23, 2018
Theory of Computation
theory-of-computation
decidability
context-free-language
+
–
4
answers
25
Which of the following process scheduling algorithm may lead to starvation?
Which of the following process scheduling algorithm may lead to starvation (1)SJF (2)SRTF (3)Priority(without preemption) (4)Priority(with preemption) a)1,2,3 b)1,2,4 c)1,3,4 d)1,2,3,4 e)1,3 f)1,4
Which of the following process scheduling algorithm may lead to starvation (1)SJF(2)SRTF(3)Priority(without preemption)(4)Priority(with preemption)a)1,2,3 ...
23.0k
views
commented
Jan 3, 2018
Operating System
process-scheduling
+
–
2
answers
26
TOC minimal DFA
1.3k
views
commented
Dec 1, 2017
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
+
–
2
answers
27
C program
The number of possible m, such that m&0x3F equals 0x23?
The number of possible m, such that m&0x3F equals 0x23?
1.9k
views
answered
Nov 27, 2017
1
answer
28
complexity
T(n) = T(sqrt(n)) + n Taking 2m = n we can convert this as S(m/2) + 2m after this how to solve by masters?
T(n) = T(sqrt(n)) + nTaking 2m = n we can convert this as S(m/2) + 2mafter this how to solve by masters?
484
views
answered
Nov 16, 2017
Algorithms
recurrence-relation
+
–
1
answer
29
TestSeries
Can Bfs be applied for topological sort?
Can Bfs be applied for topological sort?
481
views
commented
Nov 16, 2017
Algorithms
algorithms
graph-algorithm
breadth-first-search
test-series
+
–
1
answer
30
BCD adder
Total number of invalid combinations for a BCD adder is 192 100 36 156 Explanation: 4-bits are needed to represent a BCD number. So, out of 16 (i.e.,24) combinations only 10 are valid. Total combinations=16×16=256 Valid combinations=10×10=100 Invalid combinations=256-100=156 I am unable to understand this. Please explain.
Total number of invalid combinations for a BCD adder is 192 100 36 156Explanation:4-bits are needed to represent a BCD number.So, out of 16 (i.e.,24) combinations on...
3.9k
views
answered
Nov 16, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register