Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Devwritt
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Devwritt
0
votes
41
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)
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.0B) 255.255.248.0C) 255.255.128...
468
views
answered
Dec 13, 2018
1
votes
42
MadeEasy Subject Test 2019: Programming & DS - Heap
The minimum number of comparisons required to find the 65th smallest element in a minheap is equal to
The minimum number of comparisons required to find the 65th smallest element in a minheap is equal to
3.4k
views
answered
Dec 13, 2018
DS
made-easy-test-series
data-structures
binary-heap
+
–
1
votes
43
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
In a full binary tree of height 10 the number of nodes with degree 0,1 and 2 will be ______ , ______,and _____ respectivelyNote:-Consider height of a tree as the number o...
1.1k
views
answered
Dec 13, 2018
2
votes
44
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)
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)
431
views
answered
Dec 13, 2018
3
votes
45
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?
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?
956
views
answered
Dec 12, 2018
Operating System
made-easy-test-series
operating-system
file-system
+
–
1
votes
46
GATE2018 CE-1: GA-10
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 \times B \times C), (B \times G \times E)$ and $(D \times E \times F)$ are equal. Which integer among the following choices cannot be represented by the letters $A, B, C, D, E, F \ or \ G?$ A D B G E C F $4$ $5$ $6$ $9$
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 \times B \times C), (B \times G ...
2.5k
views
answered
Dec 12, 2018
Analytical Aptitude
gate2018-ce-1
general-aptitude
analytical-aptitude
logical-reasoning
+
–
0
votes
47
Self Doubt
Which of the following ALWAYS gives MINIMUM average waiting time and minimum average Turn around time SJF (Non preemptive) SRTF (Preemptive)
Which of the following ALWAYS gives MINIMUM average waiting time and minimum average Turn around time SJF (Non preemptive)SRTF (Preemptive)
547
views
answered
Dec 11, 2018
Operating System
operating-system
process-scheduling
+
–
0
votes
48
ACE TEST SERIES QUESTION
234
views
answered
Dec 11, 2018
CO and Architecture
co-and-architecture
addressing-modes
numerical-answers
ace-test-series
+
–
2
votes
49
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] ?
Given a 2D array A[40….95, 40...95] in lower triangular representation, size of each element is 1 ByteArray implemented in row major order, base address is 1000Address ...
1.2k
views
answered
Dec 11, 2018
DS
made-easy-test-series
data-structures
array
+
–
5
votes
50
construct of Deterministic Finite Automata (DFA) from following regular expression (0+1)*(00+11) (0+1)*
18.2k
views
answered
Dec 10, 2018
0
votes
51
Self Doubt
Equal Or Not $\Sigma ^{+} = L . L^{*} ?$
Equal Or Not$\Sigma ^{+} = L . L^{*} ?$
323
views
answered
Dec 10, 2018
Theory of Computation
theory-of-computation
+
–
0
votes
52
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)?
Consider the following CFG, with S as start symbol:S - aA l CBA - BaA I eB- bB l Abc l eC - B (HERE ‘e’ IS EPSILON OR NULL PRODUCTION)FIRST(B)?FOLLOW(C)?
921
views
answered
Dec 8, 2018
Compiler Design
compiler-design
parsing
first-and-follow
made-easy-test-series
+
–
0
votes
53
Ace test series
285
views
answered
Dec 8, 2018
0
votes
54
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
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 d...
529
views
answered
Dec 8, 2018
2
votes
55
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 ______________?
Consider the relation R(A,B,C,D,E) with the functional dependencies :A → B, B → C, C → A, D → E, and E → DThe Maximum possible super-keys of R is ______________...
1.4k
views
answered
Dec 7, 2018
Databases
made-easy-test-series
databases
database-normalization
superkeys
+
–
1
votes
56
WHAT IS CORRECT ANSWER
https://gateoverflow.in/17423/isro2014-36 WE WILL START INSERING FROM q[2] OR FROM q[3]
https://gateoverflow.in/17423/isro2014-36WE WILL START INSERING FROM q OR FROM q[3]
279
views
answered
Dec 7, 2018
1
votes
57
sql doubt
please give an example to differentiate between self join , natural join and join operation.
please give an example to differentiate between self join , natural join and join operation.
288
views
answered
Dec 7, 2018
Databases
sql
databases
self-doubt
+
–
0
votes
58
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
here is my calculation,it is leaf node in b+ tree son*(7+9) + 6 <= 1024n<=63.624n=63. but answer given is 64
221
views
answered
Dec 7, 2018
1
votes
59
MadeEasy Test Series: Digital Logic - Flip Flop
461
views
answered
Dec 6, 2018
Digital Logic
made-easy-test-series
digital-logic
flip-flop
+
–
0
votes
60
Graph theory
How many simple graph are possible on six vertices in which the number of edge is odd??
How many simple graph are possible on six vertices in which the number of edge is odd??
735
views
answered
Oct 17, 2018
Mathematical Logic
graph-theory
+
–
2
votes
61
self DOUBT database
If R1 have 120 tuples R2 have 100 tuples and R3 have 70 tuples then R1⋈R2⋈R3 WILL BE?
If R1 have 120 tuples R2 have 100 tuples and R3 have 70 tuples then R1⋈R2⋈R3 WILL BE?
512
views
answered
Oct 11, 2018
0
votes
62
Theory of computaion
Minimum number of states in DFA over Ʃ = {0, 1} with each string contains odd number of 0’s or odd number of 1’s. (a) 3 (b) 4 (c) 5 (d) 6 Can anyone draw the Dfa? :{
Minimum number of states in DFA over Ʃ = {0, 1} with each string contains odd number of 0’s or odd number of 1’s.(a) 3 (b) 4 (c) 5 (d) 6Can anyone draw the Dfa? :{
392
views
answered
Oct 8, 2018
0
votes
63
Prime implicants and essential implicants
1.4k
views
answered
Oct 4, 2018
Digital Logic
digital-logic
k-map
prime-implicants
minimization
+
–
1
votes
64
Minimum Spanning tree
If a simple undirected graph with positive weighted edges has 10 vertices and 30 edges, such that the cost of the Minimum Spanning tree is 59. Now, if all the edges weights are increased by 2, then the cost of the new MST is
If a simple undirected graph with positive weighted edges has 10 vertices and 30 edges, such that the cost of the Minimum Spanning tree is 59. Now, if all the edges weigh...
1.7k
views
answered
Sep 25, 2018
Algorithms
algorithms
minimum-spanning-tree
+
–
6
votes
65
GATE CSE 2002 | Question: 2.13
The smallest finite automaton which accepts the language $\{x \mid$ length of $x$ is divisible by $3\}$ has $2$ states $3$ states $4$ states $5$ states
The smallest finite automaton which accepts the language $\{x \mid$ length of $x$ is divisible by $3\}$ has$2$ states$3$ states$4$ states$5$ states
7.8k
views
answered
Mar 30, 2018
Theory of Computation
gatecse-2002
theory-of-computation
normal
finite-automata
minimal-state-automata
+
–
15
votes
66
GATE CSE 2018 | Question: GA-7
If $pqr \ne 0$ and $p^{-x}=\dfrac{1}{q},q^{-y}=\dfrac{1}{r},r^{-z}=\dfrac{1}{p},$ what is the value of the product $xyz$ ? $-1$ $\dfrac{1}{pqr}$ $1$ $pqr$
If $pqr \ne 0$ and $p^{-x}=\dfrac{1}{q},q^{-y}=\dfrac{1}{r},r^{-z}=\dfrac{1}{p},$ what is the value of the product $xyz$ ?$-1$$\dfrac{1}{pqr}$$1$$pqr$
7.3k
views
answered
Feb 14, 2018
Quantitative Aptitude
gatecse-2018
quantitative-aptitude
ratio-proportions
2-marks
logarithms
+
–
8
votes
67
GATE CSE 2018 | Question: GA-8
In a party, $60\%$ of the invited guests are male and $40\%$ are female.If $80\%$ of the invited guests attended the party and if all the invited female guests attended, what would be the ratio of males to females among the attendees in the party? $2\colon 3$ $1\colon 1$ $3\colon 2$ $2\colon 1$
In a party, $60\%$ of the invited guests are male and $40\%$ are female.If $80\%$ of the invited guests attended the party and if all the invited female guests attended, ...
6.2k
views
answered
Feb 14, 2018
Quantitative Aptitude
gatecse-2018
quantitative-aptitude
ratio-proportions
2-marks
+
–
4
votes
68
Demand Paging
Assume we have a demand-paged memory. The page table is held in registers. It takes 8 ms to service a page fault if an empty page is available or the replaced page is not modified , and 20 ms if the replaced page is modified. Memory access time is 100 ns . Assume that the page to be replaced is modified ... ns ? a) 6.1 * 10 ^ - 6 b) 7.3 * 10 ^ - 6 c) 3.4 * 10 ^ - 4 d) None of these
Assume we have a demand-paged memory. The page table is held in registers. It takes 8 ms to service a page fault if an empty page is available or the replaced page is not...
14.3k
views
answered
Nov 11, 2017
2
votes
69
UGC NET CSE | November 2017 | Part 2 | Question: 17
In SQL, ________ is an Aggregate function. SELECT CREATE AVG MODIFY
In SQL, ________ is an Aggregate function.SELECTCREATEAVGMODIFY
402
views
answered
Nov 9, 2017
Unknown Category
ugcnetcse-nov2017-paper2
databases
sql
+
–
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register