SULIT

UNlVERSITI MALAYSIA PERLIS

Peperiksaan Akhir Semester Pertama
Sidang Akademik 2016/2017

Disember 2016 1 Januari 2017

EKT 335 - PriDciples of Computer Network

[PriDsip-PriDsip Rangkaian Komputer]
Masa: 3jam

Please make sure that this question paper has TWELVE (12) printed pages including this
front page before you start the examination.
[Si/a pastilcan kertas soalan ini mengandungi DUA BELAS (12) mulca surat yang bercetak termasuk mulca
hadapan sebelum anda memulalcan peperiksaan ini.}

This question paper has SIX (6) questions. Answer only FIVE (5) questions.
[Kertas soalan ini mengandungi ENAM (6) soalan. Jawab hanya LIMA (5) soa/an sahaja.]

Section A: This section has FOUR (4) questions. Answer ALL questions. (80 marks)
[Bahagian A : Bahagian ini ada EMPAT (4) soo/an. Jawab SEMUA soa/an. (80 markah)

Section B : Answer any ONE (1) question. (20 marks)

[Bahagian B : Jawab mana - mana SA TU (1) soalan. (20 marlcah)]

SULIT

Dicetak oleh Unit Peperiksaan dan Pengijazahan. Bahagian Pengurusan Akademi/c, Jabatan Pendaftar
 SULIT
(EKT 335)
-2-

Section A (80 marks)

IBahagian A (80 markah)]

This section has FOUR (4) questions. Answer ALL questions.

[Bahagian ini mempunyai EMPAT (4) soalan. Jawab SEMUA soalan.]

Question I
/Soala" I}

(C4, COl, P04)

(a) Packet switching and circuit switching are two networking methods for transferring
data between two nodes or hosts. Differentiate between packet switching and circuit
switching and deduce which one is more efficient when you have large amount of
data to transmit and these packets can tolerate some loss and delay.
[Pensuisan paket dan pensuisan litar adalah duo kaedah rangkaian un/uk memindahkan data antara
duo nod atau hos. Bezakan aniara pensuisan poket dan pensuisan litar dan simpulkan mana satu yang
lebih berkesan apabila anda mempunyai jumlah data yang besar untuk dihantar dan data-data ini
bo/eh berto/ak ansur beberapa kerugian dan lunda.}

(4 Marks/Markah)

(C4, COl, P04)

(b) Consider a packet of length L which begins at end system A and travels over 4
links to a destination end system. Let d t , St and Ri denote the distance, propagation
speed, and transmission rate of link i, for i = 1,2,3,4. The packet switch delays each
packet by d proc •
[Pertimbangkan satu pakel dengan panjang L yang bermu/a pada sistem akhir dan bergerak melalui
4 poulan kepada sistem destinasi akhir. Andaikan d t I SI dan R t adalah jarak, kelajuan perambatan,
dan kadar penghantaran unluk poulan i, i = 1,2,3,4. Suis poket melengahkan setiap paket oleh d proc}
(i) Calculate the number of switches needed for this network.
[Kira bilangan suis yang diperlukan untuk rangkaian ini.}
(2 MarksiMarkah)

(ii) Assuming no queuing delays, in terms of d i, Si and Rt and L , calculate

the total end-to-end delay for the packet.
[Dengan mengandaikan tiada kelewatan beratur, dari segi d t I SI dan R 1, kira jumlah
kelewatan akhir-ke-akhir untuk paket ini.}
(4 MarkslMarkah)

... 3/12

SULIT

Dicetak oleh Unit Peperiksaan dan Pengijazahan, Bahagian Pengwusan Akademik, Jahatan Pendaftar
 SULIT
(EKT 335)
-3-
(iii) Suppose now the packet is 1,500 bytes, the propagation speed on all four
links is 2.5 x 108 mis, the transmission rates of all links is 2 Mbps, the
packet switch processing delay is 3 msec, the length of the first link is
5,000 km, second link is 4,000 km, third link is 2,000 km and the last
link is 3,000 km, calculate the value for end-to-end delay.
[Katakan sekarang paket adalah 1500 bytes, kelajuan perambatan pacia semua empat
pautan adalah 2.5 x 108 m/s, kadar penghantaran semua pautan adalah 2 Mbps,
kelewatan pemprosesan suis paket 3 msec, panjang pautan perlama adalah 5,000 lan,
pautan kedua ialah 4,000 kin, pautan ketiga ialah 2,000 kin dan pautan terakhir ialah
3,000 lan, hitung nilai kelewatan hujung-ke-akhir.}
(4 MarksiMarkah)

