UTAR CT aka Computer Engineering

Electronic Devices I by Dr. Aissa
===================================

T1- % marks of reports,quiz,midterm,assignment

T2- % marks of reports,quiz,midterm,assignment

T3- % marks of reports,quiz,midterm,assignment


Overall Course Work of ED I

===================================



Data Structure and Algorithms
===================================

Computer Engineering only

Entire DSA program coursework

===================================

All the Best ^^

Format soalan :

50 soalan pilihan aneka - 50 markah
Esei 3 soalan pilih 2 - 50 markah


Format Esei:

Soalan 1 adalah wajib - 25 markah

Pilih satu soalan daripada soalan 2/3


Pendahuluan - 3 markah
Isi - 20 markah
Kesimpulan - 2 markah



Isi
- sekurang-kurangnya 4 isi
- 1 isi , 1 pendapat , 1 contoh, 1 wajar/tak wajar


Pendahuluan
- Huraian, penerangan isu, teori agama
- asas pemikiran, asas pengasas


Kesimpulan
- Penilaian terakhir, jawab soalan esei



Lain-Lain
- 50 soalan aneka pilihan merangkumi semua bab.
- Nama pengasas amat penting
- Fungsi Teori amat penting

Chapter 1
Semiconductor Material
- Equation 1.1,1.7~1.11b,1.16,1.18
- Example 1.1/1.2/1.3

Chapter 1
Diode Circuits: DC analysis
- Page 30~33 Neaman's MicroElectronics

Chapter 3
Field Effect Transistors ( FET )
- Example 3.22 , page 184/185 Neaman's MicroElectronics
- Example 3.23

Chapter 4
Field Effect Transistors Amplifier ( FET Amp )
- Example 4.2

Chapter 5
Bipolar Junction Transistors ( BJT )
- Table 5.1
- Example 5.3

Chapter 6
Bipolar Junction Transistors Amplifier ( BJT Amp )
- Example 6.1

Chapter 9
Operational Amplifier ( Op-Amp )
-Section 9.3 Summing Amplifier

Chapter 11
Differential & Multistage Amplifier
- Section 11.2
- Example 11.1


Others
- Must remember those essential formulas

==== DATA STRUCTURE AND ALGORITHMS ====

1.
@ Recursion, Pointer, Linked List
- *Pointer's pointer in search linked list
- Fibonacci, Factorial

2.
@ Struct with Linked List combination
- Insert
- Update
- *Delete
- Search

3.
@ Binary Search Tree
- Consume 1 question
- *Operation of BST
- Insert
- *Draw the tree
- Know the Array looks like

4.
@ Sorting
- *All 5 types will come out
- *Know their complexity
- Know how they work
- *Big-O notation

5.
@ Searching
- *Hash Table and it's side dishes ( chain and etc )
- remember the concept
- Data will be given to draw/list out the chain table

6.
@ Stack, Queue & Graph
- *Depth First Search, given graph and perform DFS
- *Breath First Search, must understand the coding.


@ Others
- Definitions will not come out.
- More on analyst coding
- Understand The CONCEPT !!

QUESTION 1 :

Synchronous Sequential Circuit
-synthetic type
-Moore/Mealy ...FSM/ASM
*refer the hardest question in tutorial


QUESTION 2:

Synchronous Sequential Circuit
-reverse engineer type
-Moore/Mealy ...FSM/ASM
*refer the hardest question in tutorial


QUESTION 3:

Asynchronous Sequential Circuit
-arbiter, counter ...
*refer the hardest question in tutorial


QUESTION 4:

Test and Testability
-refer tutorial 4
*refer the hardest question in tutorial


QUESTION 5:

PROM, PAL, PLA , EEPROM, UVPROM
-refer tutorial 5 & 6
-mostly tutorial 6.
*refer the hardest question in tutorial


QUESTION 6:

CPLD & FPGA
-refer tutorial 7
*refer the hardest question in tutorial



GOOD LUCK AND ALL THE BEST IN FINAL!!

Time passes so fast...

coming to week 13 again ..

almost end of this semester d ..


===== Electronic Devices 1 =====

Assignment need to be hand up Tuesday
(7/4/09)

Friday :- QUIZ 3
chapter 5 and 6

===== Digital Circuits & Systems =====
Thursday :- MOCK TEST ....
2nd half of the test ..




===== Data Structure & Algorithms =====

Monday :- Due date of Assessment 4




Good luck and All the best !!