Writing
Help / Search |
Students'
Work on Note-taking |
||
Computer Architecture
On the computer architecture course, we have learnt the use of logic gates, Boolean Algebra and Map simplification. In the field of logic gates, we have studied on AND, NOT, OR, XOR and XAND gates. In Boolean Algebra, we have learnt General Axioms and Theorems, also De Morgan's Laws. For instance: x + x' = 1 and x * x = 0. Lastly, in map simplicfication, we have studied 2,3,4 variable map and don't care condition. E.g, injective and surjective mapping. On the Accounting Course , so far we have studied double entry systems ,
financial statements , accounting concepts , and we will study cost
accounting , accounting records , accounting ratios and analy In double entry systems , we have learnt aboutopening ledger accounts , i.e. debit and credit entries , nominal accounts and naming of accounts . In financial statements , we have learnt how to make a balance sheet , trading and profit and loss account and cash flow statement . In accounting concepts , we have studied what accrual and prepayment concept are
. In the future , we will learn the rest, which are cost accounting , accounting records
, accounting ratios and analysi In the subject Mathematics up to now we have studied Sequence, Limit, Differentiation and Integration. Sequence is a list of numbers n1, n2, n3, ... Limit can determine whether the point Differentiation is to find the slope at a particular point of a function. It also applies to trigonometric function (e.g. sin x, cos x). Implicit function means dx/dy = 1/ (dy/dx). We also use differentiation for curve sketching and change of rate. Integration is the reverse of the differentiation. We can use Integration to find the area and volume of the entity. On the Management Studies course, so far we have studied
Management Objectives, Management Roles, Management Functions, Management Skills and
Management Theories. |
........................... | Back to Top On the Computer Systems Architecture course so far we have studied Van Neumann Machines , Binary logic, Logic gates, Boolean Algebra and Expression simplification. In Van Neumann Machines, we studied what In Binary logic, we studied "True"&"False", "1"and "0", which is due to the "on "and "off" of a circuit in a computer e.g. Q in Q means question in question. In Logic gates, we studied six basic gates-----AND gate, XOR gate and Inverters. In Boolean Algebra, we studied some Laws; eg. Associative law, Distributive law, De Morgan. We also studied some
Axioms, Theorems and how to In Expression simplification, we studied how to use Axioms and Theorems to simplify some complicated expressions. |
If you have any suggestions or questions, please e-mail us at . Last updated on: Friday, December 14, 2001. |