(C5, COl, P04)

(c) Consider an application layer entity need to transmit an L-byte message to its peer
process, using a legacy TCP connection. The TCP segment comprises of the message
added with overhead of 16 bytes. The segment is encapsulated into an IP packet that
has an extra 20 bytes of header. The IP packet in turn goes inside an Ethernet frame
that has 18 bytes of header and trailer. Evaluate the percentage of transmitted bits in
the physical layer corresponds to message information if L = 200 bytes and 1300
bytes?
[Pertimbangkan satu entiti lapisan pengguna perlu untuk menghantar mesej L- bait kepada proses
peer, menggunakan perhubungan sediada TCP. Segmen TCP ada/ah terdiri daripada mesej dengan
penambahan overhead 10 bait. Segmen in; dikapsulkan dalam satu paket IP yang mempunyai
tambahan 20 bait di header. Paket IP pula seterusnya berada dalam rangka Ethernet yang
memprmyai 18 bait kepala dan penghujung. Nilaikan peratusan bit yang dihantar dalam lapisan
./izikal sepadan dengan makJumat mesej jika L = 200 bait dan 1300 bait?}

(6 MarksiMarkah)

SULIT

Dicetak oleh Unit Peperiksaan dan Pengijazahan, Bahagian Pengurusan Akademi/c, Jabatan Pendaftar
 SULIT
(EKT33S)
-4-
Question 2
{SoaJan2j

(C2, COl, P04)

(a) POP3 and lMAP are two different protocols used to access mail. Of the two, IMAP
is the better option (recommended). Describe the primary advantages of IMAP over
POP3.
fPOP3 dan lMAP adalah dua protokol yang berlainan digunakan untuk mengakses mel. Daripada
dua ini, lMAP adalah pilihan yang lebih baik (disyorkan). Terangkan kelebihan utama lMAP
berbanding POP3.j

(3 MarkslMarkah)

(C5, COl, P04)

(b) In a BitTorrent, suppose a user Alice has a subset of chunks. Periodically, Alice will
ask each of her neighbouring peers for the lists of the chunks they have. If Alice has
L different neighbours, she will obtain L lists of chunks. With this information, Alice
will know which chunks her neighbour have. Now, Alice will have an important
decision to make in order to request her next chunk. Suggest and explain the
technique on how would Alice determine which chunk should she request fIrst from
her neighbours.
fDa/am BitTorrent, katakan seorang pengguna Alice mempunyai subset ketulan. Dari semasa Ice
semasa, Alice alean bertanya ralcan-ralcan jiran beliau untuk senarai ketulan yang merelea ada. Jika
Alice mempunyai jiran L yang berbeza, dia akan mendapatlean senarai ketulan L. Dengan mak1umat
ini, Alice akan tahu yang mana lcetulan jirannya ada. Sekarang, Alice perlu membuat keputusan
penting untuk meminta sebahag;an berikutnya. Cadang dan terangkan teknik bagaimana Alice akan
menentulean sebahag;an dia harus meminta pertama dari negara-negarajiran.]

(4 MarksiMarleah)

(CS, COl, P04)

(c) Consider distributing a fIle of F = 15 Gbits to N peers. The server has an upload
=
rate of Us 30Mbps. Each peer has a download rate of d t = 2 Mbps and an upload
=
rate of u. For N = 10, 100 and 1000 and u 300 Kbps, 700 Kbps and 2 Mbps,
evaluate the minimum distribution time for each of the combinations of Nand u for
both client-server and P2P distribution.
fPertimbangkan mengedarlean fail F = 15 Gbits kepada N ralean-rakan. Pelayan mempunyai kadar
=
muat naik Us 30Mbps. Setiap ralean sebaya mempunyai kadar muat turun daripada d t = 2 Mbps
dan leadar muat naik u. Untuk N = 10, 100 dan 1000 dan u = 300 Kbps, 700 Kbps dan 2 Mbps,
nilaikan masa pengagihan minimum bag; setiap kombinasi N dan u untuk kedua-dua pelanggan-
pelayan dan pengedaran P2P.j
(13 MarkslMarkah)

