The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register
|
I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by Devwritt
User Devwritt
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Devwritt
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
GATE2001-1.16
Let $f(n) = n^2 \log n$ and $g(n) = n(\log n)^{10}$ be two positive functions of $n$. Which of the following statements is correct? $f(n) = O(g(n)) \text{ and } g(n) \neq O(f(n))$ $g(n) = O(f(n)) \text{ and } f(n) \neq O(g(n))$ $f(n) \neq O(g(n)) \text{ and } g(n) \neq O(f(n))$ $f(n) =O(g(n)) \text{ and } g(n) = O(f(n))$
answered
Nov 1
in
Algorithms
|
3.3k
views
gate2001
algorithms
asymptotic-notations
time-complexity
normal
0
votes
2
ISRO2009-48
The cubic polynomial $y(x)$ which takes the following values: $y(0)=1, y(1)=0, y(2)=1$ and $y(3)=10$ is $x^3 +2x^2 +1$ $x^3 +3x^2 -1$ $x^3 +1$ $x^3 -2x^2 +1$
answered
Mar 10
in
Numerical Methods
|
953
views
isro2009
polynomials
0
votes
3
ISRO2017-80
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be a. $O(n\log n)$ b. $O\left( n^{3/2}\right)$ c. $O( n^3 )$ d. $O(n)$
answered
Feb 25
in
Algorithms
|
2.9k
views
isro2017
relations
algorithms
time-complexity
0
votes
4
Self Doubt
How to prepare for BARC exam and how many marks required to confirm interview call from the previous cutoff’s. Thankyou.
answered
Feb 21
in
Others
|
149
views
general
self-doubt
0
votes
5
Peter Linz Edition 4 Exercise 2.1 Question 9 (Page No. 48)
Consider the set of strings on {$0,1$} defined by the requirements below. For each, construct an accepting dfa. (a) Every $00$ is followed immediately by a $1$. For example, the strings $101, 0010, 0010011001$ ... strings of length four or greater in which the leftmost three symbols are the same, but different from the rightmost symbol.
answered
Feb 20
in
Theory of Computation
|
363
views
theory-of-computation
peter-linz
finite-automata
+1
vote
6
ACE CBT 2018
Identify valid statements pertaining to switching S1: Computer networks are based on packet switching. S2: Packet switching increases the available throughput. (A) Both S1 and S2 (B) S1 only (C) S2 only (D) Neither S1 nor S2
answered
Jan 24
in
Computer Networks
|
83
views
computer-networks
gate2018-analysis
0
votes
7
Pipeline Efficiency
A pipeline has a speedup factor of 5 and operating at 70% efficiency. How many stages are there in the pipeline?
answered
Jan 22
in
CO and Architecture
|
78
views
co-and-architecture
0
votes
8
propositional logic
which of the following is tautology? (¬P^(P->q))->¬q ¬(p->q)->¬q [(¬p^q)^[q->(p->q)]]->¬r Both (B) and(C) please explain in detail how to check for especially for condition (C) Because “r” is only in RHS but not in LHS of this implication.
answered
Jan 22
in
Mathematical Logic
|
108
views
propositional-logic
discrete-mathematics
mathematical-logic
first-order-logic
engineering-mathematics
+1
vote
9
MadeEasy Workbook: Operating System - Resource Allocation
A. X=40,Y=20 B.X=50,Y=10 C.X=30,Y=20 D. X=20,Y=30
answered
Jan 15
in
Operating System
|
102
views
operating-system
resource-allocation
made-easy-booklet
0
votes
10
UPPCL AE 2018:45
answered
Jan 8
in
CO and Architecture
|
41
views
uppcl2018
0
votes
11
Digital Logic Made Easy
Consider the following circuit: It outputs x+y It outputs y-x It outputs x+1 It outputs y+1
answered
Jan 4
in
Digital Logic
|
60
views
digital-logic
parallel-adder
combinational-circuits
0
votes
12
UGCNET-Nov2017-II-09
Negation of the proposition ⱻ x H(x) is: 1) ⱻ x ¬H(x) 2) Ɐ x ¬H(x) 3) Ɐ x H(x) 4) ¬ x H(x)
answered
Jan 2
in
Mathematical Logic
|
853
views
ugcnetnov2017-ii
mathematical-logic
discrete-mathematics
0
votes
13
Closure Properties
What is difference between Σ* and L* ? Which is true ? S1 : Σ* – {ϵ} = Σ+ S2 : L* – {ϵ} = L+ .
answered
Dec 24, 2018
in
Theory of Computation
|
225
views
theory-of-computation
closure-property
regular-languages
+1
vote
14
MadeEasy Subject Test 2019: Theory Of Computation - Finite Automata
answered
Dec 19, 2018
in
Theory of Computation
|
120
views
made-easy-test-series
theory-of-computation
finite-automata
+1
vote
15
Made easy test series
What we do if graph is complete with 5 vertices and weight are 1,2,3,4,5,6,7,8,9 and 10. than find maximum possible weight that a minimum weight spanning tree of G have..???
answered
Dec 14, 2018
in
Algorithms
|
173
views
minimum-spanning-trees
+1
vote
16
Conversion of NFA to DFA
convert the following NFA to DFA
answered
Dec 14, 2018
in
Theory of Computation
|
141
views
theory-of-computation
finite-automata
nfa
0
votes
17
MadeEasy Subject Test 2019: Programming & DS - Binary Tree
four vertices {A,B,C,D} is given which has only vertex D as a leaf total number of binary tree are possible when every binary tree has four node!
answered
Dec 13, 2018
in
DS
|
138
views
made-easy-test-series
data-structure
binary-tree
+5
votes
18
ME Test Series
Four vertices (A,B,C,D) is given which have only vertex D as a leaf. Total number of binary trees possible when every binary tree has four nodes is ________
answered
Dec 13, 2018
in
Programming
|
99
views
0
votes
19
ME test series
If the broadcast address of the subnet is given as 163.93.63.255, which of the following mask cannot suit the above address? A) 255.255.240.0 B) 255.255.248.0 C) 255.255.128.0 D) Both (a) and (b)
answered
Dec 13, 2018
in
Computer Networks
|
68
views
+1
vote
20
ME Test Series
The minimum number of comparisons required to find the $65^{th}$ smallest element in a minheap is equal to _____
answered
Dec 13, 2018
in
DS
|
36
views
+1
vote
21
aai question 2018
In a full binary tree of height 10 the number of nodes with degree 0,1 and 2 will be ______ , ______,and _____ respectively Note:-Consider height of a tree as the number of nodes in the longest path from root node to any leaf node. A.- 511, 1 , 511 B.-511 , 0 , 512 C.-512 , 0 , 511 C.-512 , 1, 510
answered
Dec 13, 2018
in
Programming
|
38
views
+2
votes
22
aai 2018
Which of the following is the time complexity to find the determinant of an upper- triangular matrix of order n*n? O(n^2.5) O(n) O(n^2) O(1)
answered
Dec 13, 2018
in
DS
|
55
views
+2
votes
23
MadeEasy Subject Test 2019: Operating System - File System
Unix I-node has block size 8 KB and file possible with triple indirect is 128 GB.Number of bits disk block address contain is?
answered
Dec 12, 2018
in
Operating System
|
117
views
made-easy-test-series
operating-system
file-system
+1
vote
24
CE_1_GA_GATE2018
Each of the letters arranged as below represents a unique integer from 1 to 9. The letters are positioned in the figure such that (A × B × C), (B × G × E) and (D × E × F) are equal. Which integer among the following choices cannot be represented by the letters A, B, C, D, E, F or G? (A)4 (B)5 (C)6 (D)9 Please explain with proper reason.
answered
Dec 12, 2018
in
Verbal Ability
|
429
views
general-aptitude
gate2018
0
votes
25
Self Doubt
Which of the following ALWAYS gives MINIMUM average waiting time and minimum average Turn around time SJF (Non preemptive) SRTF (Preemptive)
answered
Dec 11, 2018
in
Operating System
|
40
views
operating-system
cpu-scheduling
0
votes
26
ACE TEST SERIES QUESTION
answered
Dec 11, 2018
in
CO and Architecture
|
36
views
+1
vote
27
MadeEasy Test Series 2019: Programming & DS - Arrays
Given a 2D array A[40….95, 40...95] in lower triangular representation, size of each element is 1 Byte Array implemented in row major order, base address is 1000 Address of A[66][50] ?
answered
Dec 11, 2018
in
DS
|
98
views
made-easy-test-series
data-structure
arrays
0
votes
28
construct of Deterministic Finite Automata (DFA) from following regular expression (0+1)*(00+11) (0+1)*
answered
Dec 10, 2018
in
Theory of Computation
|
558
views
0
votes
29
Self Doubt
Equal Or Not $\Sigma ^{+} = L . L^{*} ?$
answered
Dec 10, 2018
in
Theory of Computation
|
58
views
theory-of-computation
0
votes
30
ME test series
Consider the following CFG, with S as start symbol: S -> aA l CB A -> BaA I e B-> bB l Abc l e C -> B (HERE ‘e’ IS EPSILON OR NULL PRODUCTION) FIRST(B)? FOLLOW(C)?
answered
Dec 8, 2018
in
Compiler Design
|
51
views
0
votes
31
Ace test series
answered
Dec 8, 2018
in
Theory of Computation
|
43
views
0
votes
32
NIELIT SB_2018_60
Identify the true statements from the given statements (i) Number of child pointers in a B/B+ tree node is always equal to number of keys in it plus one (ii) B/B+ tree is defined by a term minimum degree. And minimum degree depends on hard disk block size, key and address sizes. (a) i (b) ii (c ) i and ii (d) None of these
answered
Dec 8, 2018
in
Databases
|
88
views
+1
vote
33
MadeEasy Test Series: Databases - Functional Dependencies
Consider the relation R(A,B,C,D,E) with the functional dependencies : A → B, B → C, C → A, D → E, and E → D The Maximum possible super-keys of R is ______________?
answered
Dec 7, 2018
in
Databases
|
186
views
made-easy-test-series
databases
functional-dependencies
superkeys
+1
vote
34
WHAT IS CORRECT ANSWER
https://gateoverflow.in/17423/isro2014-36 WE WILL START INSERING FROM q[2] OR FROM q[3]
answered
Dec 7, 2018
in
DS
|
30
views
+1
vote
35
sql doubt
please give an example to differentiate between self join , natural join and join operation.
answered
Dec 7, 2018
in
Databases
|
59
views
sql
databases
self-doubt
0
votes
36
madeeasy
here is my calculation, it is leaf node in b+ tree so n*(7+9) + 6 <= 1024 n<=63.624 n=63. but answer given is 64
answered
Dec 7, 2018
in
Databases
|
45
views
+1
vote
37
MadeEasy Test Series: Digital Logic - Flip Flop
answered
Dec 6, 2018
in
Digital Logic
|
119
views
made-easy-test-series
digital-logic
flip-flop
Page:
1
2
next »
50,644
questions
56,523
answers
195,603
comments
101,286
users