Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Recent questions tagged #testseries
0
votes
0
answers
iGate Bhillai Test: DBMS
asked
16 hours
ago
in
Databases
by
Abhinav999
(
106
points)

3
views
#testseries
0
votes
0
answers
iGate Bhilai Test 2020:dbms
asked
16 hours
ago
in
Databases
by
Abhinav999
(
106
points)

4
views
#testseries
0
votes
0
answers
Gate overflow doubt made easy cache stalls
Suppose that in 500 memory references there are 50 misses in the first level cache and 20 misses in the second level cache.Assume miss penalty from the L2 cache to memory is 100 cycles.The hit time of L2 cache is 20 cycle.The ... cache is 10 cycles. If there are 2.5 memory references per instruction.How many average stall cycles per instructions are there?
asked
2 days
ago
in
CO & Architecture
by
Ram Swaroop
(
171
points)

5
views
coandarchitecture
#testseries
cachememory
stall
instructioncycle
0
votes
1
answer
Made easy Algorithm
Which of the following procedure is suitable for finding the longest path from given vertex to any other vertex in a directed acyclic graph(weighted) with few negative weight edge. Divide and conquer Greedy algorithm Dynamic programming All of the above
asked
3 days
ago
in
Algorithms
by
sagar2405
(
192
points)

9
views
programming
#testseries
#algorithms
algorithum
0
votes
0
answers
Made easy test series  Algorithm
How to do find 0/1 knapsack in minimum time?
asked
4 days
ago
in
Algorithms
by
sagar2405
(
192
points)

13
views
programming
#testseries
#algorithms
0
votes
1
answer
regular language and few statements
$L$ is a regular language over $\Sigma^*$ $X = \{ x x\ belongs\ to\ \Sigma^*, x\ is\ between\ n\ to\ 2n1\ \}$ $\exists w \in x, w \in L\ then\ L\ is\ infinite.$ $\exists, w >= 2n,\ w \in L\ then\ \exists x \in X$ Which one of the following statements are true ? (A) Only I (B) Only II (C) Both I and II (D) Neither I or II
asked
4 days
ago
in
Theory of Computation
by
KINGSLAYER
(
106
points)

11
views
#regularlanguage
theoryofcomputation
#testseries
gatebook
+1
vote
1
answer
checking if given languages are regular or not
Consider the following languages. Which one of the following statements is true ? (A) L1 is regular, L2 is non regular (B) L1 is non regular, L2 is regular (C) L1 is regular, L2 is regular (D) L1 is non regular, L2 is non regular My ... string and if it is, we can prove that L1 is regular, but how can L2 be regular as that order needs to be maintained!
asked
6 days
ago
in
Theory of Computation
by
KINGSLAYER
(
106
points)

38
views
gatebook
regularlanguages
#testseries
#toc
0
votes
0
answers
made easy toc
In the below question if we get HTH then player 1 wins right ? But it is not going to final state . Can anyone please explain the solution
asked
Aug 15
in
Theory of Computation
by
Manasa.M
(
119
points)

20
views
#testseries
0
votes
0
answers
madeeasy TOC
Option a. language also generates aa when m=1 and n=0 but in the given transitions there is no transition for (q0,a) when it is first read when stack contains z0 as stack symbol then how it can accept all strings generated by language . Can anyone please explain the solution
asked
Aug 13
in
Theory of Computation
by
Manasa.M
(
119
points)

14
views
#testseries
0
votes
0
answers
Made Easy Test Series 2019
Consider a file system with block size 4kb and disk size is 28 mb, to keep track of free block in the disk a bitmap is used. Then how many disk block required for bit map? (Answer given is 7)
asked
Aug 10
in
Operating System
by
suparna kar
(
102
points)

9
views
operatingsystem
#testseries
bitmap
+2
votes
1
answer
Igate test series
Consider the following program fragments d= 0; for (i=1;i<31;++i) for (j=1;j<31;++j) for (k=1;k<31;++k) if(((i+j+k) %3)==0) d =d+1; printf("% d",d); The number of addition performed by the above program fragment is (A)27000 (B)27000 *3 (c)9000+3*27000 (D)9930 + 27000 * 3
asked
Aug 10
in
Programming
by
Shubhrasirmour
(
105
points)

17
views
#c
#igate
#testseries
#gatepreparation
0
votes
1
answer
Made easssy test series
The number of distinct BFS and DFS traversal possible on complete graph of n vertices is?
asked
Aug 6
in
Algorithms
by
dheerwani
(
102
points)

13
views
#testseries
#algorithms
#gatepreparation
#gate
+1
vote
1
answer
Test series Made easy
Minimum no. of NOR gates required to implement ===> (A+B+C)’ ?
asked
Jul 23
in
Digital Logic
by
Priyansh Singh
(
107
points)

6
views
#testseries
digitallogic
digitalcircuits
0
votes
1
answer
TEST SERIESQ.17
Consider an array A of length n, array containing number between(110), in any arbitary order, best sorting algo takes 650ns if n=50. The time required by algo if n=300 is _____
asked
Jul 21
in
Algorithms
by
Ritabrata Dey
(
242
points)

5
views
#testseries
0
votes
1
answer
Branching factor and maximum depth
If ‘b’ is branching factor & ‘m’ is maximum depth of search tree, then what is the space complexity of greedy search? O(b + m) O(b^m) O(bm) O(m^m)
asked
Jul 21
in
Algorithms
by
Ritabrata Dey
(
242
points)

3
views
#testseries
0
votes
0
answers
TEST SERIESQ.1
If ‘b’ is branching factor & ‘m’ is maximum depth of search tree, then what is the space complexity of greedy search? O(b + m) O(b^m) O(bm) O(m^m)
asked
Jul 21
in
Algorithms
by
Ritabrata Dey
(
242
points)

1
view
#testseries
0
votes
0
answers
ACETESTQ.1
If ‘b’ is branching factor & ‘m’ is maximum depth of search tree, then what is the space complexity of greedy search? O(b + m) O(b^m) O(bm) O(m^m)
asked
Jul 21
in
Algorithms
by
Ritabrata Dey
(
242
points)

1
view
#testseries
0
votes
1
answer
ACETEST2020Q.5
Let A[1..n] be any array of n distinct numbers, if i<j and A[i]>A[j], then pair (i,j) is called an inversion of A. What is expected number of inversions in any permutation on n elements? theta(n) theta(log n) theta(n log n) theta(n^2)
asked
Jul 21
in
Algorithms
by
Ritabrata Dey
(
242
points)

13
views
#testseries
0
votes
1
answer
Made easy testQ13
Let g(n)=omega(n) , f(n)=O(n), h(n)=theta(n) then what is the time complexity of [g(n)f(n) + h(n)] O(n) theta(n) omega(n) theta(n^2)
asked
Jul 21
in
Algorithms
by
Ritabrata Dey
(
242
points)

13
views
#testseries
0
votes
0
answers
MadeEasyTest
What will be the maximum difference between a quick sort and heap sort sorting the edge in the graph of kruskals algorithm for MST if number of edge is 128
asked
Jul 21
in
Algorithms
by
Ritabrata Dey
(
242
points)

5
views
#testseries
0
votes
1
answer
Made Easy Test
Consider the following message given below: abbaabccdabcd The number of bits required for Huffman encoding of above message is ______
asked
Jul 21
in
Algorithms
by
Ritabrata Dey
(
242
points)

5
views
#testseries
To see more, click for the
full list of questions
or
popular tags
.
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
932
questions
596
answers
1,885
comments
81,474
users