Dark Mode

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 ?

asked in IISc/IITs Feb 11, 2019

855 views

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 ___________.

commented in Digital Logic Feb 7, 2019

19.9k views

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

commented in Set Theory & Algebra Feb 4, 2019

12.5k views

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 ____ ?

commented in Graph Theory Jan 2, 2019

694 views

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

commented in CO and Architecture Jan 2, 2019

1.3k views

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

answered in DS Dec 31, 2018

346 views

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}$

answered in Compiler Design Dec 31, 2018

801 views

0 answers

8

AAI JE IT 2018
Which is ur score on AAI JE IT

comment edited in Others Dec 16, 2018

505 views

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

commented in Algorithms Dec 9, 2018

4.6k views

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

commented in Theory of Computation Nov 23, 2018

346 views

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

commented in CO and Architecture Oct 27, 2018

9.7k views

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

commented in Theory of Computation Oct 19, 2018

862 views

1 answer

13

MADE EASY CN
please explain this??

commented in Computer Networks Oct 19, 2018

421 views

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.

commented in Combinatory Sep 22, 2018

1.4k views

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% ?

commented in Operating System Sep 6, 2018

4.7k views

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 .

commented in Programming in C Aug 21, 2018

1.7k views

3 answers

17

Time Complexity
What is the time complexity of the following? for(i=0; i < n *n ; i = i *i) print("*");

commented in Algorithms Aug 10, 2018

773 views

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 ?

answered in Operating System Aug 9, 2018

689 views

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.

commented in Computer Networks Aug 5, 2018

12.0k views

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 ?

asked in Databases Jul 30, 2018

2.3k views

3 answers

21

Question on hamming code with even parity
Please check how the correct answer is B.

commented in Computer Networks Jun 19, 2018

5.0k views

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.

answered in Operating System Jun 9, 2018

5.7k views

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$

commented in CO and Architecture May 24, 2018

7.9k views

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 ?

closed in Theory of Computation Feb 23, 2018

313 views

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

commented in Operating System Jan 3, 2018

23.0k views

2 answers

26

TOC minimal DFA

commented in Theory of Computation Dec 1, 2017

1.3k views

2 answers

27

C program
The number of possible m, such that m&0x3F equals 0x23?

answered in Programming in C Nov 27, 2017

1.9k views

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?

answered in Algorithms Nov 16, 2017

509 views

1 answer

29

TestSeries
Can Bfs be applied for topological sort?

commented in Algorithms Nov 16, 2017

499 views

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.

answered in Digital Logic Nov 16, 2017

3.9k views