Questions by anjali007

0 votes

0 answers

1

MadE Easy
Shouldnt it be on when both the switches are on???… and if the switches work irrespective of the other switch then why are we dependent on the other switch..

asked in Digital Logic Jan 25, 2019

191 views

0 votes

0 answers

2

Made Easy
Shouldnt we take 1 instead of 1-P ?? As it should be sequential access???

asked in Operating System Jan 23, 2019

185 views

0 votes

1 answer

3

Made Easy
A hypothetical 5 stage processor is designed in which branch is predicted at 3 stage and each stage takes 1 cycle to compute its task. If f is the probability of an instruction being a branch instruction then what is the value of F such that speed up is atleast 3?

asked in CO and Architecture Jan 23, 2019

303 views

0 votes

0 answers

4

Made Easy
True or False:In a uniform delay pipeline stage the execution time of a single instruction is equal to the time for execution of the instruction in non pipelined manner. Shouldn’t it be false as thought each stage has uniform delay there would be additional buffer delay after each stage of the pipeline so shouldnt it be that it is not equal i.e it is more????

asked in CO and Architecture Jan 23, 2019

297 views

0 votes

0 answers

5

TestBook
The post correspondence solution <i,j,k> of the problem M=(abb,aa,aaa) and N=(bba,aaa,aa) is________ Ans is 2,1,3

asked in Theory of Computation Jan 14, 2019

541 views

0 votes

0 answers

6

Made Easy
Let N channels share 60kbps of slotted aloha channel.Frame Size is 1024 bits which are sent at every 40 seconds.The value of N is :___(upto 1 decimal place). Ans given is:862.5.. Pls explain the procedure.

asked in Computer Networks Jan 10, 2019

228 views

0 votes

1 answer

7

Applied Course Test 1
The number of states in a minimal DFA that accepts set of all strings beginning with 1 that, when interpreted as a binary integer is a multiple of 5 over the alphabet={0,1}. For example, strings 101, 1010 and 1111 are in the language?

asked in Theory of Computation Jan 6, 2019

2.7k views

1 vote

0 answers

8

TestBook
A pure ALOHA network transmits 400-bit frames on a shared channel of 400 kbps. What is the throughput(in frames) if the system (all stations together) produces 500 frames per second? Given ans is :91-92

asked in Computer Networks Dec 28, 2018

716 views

0 votes

0 answers

9

TestBook
In a database system, let TS(T1) and TS(T2) be the timestamps of transactions T1 and T2 respectively. W-t(X) denotes the largest timestamp of any transaction that executed write(X) successfully and R-t(X) denotes the largest timestamp of any transaction that ... back. 4 All of the above. Can anyone plz explain the working and what approach to take while solving these type of questions?

asked in Databases Dec 28, 2018

136 views

0 votes

1 answer

10

TestBook
A packet has arrived in which the offset value of 2nd frame is 450, the header length is 20 and the value of the total length ﬁeld is 1000. What is the number of the ﬁrst byte in the first frame and the last byte in the last frame if the size of IP packet of size 3500 bytes?

asked in Computer Networks Dec 25, 2018

184 views

0 votes

0 answers

11

Testbook
Consider two strings P = ‘10010101’ and Q = ‘010110110’. Let j be the length of the longest common subsequence between P and Q. The minimum no. of elements need to be skipped to obtain LCS of length j is _______. I am getting 2 but the ans is 3..

asked in Algorithms Dec 23, 2018

860 views

0 votes

0 answers

12

Test Book
Consider a file system that uses inodes to represent files. Disk blocks are 12 KB in size, and a pointer to a disk block requires 8 bytes. This file system has 10 direct disk blocks, as well as single and double indirect disk blocks. What is the maximum size in GB (up to two decimal) of a file that can be stored in this file system?

asked in Operating System Dec 23, 2018

1.5k views

0 votes

0 answers

13

#self-doubt
Does thrashing lead to an increase in the degree of multiprogramming?if yes then why ?

asked in Operating System Dec 23, 2018

169 views

2 votes

0 answers

14

#made easy
A->A*B {1} A->E {A.val=E.val} B->C+D {2} C->C-D {C.val=D.val.+C.val} D->D-E {D.val=D.val+E..val} E->E/F {3} F->G {F.val=G.val} A,B,C,D,E,F,G->id {A.val->id,B.val->id,C.val->id,D.val->id,E.val->id,F.val->id,G.val->id} Fill 1 ,2 and 3 so that for:6*4-3-5/4+12 it outputs 32.

asked in Compiler Design Dec 21, 2018

305 views

0 votes

0 answers

15

#testbook
If G = (V,E) is a directed graph, then length of adjacency list is ______ and it requires ______ amount of memory. 1 2|E|, θ(V) 2 |E|, θ(V+E) Correct Answer 3 |E|, θ(E) 4 2|E|, θ(V+E) Shouldnt the ans be 2|E| for the length of the adjacency list as every edge would be stored twice?

asked in Algorithms Dec 19, 2018

676 views

0 votes

1 answer

16

#TestBook-algo
The characters of the string K R P C S N Y T J M are inserted into a hash table of size of size 10 using hash function h(x) = (ord(x) - ord(A) +1) If linear probing is used to resolve collisions, then the following insertion causes collision 1:Y 2:C 3:M 4:P The given ans is 3.. but what is the approach and what do we mean by ord?

asked in Algorithms Dec 17, 2018

181 views

1 vote

0 answers

17

#Testbook-algo
Assume there are 1024 men, each with distinct arm strength, in an arm wrestling match stronger arm always wins. Number of arm wrestling matches required to find men with strongest and second strongest arm in worst case is_____ Plz also tell how to find the nth strongest in this case?

asked in Algorithms Dec 17, 2018

433 views

0 votes

0 answers

18

#selfdoubt
are non preemptive kernels free from race condition? If yes then why?

asked in Operating System Dec 15, 2018

161 views

0 votes

1 answer

19

TestBook
consider the following nested recursion. h(n)={ 0 if n=0 n if n>4 h(n+h(2n)) if n<=4} What is the value of h(2) ? The given ans is 12 I am getting 14...

asked in Programming Dec 9, 2018

98 views

0 votes

1 answer

20

Testbook-ds
Assume that p & q are pointers. What will be the output after performing following sets of operations on a given linked list? Struct node { char info; struct node *link; }; Operations are: q = p → link → link ; q → link → link = p → link; printf (“%c”, q → link → link → link → info); the given ans is b but I am getting c.. can anyone plz verify?

asked in Programming Dec 9, 2018

503 views

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

Questions by anjali007

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Subjects

Questions by anjali007

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Recent Posts

Subjects

Recent Blog Comments