Concept drill
code-analysis
GATE CSE & IT · Data Structures · 2014-2014
2
PYQs
100%
keyed
0
elite explanations
1
years appeared
Study anchor
Cormen et al. — Introduction to Algorithms (CLRS)
Algorithms, data structures, graph algorithms, complexity
Practice action
Start latest PYQPYQs in this concept
All concepts →2014 PYQ
Consider the following C functions in which size is the number of elements in the array E: int MyX(int *E, unsigned int size){ int Y = 0; int Z; int i,j,k; for(i = 0; i < size; i++...
mediumanswer key
2014 PYQ
Consider the C function given below. Assume that the array listA contains n (> 0) elements, sored in ascending order. int ProcessArray(int *listA, int x, int n) { int i, j, k; i =...
mediumanswer key