Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User kumar.dilip
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by kumar.dilip
9
answers
1
GATE CSE 2019 | Question: 25
Consider a sequence of $14$ elements: $A=[-5, -10, 6, 3, -1, -2, 13, 4, -9, -1, 4, 12, -3, 0]$. The sequence sum $S(i,j) = \Sigma_{k=i}^j A[k]$. Determine the maximum of $S(i,j)$, where $0 \leq i \leq j <14$. (Divide and conquer approach may be used.) Answer: ___________
commented
in
Algorithms
Feb 7, 2019
19.2k
views
gatecse-2019
numerical-answers
algorithms
algorithm-design
1-mark
4
answers
2
GATE CSE 2019 | Question: 43
Consider the augmented grammar given below: $S’ \rightarrow S$ $S \rightarrow \langle L \rangle \mid id$ $L \rightarrow L, S \mid S$ Let $I_0 = \text{CLOSURE} (\{[S’ \rightarrow \cdot S ]\}).$ The number of items in the set $\text{GOTO} (I_0, \langle \: )$ is______
commented
in
Compiler Design
Feb 7, 2019
17.6k
views
gatecse-2019
numerical-answers
compiler-design
grammar
2-marks
5
answers
3
GATE CSE 2019 | Question: 48
Let $\Sigma$ be the set of all bijections from $\{1, \dots , 5\}$ to $\{1, \dots , 5 \}$, where $id$ denotes the identity function, i.e. $id(j)=j, \forall j$. Let $\circ$ ... Consider the language $L=\{x \in \Sigma^* \mid \pi (x) =id\}$. The minimum number of states in any DFA accepting $L$ is _______
commented
in
Theory of Computation
Feb 7, 2019
20.2k
views
gatecse-2019
numerical-answers
theory-of-computation
finite-automata
minimal-state-automata
difficult
2-marks
1
answer
4
GATE2019
Answer for Minimum no of nor gates question
commented
in
Digital Logic
Feb 3, 2019
2.0k
views
0
answers
5
Work and Time
Chandan and Falguni work on alternate days; Chandan working on the 1st day, Falguni on the 2nd, then Chandan again on the 3rd followed by Falguni on the 4th and so on. In this way, they can finish the work in 25 days. The work done by Chandan varies every day ... my doubt is here asked is number of days so shouldn't we fill(answer) 55 instead of 54.25 as days cant be in decimal
comment edited
in
Quantitative Aptitude
Feb 1, 2019
1.0k
views
work-time
quantitative-aptitude
1
answer
6
Self Doubt
Consider the following relation: R (A1, A2, ….An) and every (n-2) attributes of R forms a candidate key. How many super keys are there in R?
answer selected
in
Databases
Jan 31, 2019
1.8k
views
databases
superkeys
2
answers
7
Made easy mock test 1 DBMS super keys
Consider the following relation R(A1, A2,...A15) with (A1,A2, ... A6) of relation R are simple candidate key. The number of possible superkey in relation R is_
commented
in
Databases
Jan 30, 2019
1.3k
views
databases
superkeys
candidate-key
1
answer
8
ace test series
please provide the detailed solution
commented
in
Computer Networks
Jan 30, 2019
748
views
1
answer
9
schedules
tell which are cascadeless or strict or both W1(A),W2(A),COMMIT1,COMMIT2 R1(A),R2(A),COMMIT1,COMMIT2 R1(A),W1(A),R2(A),COMMIT1,COMMIT2 R1(A),W2(A),COMMIT1,COMMIT2
commented
in
Databases
Jan 29, 2019
918
views
strict-schedule
4
answers
10
Bellman Ford Shortest path
Is the below statement correct: Bellman Ford finds all negative weight cycles in the graph. This is true or false?
commented
in
Algorithms
Jan 28, 2019
1.8k
views
algorithms
shortest-path
bellman-ford
true-false
0
answers
11
MeTest-MOCK2
When 54 bytes of data is transferred using the UDP protocol, the efficiency is? (In per cent) IN UDP, the maximum datagram size can be $2^{16}-1 \, bytes$ Now to this, 8 Bytes of UDP header is included and this together must fit within $65535\, bytes$ IPv4 ... are actually sending 54 Bytes, so the efficiency of the protocol is $\frac{54}{65507} \times 100(\,in\,\%)$ Am I correct?
commented
in
Computer Networks
Jan 22, 2019
522
views
computer-networks
2
answers
12
Regular Languages
Is this language regular? If yes, how? L = {wxwR | x, w ϵ {0, 1}*} wR is reverse of string w. Thank you!
commented
in
Theory of Computation
Jan 21, 2019
1.5k
views
theory-of-computation
regular-language
regular-expression
finite-automata
1
answer
13
ME Testseries
L = { w $\epsilon$ {0,1} | w has equal occurrence of 001 and 010 } Is the language regular ?
commented
in
Theory of Computation
Jan 20, 2019
608
views
1
answer
14
Self Doubt
Find the minimum number of states in the DFA which accept the language of all strings that begin or end with 00 or 11.
commented
in
Theory of Computation
Jan 19, 2019
766
views
finite-automata
number-of-dfa
minimal-state-automata
1
answer
15
Self Doubt
The average no. of comparisons performed by the merge sort algorithm, in merging 2 sorted lists of length 2 is___________. Ans: $\frac{8}{3}$
commented
in
Algorithms
Jan 19, 2019
691
views
algorithms
merge-sort
sorting
1
answer
16
Ace Test Series 2019: DBMS - SQL Output
commented
in
Databases
Jan 19, 2019
1.2k
views
databases
sql
ace-test-series
0
answers
17
Made Easy Gate Mock-2 Question 56
In the given network system, station A needs to send a payload of 1600 B from its network layer to station B. If fragmentation is done, then the actual data size to be transmitted is ______________
commented
in
Computer Networks
Jan 18, 2019
847
views
made-easy-test-series
0
answers
18
MadeEasy Full Length Test 2019: Databases - Er Diagram
Consider the following ER diagram: How many number of relations are required for the above ER diagram? 2 3 5 1 Solution: My doubt is: Since $E_2$ isn't involved in total participation with $E_1$ so on merging we might get 2NF ... 2-NF violation. So by default which case is to be considered when normalization form is not mentioned?? 1-NF?
commented
in
Databases
Jan 18, 2019
781
views
databases
er-diagram
made-easy-test-series
1
answer
19
Database
minimum no fo relation require for this ER diagram i am thinking 3 relation but given answer is______something else
comment reshown
in
Databases
Jan 18, 2019
501
views
databases
0
answers
20
Made Easy Single Subject Test
A grammar that has no epsilon productions and also free from unit productions. The maximum number of reduce moves that can be taken during bottom-up evaluation of 25 token string by performing bottom-up parsers is _______
commented
in
Compiler Design
Jan 17, 2019
443
views
compiler-design
1
answer
21
Time complexity
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers O(log n) O(n log n) O(n)^2 O(n^2 log n) The answer given was B but since worst case time is stated shouldn't the answer be C? I mean we can check all possible pairs in the worst case. Correct me if I am wrong?
commented
in
Algorithms
Jan 17, 2019
1.3k
views
algorithms
time-complexity
algorithm-design
1
answer
22
DFA_VG
Number of state in DFA accepting a language L={anbn,1<= n <=3 } over {a,b} ……..
commented
in
Theory of Computation
Jan 17, 2019
387
views
2
answers
23
Made Easy Test Series:Microprogramming
A hypothetical cpu supports $300$ instructions.each instruction takes $5$ cycle to accomplish the execution. the control unit is designed using vertical programming which has $130$ control signals $,64$ flags and $12$ branch conditions .$X$ and ... register$(CDR)$ respectively.value of $X+Y$ is ______? How to work with branch condition in micro programming :(
commented
in
CO and Architecture
Jan 17, 2019
2.7k
views
made-easy-test-series
microprogramming
co-and-architecture
1
answer
24
MadeEasy Full Length Test 2019: Operating System - Semaphore
Let S be a binary semaphore variable, S=0 What will be the value of S when following operations are performed:- 2P, 4V, 5P, 2P, 8V, 3P, 2V ?
commented
in
Operating System
Jan 17, 2019
1.5k
views
operating-system
semaphore
made-easy-test-series
0
answers
25
MadeEasy Test Series 2019: CO & Architecture - Machine Instruction
Q.A stack based CPU executes the instruction.Memory location 500 contains 0x88 and memory location 700 contains 0x37.The stack pointer is at 0x003F. The instructions are as follows: I1:PUSH 500 I2:PUSH 700 I3:ADD ... after execution instructions c)Memory location 600 contains 0xBF after execution instructions d)Both (a) and (c)
commented
in
CO and Architecture
Jan 16, 2019
1.5k
views
co-and-architecture
machine-instruction
made-easy-test-series
0
answers
26
How to solve this question
If seven colors are used to paint 50 bicycles then which of the following statements need not be true? at least eight bicycles are of the same color at least seven bicycles are of the same color at least nine bicycles are of the same color at most eight bicycles are of the same color
commented
in
Combinatory
Jan 16, 2019
4.6k
views
pigeonhole-principle
0
answers
27
MadeEasy Full Length Test 2018: Digital Logic - Number Representations
2’s complement representation of the number $(-89)_{10}$ is 7 5 4 3 I don’t understand their solution. Please help.
commented
in
Digital Logic
Jan 15, 2019
577
views
digital-logic
number-representation
made-easy-test-series
0
answers
28
MadeEasy Subject Test 2019: Algorithms - Time Complexity
commented
in
Algorithms
Jan 15, 2019
496
views
algorithms
time-complexity
made-easy-test-series
0
answers
29
Asynchronous counter (Applied course mock 3)
MOD-8 synchronous down counter MOD-8 asynchronous up counter MOD-10 asynchronous up counter MOD-8 asynchronous down counter Please explain why it is down counter?
commented
in
Digital Logic
Jan 15, 2019
1.2k
views
digital-counter
0
answers
30
MadeEasy Test Series 2019: Digital Logic - Hamming Code
plz tell the answer
comment edited
in
Digital Logic
Jan 12, 2019
640
views
digital-logic
hamming-code
made-easy-test-series
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...