Computer Science
Algorithms, databases, programming and networks.
2 solved questions
- Implement deletion in a binary search tree
Deletion replaces a two-child node with its in-order successor. Average time is O(log n) and the worst case is O(n).
- Normalise a student enrolment table to 3NF
3NF removes repeating groups, partial and transitive dependencies. The result is separate Students, Modules, Tutors and Enrolments tables.