Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by goxul
2
votes
31
CN-DOUBT
A network that is 172.28.0.0 and would like to support 650 hosts per subnet.The subnet mask should we use is 255.255.____ and____?
A network that is 172.28.0.0 and would like to support 650 hosts per subnet.The subnet mask should we use is 255.255.____ and____?
424
views
answered
Nov 12, 2018
1
votes
32
Algorithm questions on graphs
758
views
answered
Nov 12, 2018
Algorithms
graph-theory
graph-algorithms
test-series
+
–
0
votes
33
Self Doubt
What is order of T(n) ? T(n) = T(n-1) + 2$^{n}$ , n>1 T(n) = 1 , n=1 A) O(2$^{n}$) B) O(n.2$^{n}$) C) O(2$^{2n}$)
What is order of T(n) ?T(n) = T(n-1) + 2$^{n}$ , n>1T(n) = 1 , n=1A) O(2$^{n}$)B) O(n.2$^{n}$)C) O(2$^{2n}$)
246
views
answered
Nov 12, 2018
Algorithms
recurrence-relation
time-complexity
+
–
1
votes
34
why do we need O(n), we can do directy check if index is present or not in O(1) time. Please explain..
Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]= i.(a) O (1) ...
291
views
answered
Nov 10, 2018
Algorithms
algorithms
time-complexity
+
–
2
votes
35
States in DFA
If NFA has 'n' states then how DFA can have 2^n states. Please help me in understanding how this is true. As per my understanding every DFA is NFA then how no of states can be more in DFA than nfa Please suggest Thanks
If NFA has 'n' states then how DFA can have 2^n states. Please help me in understanding how this is true.As per my understanding every DFA is NFA then how no of states c...
1.1k
views
answered
Nov 9, 2018
Theory of Computation
number-of-states
finite-automata
theory-of-computation
+
–
1
votes
36
adressing modes
Given 2 machine instructions, LW R4 #400 LW R1, 0,(R4) IN second instruction what will be loaded in R1,is it the operand at memory location 400?or some random memory location operand..I want to clarify whether the value stored in register is same as adress that register points.
Given 2 machine instructions,LW R4 #400LW R1, 0,(R4)IN second instruction what will be loaded in R1,is it the operand at memory location 400?or some random memory locatio...
1.2k
views
answered
Nov 9, 2018
CO and Architecture
co-and-architecture
machine-instruction
addressing-modes
registers
numerical-answers
+
–
2
votes
37
Zeal Test Series: Mathematical Logic - First Order Logic
1)How to do question no. 34,36
1)How to do question no. 34,36
574
views
answered
Nov 9, 2018
Mathematical Logic
zeal
mathematical-logic
first-order-logic
zeal-workbook
+
–
0
votes
38
Zeal Workbook: Mathematical Logic - First Order Logic
How to write the last line of Qno. 19 - irrespective of whether the system has been armed the alarm should go off when there is fire For Qno 20 I am getting iii) and iv) as true but answer is a) please check the 5th one
How to write the last line of Qno. 19 - irrespective of whether the system has been armed the alarm should go off when there is fireFor Qno 20 I am getting iii) and iv) a...
845
views
answered
Nov 9, 2018
Mathematical Logic
zeal
mathematical-logic
first-order-logic
zeal-workbook
+
–
0
votes
39
made easy 2019
I AM GETTING 28% WITH TLB= 140ns WITHOUT TLB= 500ns i havent considered memory access time, just address translation time is cosidered! am i right??
I AM GETTING 28%WITH TLB= 140nsWITHOUT TLB= 500nsi havent considered memory access time, just address translation time is cosidered!am i right??
480
views
answered
Nov 9, 2018
0
votes
40
SELF DOUBT
https://gateoverflow.in/83993/gate1990-2-viii WHAT IS CORRECT ANSWER FOR HEAP?
https://gateoverflow.in/83993/gate1990-2-viiiWHAT IS CORRECT ANSWER FOR HEAP?
252
views
answered
Nov 9, 2018
0
votes
41
Karumanchi
825
views
answered
Nov 4, 2018
Algorithms
algorithms
time-complexity
recurrence-relation
+
–
0
votes
42
recurrence equation:
T(1) = 1 T(n) = 2T(n - 1) + n, n ≥ 2 evaluates to (a) 2n + 1 - n – 2 (b) 2n – n (c) 2n + 1 – 2n – 2 (d) 2n – n HOW TO EVALUATES USING MASTER THEOREM
T(1) = 1 T(n) = 2T(n - 1) + n, n ≥ 2 evaluates to(a) 2n + 1 - n – 2(b) 2n – n(c) 2n + 1 – 2n – 2(d) 2n – n HOW TO EVALUATES USING MASTER THEOREM
407
views
answered
Nov 2, 2018
Algorithms
recurrence-relation
master-theorem
+
–
2
votes
43
Asymptotic Notations
Consider the following statements: $(1)$ Any two functions $f,g$ are always comparable under big Oh,that is $f=O(g)$ or $g=O(f)$ $(2)$ If $f=O(g)$ and $f=O(h)$ then $g(n)=\theta(h)$ $A)$ $(1)$ is true $(2)$ is false $B)$ $(1)$ is false $(2)$ is true $C)$ Both are false $D)$ Both are true
Consider the following statements:$(1)$ Any two functions $f,g$ are always comparable under big Oh,that is $f=O(g)$ or $g=O(f)$$(2)$ If $f=O(g)$ and $f=O(h)$ then $g(n)=\...
1.2k
views
answered
Nov 1, 2018
Algorithms
algorithms
asymptotic-notation
time-complexity
+
–
0
votes
44
Karumanchi
what is the time complexity of function(int n) { if(n<=1) return; for(int i=1; i<n; i++) { printf("*"); } function(0.8n); } i'm getting O(nlogn base 5/4) using the recurrence relation method but in the book it's given O(n) $T(n)=T(\frac{4n}{5})+O(n)$
what is the time complexity offunction(int n){ if(n<=1) return; for(int i=1; i<n; i++) { printf("*"); } ...
1.2k
views
answered
Oct 31, 2018
Algorithms
algorithms
time-complexity
recurrence-relation
+
–
2
votes
45
GATE2018 ME-2: GA-9
A house has a number which need to be identified. The following three statements are given that can help in identifying the house number? If the house number is a multiple of $3$, then it is a number from $50$ to $59$. If the house number is NOT a multiple of $4$, then it ... a multiple of $6$, then it is a number from $70$ to $79$. What is the house number? $54$ $65$ $66$ $76$
A house has a number which need to be identified. The following three statements are given that can help in identifying the house number?If the house number is a multiple...
6.2k
views
answered
Oct 30, 2018
Quantitative Aptitude
gate2018-me-2
general-aptitude
quantitative-aptitude
numerical-computation
+
–
3
votes
46
GATEBOOK-Combinatorics
How many license plates with 3 decimal digits followed by 3 letters do not contain both the number 0 and the letter O?
How many license plates with 3 decimal digits followed by 3 letters do not contain both the number 0 and the letter O?
904
views
answered
Oct 30, 2018
Combinatory
discrete-mathematics
combinatory
+
–
0
votes
47
Turing machine
What is the meaning of non trivial property related to a language. Please explain with an example.
What is the meaning of non trivial property related to a language. Please explain with an example.
229
views
answered
Oct 30, 2018
Theory of Computation
turing-machine
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
0
votes
48
testbook Testseries
An organism is born on day k = 1 with 1 cells. During day k = 2, 3, . . . the organism produces k 2 k−1 times more new cells than it produced on day k − 1. Give a simplified expression for the total of all its cells after n days
An organism is born on day k = 1 with 1 cells. During day k = 2, 3, . . . the organism produces k 2 k−1 times more new cells than it produced on day k − 1. Give a sim...
335
views
answered
Oct 28, 2018
2
votes
49
me book
how we can solve such type of question?
how we can solve such type of question?
219
views
answered
Oct 27, 2018
0
votes
50
Prepositions
556
views
answered
Oct 24, 2018
0
votes
51
TANCET 2011 ALGORITHMS
Suppose f, g, h, k : N → N. If f = O(h) and g = O(k), then 1) f + g = O(h + k) 2) fg = O(hk) 3) Both 1 and 2 4) None of the above
Suppose f, g, h, k : N → N. If f = O(h) and g = O(k), then1) f + g = O(h + k)2) fg = O(hk)3) Both 1 and 24) None of the above
516
views
answered
Oct 24, 2018
Algorithms
tancet
asymptotic-notation
+
–
0
votes
52
Insertion Sort
Consider following Statements : S1 : On any random input insertion Sort works more efficiently then Bubble Sort. S2 : Average number of Comparison of Insertion Sort is better then bubble sort by a constant Factor. If efficiency is considered as number of comparisons to sort an Input Array Which of Following is Correct ? A. Only S1 B. Only S2 C. Both S1 and S2 D. None
Consider following Statements :S1 : On any random input insertion Sort works more efficiently then Bubble Sort.S2 : Average number of Comparison of Insertion Sort is bett...
1.5k
views
answered
Oct 20, 2018
Algorithms
algorithms
sorting
+
–
1
votes
53
Paging - Memory management
Why do we need multilevel paging? According to me the reason is that page table needs contiguous memory allocation.So if page table size is too large, we may not be able to store the table in contiguous memory. So is this the reason behind multilevel paging? Also when we page the page table, do we store all levels page table in memory or only the outer level page table?
Why do we need multilevel paging?According to me the reason is that page table needs contiguous memory allocation.So if page table size is too large, we may not be able t...
616
views
answered
Oct 17, 2018
Operating System
operating-system
paging
memory-management
+
–
1
votes
54
Example of a countable set which is infinite
I wanted an example of a set which is infinite and countable. Is hair on human head an example of countable set being infinite?
I wanted an example of a set which is infinite and countable. Is hair on human head an example of countable set being infinite?
623
views
answered
Oct 7, 2018
Set Theory & Algebra
set-theory&algebra
discrete-mathematics
+
–
1
votes
55
Aptitude Doubt
The least number of five digits which is exactly divisible by 12,15 and 18 is: a)10080 b)10800 c)18000 d)81000
The least number of five digits which is exactly divisible by 12,15 and 18 is:a)10080 b)10800 c)18000 d)81000
650
views
answered
Sep 28, 2018
Quantitative Aptitude
quantitative-aptitude
general-aptitude
+
–
1
votes
56
You can do it. Passive voice
169
views
answered
Sep 28, 2018
0
votes
57
PREDICATE LOGIC DOUBT
Only Area 51 has Extra-Terresstrials A(x) = x is Area 51 E(x) = x has Extra-Terresstrials Which of the following is correct? (∀x)(A(x) -> E(x)) (∀x)(E(x) -> A(x)) (∀x)(A(x) <-> E(x))
Only Area 51 has Extra-TerresstrialsA(x) = x is Area 51E(x) = x has Extra-TerresstrialsWhich of the following is correct?(∀x)(A(x) - E(x))(∀x)(E(x) - A(x))(∀x)(A(x)...
511
views
answered
Sep 27, 2018
Mathematical Logic
mathematical-logic
first-order-logic
+
–
1
votes
58
self doubt
what is trivial or nontrivial property of a language please explain?????
what is trivial or nontrivial property of a language please explain?????
211
views
answered
Sep 26, 2018
1
votes
59
mock test
how to solve this
how to solve this
321
views
answered
Sep 25, 2018
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register