(A +B) * C -( D – E ) / ( F+G ).
Home==>makaut-2011==>Page 6
eduhilfe Latest Questions
Sayani saha
Asked: March 7, 2021In: MAKAUT
a) a minimal cost spanning tree of a graph b) a depth first spanning tree of a graph c) a breadth first spanning tree of a graph d) none of these.
a) unit matrix b) asymmetric matrix c) symmetric matrix d) none of these.
Sayani saha
Asked: March 7, 2021In: MAKAUT
a) Quick sort b) Heap sort c) Merge sort d) Bubble sort.
Sayani saha
Asked: March 7, 2021In: MAKAUT
a) queue b) dequeue c) stack d) tree.
Sayani saha
Asked: March 7, 2021In: MAKAUT
a) O ( n ) b) c) O ( n log n ) d) O ( log n ).
Sayani saha
Asked: March 7, 2021In: MAKAUT
i) n + 1 if m=0 ii) A ( m -1, 1 ) if m!=0 and n=0 iii) A( m-1 ), A ( m, n-1 ) if m !=0, n !=0.