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
Recent activity by PEKKA
2
answers
1
MADE EASY TEST SERIES
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’. What is the expected number of colliding pairs of elements, if we used simple uniform hashing?
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’.What is the expected number of colliding pairs of elements...
829
views
commented
Jan 17, 2017
DS
hashing
+
–
5
answers
2
min heap
The number of binary min. heaps that can be formed from a set of 7 distinct integers is _________?
The number of binary min. heaps that can be formed from a set of 7 distinct integers is _________?
16.1k
views
commented
Jan 7, 2017
DS
data-structures
binary-heap
combinatory
+
–
0
answers
3
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)
623
views
commented
Jan 6, 2017
Set Theory & Algebra
functions
+
–
2
answers
4
GATE CSE 2015 Set 1 | Question: 28
The binary operator $\neq$ ... about the binary operator $\neq$ ? Both commutative and associative Commutative but not associative Not commutative but associative Neither commutative nor associative
The binary operator $\neq$ is defined by the following truth table.$$\begin{array}{|l|l|l|} \hline \textbf{p} & \textbf{q}& \textbf{p} \neq \textbf{q}\\\hline \text{0} & ...
6.5k
views
commented
Jan 6, 2017
Set Theory & Algebra
gatecse-2015-set1
set-theory&algebra
easy
binary-operation
+
–
1
answer
5
Simple Integration Q2
$\int_{0}^{\frac{\pi}{4}}( \sec 2x -\tan 2x )\ dx$
$\int_{0}^{\frac{\pi}{4}}( \sec 2x -\tan 2x )\ dx$
624
views
commented
Jan 4, 2017
Calculus
calculus
+
–
1
answer
6
Simple Doubt in Integration
$\int_{- \pi }^{\pi} t^{2} \sin t \ dt$
$\int_{- \pi }^{\pi} t^{2} \sin t \ dt$
383
views
answer selected
Jan 4, 2017
Calculus
calculus
+
–
4
answers
7
GATE CSE 2014 Set 1 | Question: 6
Let the function ... $\theta \in (\frac{\pi}{6},\frac{\pi}{3})$ such that $f'(\theta)\neq 0$ I only II only Both I and II Neither I nor II
Let the function$$f(\theta) = \begin{vmatrix} \sin\theta & \cos\theta & \tan\theta \\ \sin(\frac{\pi}{6}) & \cos(\frac{\pi}{6}) & \tan(\frac{\pi}{6}) & \\ \sin(\frac{\pi...
13.8k
views
commented
Jan 4, 2017
Calculus
gatecse-2014-set1
calculus
differentiation
normal
+
–
4
answers
8
GATE CSE 2012 | Question: 9
Consider the function $f(x) = \sin(x)$ in the interval $x =\left[\frac{\pi}{4},\frac{7\pi}{4}\right]$. The number and location(s) of the local minima of this function are One, at $\dfrac{\pi}{2}$ One, at $\dfrac{3\pi}{2}$ Two, at $\dfrac{\pi}{2}$ and $\dfrac{3\pi}{2}$ Two, at $\dfrac{\pi}{4}$ and $\dfrac{3\pi}{2}$
Consider the function $f(x) = \sin(x)$ in the interval $x =\left[\frac{\pi}{4},\frac{7\pi}{4}\right]$. The number and location(s) of the local minima of this function are...
14.1k
views
commented
Jan 4, 2017
Calculus
gatecse-2012
calculus
maxima-minima
normal
+
–
0
answers
9
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]
248
views
asked
Jan 3, 2017
Calculus
calculus
+
–
0
answers
10
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}}$
286
views
commented
Jan 3, 2017
Graph Theory
engineering-mathematics
+
–
0
answers
11
Correct ans would be (B) right?
310
views
commented
Jan 3, 2017
1
answer
12
Data Structure
p=head; q=head-> next; while(A) { ....................................... } A is the condition to see list is empty or not, which one is valid? a) p!=NULL; b) q!=NULL; c)(p!=NULL)&&(q!=NULL) d)(p!=NULL)||(q!=NULL) -------------------------------------- ... ---------------------------------------- a) p!=NULL; b) q!=NULL; c)(p!=NULL)&&(q!=NULL) d)(p!=NULL)||(q!=NULL)
p=head; q=head- next; while(A) { ....................................... }A is the condition to see list is empty or not, which one is valid?a) p!=NULL;b) q!=NULL;c)(p!=N...
1.0k
views
commented
Jan 3, 2017
Programming in C
data-structures
+
–
0
answers
13
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
284
views
asked
Jan 3, 2017
Linear Algebra
linear-algebra
+
–
1
answer
14
Sorting Algorithm
A cache aware sorting algorithm sorts an array of size 2k with each key of size 4 Bytes. The size of the cache memory is 128 Bytes and algorithm is the combination of merge sort and insertion sort to exploit the locality of reference for the cache memory (i.e. will use insertion sort while ... [1+log22k-5], 2k [25+log22k-5 ] D) 2k [25+log22k-5], 2k [25+log22k -5]
A cache aware sorting algorithm sorts an array of size 2k with each key of size 4 Bytes. The size of the cache memory is 128 Bytes and algorithm is the combination of mer...
5.0k
views
commented
Jan 2, 2017
Algorithms
sorting
time-complexity
algorithms
+
–
1
answer
15
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
577
views
commented
Jan 2, 2017
Algorithms
test-series
gate-academy-test-series
algorithms
time-complexity
+
–
5
answers
16
GATE CSE 2015 Set 1 | Question: 40
An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decrease-key operations on a set of data ... if the goal is to achieve the best total asymptotic complexity considering all the operations? Unsorted array Min - heap Sorted array Sorted doubly linked list
An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decrease-...
23.9k
views
commented
Dec 29, 2016
Algorithms
gatecse-2015-set1
algorithms
data-structures
normal
time-complexity
+
–
9
answers
17
GATE CSE 2013 | Question: 30
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is $\Theta(1)$ $\Theta(\sqrt{\log} n)$ $\Theta(\frac{\log n}{\log \log n})$ $\Theta(\log n)$
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is$\Theta(1)$$\Theta(\sqrt{\log} n)$$\Theta(\frac{\log n}{\log \log n})$$\Theta(\log n)...
28.3k
views
commented
Dec 26, 2016
Algorithms
gatecse-2013
algorithms
sorting
normal
heap-sort
+
–
6
answers
18
GATE CSE 2015 Set 2 | Question: 22
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is $\Theta(n \log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta(1)$
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is$\Theta(n \log n)$$\Thet...
17.7k
views
commented
Dec 20, 2016
Algorithms
gatecse-2015-set2
algorithms
time-complexity
easy
+
–
1
answer
19
question on Big O and theta notation
1.2k
views
commented
Dec 20, 2016
1
answer
20
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
+
–
2
answers
21
Digital
2's complement of $-(96.75)_{10}$?
2's complement of $-(96.75)_{10}$?
735
views
commented
Dec 19, 2016
Digital Logic
digital-logic
number-representation
+
–
1
answer
22
Convert the given Three Address Code (TAC) into Static Single Assignment (SSA) ?
$x=5$ $x=x-3$ $\textbf{if } x<3$ $\quad y=x*2$ $\quad w=y$ $\textbf{else}$ $\quad y=x-3$ $w=x-y$ $z=x+y$ Give Equivalent SSA.
$x=5$$x=x-3$$\textbf{if } x<3$$\quad y=x*2$$\quad w=y$$\textbf{else}$$\quad y=x-3$$w=x-y$$z=x+y$Give Equivalent SSA.
2.0k
views
commented
Dec 18, 2016
Compiler Design
compiler-design
static-single-assignment
+
–
1
answer
23
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...
626
views
commented
Dec 18, 2016
Algorithms
algorithms
floyd-warshall-algorithm
+
–
0
answers
24
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 ...
914
views
commented
Dec 18, 2016
Algorithms
algorithms
prims-algorithm
+
–
1
answer
25
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.8k
views
commented
Dec 18, 2016
Algorithms
algorithms
kruskals-algorithm
+
–
1
answer
26
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
commented
Dec 18, 2016
Algorithms
algorithms
dijkstras-algorithm
+
–
2
answers
27
pointer defination
953
views
commented
Dec 17, 2016
4
answers
28
Time complexity and output
#include <stdio.h> #define N 3 int main() { int array[N] = {1,2,3}; int i,j; for ( i=1; i<(1<<N); i++) { for( j=0; j<N; j++) { if((1<<j)&i) { printf("%d", array[j]); } } printf("\n"); } return 0 ... $N = n \;\; , n \; \text{ is a positive integer }$ ? B. What is the output? C. What will be the complexity when $N$ is large.
#include <stdio.h #define N 3 int main() { int array[N] = {1,2,3}; int i,j; for ( i=1; i<(1<<N); i++) { for( j=0; j<N; j++) { if((1<<j)&i) { printf("%d", array[j]); } } p...
1.8k
views
commented
Dec 17, 2016
Programming in C
time-complexity
bitwise
programming-in-c
combinatory
summation
sub-set
binomial-theorem
+
–
1
answer
29
ACE-TEST
203
views
answered
Dec 14, 2016
4
answers
30
#compiler
given Grammar E → E + E E → E * E E → ( E ) E → id Find set of handles and viable prefixes for the input string id1 + id2 * id3
given GrammarE → E + EE → E * EE → ( E )E → idFind set of handles and viable prefixes for the input string id1 + id2 * id3
4.3k
views
comment edited
Dec 13, 2016
Compiler Design
compiler-design
viable-prefix
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register