Subjects under University of New South Wales
Document Details

Notes for Higher Computing 2 - Data Structures and Algorithms

User Description:
Got a Distinction by using these notes for the final exam. Covers graphs, algorithms and sorting among others.

Thinkswap Satisfaction Guarantee

Each document purchased on Thinkswap is covered by our Satisfaction Guarantee policy. If you are not satisfied with the quality of any document, or you believe the document was incorrectly described or categorised, Thinkswap will provide a full refund of exchange credits so you can check out another document. For more information please click here.

This student studied:
Claim a Thinkswap Bounty

Do you know if the Subject listed above has changed recently? Click report to earn free Exchange Credits!

Document Information:
36 Pages Complete Study Notes > 2 Years old* Previously uploaded under: COMP1927 - Computing 2
Share

5 Ex Credits


Document Screenshots:
Topics this document covers:
Sorting algorithms GNU Debugger Quicksort Merge sort Abstract data type Sort Adaptive sort Radix sort Algorithmic efficiency Selection sort Algorithm Pointer Insertion sort Bucket sort Heapsort Recursion
This is a Complete Set of Study Notes

Complete Study Notes typically cover at least half a semester’s content or several topics in greater depth. They are typically greater than 20 pages in length and go into more detail when covering topics.

What are Exchange Credits:

Exchange Credits represent the worth of each document on Thinkswap. In exchange for uploading documents you will receive credits. These can then be used to checkout other documents on Thinkswap.

Topics this document covers:
Sorting algorithms GNU Debugger Quicksort Merge sort Abstract data type Sort Adaptive sort Radix sort Algorithmic efficiency Selection sort Algorithm Pointer Insertion sort Bucket sort Heapsort Recursion
Sample Text:
1 Analysis of Software . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 4.2 Program Effectiveness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 4.3 Algorithm Efficiency . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 4.4 Algorithm Complexity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 5 Abstract Data Types 12 5.1 ADT Interfaces vs. ADT Implementations . . . . . . . . . . . . . . . . . . . 12 5.2 Collections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 6 Extra from Labs 15 6.1 Piping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 II Sets & Sorting 16 1 Sets 16 1.1 Book-Keeping Operations . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 1.2 Assignment Operations . . . ...
Similar Documents to Notes for Higher Computing 2 - Data Structures and Algorithms

Engineering Programming 100 - Study Notes

This student studied:
Curtin University of Technology - COMP1004 - Engineering Programming

This document contains study notes for EM100 with some examples shown within the lectures and tutorials. Topics covered within this document include: - C Programming Fundamentals - Control Flow - Looping Structure - Array, Matrix and Data Structure - Functions - File Input and Output

5 Ex Credits

View Details

Comprehensive Notes for FIT1008 2017 S2

This student studied:
Monash University - FIT1008 - Introduction to Computer Science

This set of notes covers completely all of the materials of FIT1008 in a compact and easier to understand form, however it is not simply a memorisation tool. This set of notes also includes the fundamental understandings of everything in this unit so that memorisation is not needed, once you understand everything in these notes they will stick with you.

5 Ex Credits

View Details

Comp1917 Notes

This student studied:
University of New South Wales - COMP1711 - Higher Computing 1A

Notes for higher computing

5 Ex Credits

View Details

Comprehensive Notes on INFS1609

This student studied:
University of New South Wales - INFS1609 - Fundamentals of Business Programming

This is a full set of notes providing you with the theory behind object oriented programming, however you must still do the exercises to fully understand programming in both a theoretical and practical sense

5 Ex Credits

View Details