Задания »

9, Авг 2009

На курсе COMP3004 у меня было персональное задание – сделать обзор книги Software Engineering до конца семестра, каждая глава отдельным файлом, с передачей основных идей и принципов. В конце каждой главы нужно выразить свое мнение о полученной информации.

Почитать главы можно в вики.

2, Авг 2009

1, Авг 2009

Midterm-экзамен по предмету COMP2805. Скачать.

28, Июль 2009

Одим из заданий курса Operating Systems было написать некое подобие публикации, основанной на настоящих публикациях разных информатиков и разработчиков. Я выбрал пару бумаг, посвященных структуре ядра и новым идеям. Мою работу можно почитать в вики.

7, Июнь 2009

(Задание 02 курса Assembly Language)

Write a stand-alone assembly language program that emulates in a very crude way a receiver for a data packet which is being transmitted in serial form across a transmission line. The packet contains a bit string which can be parsed and decoded. Your program reads a stream of “bits” in the transmission simulated by a stream of ASCII character ‘0’s and ‘1’s which you must read with the GetCh Macro or using INT 21H. The most significant bits come first so that for example the first 8 bits is 00000010 for the STX character, as indicated below The bits should first be reconstituted into bytes and treated according to the “COMP 2003 transmission protocol” (CTP ) defined as follows.

6, Июнь 2009

(Задание 02 курса Assembly Language)

The objective of this assignment is to write a C and assembly mixed-mode program which accepts a simulated bit pattern, which represent ASCII characters which are HEX digits. Thus the bit pattern 0011100101000001 would represent the ASCII codes for the HEX digits 9A. You are to discard invalid HEX digits. The assignment is to be done as outlined below. The C main function inputs a relatively small integer “n”. The variable “n” is the number of characters to be read and should be small. It then passes by value the parameter “n” , and a pointer to an array “string” to an assembly language procedure. Upon the return from the procedure the main C function outputs the string in the array “string”.

6, Июнь 2009

(Задание 01 курса Assembly Language)

Part I. An Exploration. Not to be handed in.

a) Write a short program that consists of variations of the mov instruction using the different modes

For example:

label1: mov AX,BX
label2: mov BX,AX
label3: mov AX, 5
label4: mov AX,127
label5: mov AX, item
label6: mov item,AX


29, Май 2009

Задание 03 курса ADT and Algorithm
Question 1: Binary Tree Node

>The goal of this question is to implement binary tree nodes which will then be used for implementing a generic binary tree which, in turn, will be used to implement heaps and binary search trees. As you know, heaps and binary search trees are defined for objects with associated keys that are comparable to each other. For these keys, we will use comparable objects. For testing purposes, keys will be instances of the class MyInteger.
29, Май 2009

Задание 02 курса ADT and Algorithms

Question 1


Consider a “RedBlueStack” which behaves like a normal stack, except for the fact that items inserted into the stack can be labelled as either “red” or “blue” and that there are two pop operations which return the most recently inserted “red” or “blue” item, respectively. A “RedBlueStack” should provide the following methods:

Test if the stack is logically empty.

Make the stack logically empty.

29, Май 2009

Задание 01 курса ADT and Algorithms

Question 1
20 marks (10 each)