Fundamentals of Algorithms (CS502)

1. Chain matrix multiplication problem can be solved through ________ strategy.

   1. Dynamic programming
   2. Greedy
   3. Divide and conquer
   4. Sorting

2. Counting sort assumes that the numbers to be sorted are in the range ________.

   1. k to n where n is large
   2. 1 to k where k is small
   3. k to n where k is small
   4. k to n where n is small

3. In Dynamic Programming approach, we do not store the solution to each sub-problem in case if it reappears.

   1. True
   2. False

4. In Dynamic Programming, our approach is to ________.

   1. Develop the solution in a top-down fashion
   2. Express the problem non-recursively
   3. Build the solution in a bottom-up fashion
   4. Input several sub-problems simultaneously

5. Heap sort is a/an ________ and ________ sorting algorithm.

   1. Not in-place, not stable one
   2. In-place, stable one
   3. In-place, not stable one
   4. Not in-place, stable one

6. If there are Θ (n²) entries in edit distance matrix then each entry E (i, j) takes ________ time to compute.

   1. Θ (n)
   2. Θ (n²)
   3. Θ (1)
   4. Θ (n log n)

7. Radix sort is not a non-comparative integer sorting algorithm.

   1. True
   2. False

8. Dynamic Programming is a problem-solving approach in which ________.

   1. Problem is solved in Zero time
   2. Solution is developed only at final stage
   3. Both are correct
   4. Both are incorrect

9. Consider three matrices X, Y, Z of dimensions 1 × 2, 2 × 3, 3 × 4 respectively. The number of multiplications of X(YZ) is:

   1. 16
   2. 23
   3. 26
   4. 32

10. We can use the optimal substructure property to devise a ________ formulation of the edit distance problem.

    1. Selective
    2. Optimum
    3. Iterative
    4. Recursive

Select a course code for Objective Questions:

ACC311 ACC501 BIF101 BIF401 BIF501 BIO101 BIO201 BIO202 BIO203 BIO204 BIO301 BIO302 BIO303 BIO401 BIO503 BNK603 BT101 BT201 BT301 BT302 BT401 BT402 BT403 BT404 BT405 BT406 BT501 BT504 BT505 BT604 CHE201 CHE301 CS001 CS101 CS201 CS202 CS204 CS301 CS302 CS304 CS311 CS401 CS402 CS403 CS408 CS501 CS502 CS504 CS506 CS508 CS601 CS602 CS604 CS605 CS607 CS609 CS610 CS614 CS707 CS710 ECO401 ECO402 ECO403 ECO404 EDU302 EDU401 EDU402 EDU501 EDU601 ENG101 ENG201 ENG301 ENG501 FIN611 FIN624 FIN625 ISL201 IT430 MCM101 MCM301 MGMT623 MGT101 MGT211 MGT301 MGT401 MGT402 MGT501 MGT502 MGT503 MGT510 MGT601 MGT603 MKT501 MKT610 MKT630 MTH101 MTH202 MTH302 MTH501 MTH601 MTH634 PAK301 PHY101 PHY301 PSY101 PSY403 PSY502 PSY512 SOC101 SOC301 SOC401 STA301 STA630 STA641 ZOO102 ZOO401 ZOO501 ZOO502 ZOO503 ZOO504 ZOO505 ZOO506 ZOO510 ZOO630

Select a course code for Subjective Questions:

ACC311 CS001 CS101 CS201 CS301 CS607 CS701 CS702 CS703 CS704 CS707 CS708 CS710 CS711 CS718 CS721 CS724 ECO401 ECO403 ENG101 ENG301 MGT703 MTH501 STA301