Filter By
Filter Reset
Semester
Class Notes (1,016,963)
AUS (34,890)
UTS (657)
Information Technology (48)

Class Notes for Information Technology at University of Technology Sydney

Exam Study Guides for Information Technology Courses

Covers all exam topics.

31268 Lecture Notes - Lecture 1: Openvms, Qnx, Graphical User Interface
Premium

Lecture: Web Systems What is the Web? A network. Tons of devices t...

Information Technology
31268
Chris Wong
31251 Lecture Notes - Lecture 4: Binary Logarithm

Divide and Conquer The general framework for a divideandconquer alg...

Information Technology
31251
Luke Mathieson
31251 Lecture Notes - Lecture 6: Dynamic Programming

Dynamic Programming Dynamic programming looks a lot like Div...

Information Technology
31251
Luke Mathieson
31251 Lecture Notes - Lecture 3: Big O Notation

the vector class Arrays in C/C++ are difficult. Lists provide a...

Information Technology
31251
Luke Mathieson
31251 Lecture Notes - Lecture 6: Binary Search Algorithm, Binary Tree

Binary Search Trees Binary Search Trees (BSTs) are a simpl...

Information Technology
31251
Luke Mathieson
31251 Lecture Notes - Lecture 7: Merge Sort, Quicksort, Sorting Algorithm

Sorting Bubble Sort bubbleSort(int a[]) { //assume ...

Information Technology
31251
Luke Mathieson
31251 Lecture 4: dsa-recursion

Recursion Recursion is conceptually a central component of D&C. ...

Information Technology
31251
Luke Mathieson
31251 Lecture Notes - Lecture 9: Shortest-Path Tree, Dynamic Programming, Prims

Dijkstras Algorithm The backbone algorithm for most sh...

Information Technology
31251
Luke Mathieson
31251 Lecture Notes - Lecture 8: Abstract Data Type, Associative Array, Quadratic Probing

Simple hash-maps (linear and quadratic probing, division hash funct...

Information Technology
31251
Luke Mathieson
31251 Lecture Notes - Lecture 5: Adjacency Matrix, Beaufort Scale, Compact Space

Graph and tree traversals Graphs as Mathematical Objects ...

Information Technology
31251
Luke Mathieson
31251 Lecture Notes - Lecture 1: Computational Problem

Whats an Algorithm? A well-defined computational process th...

Information Technology
31251
Luke Mathieson
31251 Lecture Notes - Lecture 5: Counting Sort, Ackermann Function, Radix Sort

Minimum Spanning Trees Spanning Trees A subgraph is a...

Information Technology
31251
Luke Mathieson
31251 Lecture Notes - Lecture 2: Memory Management, Memory Leak, Standard Streams

cin and cout They are in the iostream library in the C++ Standard...

Information Technology
31251
Luke Mathieson
31251 Lecture Notes - Lecture 1: Data Structure, In C

Data Structures Algorithms: Algorithm: A well defined computation ...

Information Technology
31251
Luke Mathieson
31284 Lecture Notes - Lecture 2: Javaserver Pages, Glassfish, Web Service

Web Services Development Week 1 JSP Introduction: Web Apps vs. Web...

Information Technology
31284
Min Xu

Log In


OR

Don't have an account?

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


OR

By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.


Submit