Question

pls write correct answers asap....

Note- You are athempting question 9 out of 10 Match the following: 1) Quick Sort A) Divide and conquer programming 2) Task Scheduling B) Greedy programming 3) Merge Sort C) Dynamic programming 4) Prim's D) Not stable a) 1-B2-A 3-C4-D b) 1-D 2-C3-A 4-B c) 1-D 2-C 3-B 4-A d) 1-C 2-D 3-A 4-B Ansre Note - You are attermpring qpestion out of 10 Odd man out: e Topological sort Algorithm DFS Algorithm Binary search Algorithm BFS Algorithm Prim's Algorithm a) Binary search Algorithm b) BFS Algorithm c) Prim's Algorithm d) Topological sort Algorithm Answer Consider the graph adjacency matrix How many paths are there from vertex I to vertex S of length either I edge or 2 edges or 3 edges or 4 edges? a) 2 b)3 c) 4 d) 5 Aswer Consider the following arithmetic operations in C int X-20 int Y-20; int Z-2*(X+Y which assembly code(0x86) does not evaluate value for Z correctly? a) mov ebx.Υ add eax,ebx mov cl,2 imul cl mov Z.eax mov eax.x b) mov ebx Y add eax,ebsx mov cl.4 imul cl shr eax 1 mov Z,eas c) mov eax,X mov ebx Y shl eax,2 shl eax 2 add eax.ebx mov eax. X mov ebx Y add eax.ebx shl eax.I mox Z.eax

Answer 1

O NO七Stable. Dynamic Pro2 rommr Divide and con2ueL in 2- Only Path Int mov