SULIT

Dicetak oleh Unit Peperiksaan dan Pengijozahan, Bahagian Pengurusan Akademi/c, Jabatan Pendaftar
 SULIT
(EKT 335)
-5-
Question 3
{Soa/an3j

(C5, C02, P02, POll)

(a) Consider a reliable data transfer that uses only negative acknowledgements. Suppose
the sender sends data infrequently.
[Pertimbanglean pemindahan data yang boleh dipercayai yang hanya menggunalcan perakuan negatiJ.
Katalcan penghantar menghantar data secarajarang.}

(i) Would a NAK-only protocol be preferable to a protocol that uses ACKs?

Justify your answer.
[Adalcah NAK-sahaja protoleol adalah lebih baik untuk protoleol yang menggunakan
ACKs? Jelasleanjawapan anda.}
(3 MarkslMarlcah)

(ii) Now suppose a sender has a lot of data to send and the end-to-end
connection experiences few losses. In this latter case, would a NAK-only
protocol be preferable to a protocol that uses ACKs? Justify your
answer.
[Sekarang andailean penghantar mempunyai banyak data untuk menghantar dan
sambungan hujung-lre-akhir mengalami beberapa lrehilangan. Dalam Ires lredua ini,
alean NAK-sahaja protoleol menjadi lebih baik untuk protoleol yang menggunalcan
ACKs? Jelasleanjawapan anda.}
(2 MarkslMarleah)

(C4, C02, P02, POll)

(b) UDP and TCP uses l's complement for their checksum. Suppose you have the
following three 16-bit bytes: 00100011 01001110, 01001110 11010101, 01010100
01010101.
[UDP dan TCP menggunakan pelengkap 1 untuk checksum merelea. Katakan anda mempunyai yang
tiga bait 16-bi yang berikut: 00100011 01001110, 0100110 11010101, 01010100 0101O1O1}

(i) Calculate the 1's complement of the sum of these 16-bit bytes.
[Kiralean pelengleap 1 daripada jumlah 16-bit bait ini.}
(3 Marks!Marleah)

(ii) Suppose the receiver receives the following checksum:

1000001001111000. Detect if there is any errors in this transmission.
[Andailean penerima menerima checksum berikut: 1000001001111000. Kesanlcan jika
terdapat apa-apa kesi/apan dalam penghantaran ini.}
[2 Marks!Markah]
... 6/12

SULIT

Dicetak oleh Unit Peperiksaan dan Pengijazahan, Bahagian Pengurusan Alazdemi/c, Jabatan Pendaftar
 SULIT
(EKT 335)

(CS, C02, P02, POll)

(c) Consider that only a single TCP (Reno) connection uses one ISMbps link which
does not buffer any data. Suppose that this link is the only congested link between
the sending and receiving hosts. Assume that the TCP sender has a huge file to send
to the receiver, and the receiver's buffer is much larger than the congestion window.
We also make the following assumptions: each TCP segment size is 1200 bytes: the
two-way propagation delay of this connection is 160 msec; and this TCP connection
is always in congestion avoidance phase, that is, ignore slow start.
{Pertimbangkan bahawa hanya sambungan rep tunggal ( Reno) menggunakan satu J 5Mbps paulan
yang tidale menyimpan apa-apa data. Katakan paulan ini sahajalah pautan sesak antara penghantar
dan penerima. Andaikan Pengguna rep mempunyai fail yang besar untuk dihantar ~pada penerima,
dan penyimpan penerima adaJah lebih besar daripada tetingkap ~sesakan. Kami juga membuat
andaian berikut: saiz setiap segmen rep ialah J 200 bait: masa penghantaran dua-hala ada/ah 160
msec ; dan sambungan TCP ini sentiasa dalam fasa menge/akkan ~sesakan, iaitu, mengabaikan
permu/aan perlahan.}

(i) Evaluate the maximum window size (in segments) that this TCP
connection can achieve.
[Nilailcan saiz maksimum tetingkap ( dalam segmen ) yang sambungan rep ini bo/eh
mencapai.]

(3 Marks/Markah)

(ii) Calculate the average window size (in segments) and average throughput
(in bps) of this TCP connection.
{Kirakan saiz purata tetingkap ( dalam segmen) dan purata perolehan (dalam bps)
untuk sambungan rep ini.]

(4 Marks!Markah)

(iii) Rate how long would it take for this TCP connection to reach its
maximum window again after recovering from a packet loss.
{Kirakan berapa lama ia akan mengambil masa untuk sambungan TCP ini untuk
mencapai teting/cap maksimum lagi se/epas pulih daripada ~rugian paket.]

(3 Marks/Markah)

SULIT

Dicetak oleh Unit Peperiksaan dan Pengijazahan. Bahagian Pengurusan Akademi/c, Jabatan Pendaftar
 SULIT
(EKT 335)
-7-
Question 4
{Soa/an 4J

(C6, C03, POll)

(a) Consider a router that interconnects three subnets: Subnet 1, Subnet 2 and Subnet 3.
Suppose all of the interfaces in each of these three subnets are required to have prefix
223.1.17/24. Also suppose that subnet 1 is required to support up to 62 interfaces,
Subnet 2 is to support up to 106 interfaces and Subnet 3 is to support up to 15
interfaces. Construct three network addresses (of the form a.b.c.d/x) that satisfY
these constraints.
[Pertimbangkan satu router yang menghubungkan tiga subnet: Subnet 1, Subnet 2 dan Subnet 3.
Katakan semua antara-muka dalam ketiga-tiga sub net perlu mempunyai awalan 223.1.17124. Juga
anggapkan bahawa Subnet 1 diperlukan untuk menyokong sehingga 62 muka, Sub net 2 adalah untuk
menyokong sehingga 106 antar- muka dan Subnet 3 adalah untuk menyokong sehingga 15 muka. Bina
tiga alamat rangkaian (daripada bentuk a.b.c. d 1x) yang memenuhi kekangan ini.]
(5 MarkslMarkah)

(C6, C03, POll)

(b) Consider the following network in Figure 1. With the indicated link costs, use
Djikstra's shortest-path algorithm to compute the shortest path from t to all network
nodes.
[Pertimbangkan rangkaian dalam Rajah 1 berikut. Dengan kos pautan yang ditunjukkan, gunakan
algoritma singkat-jalan Djikstra untuk mengira laluan terpendek dari t kepada semua nod
rangkaian.]
(5 MarkslMarkah)

Figure 1
[Rajah 1]
... 8112

SlJLIT

Dicetak oleh Unit Peperiksaan dan Pengijazahan, Bahagian Pengurusan Akademik, Jabatan Pendaftar
 SULIT
(EKT 335)
-8-

(C6, C03, POll)

(c) Consider the following Internet Service Provider network in Figure 2.
[Pertimbangkan rangkaian penyedia per/chidmatan internet berikut seperti di dalam Rajah 2.J

Figure 2
[Rajah 2]

Construct the shortest-paths from source node A to all other nodes using
Bellman-Ford algorithm.
[Bina laluan yang singkat dari sumber nod A Ire semua nod lain menggunakan aigoritma Bellman-
FordJ
(10 MarksiMarkah)

SULIT

Dicetak oleh Unit Peperiksaan dan Pengijazahan, Bahagian PengulUSan Akademi/c, Jabatan Pend4ftar
 SULIT
(EKT 335)

Section B (20 marks)

[Bahagian B (20 mlll'kah))

This section has TWO (2) questions. Answer only ONE (1) question.
[Bahagian ini mempunyai DUA (2) soa/an. Jawab hanya SATU (1) soalan.]

Question 5
/Soakln 5/

(C5, C03, P02, POll)

(a) In a reliable data transfer, ACKINAK is used to acknowledge a
successful/unsuccessful data transmission. Suggest a possible solution to handle the
situation when the ACKlNAKs is corrupted during the transmission.
fDalam pemindahan data yang bo/eh dipercayai, ACKINAK digunalran untuk mengakui
penghantaran data yang berjaya/tidak berjaya. Cadangkan satu cara penye/esaian untuk menangani
keadaan apabila ACK /NAKs rosak semasa penghantaran.]
(3 Marks/Marlrah)

(C5, C03, P02, POll)

(b) Consider the GBN protocol with a sender window size of 4 and a sequence number
range of 1024. Suppose that at time t, the next in-order packet that the receiver is
expecting has a sequence number of k. Assume that the system does not reorder
messages.
fPertimbangkan protokol GBN dengan saiz teting/cap penghantar 4 dan nombor urutan dalam
linkungan 1024. Katalran pada masa t, paket dalam susunan seterusnya yang penerima menjangkakan
mempunyai beberapa urutan Ie. Anggapkan bahawa sistem ini lidak menyusun semula mesej.}

(i) Predict the possible sets of sequence numbers inside the sender's
window at time t? Justify your answer.
[Ramallran set kemungkinan nomhor urutan di da/am teting/cap penghantar pada masa
t? Jelaslranjawapan anda.]
(3 Marks/Markah)

(ii) Estimate all possible values of the ACK field in all possible messages
currently propagating back to the sender at time t. Justify your answer.
[Anggarkan semua kemungkinan nilai dalam medan ACK da/am semua mesej yang
mungkin kini menyebarkan kepada penghantar pada masa t. Jelaskan jawapan anda.]
(2 Marks/Marlrah)

... 10/12

SULIT

Dicetak oleh Unit Peperiksaan dan Pengijazahan. Bahagian Pengurusan Akademik, Jabatan Pendaftar
 SULIT
(EKT 335)
-10-
(C6, C03, P02, POll)
(c) Computer X and Y are communicating over a TCP connection. All bytes up through
byte 112 received to Computer Y from Computer X. Suppose Computer X then sends
loopback two segments to Computer Y. Subsequently, first and second segments
contain 40 and 20 bytes of data, respectively. In the first segments, the sequence
number is 113, the source port number is 443 and the destination port number is 80.
Computer Y transmits an acknowledgement whenever it receives a segment from
ComputerX.
[Komputer X dan Y berkomunilu:zsi melalui sambungan TCP. Semua byte menerusi bait 112 diterirna
kepada /computer Y dari Komputer X Katakan kemudiannya Komputer X menghantar loopback duo
segmen kepada Komputer Y. Seterusnya, masing-masing segmen pertama dan kedua mengandungi 40
dan 20 bait data. Dalam segmen pertama, nombor urutan adalah 113, nombor port sumber adalah
443 dan nombor port destinasi ialah 80. Komputer Y menghantar peralcuan apabila ia menerima satu
segmen dari Komputer X}

(i) In the second segment sent from Computer X to Y, appraise what are the
sequence number, source port number, and destination port number?
{Dalam segmen keduo dihantar dari /computer X ke Y, nilai!«m nombor urutan, nombor
port sumber, dan nombor port destinasi?.j
(2 MarksiMarkah)

(ii) Decide the acknowledgement number, the source port number, and the
destination port number, presuming that the first segment arrives before
the second segment, in the acknowledgement of the first arriving
segment.
{I'entukan nombor pengakuan, nombor port sumber, dan nombor port destinasi,
menganggap bahawa segmen pertarna tiba sebelum segmen keduo, dalam pengaJcuan
segmen pertama tiba.}
(2 Marks!Markah)

(iii) Recommend the acknowledgement number presuming that the second

segment arrives before the first segment, in the acknowledgement of the
first arriving segment
{Cadangkan nombor peraJcuan dengan menganggap bahawa segmen lredua tiba
sebelum segmen pertama, dalam pengakuan segmen pertarna tiba.]
(2 MarksiMarkah)

(iv) Suppose the two segments sent by Computer X arrive in order at

Computer Y. The first acknowledgement is lost and the second
acknowledgement arrives after the first timeout interval. Construct a
timing diagram, showing these segments and all other segments and
acknowledgements sent (Assume there is no additional packet loss).
{Katakan duo segmen yang dihantar oleh komputer X tiba menurut turutan Ire
Komputer Y. Pengakuan pertama telah hilang dan pengakuan kedua tiba selepas
tempoh tamat masa pertama. Bina gambar rajah pemasaan, dengan menyatakan
segmen in; dan semua segmen yang lain dan penralcuan yang telah dihantar
{Anggapkan tiada kehilangan paket tambahan}.}
(6 MarksiMarkah)

SLTLIT

Dicetak oleh Unit Peperiirsaan dan Pengijazahan, Bahagian Pengurusan Akademilc, Jahatan Pendaftar
 SULIT
(EKT33S)
-11-

Question 6
/Soa/on 6/

(CS, C03, P02, POll)

(a) Suggest an alternative to NAK in a reliable data transfer and describe its
functionality .
[Cadangkan a/ternati! kepada NAK dalam pemindahan data yang holeh dipercayai dan terangkan
fungsinya.}
(4 Marks/Markah)

(C4, C03, P02, POll)

(b) Consider a packet with a size of 8000 bits to be transmitted over a link of 1Gbps.
Given that the propagation delay to propagate this packet is 15 ms. Compare and
contrast the performance of Stop-and-Wait and Go-Back-N in terms of link
utilization which is the fraction of time the sender busy sending the packet. Deduce
the conclusion from the result.
[Pertimbangkan satu paket dengan saiz 8000 bit yang akan dihantar melalui pautan 1Gbps.
Memandangkan peramhatan lengah untuk menyebarkon paket ini ada/ah 15 ms. Beza dan
bandingkan prestasi Berhenti-dan-Tunggu dan Go-Back-N dari segi penggunaan pautan yang
merupakon sehahagian kecit daripada masa sibuk penghantar menghantar paket. Simpulkon
kesimpu/an dari hasi/nya.j
(6 Marks!Markah)

(C5, C03, P02, POll)

(c) Compare Go-Back-N and Selective Repeat. Assume that the timeout values for the
two protocols are sufficiently long such that 5 consecutive data segments and their
corresponding ACKs can be received (if not lost in the channel) by the receiving host
(Host B) and the sending host (Host A) respectively. Suppose Host A sends 5 data
segments to Host B, and the 2nd segment (sent from A) is lost. In the end, all 5 data
segments have been correctly received by Host B. Calculate the number of segments
that Host A sent in total and how many ACKs has Host B sent in total? What are
their sequence numbers? Answer this question for both protocols.
[Bandingkan Go-Back-N dan Selective Repeat. Andaikan bahawa ni/ai tamat masa untuk kedua-dua
protokol culwp panjang dimana 5 segmen data herturut-turut dan ACKs mereka holeh diterima Oika
tidak hilang dalam sa/uran) oleh tuan rumah penerima (Hos B) dan tuan rumah penghantar (Host A)
masing-masing. Katakan Host A menghantar 5 segmen data kepada Hos B, dan segmen ke-2
(dihantar dari A) hi/ang. Akhirnya, semua 5 segmen data telah diterima dengan hetul oleh Tuan B.
Kira jumlah hi/angan segmen yang Host A hantar dan berapa jumlah ACKs yang telah Tuan B
hantar? Apakah nombor urutan mereko? Jawab soaZan ini untuk kedua-dua protokol.]
(6 MarksiMarkoh)

(d) Differentiate between TCP flow control and congestion control.

[Bezakan amara kawalan aliran TCP dan kawalan kesesakan.}
(4 Marks/Markah)
-0000000-

SULIT

Dicetale oleh Unit Peperiksaan dan Pengijazahan, Bahagian Pengurusan Akademi/c, Jabatan Pendajtar
 SULIT
(EKT 335)
-12-
APPENDIX
lLAMP/RAN]

COURSE OUTCOMES
Ability to analyse and apply the application layer program over the
COl
Internet
Ability to develop and implement the transport layer protocol which set
CO2
up the Internet network
Ability to design and develop the IPs which are needed to transfer data
COO
from sender to receiver

PROGRAM OUTCOMES

Ability to acquire and apply knowledge of mathematics, science,

engineering and an in-depth technical competence
POI
in Computer/Communication/Computer Network engineering discipline to
solve complex engineering problem.
P02 Ability to identify, formulate and solve complex engineering problems.
P03 Ability to design a system, component or process to meet desired needs.
Ability to design and conduct experiments, as well as to analyze and
P04
interpret data.
Ability to use techniques, skills and modem engineering tools necessary
POS
for en~eering practices.
Ability to demonstrate the social, cultural, global and environmental
P06
responsibilities of a professional engineer.
Ability to understand entrepreneurship, the process of innovation and the
P07
need for sustainable development of the environment.
Ability to understand professional and ethical responsibilities and
P08
commitment to the society.
P09 Ability to function on multi-disciplinary teams.
POlO Ability to communicate effectively.
A recognition of the need for, and an ability to engage in life-long
POll learning.
POl2 Demonstrate understanding of project management and finance principles.

SULIT

Dicetak oleh Unit Peperiksaan dan Pengijazahan, Bahagian Pengurusan Akademi/c, Jahatan Pendaftar