Midterm Questions
OliverPope23These questions are Based on:
A C++ Prime
Object-Oriented Design Array
Analysis Tools Stacks
Queues
Deques
List
Iterator ADTs
Trees
Q1: Suppose you are given a flow network N and a maximum flow f for N. Suppose d, a positive integer, is added to the capacity of one edge of N.
1. Give an efficient algorithm to compute a maximum flow for the new network.
2. What is the worst-case time complexity of your algorithm?
______________________________________________________________________________
Q2. In a heap, the heights of the left and right subtrees of a node differ by atmost 1.
2. The best-case running time of Bubble Sort is O(n).
3. The best-case running time of Merge Sort is O(n).
4. The worst-case complexity of Quick Sort is O(n2).
5. The worst-case complexity of AVL Tree insertion is O(n)
- 3 years ago
- 10
- FIN 419 Week 4 - DQ 1 and DQ 2
- CMGT 442 Entire course Week 1-5 GRADE A++ 100%
- ACC 281 Week 1-5 Complete GRADE A++ 100%.
- for expert_researcher
- VCT 236 Week 5 DQ 1 and DQ 2
- VCT 236 Week 4 DQ 1 and DQ 2
- HCA 305 Week 2 Discussion Question 1 and Discussion Question 2 3#
- CJA 490 Week 2 Individual Assignment Law Enforcement
- BSA 376 Week 5 Learning Team SDLC Final Project Presentation
- Web 240 Week 3 Learning Team C Assignment Website Evaluation