Cos2611 - Study guides, Class notes & Summaries

COS2611 Assignment 1 2024 memo

COS2611 Assignment 3 memo 2024 UNISA  2024  COS2611-24-Y  Assessment 3 QUIZ Question 1 Match the following operations on a Binary Search Tree (BST) with their correct descriptions: InsertionAdding a new node with a given value to the appropriate position in the BST while maintaining the BST properties. Inorder TraversalA process of visiting all nodes in a BST in ascending order of their values. DeletionRemoving a node with a specific value from the BST while ensuring that the tr...

COS2611 2023 assignment 2 solution with source code and link to the zipped files. Create a C++ program that will display a binary search tree: inorder traversal, preorder traversal, postorder traversal and height of the tree. The nodes of the binary search tree will be read into the code using a text file. Download from Additional Resources, the files for Assessment 2, Question 1. The file COS2611 AS2 BST S contains a skeleton framework for binary search trees (BST) and two test files. Notice ...

COS2611 Final Project 2024 solution Highway traffic flow analyser Final Practical Project - Mark contributes to the final examination mark. Study the scenario that will monitor and analyse traffic patterns to determine if the road can handle the volume or if it requires expansion Follow the instructions to develop, test and submit the project. Click on ADD SUBMISSION to see the details and activity instructions. Highway traffic flow analyser Scenario: Imagine a single-lane road in a sub...

COS2611 Assignment 2 memo 2024 all questions including code for question 16

COS2611 Assingment 4 marked memo 2024

COS2611 Assignment 2 2023 Complete code for both questions, Code + comments. Create a C++ program that will display a binary search tree: inorder traversal, preorder traversal, postorder traversal, and height of the tree. The nodes of the binary search tree will be read into the code using a text file.

COS2611 Assignment 2 Question 16 code: You are required to choose two sorting algorithms from a specified list the first algorithm must be Bubble Sort, while the second algorithm can be either Merge Sort or Heap Sort. a) Write a C++ program where you implement the two sorting algorithms you have chosen -ensure that they are part of the same program and can be called using methods, functions and/or procedures. b) Continue in this C++ program and generate random input arrays of different size...

QUESTIONS AND ANSWERS

This contains the attempted questions and got 100%. Everything is correct