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
Questions by PEKKA
–1
votes
0
answers
1
Simple Doubt in Functions
How to find identity element of a function ? Ex : f(x)= x+y-3 How to find identity element of fog(x) ? please take an example and explain for fog(x)
How to find identity element of a function ? Ex : f(x)= x+y-3How to find identity element of fog(x) ? please take an example and explain for fog(x)
610
views
asked
Jan 6, 2017
Set Theory & Algebra
functions
+
–
2
votes
1
answer
2
Simple Integration Q2
$\int_{0}^{\frac{\pi}{4}}( \sec 2x -\tan 2x )\ dx$
$\int_{0}^{\frac{\pi}{4}}( \sec 2x -\tan 2x )\ dx$
611
views
asked
Jan 4, 2017
Calculus
calculus
+
–
0
votes
1
answer
3
Simple Doubt in Integration
$\int_{- \pi }^{\pi} t^{2} \sin t \ dt$
$\int_{- \pi }^{\pi} t^{2} \sin t \ dt$
378
views
asked
Jan 4, 2017
Calculus
calculus
+
–
0
votes
0
answers
4
Countinuity And Bounded Region
f(x) = x^ (-1/3) Show that f(x) is not countinuous in [-1,1] and not bounded [-1,1]
f(x) = x^ (-1/3)Show that f(x) isnot countinuous in [-1,1] andnot bounded [-1,1]
243
views
asked
Jan 3, 2017
Calculus
calculus
+
–
0
votes
0
answers
5
What are normalied Eigon Vectors ?
Give normalized eigon vector for 3*3 matrix A[ij] , in general
Give normalized eigon vector for 3*3 matrix A[ij] , in general
282
views
asked
Jan 3, 2017
Linear Algebra
linear-algebra
+
–
3
votes
1
answer
6
Calicut Gate Academy Test Series | DAA Complexity
f(n) = $\Theta (n^{2})$ g(n) = $\Omega (n)$ h(n)=O(log n) then [ f(n) . g(n) ] + [h(n) . f(n) ] is $\Omega (n)$ $\Theta (n^{2})$ O(log n) None
f(n) = $\Theta (n^{2})$ g(n) = $\Omega (n)$ h(n)=O(log n) then [ f(n) . g(n) ] + [h(n) . f(n) ] is $\Omega (n)$$\Theta (n^{2})$O(log n)None
561
views
asked
Jan 2, 2017
Algorithms
test-series
gate-academy-test-series
algorithms
time-complexity
+
–
0
votes
0
answers
7
How this statement is true
How this is true ? $_{r}^{\frac{n(n-1)}{2}}\textrm{C} = 2^{\frac{n(n-1))}{2}}$
How this is true ?$_{r}^{\frac{n(n-1)}{2}}\textrm{C} = 2^{\frac{n(n-1))}{2}}$
276
views
asked
Jan 2, 2017
Graph Theory
engineering-mathematics
+
–
1
votes
1
answer
8
2s complement Notation
What is the difference betwen 2s complent of a number and 2s complement representation of a number .
What is the difference betwen 2s complent of a number and 2s complement representation of a number .
1.2k
views
asked
Dec 19, 2016
Digital Logic
number-representation
+
–
0
votes
1
answer
9
Analysis Of Flloyd Warshal Algorithm
I have seen many varients of complexities using diferent data structures in implementing Flloyd Warshal Algorithm. Can you pls post standard algorithm and tells me in details how to derive the complexities. Please also mention the variations possibles when data structure changes and How will effect the complexity taking Best case and Worst case senarios .
I have seen many varients of complexities using diferent data structures in implementing Flloyd Warshal Algorithm. Can you pls post standard algorithm and tells me in de...
620
views
asked
Dec 18, 2016
Algorithms
algorithms
floyd-warshall-algorithm
+
–
2
votes
0
answers
10
Analysis Of Prims Algorithm
I have seen many varients of complexities using diferent data structures in implementing Prims Agorithm. Can you pls post standard algorithm and tells me in details how to derive the complexities. Please also mention the variations possibles when data structure changes and How will effect the complexity taking Best case and Worst case senarios .
I have seen many varients of complexities using diferent data structures in implementing Prims Agorithm. Can you pls post standard algorithm and tells me in details how ...
909
views
asked
Dec 18, 2016
Algorithms
algorithms
prims-algorithm
+
–
2
votes
1
answer
11
Analysis OF Kruskal's Algorithm
I have seen many varients of complexities using diferent data structures in implementing Kruskal Agorithm. Can you pls post standard algorithm and tells me in details how to derive the complexities. Please also mention the variations possibles when data structure changes and How will effect the complexity taking Best case and Worst case senarios .
I have seen many varients of complexities using diferent data structures in implementing Kruskal Agorithm. Can you pls post standard algorithm and tells me in details ho...
4.7k
views
asked
Dec 18, 2016
Algorithms
algorithms
kruskals-algorithm
+
–
3
votes
1
answer
12
Analysis of Dijikstra Algorithm
What will be the change is Time Complexity OF Dijikstra Algorithm If Following Data Structures are used ? Priority Queue : Binary Heap & Graph : Matrix Priority Queue : Binomial Heap & Graph : Adjacancy List Priority Queue : Fibonacci Heap & ... : AVL Tree & Graph : Adjacancy List How to find the change in timecomplexity if one is used over the other
What will be the change is Time Complexity OF Dijikstra Algorithm If Following Data Structures are used ?Priority Queue : Binary Heap & Graph : MatrixPriority Queue : B...
1.4k
views
asked
Dec 14, 2016
Algorithms
algorithms
dijkstras-algorithm
+
–
0
votes
1
answer
13
Difference Between Subnetmask and DBA
Given a classful network if we are given an IP address . How do we deffertiate it as DBA or Subnetmask ? Are the same ? Please explain with an example
Given a classful network if we are given an IP address . How do we deffertiate it as DBA or Subnetmask ? Are the same ? Please explain with an example
794
views
asked
Dec 12, 2016
Computer Networks
computer-networks
+
–
1
votes
1
answer
14
Negative Number AND Operation
Negative Number AND Operation Result in True . Why it is SO ? printf("%d", -1&&1); printf("%d", -1&&-1);
Negative Number AND Operation Result in True . Why it is SO ?printf("%d", -1&&1);printf("%d", -1&&-1);
246
views
asked
Dec 12, 2016
Programming in C
programming-in-c
+
–
0
votes
0
answers
15
Turing Machine
Is Turing Machine that accpet Regular Languages Decidable ?
Is Turing Machine that accpet Regular Languages Decidable ?
219
views
asked
Dec 8, 2016
Theory of Computation
turing-machine
theory-of-computation
+
–
0
votes
1
answer
16
Solve The Recurrance
Solve the following Recurrence Equation using back substitution method T(n)= T(n-1)+log n
Solve the following Recurrence Equation using back substitution methodT(n)= T(n-1)+log n
7.1k
views
asked
Dec 6, 2016
Algorithms
algorithms
recurrence-relation
+
–
1
votes
0
answers
17
Solve the recurrence using back substitution method
Solve the following Recurrence Equation using back substitution method T(n)= 2T(n/2)+log n
Solve the following Recurrence Equation using back substitution method T(n)= 2T(n/2)+log n
2.9k
views
asked
Dec 6, 2016
Algorithms
algorithms
time-complexity
+
–
0
votes
2
answers
18
Calicut Gate Academy Test Series | DAA Time complexity Q2
Complexity of the following snippet is for (i=1;i<n;++i) for(j=1;j<=n;j=j+i) c=c+1;
Complexity of the following snippet is for (i=1;i<n;++i) for(j=1;j<=n;j=j+i) c=c+1;
451
views
asked
Dec 6, 2016
Algorithms
test-series
gate-academy-test-series
algorithms
time-complexity
+
–
1
votes
1
answer
19
Calicut Gate Academy Test Series | DAA Find Complexity
Complexity of the below code snippet is .. for (i=1;i<=n;++i) { j=2; while(j<=n) { j=j*j; c=c+1; } } $O(nlog n)$ $O(n^{2})$ $O(nloglog n)$ $O(n)$
Complexity of the below code snippet is ..for (i=1;i<=n;++i) { j=2; while(j<=n) { j=j*j; c=c+1; } }$O(nlog n)$$O(n^{2})$$O(nloglog n)$$O(n)$
431
views
asked
Dec 6, 2016
Algorithms
test-series
gate-academy-test-series
algorithms
time-complexity
+
–
0
votes
1
answer
20
Asymptotic Notations DAA
$f(x) = n^{log (n)}$ $g(x) = nlog (n)$ $h(x) = 2^{n}$ Arrange Them in Increasing Order of rate of growth
$f(x) = n^{log (n)}$ $g(x) = nlog (n)$ $h(x) = 2^{n}$Arrange Them in Increasing Order of rate of growth
348
views
asked
Dec 5, 2016
Algorithms
asymptotic-notation
algorithms
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register