User talk:08094002a

Computer science
{{db-user}

Computer science Task 1
programming (kevin hopkinson) _ section on programming

(my advice to you would be)

(a piece of advice that is to be takiin onwards in life)

Task 1 programming
Task 1. you are to program a computer and then run it as an operating systems and decide how many programs it will have and then name each app.

the following statement does not make any sense and was written in a program and this is what it says:

(my name is richard) my age is _ what is wrong with the program?

task 1 due in next thursday.

Thursdays lecture
simple program skills

hyperlinks -

operating science

History of computer science

Engrade - Task 1 worth 65% of final exam

A tree sort is a sort algorithm that builds a binary search tree from the keys to be sorted, and then traverses the tree (in-order) so that the keys come out in sorted order. Its typical use is when sorting the elements of a stream from a file. Several other sorts would have to load the elements to a temporary data structure, whereas in a tree sort the act of loading the input into a data structure is sorting it.

Friday Lectures
Lecture 1 comp 1927

data structures

papp

prac exam

Lecture 2

lopps and arrays

course schelude
Schedule Computing 2

Week Topic Textbook reference 1 Introduction, Linked lists Chapter 3 2 Abstract Data Types Chapter 4 3 Recursion and Trees Chapter 5 4 Work Complexity and Trees Chapter 5 5 Sorting Chapter 6.1 - 6.5, Chapter 7 & 8 6 Symbol Tables, Binary Search Trees Chapter 12 7 Balanced Trees Chapter 13 8 Binary Search Tables Chapter 13 9 Hash Tables, Graph Intro Chapter 14, Chapter 17 10 Graph Search Chapter 18 11 DAGs, Minimum Spanning Trees, Shortest Path Chapter 21 12 Revision

Programming - Task
(buffer write a progrram which includes 2 advantages and 2 disadvantages of loops and binary trees?

Administration task 1 due on tuesday by the lecture

mac and using windows

Course timetable
Monday 11:00-13:00 wednesday 2:00-3:00 Tutorial friday 2:00-3:00 Labs thursday 1:00-3:00

Loops and arrays
What is an array?

what is a loop?

sort the algorithum

2 4    19   23  45

Replace the algorithum with binary

2   4   19   23   45

Prac exam students - Start revising

September 2011
Hello, and welcome to Wikipedia. Although everyone is welcome to contribute to Wikipedia, at least one of your recent edits, such as the one you made to Wikipedia:New pages patrol/patrolled pages with this edit, did not appear to be constructive, and has been reverted or removed. Please use the sandbox for any test edits you would like to make, and read the welcome page to learn more about contributing constructively to this encyclopedia. Thank you.  Ron h jones (Talk) 22:39, 7 September 2011 (UTC)

Please refrain from making unconstructive edits to Wikipedia, as you did at Wikipedia:New pages patrol/patrolled pages with this edit. Your edits appear to constitute vandalism and have been reverted or removed. If you would like to experiment, please use the sandbox. Thank you. Calabe1992 (talk) 22:40, 7 September 2011 (UTC)


 * Please stop posting nonsense like the edits above to the new pages patrolled page. Calabe1992 (talk) 22:42, 7 September 2011 (UTC)

This is your only warning; if you vandalize Wikipedia again, you may be blocked from editing without further notice. Every one of your 22 edits since registering with  the Wikipedia on 7 September is either vandalism, complete nonsense, or abuse of Wikipedia's award system. Kudpung กุดผึ้ง (talk) 06:20, 8 September 2011 (UTC)