Posted on February 9, 2010 by Shaun
Fixed and Variable Costs
You’ll remember from the previous post that there’s more than one way to define cost. The methods were:
- Differential future cash flows (DFC)
- Cost behaviour in relation to output
- Assignment to cost object
- Financial statement perspective
- Business function
The previous post focused on DFC, and this post is about cost behaviour in relation to output. What’s that in english? We’re on about fixed and variable costs.
Read more »
Filed under: Business, Management Accounting, Year 2 | Tagged: Accounting, Business, costs, Fixed, Management, Variable, Year 2 | 1 Comment »
Posted on February 9, 2010 by Shaun
Traversals
What is a traversal? It’s when you visit every node of a tree or graph using the edges.
Tree traversal
Let’s talk about 3 methods of traversing trees (Note: Always start at the root)
- Depth-First-Search: Visit all the descendants of a node before visiting the sibling nodes. You have to visit some nodes more than once in a DFS, this is called backtracking
- Breadth-First-Search: Visit all children of a node before visiting sibling nodes
- Priority Search: Nodes are given priorities, and the children of the node that haven’t been visited yet with the highest priority are visited first
So let’s try these on a tree. Here’s one I made earlier: Read more »
Filed under: Algorithms, Computer Science, Year 2 | Tagged: Algorithms, COMP20010, graphs, traversals, Trees, Year 2 | Leave a Comment »
Posted on February 9, 2010 by Shaun
More Graphs (yay)
Note: This is a direct follow on (or a sequel if you want) to this post, so you might want to read that first!
Representing graphs
So you’ve seen what graphs are and how they can be classified. But how do you represent them in code? For example, do we put them in an array, a vector or a linked list? There isn’t one definite answer, so let’s go through some of the methods of representing them. Read more »
Filed under: Algorithms, Computer Science, Year 2 | Tagged: Algorithms, COMP20010, graphs, Year 2 | Leave a Comment »
Posted on February 8, 2010 by Badgerati
A Post For All Our Boredom
Proxies and Caches:
Read more »
Filed under: CSS Funnies | Tagged: CSS Funnies | Leave a Comment »
Posted on February 5, 2010 by Shaun
Relevant Costs
Right, onto the proper lecture material!
Basically there isn’t a single way to define cost, which is quite inconvenient for us. What you’re going to use the cost to figure out should tell you how to calculate it however. Read more »
Filed under: Business, Management Accounting, Year 2 | Tagged: Accounting, BMAN10621, Business, Management, Year 2 | 1 Comment »
Posted on February 5, 2010 by Shaun
Management Accounting – An Introduction
Like most of the intro lectures, this is going to be quite brief, the real ‘meat’ is in the next lectures!
What is accounting?
Seems like an easy question…but it’s something you need to learn! My answer at first was “erm it’s you know money and stuff and balance sheets”. This is not a model answer! Read more »
Filed under: Business, Management Accounting, Year 2 | Tagged: BMAN10632, Management Accounting, Year 2 | Leave a Comment »
Posted on February 4, 2010 by James Bedford
Hey guys,
Here’s a video that may come in useful when developing GUIs for Java application using NetBean’s interface builder. Read more »
Filed under: Software Engineering | Tagged: GUI, NetBeans, Tab View, User Interface | Leave a Comment »
Posted on February 4, 2010 by David Buckley
Symbolic AI is very different from other Artificial Intelligence courses, as it attempts to solve the problem of how to get computers to validate a statement given a load of facts. We humans do it all the time:
That car is indicating.
Cars which indicate turn.
From this we’re able to deduce that the car is going to turn. Getting computers to interpret these statements of fact and validate statements would be incredibly useful. Read more »
Filed under: Computer Science, Symbolic AI, Year 2 | Tagged: COMP20442, Introduction, Symbolic AI, Year 2 | Leave a Comment »
Posted on February 3, 2010 by nidazh
Why would you even want to use 100’s or even 1000’s of computers? What would you do with such a large number of networked computers?
Well the simplest answer is that there are many applications that we utilize which require good response time, such as Search engines, and File sharing. By increasing the number of computers working in parallel we can actually increase the execution time, giving users faster responses to resource queries.
- Parallel computing – utilizing multiple CPU’s within a single computer
- Distributed Computing – utilizing several computers connected through a network
Read more »
Filed under: Distributed Computing, Year 2 | Tagged: COMP20032, Distributed Computing, Year 2 | Leave a Comment »
Posted on February 2, 2010 by nidazh
Okay sooo distributed systems are spread out over vast distances. Due to this attribute there are many issues and challenges surrounding such distributed systems some of which are discussed below! Enjoy!
Challenge No.1 - Heterogeneity
Heterogeneity - “Describes a system consisting of multiple distinct components”
Read more »
Filed under: Distributed Computing, Year 2 | Tagged: COMP20032, Distributed Computing, Year 2 | Leave a Comment »