Home==>makaut-cs-302-data-structure and algorithm==>Page 33
eduhilfe Latest Questions
Sayani saha
Asked: February 24, 2021In: MAKAUT
Show that the function f(n) defined by if (I) = 1 f(n) = f(n-1) + 1/n for n>1, has the complexity O (log n) Let the size of the elements stored in an 8*3 matrix be 4 bytes each. If the base address ...
Sayani saha
Asked: February 24, 2021In: MAKAUT
a,f,b,k,h,m,e,s,r,c. (Order 3) a,g,f,b,k,d,h,m,j,e,s,I,r,x,c,l,n,t,u,p. ( Order 5 )
Sayani saha
Asked: February 24, 2021In: MAKAUT
a) 9 edges, 6 vertices b) 6 edges, 4 vertices c) 10 edges, 5 vertices d) 9 edges, 5 vertices.