What are deterministic and non-deterministic algorithms? Explain greedy algorithm.
Marks: 5Chapter: Unit 11: Algorithms (5Hrs)
Chapter Study
BCA Semester 3 – Data Structure and Algorithms – Unit 11: Algorithms (5Hrs)
Comprehensive questions and detailed answers for Unit 11: Algorithms (5Hrs). Perfect for exam preparation and concept clarity.
5
Questions
25
Marks
What are deterministic and non-deterministic algorithms? Explain greedy algorithm.
MediumTHEORY5 marks2019(TU FOHSS Final)
Write the difference between serial and parallel algorithm with example.
MediumTHEORY5 marks2021(TU FOHSS Final)
What is minimax algorithm? Create Huffman Tree and calculate Huffman code for the following characters along with their frequencies using Huffman algorithm.
| Characters | A | E | I | O | U | S | T |
|---|---|---|---|---|---|---|---|
| Frequencies | 10 | 15 | 12 | 3 | 4 | 13 | 1 |
MediumTHEORY5 marks2022(TU FOHSS Final)
What is big-oh notation? Explain about divide and conquer strategy with example.
MediumTHEORY5 marks2023(TU FOHSS Final)
What are deterministic and non-deterministic algorithms? Explain the use of Big Oh notation to measure the complexity of an algorithm with an example.
MediumTHEORY5 marks2024(TU FOHSS Final)
Showing 5 questions
Sample Questions
Write the difference between serial and parallel algorithm with example.
Marks: 5Chapter: Unit 11: Algorithms (5Hrs)
What is minimax algorithm? Create Huffman Tree and calculate Huffman code for the following characters along with their frequencies using Huffman algorithm. | Characters | A | E | I | O | U | S |
Marks: 5Chapter: Unit 11: Algorithms (5Hrs)
What is big-oh notation? Explain about divide and conquer strategy with example.
Marks: 5Chapter: Unit 11: Algorithms (5Hrs)
What are deterministic and non-deterministic algorithms? Explain the use of Big Oh notation to measure the complexity of an algorithm with an example.
Marks: 5Chapter: Unit 11: Algorithms (5Hrs)