Department of Computer Science and Englneeing, Unversrv of Chittasons
Page 27
8. Undergraduate Program
8.1.
Ordinance of the B.Sc. Engineering program
University of Chittagong
Chittagong, Bangladesh.
Faculty of Engineering
Mffiil
7-----
666erA
Ordinance
For
THE DEGREE OF B.Sc.ENGINEERING
WITH EFFECT FROM SESSION 2014-2015
Deparfr'€nt of Computer Scierce and
E
Bineerr!3 Universit/ of Chttagons
Page 28
Contents:
hge
1.
)
3.
4.
5.
6.
7.
B.
9.
10.
11.
72.
15.
14.
Departments
Degrees Offered
Duration of Course and Course Structure
Distribution of Coursr:s
Academic Calendar
Admission
Admission on Tiansfe r
Medical Examination at the time of Admission
Registration
Change of Departmen t
Attendance
Striking off the Names, and Readmission
Crading System
Marks and Credits Disribution
Conducting of Examination and Rules for Promotion
Award of Scholarships
Course Exemption
15.
16.
17.
18. Class Tbst
19. Award of Degree and lhblication of Results
20. Improvement of Result
2t.
Flailed Student
22. Examination Committr:e
25. Theoretical Examination
24. Laboratory Dxaminatic,n
25. Medium of Answers
26. Duties and Responsibitities of Question Setters and Dxaminers
27. Dligibility of the studerrt for appearing at the Examination
24. Amendment
3
3
5
4
5
5
6
6
6
6
6
7
8
9
10
11
11
11
11
11
11
72
15
15
15
15
t4
t4
Page 29
Unive6ity of ChittagorE
D@artrnent of Comp.rter 5ci6lc€ and Er8inedins,
FacuItY of Engineering
UniversitY of Chiffagong
Academic Ordinance for Undergraduate Programme
for the award of the degree of Bachelor of Science in Engineering
1. Departments
1.1 Degree Awarding DePartments
The Ficulty shall consisi ofthe following Degree Awarding Departments:
l.
D"p-ttn*t of Co.puter Science and Engineering (abbreviated as CSE)
l I
1.1.2
Deparunent
of epitied phlsics, Electronics and Communication Engineering (abbreviated as
APECE)
1.1.3 Any other department
to be approved in future
1.2 Related Teaching DePartmetrts
The Faculty may requi-re thi participation of some or all of the following Departments to teach Humanities,
Mathematics and Basic Science cowses:
Deparftnent of Chemistry, CU
1.2.2 Department of Ph)sics, CU
1.2-3 Department of Mathematics, CU
Department ofStatistics, CU
l
1.2.5 Departmant of English, CU
1.2.6 Departmsnt of Law, CU
1.2.7 Departrnant of Economics, CU
1.2.8 Department of Management, CU
1.2.9 Deparhrent of Accounting and Information System, CU
1.2.10 Departmsnt of Sociology, CU
1.2.1
Departrnent ofPsychology, CU
1.2.12 Any other department as per requirements ofsyllabus ofany departrnent ofthe Faculty.
1,
.2.1
-2.4
I
2. Degree Offered
The Faculty shall offer courses leading to the award ofthe following degrees:
Bachelor ofScience in Engineering in Computff Science and Engineering
Bachelor ofScience in Engineering in Applied Physics, Electronics and Communication
2.1
2.2
2.3
Any other degree that may be awarded by a department or affiliated college on the approval of the
Syndicate on the recommendation ofthe Faculty ofEngineering and the Academic Council ofCU.
3. Duration of Course and Course Structure
3.1
3.2
The B. Sc. Engg. Programme shall extend over a period of four academic years, each ofa normal
dumtion ofone calendar year, divided into 2 Semesters; (details are given in Section 5 ofthe ordinance).
The crmicula of the B. Sc. Engg. degree in the different departments shall be proposed by the
3.3
Committee ofCourses and approved by the Syndicate on the recommendation ofthe Academic Council.
The Committee of Courses of each departmealt shall reyiew the curricula at least once in two
3.4
consecutive Academic Years and recommend changes and revision, if any, that must be approved by
the Faculty. The recommendation ofthe Faculty will be placed to the Academic Courcil for approval.
Teaching ofthe courses is reckoned in terms ofcredits and the qedits allotted to various courses will be
determined by the Committee ofCourses under the following guidetines:
Nature of course
Theoretical Lecture
Laboratory
Project
Field work
Contact hour
(in a semester)
I hour/week
2 - 3 hours/week
4 - 6 hourVweek
2 weeks of field work
For other fiactions ofcredit, proportionality shall be considered
No. of credits
I
I
2
I
Dep En€rt
Page
of Conp,t€r Scienc€ dnd Ergjneenr]g Uni!€rsrty of ChrttasorE
3O
3.5
Contact Hours/week: The t,)tal contact hours for the regular students including tecture, tutorid and
3.6
laboratory shall be between 24 - 48 periods per week, each period being 45 minutes in duration.
Course Adviser: In each deg:ee-awarding department, one of the teachers nominated by the Academic
Committee shall act as Course Adviser for each academic year (two consecutive odd and even
3.7
3.8
3.9
semesters).
With the approval ofAcadem c committee, Course Adviser will prepare and announce the class routine,
showing details ofthe lectures, course plan, class test, etc at the start ofeach semester.
Core Courses: In each discipline a number of courses will be identified as core courses by the
Committee of Courses and litudies of each department, which form the nucleus of the respctive
bachelor's degree programme A student has to complete all ofthe designated core courses to obain a
degree in his/her discipline. The course code of the core colrses shall be prefixed by the own
deparhnental letter code; for e:rample, CSE I I I is a core course in CSE department.
Pre-Engineering Courses: Some ofthe core courses are identified as pre-engineering courses. A pre
engineering course is one, which is required to be completed before some other courses can be hken.
Any such course, on which one or more subsequent courses build up may be offered in each of tle two
regular semesters.
3.10
3.ll
will have to complete a number of elective
will
have
to choose the required number of corses
courses, as offered by the department. Students
Elective Courses: Apart ftonr the core courses, students
from a specified group/number ofcourses.
Course Designation: Each c lurse is designated by a course code and course title. A course code
consists ofa two to four lettel word usually identifies the course offering department and a threedigit
number. Course designation is generated with the following criteria
(a) The first digit will correspond to the semester in which the course is normally taken bythe
students
second digit
(b) The
(c)
(d)
will
be reserved for departmental use for such things as to
areas within a departm(nt
The third digit will b€ odd
The course title.
identif dif€rent
for theoretical, even for laboratory courses
The system is illustrated by the following example.
Course Titl€
course Code
APEC 1 3
1
Electronic
D
evices & Circuits
L-
Course title
Third odd digit represents a Theoretical course
Second digit is reserved for departmental use
First digit signifies semester number
Dept. identification code (Computer Science and Engineering/
Applied Physics, Electronics and Communication Engineeing
4. Distribution of Courses
The programme of study for the B. lic. Engg. shall carry a total of4000 marks (40
Suggested distribution ofcourses is as follows:
mits. 160 credits)
Page 3l
Deparfn€nt of Computer S.rerrce and Englneerins, Unversity of Chiftagong
Course qpe
uHumanities
t-3
-E\,I"th.""ti"s and Basic Sciences (with Lab)
Basic and Maj or Engineering
( i) Basic Engineering
with Lab
Distribution (ii) Major Engineering
(a) Theoretical
(b) Laboratory
6-9
28-32
I
I
|
100
2800
1500
700
of Total
Marks
2.5
300
9oo
3200
100-300
-
Credits
4t2
7.5
24-36
t1_2 128
- 22.5
70-80
15
600
3
t5 -24
7 -12
Yo
Marks
Units
2.5
412
7.5
37.5-60
2400
1200
60- 96
28
17.5 - 30
,1000
.10
Total
on
English.
include
a
course
must
"Each department
bEach
department must include courses on Physics, and Mathematics
48
160
100"/"
I
5. Academic Calendar
5.1
The academic year shall be divided into two semesters each having duration of not less than 1l
teaching weeks.
5.2
There shall be final examinations at the end of each semester conducted by the respective
5.3
Examination Committee of the Departments.
An academic schedule for the academic year shall be announced for general notification before the
start of the academic year, on tle approval of the Academic Committee. The schedule may be
prepared accor
to the followin
delines
Number ofweeks
Semester-Odd (19 weeks)
Teachirg
I
Preparatory Leave
Examination Period
Result Publication
I
2
2-3
3-4
19
Semester-EYen (19 weeks)
Teaching
Preparatory Leave
Examination Period
Result Publication
r-
I
6
ll (66 working days)
,
2-3
6
3-4
19
f
tl
Vacation (Summer, Ramadan, and
Others) include Inter-Semester Break.
Total:
5.4
(66 working days)
<,
However, the academic committee may reschedule the above academic schedule
if
and when
necessary.
6. Admission
6.1
6.2
6.3
The four academic years of study for the degree of B. Sc. Engineering shall be designated as First,
Second, Third, Fourth, Fifth, Sixth, Seventh and Eighth semester in succeeding higher levels ofstudy.
Students shall generally be admitted into the First semester. In special cases, studsnts may be
admitted into a higher semester class on the recommendation of the appropriate Equivalence
Committee and concemed Departrnent, only in case of transferred shrdents.
An Admission Committee shall be formed as per statute of the University.
A candidate for admission into the First Semester, must have passed the HSC Examination (with a
minimum GPA as decided by the Admission Committee) from a Board of Secondary and Higher
Secondary Education in Bangladesh (after 12 years of Schooling) with Physics, Chemistry and
Mathematics as his/her subjects of Examination of the Higher Secondary level or examination
recognized as equivalent and must also fulfill all other requirements as may be prescribed by the
Admission Committee of the University.
D€parunqt of ConpJt€r Science ard Ergineenng UnrveGtty of ChittagorE
6.4
6.5
6.6
6.7
Page 32
The rules and conditions for irdmission into different Departments shall be framed by the Academic
Council on the recommendation of the Admission Committee of the University.
All candidates for admissim into the courses of B. Sc. Engg. must be citizens of Bangladesh unless
the candidature is against thr seats that are reserved for foreigt students. Cardidates for all seats
except the reserved ones, if any, shall be selected on the basis of merit. The rules for admission into
the reserved seats shall be ftaned by the Academic Council on the recommendation ofthe Admission
Committee of the University.
No student shall ordinarily be admitted after the beginning of classes.
Admission test
6.7.1
6.7.2
The admission test shall be conducted by an admission Committee ofthe Faculty (or
as sugg€sted by the Central Admission Committee of the university)
The admission Comnittee of the Faculty shatl be formed as per guidelines given
below:
(a) Dean ofthe Faculty as Chief Coordinator,(Jnit Chairman
(b) Alt the Chairmen of the Departments as Coordinator/unit member and
(c) One teachq from each member Departmant (nominated by the concemed
Academic Committee) as Member if necessary.
6.7.3 The committee fonned under clause 6.7.2, shall form other
necessary sub-
6.7.4
committee(s), appoin. question setters and take other necessary decisions.
A, merit list shall b( prepared based on candidates'GPA in SSC/equivalent and
HSC/equivalent exanrinations and admission test results, or as decided by the Cenfral
6.7.5
Admission Committe:.
Admission into different Departrnents of the Faculty shall be granted from the single
m€rit list according tr the position in the merit list and choice ofa candidate.
7. Admission on Transfer
A candidate seeking admissior on transfer from othel Institutes or Universities should apply to the
Registrar of the University. The Registrar will refer the case to the Chairman of the Departrnent
concerned and also to the Equivalence Committee. On receiving the opinions of the academic
committee and the Equivalencr: Committee, the matter will be placed before the Vice-Chancellor. The
Vice-Chancellor's decision will be communicated to the Chairman of the Departrnent and the
candidate.
8. Medical Examination at the Time of Admission
Every student before taking atlmission to the University shall be examined by a competent medical
officer as may be provided in tlte admission rules.
9. Registration
9.1
9.2
University Registration: Ever y student admitted into the University shall be required to register on
payment ofthe prescribed fees within the stipulated time.
Course Registration:
A
stuc
register his,4rer courses_in
ent admitted into a deparftnent of the Faculty shall be required to
the department in each semestff within l0 days of semester
commencement.
10. Change of Department
Change or transfer of department is not allowed in general. However, urder very special
circumstances if a student wants to change a subject of study in First semester, prayer may only be
considered by th€ Dean of Faculty after getting opinions from the Academic Committee of the
Departments. No change will b,: allowed in Second to Eighth semester.
11. Attendance
ll.l In order to be eligible for
appearing as a regular candidate at the semester final examinations, a
sndent shall be required to have attended al least 1U/o of the total number of periods of
lectures/tutorialylaboratory clar;ses held during the semester in all courses as defined in the curricula.
The laboratory courses mean all laboratory/projecVfieldwork/in-plant training and any other simitar
courses.
ll.2 A student whose attendance
frlls short of
707o but not below 600Z as mentioned above mav be
Depdrfnent oi Computer Sci€nce and Englneenng Unrversty of Chittagong
Page 33
allowed to appear at the final examinations as tron-coltegiate student and helshe shall not be eligible
for the awari of any scholarship or stipend. A student, appearing at the examination under._the
prescribed
ofthis provision shall haveio pay, in addition to the regulff fees' the requisite fine
l l.3
I 1.4
I 1.5
benefit
by the s5,ndicate for the PurPose
Tie Cou.se mentioned above shall mean a course of study as described in the curricula and it may
be a theoretical or a laboratory course.
ituJ*t. nuring less than 6byo at endance in lecture/tutoriay laboratory will not be allowed to
appear at the final examinations ofthe semester.
teacher for his/her Class shall prepare an attendance report ofthe students. TheTi,"
"on""In"d.ourse
,"po., ,t utt be submitted to the chairman of the Deparftnent within three days of the last class of
the course. Awarded marks for class attendance of the students shall also be prepared by the
concemed course teacher and submitted to the Chairman of the Examination Committee, in a sealed
envelope.
12. Striking off the Names and Readmission
12. The names ofthe students shall b€ stuck offthe rolls on any of the following grorurds:
l2.l.l Non-payment ofuniversity fees and dues within prescribed period, or failure to appear at the
I
semester final exarnination due
to shortage of the minimum required percentage of
class
attendance.
12.1.2
12.1.3
t2.1.4
12.2
Faiture to eam required GPA to get himselt/herself promoted to the next higher semester or
failure to appear at the semester examination after depositing examination fees.
Forced to discontinue his/her studies mder disciplinary rules and
Withdrawal of names from the rolls of the University on grounds acceptable to the ViceChancellor ofthe University after having cleared all dues.
Readmission ofa student whose name has been struck off
12.2.1 In case a student. whose name has been struck offthe rolls under clause l2.l.l seeks
readmission before the start of that semester with the batch that immediately follows on
recommendation of and with the date fixed by the academic commitlee of the department on
payrnent ofall the fees and dues. But ifhe/she seeks readmission in any subsequent year, the
procedure for his/her readmission wil[ be the same as described rurder clause 12.2.4.
12.2.2 ln case a student. whose name has been struck offthe rolls under clause 12.1.2 seeks
readmission b€fore the start of next higher semester with the batch that immediately
follows on recommen&tion of and with the date fixed by the academic committee of the
department on paynent ofall the fees and dues.
12.2.3 ln cas€ a Studsnt, whose name has been struck offthe rolls by exercise ofthe clause 12.1.3,
seeking readmission after expiry of the suspension period, shall submit an application to the
Chairman of the Departrnent before the commencement of the semester to which he/she
seeks re-admission. The Chairman of the Department shall forward the application to the
Deputy Registrar (academic). In case the readmission is allowed, the student will be
readmitted on pa),rnent of all the fees and dues within l0 working days from the date of
12.3
permission given by the proper authority.
who has withdrawn his,ter name under clause 12.1.4 shall be given readmission.
In case any application for readmission is rejected, the student may appeal to the Academic Council
for re-consideration. The decision ofthe Academic Council shall be linal.
12.4
All
12.2.4 No student
re-admission should preferably be completed before the semester starts. The percentage of
attendance ofthe readmitted student shall be counted from the date ofreadmission.
12.5
The application of a student for readmission will only be considered if he/she applies within one
academic year from the date he/she discontinues his/her studies in the University. The maximum
period of studies for B. Sc. Engg. Degree under no circumstance ryill exceed six academic years.
12.6
Dropping out: Students failing to eam the required GPA after completing regular examinations and
subsequently fail again after retaking the examinations in any semester in the stipulated period shall
be dropped out of the programme. A student will also be dropped out if he/she fails to appear at the
examination twice in a particular semester or more than twice in the entire Progra.m.
Departnent of Computer
k€nce
Page
dnd Engln€ennc , UnveEry of Chtttagorn
34
13. Grading System
l3.l
The letter
S
tem for assessin
Numerical grade
the
formance ofthe students shall be as follows
Letter Grade
(LG)
or above
75% to less than 80%
'7
\Yo to less thala T5o
65% to less than 70%
60% to less than 650lo
55% to less tharl 60%
50% to less than 55%
45% to less than 50%
40oln to less than 457n
Grade Point
(GP)
4.00
80%o
4
4
4
1
1
4
1
1
4
4
4
I
3.7 5
3.50
3.25
3.00
B+
B
B
C+
2.'7 5
2.50
2.25
2.00
0.00
0.00
C
D
F
less than 40%o
Incom lete
13.2
Credit
I
A Grade Point Average (GI'A) shall be calculated for each semester
tlPA =
Total Credit Points
Total Credit
as
Credit Point
= GP x Credit
16.00
15.00
14.00
13.00
12.00
I 1.00
10.00
9.00
8.00
0.00
0.00
follops
ZC,G,
r=l
Offered $ c
a-'
13.3
where, /, is the number of corrses offered during the semester, C, is the number of credits allotted to
ith course and G is the grade ,oint eamed for that course.
The Cumulative Grade Poirrt Average (CGPA) gives the cumulative performance of the students
fiom the l" semester up to 8'b semester to which it refers, and will be calculated as follows:
CGPA-
13.4
ZCoc,
+^
L'^
where, nr is the total number ofcourses offered, C1 is the number ofcredits allotted to the tth course
and G1 is the grade point eamt:d for that course.
Conversion of CGPA to per,:entrge of Marks: The following formulae for conversion of CGPA to
percentage of Marks are reconrmended.
3.75<x 4.00
Y:79 + 84
3.75
+
(x
2.25
Y= 44 20
of
Marks
1
Percentage
Obtained CGPA
=
Here, X
Rolt No [RolU of session [Session] of the
having
of
percentage
of
marks
Thus the
[Name]
:
(x 3.75);
2);
x
departsnent of [Deptl is [percr:ntage marksl 7o.
Cumulative Grade Point Averaie (CGPA) shall be calculated at the end of 8'h semester and to be
communicated to the student! along with the GPAs. The individual grades of courses obtained by
them for an individual semestr:r will be communicated at the end ofthe semester by the Chairman of
the Examination Committee.
In GpA or CGPA calculation, if either of them com€s up with fractional part and non-zero value
appears in the 3d and/or +,n a S,(.) after the decimal poini, the 2"d digit should be round up to next
hiitrer aigit. Illustration: (i) srrppose, a total of 32 credits are offered in a class and a student eams
total point secured (TPS) of 1 13 in that class, then hisiher GPA will be 3.54 while the precise value is
3.53125, (ii) suppose, a total o'26 credits are offered in a class and a student eams total point secured
(TPS) of 84 in that class, then hi*/her GPA will be 3.24 while the precise value is 3.230769..., (iii)
suppose, a total of 160 credits are offered in a 4-1ear program and a student eams total point secured
(TPS) of 585 in that program, then his/her CGPA will be 3.66 while the precise value is 3.65625.
(oq.oe.qo!c sfir{ q6E ,c+fsft+ +tBfrrsr* a.tb s{ {sl:I q) l\ fi6.fs q<t 5e.oe.lo)c qfu{ WCBE
13.5 A
13.6
frffi?
13.7
8bs
s{ {srr ei\ fr6t.s c"c$G-s)
Earned Credit: The credits assigned to the courses in which a student obtains 'D' or higher grade
will be counted as credits eanred by the student. Any course in which a student obtains ,F, or .I,
grade wilt not be counted towrds his/her earned credit. 'F' or 'I' grade will be counted for GPA
calculation alld will stay permar€ntly on the Grade Sheet and transcript.
Depdrtrn€nt of Computer
14.
Page 35
kience and Er8ineenns, Unversity of Chittasons
Marks and Credits Distribution
14.1
as er course
Theoretical Courses:
Distribution of Marks
14.1.1
l
s
t0%
Class Participation and Attendance
QuizzeVClass Test
20%
Semester Final Examination
70%
Total
t00%
Laboratory/Field Work:
14.1.2
Class Participation and Attendance
t0%
Quizzes and,/or Viva-Voce
Practical,/Design WorVReport
40%
50%
Total
t00%
Proj€ct Work
14.t.3
Internal Examiner (Supervisor)
35.h
(Based on performance, regularity, quality of
analysis, design, organization, wdting style)
I
External Examiner
(Any teacher from the panel of examiners)
(Based on quality ofanalysis, design,
organization, writing style)
3syo
Presentati on and oral Examination
30%
Total
t00%
I
I
4.t.4
Basis for aw
marks for class
I
14.2
and attendance:
a
Marks/Unit
Attendance
90% and above
85% to less than 90%
80% to less than 85%
75% to less than 80%
70% to less than 75%
t0
9
it
'7
6
Limits of Units, Marks, Credits and Contact Hours Distribution
(as
er Semester
Ir+z.r
First and S€cond semester
I
Nature of course
Units
Humanities
Mathematics and Basic Sciences
0-
Basic and Major
1.5
0.5 2.5
0.5
2.5
0.5 -
-
Theoretical
Engineering
Laboratorf
Marks
Credits
0-6
06
50 - 250
2- t0
2- t0
50- 250
2-t0
2-10
-
2-6
0-
50
150
150
4 -12
1.5
t4.2.2
Total
Third and Fourth semester
Nature of course
5.0
Units
I
t8-22
500
Marks
Credits
Sciences
Basic and
Theoretical
Major
I
Engineering
0
1.5
0.5 - 2.s
0.5
-
0-150
0-6 I
50 - 250
2-10
50 - 3'15
2
0-6
2-10
t5
|
0.5-2
50 - 200
2-8
5.0
500
t8-22
I
Total
hours/week
2
- 15
3.'.15
Laboratorv
20-26
Contact
I
Humanities
Mathematics and Basic
Contact
hourVweek
4 -16
20
26
Page 56
Departnst of Compner kieflce ard k8ineerir',(], Unversiv of Chittngorlg
14.2.3
Fi
si
Se
/enth alld E
Nature ol course
Hum:,nities
Theoretical
Basic and
Major
Engineering I Laborarory
Total
semester
Units
Marks lCredits
0-150
0-6
0 1.5
2-4 I 200- l8-16
0.5-2
5.0
l+ool
Contact
hours/week
0-6
- l6
8
50 - 200
2-8
4 -t6
s00
18-22
20-26
*labora:ory (Experimsnts/hoject/Field World In-Plant Training/Workshop/Similar
Courses).
14.3
Duration of Examinat ion
Duration ofTheoretical e&rmination of differetrt courses at the end ofsemester shall be as
Follows (for other liactionri ofunits, proportionality shall be considered):
3 Hours
Courses with crr'dits less than or equal to 2
4 Hours
Courses with crrdits greater than 2 but less than or equal to 4
15. Conducting Examinatio:n and Rules for Promotion
15.1 The academic year shall te divided into two semesters each having duration of not less than ll
15.2
15.3
15.4
15.5
15.6
teaching weeks (details are given in Section 5 ofthe Ordinance).
of the
Departments at the end oferrch semester.
The results shall be finalize,l at the end ofthe each semester. Individual course letter grade and GPA
shall be announced within a date ordinarily not later than four weeks after the end ofthe semester final
examinations.
Minimum passing grade: 'fhe minimum passing grade in any course will be D.
Promotion to higher semeiter: A student who has a GPA oi2.20 or higher shall be promoted to the
next higher semester.
Examination for backlog and/or improvement:
15.6.1 Ifa student does not appear after depositing examination fees or fails in a course or
intends to improve his/her grade ofa particular course with less than B grade, he/she must
appear at the senrester final examination with the students ofthe immediate following odd
or even semestel as the case may be; but the student will not get more than B grade in
that course. Horrever, if the candidate fails to improve the grade of the course then the
grade obtained by him,/her at the immediate past examination will be retained.
15,6.2 Ifa student app(ars at the Improvement Examination of any course as mentioned in the
clause 15.6.1 anl whatever the score he/she eams, a letter grade not above B (even the
score above B i; earned) shall be written in the tabutation sheet and grade sheet. The
word "Improverl' shall be wdtten as remarks in the grade sheet. However, if a student
appears in the final examination as an irregular candidate the word "Irregular" shall be
r tten in the grade sheet.
15.6.3 Promotion of rcferred student to higher semester: In order to be promoted to the next
higher semester, a student must obtain a grade point average (CPA) of2.20.
15-6.4 Grades obtained by a student in the courses in which he/she appeared at the examination
of backlog cour;es will be recorded for final assessment and the grade obtained by
him,/her in those courses at the regular final examination shall automatically be treated
cancelled, but hir/her previous class test and attendance marks of those courses will be
counted for gradt, calculation.
15.6.5 Ifa student unde: clauses 12.1.1, 12.1.2 and 12.1.3 eams required GPA for promotion in
the semester finrtl examination she,/he shall not be allowed to appear in the course/s
she/he scored lesri than B grade to improve his/her GPA under any consideration.
15.6.6 Ifa candidate faiLs to improve GPA with the block ofnew GP in total, the previous GPA
shall remain vali<l.
There shall be final exanrinations conducted by the concemed Examination Committee
Deportrnent of Computer Science dnd Ensineenng Unrversiv of Chtta8ons
Page 37
16. Award of Scholarships
The GPA obtained bya student in the semester final examinations in an academic year will be considered
for determining the merit position for the award ofscholarships, stipends etc.
17. Course Exemption
Students who fail to be promoted to the next higher semester shall be exempted from the theoretical and
laboratory courses where they obtained grades equrl to or better thon D. These grades would be counted
in calculating GPA in that semester's Examination results.
18. Class Test
18.l
18.2
18.3
18.4
18.5
For theoretical courses, there may be at least three class tests for the course of less than or equal to
2 credits and at least four class tests for the courses of greater than 2 credits in a semester, out of
which the best two or three of each student shall be used for assessment respectively. Course
will conduct the concemed class tests.
The tentative periods for the class tests shall be fixed and arnounced accordingly by Course Adviser
teachers
within two weeks ofthe start ofthe semester class.
The class tests shall be held during the scheduled periods.
The result ofeach individual test shall be posted to inform the students.
All marks ofthe class tests shall be summed up by the concemed course teacher and submitted to the
Chairman of the Examinalion Committee.
19. Award of Degree and Publication of Results
l9.l
19.2
A
student must successfully complete the courses of all the semesters within a maximum of six
academic years as outlined by the Committee of Courses in order to be eligible for the award of B.
Sc. Engineering degree. The student must earn CGPA 2.25 or highu and he/she must have to eam
minimum 154 Credits, provided she,fte must pass all the core courses ofthe concem departrnent.
Industrial and Professional Training Requirements: Depending on each department's own
requirements, a student may have to complete a prescribed number of days of industriaVprofessional
training in addition to minimum credits and otler requirements, to the satisfaction of the concemed
department.
19.3
Recording of Result: The overall results of a student covering all semesters' examinations of four
years shall be declared on the basis ofCGPA with the corresponding letta grade (LG). The transcripts
in English will show the Course Code, Course Title, Credits, Letter Grade, Grade Point, Credit Points,
Total Credits Offered, Total Credits Earne4 Total Credit Points, Grade Point Average (GPA), and
Cumulative Grade Point Average (CGPA) for the overall result
20. Improvement of Result
20.1
A student may improve his Aer CGPA after the degree is awarded by appearing only once in seven
aad eight semesters course/s eaming less than B gmde at the examination with the immediate next
batch but it must be within six consecutive years from the session of his/her first admission. If a
student improyes his/her CGPA, the word 'Improvement' and 'the Year' of improvement
examination should be mentioned in his/her academic transcript and certiticate.
fails to improve CGPA with the block ofnew GP in total, lhe previous results shall
remain valid.
A student willing to cancel his,/her improved CGPA and have the preyious results reinstated shall
apply in this respect to the Controller of Examinations through the Chairman ofthe Departrnent and
the provosts of the concemed hall with necessary fees prescribed by the University Authority from
time to tim€.
20.2 Ifa candidate
20.3
21. Failed Student
2l.l Ifa student fails to eam GPA of 2.20 for promotion
any semester examination, s/he shall be treated
as a failed student. The failed student shall be allowed to appear in the course/s with the batch that
immediately follows as an irregular candidate, failing which s/he shall be dropped out of the
21.2
prograrnme.
Ifa student fails to appear at any semester examination after depositing examination fees, s,/he
shall be treated as a failed student. The failed student shall be allowed to appear at the examination
with the batch that immediately follows as an irregular candidate, failing which s/he shall be
dropped out o ftlE prograrnme.
Page 38
Departm€nt of Computer Science and Engrneenn! , Unversiv of Chlttosong
21.3 If a failed student earns
21.4.
21.5
lequired GPA for promotion as an irregular candidate in any semester
examination, s,/he shall nor be allowed to appear in any course/s s/he scored B-, C+, C, D or F grade
to improve his/her GPA ur der any consideration.
\f a student fails to appea- or fails in a Laboratory course of a semester $he shall be allowed to
appear at the l-aboratory c()urses only once with the batch lhat irnmediately follows with permission
of Academic Committee lf the Deparhnent failing which an "F" grade will be recorded in his
transcript.
The failed student shall appear at each semester examination as an irregular candidate, gorerally as
per syllabus in force with(,ut any re-admission. If any drasfic changes in the syllabus are made, the
in
21.6
21.7
21.8
irregular candidate shall appear at the examination
his/irer original syllabus on the
recommendation of the Academic Committee of the department.
After completing a semest -'r as an irregular candidate, the above categories ofstudents shall have to
be admitted provisionally to the next higher semester within the date fixed by the Academic
Committee of the concemed department. If the student fails at the respective examination, his/her
provisional admission shall automatically be cancelled.
Ifa student fails to appear at the examination twice in a particular semester or more than twice in
the entire programme, s/he shall be dropped out ofthe programme.
A student failing to eam n inimum GPA 2.20 in the Eighth semester examination shall be heated as
a failed student. Such a student is allowed to improve his/her GPA by appearing in the Eighth
semester examination with the immediate next batch only as an irregular candidate, but it must be
within six consecutive ac;rdemic years from the session of hiVher fust admission. Failing which
s,4re shall be dropped out c f the programme.
22. Examination Committee
22.1
22.2
FORMATION OF THE EXAMINATION COMMITIEE
There shall be separate Exanination Committees for each semester examination as follows:
The lst to 4'h semester Exarnination Committees: each shall consist of one Chairman, two Intemal Members
of the major courses, two nemkrs on the related courses and one Extemal Member (fiom another Public
University).
The 5o to 8'h Semester Exanrination Committees: each shall consist ofone Chairman, three Intemal Members
and one Extemal Member (lrom another Public Universiry).
For Alliliated colleges the fcrmation of examination committee shall be as follows:
The lst to 4s semester Exanrination Committees: each shall consist ofone Chairman, one Intemal Member of
the major courses, one interlal member ftom the faculty of Engineering, CU (Nominated by the Dean of the
faculty), two members on the related courses and one Ext€f,nal Manber (from anotha Public University).
The 5d to 8th Semester Exaraination Committees: each shall consist ofone Chairman, two Internal Members,
one intemal member from tre faculty of Engineering, CU (Nominated by the Dean of the facutty), and one
Extemal Monber (fiom another Public University).
Functions of the Exrmination Committee
22.21 Propose the nales of the question setters and script/dissertation/project/ in-plant training
report examineri from the previously approved panel ofexaminers
22.2.2
22.2.3
Moderate examjnation questions ofall theoretical courses
Propose examirtation schedule (for approval of the deparmental Academic Committee) to
conduct the exarninations properly
22.2.4
22.3
Make necessary arangements for holding the examination ofall Theoreticrl and Prrctical.
(as per the rules given in Sections 23 and 24).
22.2.5 Recommend thc names of three tabulators and a scrutinizer to the Contollfi of Examination
for appoval.
22.2.6 Finalize the results (as per the rules given in Sections 13, 14, 15, and l8)
The major duties of the Clairman ofan Examination Committee shall be as follows
22.3.1
22.3.2
22.3.3
22.3.4
22.3.5
Call meetings of the Examination Committee
Eitha to serd rhe moderated question papers to the Contoller ofExaminatiors for printing or
to take necessaT steps for printing the questiors in his/her own care.
lssue instructions to the examinas and to see those instuctions issued are prqrcrly followed
Hand over the rnarks received from the examiners to the tabulatms.
Issue instuctirn to [te tabulators so that they must prqrare marks related information hand
*r.itt€n in the trLbulation sheet.
Page
Departrn€nt of Computer Science and Engineenng Unive6it/ of Chittdgons
39
23. Theoretical Examination
23.1
23.2
23.3
23.4
23.5
23.6
There shall be two examiners for each theoretical course of each semester flnal examination, at least
one ofwhom shall be the teacher of the course. Each question paper of a course will be divided into
two sections: Section A and Section B, Each examiner u/ill set queslions for both the sections and
examine answer scripts of one of the sections as will be decided by the Examination Committee.
Student will use separate answer scripts to answer questions from each section'
In each theoretical course examination, the candidates shalt be allowed to answer 3 questions out 4 in
each section.
Scripts examined by
a single examiner shall be scrutinized for any error and omissions by
the
scrutinizer.
Wtere there is an arithmetical error in adding ofmarks, and skipped answer in the script to score, the
scrutinizer shall bring it to the notice of the Chairman of the Examination Committee and the
Examination Committee shall make corrections in tlese cases.
The answer scripts ofthe examinations shall neither be shown to the students nor re-examined for the
purpose ofre-assessing the answers, but may be re-scrutinized for errors and omissions only. Such rescrutinization may be made on receipt of a formal application from a candidate together with the
prescribed fee. No application shall be entertained unless it reaches the appropriate authority within
fifteen days of the publication of such results. The scrutiny shall be arranged in a manner as may be
considered appropriate by the Chairman ofthe Examination Commiftee.
Absence ofa candidate in an examination ofa course in which he/she ought to have been present will
be considered as ifthe candidate obtained zero marks ('F' grade) in that course.
24. Labor atory Examination
24.1
24.2
Th€ deparhnental Academic Committee will assign a teacher or a group of teachers to conduct a
particular laboratory class or all the laboratory classes of a particular semester as well as to conduct
the laboratory examination of that class during the scheduled course periods. The concerned Lab
teacher/s and the Examination Committee will conduct Quizzes and/or Viva-Voce.
Concemed teacher/s will send three copies of marks of the laboratory course to the Chairman of the
concerned Examination Cornmittee, and another copy
to the Controller of Examinations of
the
University.
25. Medium of Answers
The medium of answer in the examination
will be in English.
ofall written, laboratory and other
courses ofeach departrnent
26. Duties and Responsibilities of Question Setters and Script Examiners
26.1 If a question setter or a script examiner is rmable to accept the appointmsnt before or during the
26.2
examination, he/she should irnmediately inform the Controller of Examinations. ln case an examiner
cannot finish marking the scripts received by him/trer within the specified time, he/she should
immediately retum the scripts to the Chairman of the Examination Committee.
Th€ question setters and the script examiners should send their remueration bills to the Controllsr of
Examination. The University on presentation ofduly signed bill will pay all postal and other incidental
expenses incurred by the setters/examiners in connection with the examination for the same, supported
with vouchers.
any examiner is rmable to accept or has to relinquish hi$ft€r appointrnen! the Examination
Committe€ concemed shall recommend to the Controller of Examinations a new question setter or
26.3 If
script examiner.
26.4 All manuscriptVquestion
26.5
26.6
26.7
26.8
papers shall be sent by the setters in a sealed covers to the Chairman ofthe
Examination Committee who shall then catl a meeting of the Examination Committee to moderate the
question papers.
The question papers, scripts and any other documents in connection with the examination would be
handed over oftrcially/personally or sent by insured post to the Chairman of the respective
Examination Committe .
The marks of all examinations shall be submitted to the Chairman of the Examination Committee,
either personally in a sealed cover or in a doubly sealed insured cover, if sent by post. A copy should
rlso be submitted separately to the Controller ofEraminations ofthe University.
The question setter shall as far as practicable, avoid in marked change of standard from year to year
but shall not be required to set the same type ofquestions every year. The questicf,r shall be so framed
that there shall be no ambiguity ofmeaning. The questions should be set ir such a way that originality
and individuality of the candidates may be encouraged'
The question setter shall be guided as to the standard extent of knowledge requted and scope of the
D@artrn€nt of Cornpn€r
kiance dnd
Page
Engineenn j, Unrvqsit/ of Chittasons
courses of examination by the syllabus prescribed and the textbook,
University fiom time to tinre.
26.9
26.t0
26.1 I
26.t2
26.13
26.t1
27.
if
4O
any, recommended by the
All co[ections
and alterations in the manuscripts, question papers, marks placed in the scripts and
marks entered in the mark sheets must invariably be initiated by the person making the correction.
Over-writing in the case of marks should be avoided. The wrong figures should be crossed out and the
correct figures wdtten in c(,nvenient places. Doubtful entries should be indicated by words as well.
If in the course of examiting the answer scripts the examiners have reasons to suspect that ary
candidate has adopted unfat means, he/she should at once submit confidential report to the Chairman
ofthe respective Examination Cornmittee giving the grounds for his,&er suspicion.
The marks of each course of examination or a section thereof entered in the mark sheets in ink are to
be submitted to the Chairman of the respective Examination Co[unittee. A copy should also be
submitted separately to the Sonholler ofExaminations ofthe University.
Ifany examiner is unable t) examine answer script, he/she should return the packet ofanswer scripts
immediately to the Chairman of Examination Cornmittee.
Immediately on receipt of :ach packet containing answer scripts of candidates, the examiner should
count the script and verify :he figures given in the statement (Top Sheet) regarding the details of the
answer scripts sent. Should any discrepancy be discovered, it should at once be brought to the notice
of the Chaiman of the Examination Committee with a report of the statement which shoutd be filled
in and rehrmed to the Chairnan of the Examination Committee immediately after receiving the answer
scripts, so that prompt action may be taken about the mattsr. If no report is received within three days
ofreceipt, it will be assumerl that the statement sent is accurate.
Request to the question selters
26.14.1 To write the nranuscripts ofthe questions papers in English. To make sure that the
manuscripts ol questions are as clear and legible as possible, taking special care in
writing, so as t ) ensure accuracy in printing,
26.14.2 To retain no copy of the question paper fiamed by him,rher and to destroy all rough
draft and memorandum connected therewith immediately after being used properly,
and,
26.1.4.3 To sign at the tottom ofeach sheet ofthe manuscript question paper set by him-
Eligibility of the student for appearing at the Examination
27.1
A candidate may not be allowed to appear at any semester final examination unless he/she has
27,1.1 submitted to the controllsr of examination an application in the prescribed form for
appearing at the e:amination,
27.1.2 paid the prescriberl examination fees, and all outstanding University and Hall
27.1.3 fulfilled the condilions for attendance in class and
27,2
28.
2'l
.1.4
dues,
beerl bNred by an., disciplinary rule.
On special cicumstances the Vice-Chancellor may permit a student on recommendation of the
Academic Committee ofthe concemed deparhnent to appear at the examination.
Amendment
Any amendment ofthis ordinance sha I be proposed through the Faculty of Engineering and passed by the
Academic Council.
9s p"r -"cororannJrzlron
ZcczJ"nr" CouncJ ";J" reso-/ultbn ao-66 Ae/J orz o?-o3-2o15 A
re'olulion no.4 Ae-lJ oa l3-o3-2o15
tzpptttteJ 6y <9614,nee1,ng 9y' /A" SynJnale
";c/"
orf zzalA
(Professor Dr.Mohammed Kamrttl Huda
)
Registrar
(In-.hargE)
University of Chittagong
&
Member Secretary
Ordinance Committee
oc.!t.to)s vlfrc{ q{68 teF{lRl q{qBiT )) E-{ TEtn rn"\ frfiEi fr.c{.fr- !&ffi.. qffirfrT{
)e-e q|Tr
^r{8:qffi
q\r.{N+m
qfrcthrjr{ qiT lgifri +*r qr rgfkft{lfrR-q{{rE-{ E-s,rs6+f{R.{dffr
oa.oo.foro
#oq*{6.
,{5rasftf rtBfrrrd \ttr v.[ qElir \rs i\ frqEe u-amrca-* e+i
qll )e.oe.\orc ql&a{;r vifi}s eer+o-* axu
anfr.r-<r<*
sq rsll a{< frtEsq{a{fis {s
[sugsestions for partiat revision ofArt. 13.3]
Updated: December 2014
r
Yage 4l
Departn€nt of Computer Screoce and Ensineenng Unive6rt/ of Chinagong
8.2.
Detailed Syltabus of the B.Sc. Engineering program
Department of Computer Science and Engineering
Syllabus for the Degree of B. Sc. Engineering
Session: 2016-2017 , 2Ol7 -2018, 2018-2019 and 2019'2020
First Semester
Course Title
Course Code
I1I
Introduction to Computer Slstems and
Computing Agents
3
CSE 113
CSE 114
Structured Progarnming Language
Structured Progmmming Language Lab
3
EEE
Electrical Engineering
Electrical Engineering Lab
Mahices, Vector Anal)sis and Geometry
Basic Statistics
Total for Semester
Total for Semester (Theory + Laboratory)
3
CSE
121
EEF. 122
MAT I3I
STA 15I
Hours/Week
Theory
Laborqton)
Credits
Theory
Laboratory
3
4
2
3
)
I
l
l
3
l5
t5
3
Cumulative Total
15
6
2t
18
15
3
6
Second Semester
Course Title
Course Code
CSE 21
1
CSE 2I2
CSE
2I4
EEE 221
EEE 222
MAT 23I
P}IY 241
MAT
233
ENG 271
Hours/Week
Theory
Laboralory
Credits
Theory
Data Struchles
Laboratorl)
3
Data Structures Lab
Engineering Drawing Lab
Basic Electronic Deviccs and Ctcuits
Basic Electonic Devices and Circuits Lab
Calculus and Differential Equations
Electricity, Ma$etism and Optics
Discrete Mathematics
English
Total for Semester
Total for Semester ( Theory + Laboratory)
Cumulative Total
I
I
I
l
1
I
3
3
I
2
3
3
3
3
3
3
3
3
l
l8
l8
33
6
24
21
6
33
12
D@artrngrt ot Compt]teI Scierrce dnd
Engineeri
Page 42
19 Un,ve.sit/ of Chitt4ong
Third Semcster
Course Title
Course Code
Theory
CSE 3I I
CSE 312
EEE 32I
EEE 322
MAT 33I
ect Oriented ho
ect Oriented
tal
c Desi
Hours/!Veek
Theory
Lqborato
3
ammln Lan
Lab
2
1
l
3
Digital Logic Design -ab
1
I
Complex Variables, Laplace and Fourier
Tran sformation
STA 351
Probabi
ECO 38
Economics
I
Credits
Laborator"v
3
s
and Statistical Anal
3
IS
3
3
Total for Semester
Total for Sem( ster ( Th
t5
15
6
l8
+ Labor
Cumulative Total
,18
21
t8
48
9
Fourth Semester
Co use
Course Code
Title
CSE 4I I
CSE 412
CSE 413
CSE 414
Desi
and
Desi
and
Database
Database S
csE 415
CSE 416
MAT 431
MAT 432
s
rfAl
s
cfAl
HoursllVeek
Theory
Labor0l
Credits
Theory
ithms
ithms Lab
Laboratory
3
3
4
2
3
Lat
4
2
ors
3
Mi
ors Lab
Numerical Methods
Numerical Methods Lrb
Total for Semester
Total for Sem(ster
4
2
I
3
3
2
1
t2
Th
+
Cumulative Total
t4
1
t2
16
60
Laboralon)
Theory
t9
60
26
32
Fifth Semester
Corrse Title
Course Code
Credits
Theory
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
51I
Operatins Systems
5I2
5I3
514
La.:
Data Communication
Data Communication -ab
5I5
Soft*are En
516
517
519
ACC 59I
Hours/lVeek
3
4
2
3
3
1
md
Pattern
Soliware Engineering and Design Pattem Lab
ter Architectuo
Ethics and C ber Law
Accoun
and Mana
Total for Semester
Total for Semeiter
1
3
l
3
I
)
18
+ Laborat
Cumulative Total
1
2
3
l8
23
78
l0
28
2t
'/8
42
rage 43
Depart nent of Computer Science and Ensineenng, Universlt/ of Chittagong
Sixth Semester
CSE
CSE
CSE
CSE
CSE
6II
fieory
C
Interfacin
6I2
614
615
csE 616
CSE 617
CSE 618
EEE 62I
ENG 672
Microcontroller
and Microcontroller Lab
Ldhotatorv
3
3
and
Networks
Networks Lab
613
HourVWeek
Laborolorv
Theon'
Credits
Course Title
Course Code
Web
I
2
I
1
3
.)
Web Engineedng Iab
Theory of Computation
2
I
J
3
1
2
t Lab
Devel
Telecommunication
eenn
Technical Writing and Presentation
Mobile
3
I
2
6
l5
27
9l
l5
Total for Semester
Total for Semester ( Theory + Laboratpry)
Cumulative Total
12
2l
93
21
5Ll
Seventh Semester
Course Title
Course Code
CSE
7OO
Project / Thesis
Compilers
CSE 712
Compilos Lab
Artifi cial [ntelligence
Artifi cial Intelli gence Lab
CSE 714
CSE 7I5
CSE 716
CSE 717
CSE 718
CSE 7I9
Theorv
Hours/Week
Laboratorv
Theory
Laboratory
4
l3
csE 7r I
CSE 713
Credits
I
3
I
3
I
2
3
I
l
Computer Graphics
Computer Graphics kb
Information Security
Industrial Training
I
2
3
1
1
l3
3
2
1
Option-I
3
Total for Semester
Total for Semester ( Theory + Laboratory)
l5
6
t2
15
20
Cumulative Total
108
25
33
108
Laboratory
Theory
66
Eighth Semester
Course Code
Course Title
Credits
Theory
CSE 8OO
CSE 81 I
CSE 812
Project / Thesis
Digital Image Processin g
CSE 813
CSE 814
Disfibuted and Cloud Computing
CSE 8I5
CSE 816
CSE 8I7
OptionJI
Total for Semester
Total for Semester ( Theory + fu66131*1
Cumulative Total
Cumulative Grand Total ( Theory + Laboratory)
Laborqlory
4
3
8
3
Digital Image hocessing lab
Distributed and Cloud Computing Lab
Machine Leaming
Machine Leaming fab
Hours,{f,/eek
2
1
l
I
3
2
3
lrl
2
3
3
t2
1
120
26
40
160
l4
t2
l9
120
80
200
Page 44
Departrr€nt of Compnel Science and ErEineenrE Unive6ity of Chittasons
Option -I
Course Code
Co rrse
Title
Credts
Laboratory
Theory
csE 719
o
csE 719
cal Fiber Commur ications
Hours/Week
|
Theory
3
3
Soft Computing
3
3
csE 719
E-Commerce
3
3
csE 719
Robotics
3
3
csE 719
3
3
3
3
csE 719
Natural La
age Pro(:essing
Computer Vision
Cryptography and Network Security
3
3
csE 719
ob
3
3
3
3
csE 719
csE 719
Oriented Ana sis and Design
Bio-lnformatics
csE 719
Data Warehouse Syst€ms
csE 719
Man
La
3
3
3
csE 719
ment lnforma :ion Systems
Modeling and Simulation
3
3
csE 719
Special Topics related :o
3
3
CSE
Option-II
Course Title
Course Code
Credits
Labordtorv
Theory
Hours,A eek
Theory
3
3
csE 817
Mobile Com uting
Geographical lnformat on Systems
3
3
csE 817
Parallel Computing
3
3
csE 817
VLsl Des n
3
3
csE 817
Data Engineering
3
3
csE 817
Human Computer lnte'action
3
3
csE 817
Wireless Sensor Netw(,rk
3
3
csE 817
Graph Th
3
3
csE 817
Multimedia Systems
3
3
csE 817
Digital Signal Processin
3
3
csE 817
SpecialTo ics related 1o
3
3
csE 817
CSE
Summary of the Syllabus
No. of Cr:dits
Course Type
According to the
Ordinance
4 to
lll
Humanities
Basic Science
(Theory + Laboratory)
24 to 36
Minor Engineering
(Theory + Laboratory)
4 to
Major Engineering
Major Engineering
(
Total
l','.
No. Credits in
the Syllabus
l0
28
(24+4)
t2
(9+3)
9/" of Total Credits
According to the
Ordinance
2.5 to '7 .5
15
to 22.5
2.5 to '7 .5
70 of Total Credits
in the Syllabus
6.25
17.5
(15+2.5)
7.5
(5.625+r.875)
60 to 95
77
37.5 to 60
48.125
4l
33
17.5 to 30
20.625
160
100%
28 to
r60
100"
Depdrfn€nt of Cornputer Science and Eng,n€enng, Unve6it/ of Chittdgor8
Page 45
DDTAILED SYLLABUS
First Semester
CSE 111 Introductlon to Computer Systems and Computing Agents
75 lelarks, 3 Credits, 3 lTourslWeek
Basic concepts: lntroduction, what is computer and computing agents, Types of
computers, History of computers, Generation of computers, and Specification of
computers; Computerization and Clobal Perspective, and Office Automation.
Ilardware Components: Basic organization and functional units of computers, Input
devices, Output devices, Central Processing Unit, Memory Devices, Basics of microprocessor.
Soft$,are Components: Types of software, System software, Application software; Introducing
Computer languages, Classification of computer language, machine language, Assembly language,
and high-level languages; Language translators - Interpreter, Compiler, and System Utilities.
Op€ratlng Systems: Introduction to Operating System and its Definition, Services, Component,
Associated Technology. Types of Operating Systems: Single User Systems, Multi-user System,
Graphical User Interface (GUl) Systems.
Computer Networks: Networking Basics, Uses of a lletwork, Simultaneous Access, Common 'l)pes
of Networks, Hybrid networks, Structure of networks, Network Topologies and protocols, Network
Media, Network Hardware; The Internet and World Wide Web, E-mail and Other Internet services.
Number Syst€m and Cod€: Binary, Decimal, Octal and Hexadecimal numbers, Conversions
between different number systems; Binary arithmetic, BCD and ASCII codes; Integer and Floating
number representation.
Loglc Gates and Boolean algebra: Different Types ofgates and their truth tables, Boolean
algebra, De-Morgan's theorem.
Computing Agents: Agents and Environments, Nature of Environments, structure of Agents;
Agent-based computing, micro-level and macro-level issues in agent-based systems; and the key
application areas for agent technologr.
Text Book:
1. Computer Fundamentals: M. Lutfur Rahman
Relerence Books
1. Introduction to Computers: Peter Norton
Computer Science: C.S. French.
Computer Science: Warford.
2.
3.
CSE 113 Structured Programming Language
75 Marlcs, 3 Credits, 3 Hours/lleek
Programming Language: Basic concept, overview of Programming Languages, problem Solving
Techniques and Data Flow Diagram.
c-Language: Preliminaries, Program constructs Variables and Data Types in c. Input and output.
Character and Formatted VO, Arithmetic Expressions and Assignment Statements, Loops and Nested
Loops, Decision Making, Arrays
Functions: Arguments and Local Variables, Calling Functions and Arrays. Recursion and Recursive
Functions, Structures within Structure.
Files: File Functions for Sequential and Random VO.
Pointers: Pointers and Structures, Pointer and Functions, Pointer and Arrays, Operation and Pointer,
Pointer and Memory Addresses.
Operations on Bits: Bit Operation, Bit Field, Advanced Features; Standard and Library.
Page 46
D€portnent of Co.rpder Scktce aM kBineei rg, Universiv of ChittasorE
Tut Book:
l.
Programming with C: Gottfried
Reference Books:
The C programming [anguage: B. Kernighan
Teach yourself C: H.lchildt.
C how to Program: Deitel & Deitel.
Programming in ANI|I C: L. Balagurushami.
l.
2.
3.
4.
& D. Ritchie.
CSE 114 Structured Progranrming Language Lab
50 Marks, 2 Credits, 4 Hours/V/eek
(Recommended but not limited to ,he
follo*'ing topics)
'.
Practice of writing different sinple program like area ofa circle, temperature conversion etcImplement Branching: The IF statement (break and continue statement), Branching: SWITCH
.
.
.
r
Irnplementation ofloopirg: FOR statement (break and continue)
Irnplementation of Loopir g: WHILE and DO WHILE statement
Irnplementation of Libraqr Functions
.
.
.
.
.
statement, GOTO statement
Irplement Argument
Pe
ssing and Value Receiving, Functions: Pass-by-value, Pass-by-
reference
Value Receiving Functiols: Command Line Parameter and Arrays: Initialization, Access,
Passing and Receiving
Arrays: 2D handling, Arfilys:, String Handling, Structure: Initialization, Access, Passing and
Receiving, Structure:, Union and Bit-fields
Irplementation of Structures and Sorting and Searching program
Compiler and Linker, Segment and Memory Model, Video Adapter, Modes, Graphics
Initialization, Graphics Functions
Write program for Pointtr handling, Text File Handling, Binary File Handling, Data File
Management
EEE 121 Electrical Engineering
75 Marks, 3 Credits, 3 Hours/\4'eek
D.C. Circuits: Fundamental El:ctrical Concepts and Measuring Units. D.C. Voltage,
Current,
Resistance and Power, Series, Parallel and Compound Circuit Analysis, Voltage and Current Divider
Rules, Kirchhoffs Laws, Mesh anrt Nodal Analysis, Star-Delta and Delta-Star Transformation.
Network Tbeorem: Superposition theorerr! Thevenin's theorem, Norton's theorenL Maximum Power
Transfer Theorem, Reciprocity Theorenq Millman's Theorern, Substitution Theorem.
Basic Passive Elements: Resistr,rs, Inductors and Capacitors in Series and Parallel, Transient in
Capacitive Network: Charging Ph.Lse, Discharge Phase; R-L Transients: Storage Cycle, Decay Phase.
Fundamentals of A. C. and the Basic Elements and Phasors: Generation of Altering Voltage and
Currents, The Sine Wave, General Format of Sinusoidal Voltage and Currents, Phase and Algebraic
Representation of Sinusoids, Average and RMS (Effective ) Values, Response of Basic R,L,C
Elements to a Sinusoidal Voltage and Currents, Frequency Response of Basic Elements, Resonance,
Average Power and Power Factor, complex Numbers, Rectangular and polar Forrn, Active and
Reactive Power, Series and Parallel Resonance Circuit, euality Factor, Selectivity.
Ts, Book:
1. Introductory Ctcuit Analysis: Robert L. Boylestad.
Reference Books:
1.
2.
Electrical Technology: B.L. Theraja.
Network Analysis, 3rd edition: M.E. Van Valkenburg.
D@artrr€nt of Conpder Soence dnd Engineenns, Uni!€rsty of Chittagong
3. Electronic Devices and Circuit Theory,4th Edition, PHI: Boylestad
4. Engineering Circuit Analysis: Hal & Kemmerly.
5. Altering Currgnt Circuits: Korchner & Corcorn.
DDn
Page
47
& Nashelsky.
n2 Electrical Engineering Lab
25 Marl<s, 1 Credit, 2 HoursMeek
(Recommended but not timited to the following topics)
.
.
.
.
.
.
.
MAT
Implementation of KirchhofFs Voltage & Current law
Maxwell Loop Current Technique using 2-3 Meshes and l-2 D.C. voltage sources
Verification of Supper Position Theorem using 1-2 D.C. sources.
Irnplementation of Thevenin's Theorem
Irnplementation of Norton's Theorem
Calculation of Current, Voltage and Power using Multi-meter.
AC Transient Analysis, R, R-L, R-C & R-L-C
131 Matrices, Vector Analyses and Geometry
75 Marl<s, 3 Credits, 3 Hours/Week
Matrices: Definition of Matrix, Different Types of Matrices, Algebraic Operations on Matrices,
Adjoin and Inverse of a Matrix, Rank and Elementary Transformations of Matrices, Normal and
Canonical Forms, Diogonalisation of Matrices, Solution of Linear Equations, Vector Spaces,
Characteristic Roots and Vectors.
Vector Analysis: Scalar and Vectors, Operation of Vectors, Scalar and Vector Product ofTwo, Thee
and Four Vectors-Their Applications, Vector Components in Spherical And Cylindrical Systems,
Derivative of Vectors, Vector Operation, DEL, Gradient, Divergence and Curl- Their Physical
Signifi cance, Vector Differentiation and Integration- Their Applications.
Geometry: Review of Equation for Straight Line, Circle, Parabola, Ellipse, Hyperbola, Pair of
Straight Lines, General Equation of Second Degree, Three Dimensional Co-Ordinates, Equation For
Planes, Spheres, Cylinda, Cone, Ellipsoid and Paraboloid.
Tut Books:
l.
2.
A Textbook on Geometry and Vector Analysis: Rahaman & Bhattacharjee.
A Textbook of Matrices: Santi Narayan.
Reference Books:
l.
2.
3.
4.
5.
6.
Vector Analysis: S.A. Sattar.
Geometry of Conic Sections: C. Smith.
An Elementary Treatise on Solid Geometry: C. Smith.
Analyical Coordinate Geometry: S.L. Loney.
A Treatise on Three Dimensional Geometry: J.T. Bell.
Vector Analysis: M.R. Spiegel.
Anallical
STA 151 Basic Statistics
75 Marks, 3 Credits, 3 Hours/Week
Introduction: Origin, History and Development of Statistics, Definitions Uses
&
Misuses of
Statistics. Concept of Population, Sample, Different Types of Variable and Scales of Measurements.
Collection and Summarization of Data: Collection of Primary Data - Questionnaire Method,
Tabular and Graphical Presentation of Data - Histogram, Frequency Curve, Ogive, Bar Diagranr, Pie
Chart, Tree Diagrarn
Measures of Locations: Different Measures
Applications.
-
AM, Median, Mode, Quantiles, Related Properties and
D@artrnent of Cqrputer Science and Er€in€efin3, UniversE of Chrttasong
Page 48
Measures of Dispassion: Differelrt Measures - Standard Deviation, Coefficient of Variation, Related
Properties and Applications, Mom3nts, Skewness and Kurtosis.
correlation Analyses: concept, Scatter Diagranl pearson's and Spearman's coefficient of
Correlation, Concept of Partial and Multiple Correlation, Their interpretations, Properries, and
Applications.
Regression Analyses: Concept or'Simple Linear Regression, Least Squares Method of Estimation,
interpretation and Properties, Cc,efficient of Determination and Its interpretation, Applications'
Concept of Multiple Regressions.
Text Book:
l. Fundamentals of Mar hematical Statistics: S.C. Gupta and V.K. Kapoor.
Reference Books:
I . An introduction to the lheory of Statistics: R.N. Shill & S.C. Debnath.
2. Methods of Statistics: tr{.G. Mostafa.
3. Theory and problems o'Statistics: Murry R. Spiegel.
4. Mathematical Statistics J.N. Kapoor & H.C. Saxena.
5. An Introduction to the theory ofProbability: Manindra Kumar Roy
6. Advanced hactical Staristics: S.P. Gupta.
7. Fundamentals ofProbability and Probability Distribution: M.K. Roy.
SECOND SEMESTER
CSE 211 Data Structures
75 Marks,3 Credits, 3 Hours/llteek
Basic: Basic Data Structues and R3presentation of Data. Data Structures Operations.
Linear Data Structwes: Arrays, llecords, Pointer, Linked Lists, Linked Lists with Sentinels, Stack
Queue, Dequeue and Priority Queur:, Recursion, Data Structues' Operations on Them.
Non Linear Data Structures
Trees: Binary Tree, Traversing Bir ary Trees, Inse ion Deletion and Searching, Binary Search Trees
B+ Trees, Indexing, Red-Black 'frees, Operations on Red-Black Trees, Heap, Heapsort, Heap
Property, Heapify, Building and Mr.intaining a Heap, Huffman's Algorithm, Binomial Heaps.
Graphs: Introduction to Graph, liequential and Linked Representation of a Graph on Memory,
Operations on Graph, Traversing a ,3raph,
Hashing Techniques: Characterisrics of Hash Functions, Collision Resolution, Probing Chaining
Perfect Hashing.
Data Structures for Disjoint Sets: Disjoint Set Operations, Linked List Representation of Disjoint
set, Disjoint Set Forests.
Augmenting Data Structures: Dy1amic order Statistics, How to Augment a Data Structure, Interva
Trees.
Searching and Sorting Techniques i r Different Structures.
T6t Book:
I
I
Data Structure: Silymour Lipschetz.
Reference Books:
I
2
3
4
5
6
Introduction to Algorithms: T. Cormen et. al..
Fundamentals of d{ta structures in C++: Ellis Horowitz & Sartaj Sahni Mehta.
Data structwes in (l: Tanenbaurn
Fundamentals of C cmputer Algorithms: Etlis Horowitz & Sartaj Sahni.
Data Structures an<[Algorithms: Aho, Hopcroft, Ullman.
Algorithms. : Robert Sedgwick
Depdrtrn€nt of Computer Science and Engineerins, Unrversity of Chittasong
Page 49
CSE 212 Data Structures Lab
25 Mart<s, t Credit, 2 Hours/lV'eek
(Recommended but not limited to the following topics)
'
.
.
.
.
r
'.
.
.
Testing ComParator
Sorting code ofbubble, selection, merge, insertion
Generator, Abstract generator, prime generator' get prime'
Linked list programming.
Stack irnplementation both sequential and linked list
Queue implementation both sequential and linked list
Implementation oftree, tree traversals.
Binary Search Trees: Bounded Depth Search Trees
Implementation of Heap, Heap sort
Irnplementation of Hashing
CSE 214 Engineering Drawing Lab
25 Marks, 1 Credit, 2 Hours/W'eek
(Recommended but not limited to the following topics)
Orthographic projection: Concept of axes, plane and quadrant, Scale drawing, Sectional view, Top
and side view Isometric views, Missing line, Auxiliary view, Pictorial views.
Drawing standard and practices: Interpenetrating of surface, Development of surfaces, Machine
drawings, and TechnicaI sketching.
Basic Concept of Computer Aided Design (CAD): Project on Engineering Drawing and CAD using
Contemporary packages in engineering drawing.
Recommended Books:
l. Descriptive Geometry: S. Salaby.
2. Technical Drawing: Fredrick E. Giessecke, Alva Mitchell.
EEE 221 Basic Electronic Devices and Circuits
75 Marks, 3 Credits, 3 Hours/Week
Theory of Semiconductors: Electronic Structure of The Elements, Energy Level, Energy Band
Theory of Crystal, Energy Band Diagram of insulator, Semiconductor and Metal, Free Electron
Theory, Bond Structure of Silicon and Germaniurn, intrinsic and Extrinsic Semiconductor, Fermi
Level, Concept of Hole, Carrier Densities, Generation and Recombination of Excess Carriers, Carrier
Life Time, Carrier Movement By Diffrrsion and Drift, Continuity Equation.
Semiconductor Diodes: The PN Junction, Biasing Conditions, V-I Characteristics, Half Wave and
Full Wave Rectification With Filtering, Clipping and Clamping Circuit, Zener Diode.
Bipolar Transistor: Junction Transistors, PNP and NPN Transistors, Principle of Operation, Biasing,
Characteristics in Different Conditions, Transistor Switching Time, DC and AC Load Line, Q Factor,
Transistor As a Circuit Element, Transistor Equivalent Circuit, Small Signal Low Frequency HParameter Model.
Field Effect Transistor: Construction of JFET, Characteristics and Principle of Operation,
Characteristics Parameters, FET Biasing.
MOSFET: Different Types, Operation, Characteristics Curve, DC Biasing of Depletion and
Enhancement Type MOSFET.
Other Semiconductor Devices: Transistor, SCR, UJT, DIAC, TRIAC, Photo Diode, Photo
Transistor, Solar Cells, LED and LCD.
Amplifier: voltage and curratt Amplifiers, Differential Amplifiers, operational Amplifiers
(Opamps), Linear Applications of OPAMP, Gain, input and Output Impedance'
Departrnent of Computer Science and EngrneerL€, Un$.,e6iv of Chittasons
Page
5O
integrated-circuit Logic Famjlies: Digital IC Terminology, TTL Logic Family TTL Series
characteristics, open-collector TTL, Tristate TTL, ECL Family, MoS Digital lcs, MoSFET, cMoS
Characteristics, CMOS Tristate L rgic, TTL-CMOS-TTL Interfacing.
Text Book:
I
Electronic devices E: circuit theory: Robert Boylestad & Louis Nashelsky.
Reference Books:
L
2.
3.
4.
5.
6.
7.
Electronic Devices and Circuits: Abraham Bell.
Digital Electronics: '[aub & Schilling.
Digital Fundamentals: Floyd.
Pulse, Digital and Srvitching Waveform: Millman & Taub.
Integrated Electronirrs: Millman & Halkias.
Electronic principle: Albert Paul Malvino.
Digital Electronics: lt.P. Jain.
EEE 222 Basic Electronic Devices and Circuits Latr
25 Marks, I Credit, 2 Hours/lV':ek
(Recomnended but not limited to lhe following topic$
.
'
o
o
o
.
o
o
Verification of Diode ctaracteristics using Forward and Reversed biased.
Applications of diodes in the Half Wave and Full wave circuits.
Verification of Commorr Based Transistor Characteristics for PNP and NPN
Transistor.
Verification of Commorr Emitter Transistor Characteristics for PNP and NPN
Transistor.
Verification of CommorL Collector Transistor Characteristics for PNP and NPN
Transistor.
Load-line and Output Characteristics using Common Emitter Connection
Design of Integrator and Differential Operational amplifiers using different gains
Design ofFirst order active filters circuit.
MAT 231 Calculus and Differential Equations
75 Marl<s, 3 Credils, 3
Hours/ll'eek
Differential Calculus: Function of Real Variable and Their Plots, Continuity and Differentiability,
Physical Meaning of Derivative of Function, Successive Derivatives, Leibniz Theorerq Roll's
Theorern, Mean Value Theorerq l'aylor's Theorem, Taylor's and Maclaurian's Series and Expansion
Functions, Maximum and MinimrLm Values of Functions of Two and Three Variables, Partial and
Total Derivatives.
Integral Calculus: Physical Mean ng of Integration ofa Function, Integration As An Inverse process
of Differentiation, Different Techniques of Integration, Definite Integral As The Limit of A Sum and
As An Area, Definition of ReimiLnn Integral, Fundamental Theorem of Integral Calculus and Its
Application To Definite Integraft;, Reduction Formula, Improper Integrals,- Double
Integration,
Evaluation of Areas and Volumes lly Integration.
Dilferential Equation: Definitior and Solution of ordinary Differential
Equations, First order
9.diTy Differential Equations, Second order Linear Differentiar equat'iom- iirh
coefficient. Initial Value probrems, Bessel's and Legendo's Differential
Equaiions.
constant
DeporEnent of Computer Scrence dnd Engineering, UnVeEit/ of Chittagong
Page 51
Text Book;
I
Differential Calculus: Das & Mulherjee.
Reference Books:
Calculus: Mohammmad & Bhattacharjee.
Ghosh & Maity.
Calculus:
Differential
Advanced Calculus: M.R. Spiegel.
Integral Calculus: Das & Mulherjee.
Integral Calculus: Mohammmad and Bhattacharjee.
Integral Calculus: Ghosh & Maity.
Integral Calculus: Md. Abu Yusuf.
l. Differential
2.
3.
4.
5.
6.
7.
PIJY 241 Electricity, Magnetism and Optics
75 Marks, 3 Credits, 3 Hours/ll'eek
Electromagnetism: Different Electrical Units, Coulomb's Law, Electric Field, Electric Potential and
Potential Function, Gauss's Law and Its Applications, Electric Dipole, Electric Field in Dielectric
Media, Ohm's Law Kirchhoffs Law with Applications. Faradays and Current Lenz's Law of
Electromagnetic Induction, Self and Mutual Induction, Biot-Savart Law, Magnetic Force on Change
and Current Ampere's Law, Alternating Voltage and Current and Their Graphical Representation,
Rms Value of A Cunent, AC Voltage and AC Current Applied To Circuits Containing Resistors,
Capacitors and Inductors.
Optics: Theories of Light; Interference of Light, Young's Double Slit Experiment; Displacements of
Fringes and Its Uses; Fresnel Bi-Prisnl Interference At Wedge Shaped Films, Newton's Rings,
Interferometers; Diffraction of Light: Fresnel and Fraunhoffer Diffiactiorq Diffraction by Single Slit,
Diffraction From a Circular Aperture, Resolving Power of Optical Instruments, Diffraction At Double
Slit & N-Slits-Diffraction Gratng; Polarization: Production and Analysis of Polarized Light,
Brewster's Law, Malus Law, Polarization by Double Refiactioq Retardation Plates, Nicol Prisrl
Optical Activity, Polarimeters, Polaroid.
Modern Physics: Atomic Model, Bohr Atorq Atomic Spectra, Photoelectric Effect, Corryton Effect,
De-Broglie Wave, Bohr's Atomic Model, Radioactive Decay.
Text Book:
Classical Mechanics: Gupta, Kumar
I
&
Sharma.
Reference Boo*s:
Classical Mechanics: Gold Stein.
Properties of Matter: Beginld J. Stephen.
The General Properties of Matter: Newman & Searle.
Heat and Thermodynamics: Brijlal.
Heat and Thermodynamics: T. Hossain.
Perspectives of Modem Physics: Arthur Bayser.
l.
2.
3.
4.
5.
6.
MAT
233 Discrete Mathematics
75 Marl<s, 3 Credits, 3 Hours/Llleek
Set Functions, Relations: Set, Set Operation, Functions, Relations and Their Properties, n-ary
Relations and Their Applications, Representing Relations, Closures of Relations, Equivalence
Relations, Partial Orderings.
Propositional Calculus: Propositions, Predicate and Quantifier.
Algorithms: Complexity, Divisions, Algorithm, Application of Number Theory.
Recursion: Sequences and summations, Recursive Defrnition and algorithrn
Combinatorial Analysis: Permutation and Combinatiort Divide and Conquer Algorithms,
Generating Functions, Inclusion-Exclusion.
D€partrnent of Computer Scierrce and Engirieerirrg Uni!€rsity of Chittasong
Page 52
Graphs: Representration, Isomlrphism, connectivity, Euler and Hamilton path, shortest path,
Planarity, Coloring.
Ilees: Introduction
to Trees, Application of Trees, Tree Traversal, Spanning Trees, Minimum
Spanning Trees
Itlathematlcal Induction: Mathematical Induction, Recursive Definitions and structural Induction,
Strong Induction.
Text Bookgj
1.
Discrete Mathematics and its Applications: Kenneth Rosen.
Reference Books:
1.
2.
5.
4.
Discrete Mathematics Structure with Applications to Computer S€ience: P. ftembly
R.Monohar.
Sets, Lattice and Boolean Algebra: J.C. Abbott.
Introduction to friscrete Mathematics: Alan Doer.
Discret€ Mathematics: O. Nicodemi.
&
ENG 271 English
75 tlarks, 3 Oedits, S lloursllVeek
Gramman Grammatical hincipl:s, Modals, Phrases & Idioms, hefixes & Suffixes, Sentence
Structures, Wh & Yes/ No Questions, Conditional Sentences.
Vocabulary: Technical & Scientinc Vocabulary, Defining Terms.
Spoken Dnglish: Introduction Tc Phonetic Symbols, Dialogue, Responding To Particular Situations,
Extempore Speech.
Reading: Comprehension of Technical & Non-Technical Materials-Skimming, Scanning, Inferring
& Responding To Context.
Technical Writing: Paragraph 8l Composition Writing On Scientific & Other Themes, Report
Writing, Research Paper Writing, Library References.
Professional Communicatlon: E usiness Letter, Job Application, Memos, Quotations, Tender Notice
Text Books:
l.
2.
Technical Writing: John M. Lennon.
A Practical English Orammar: A.J. Thomson & A.V. Martinet.
Reference Books,
l.
2.
3,
4.
Oxford llandbooli of Commercial Correspondence: A. Ashley.
Writing Scientific English: J. Swales.
Complete Course in English: Robert J. Dixson.
Dssentials of Busin€ss Communications: Bajendra pal & J. S. Korlahalli.
Derf;/tlrfgnt of Cc/ilputet
ScPJnce and Engneenrg, unMersry
of Chittasons
Page 55
TIIIRD SEMESTER
CSD 311Object Oriented Programming Language
75 ltarks, 5 Credits, S llourslweek
Introduction to Java: tlistory
of Java, Java Class Libraries, lntroduction to Java Programming,
A Simple Program.
Developing Java Application: Introduction, Algorithms, Pseudo code, Control Structure, The If
/Else Selection Structure, The While Repetition Structure, Assignment Operators, Increment and
Decrement Operators, Primitive Data Types, Common Escape Sequence, Logical Operator
Control Structure: lntroduction, The For Structure, The Switch Structure, The Do/while
Structure, The Break and Continue Structure.
Itethods: Introduction, Program Module in Java, Math Class Methods, Method Definitions, Java
API Packages, Automatic Variables, Recursion, Method Overloading, Method of the Applet Class.
Arrays : Introduction, Arrays, Declaring and Allocating Arrays, Passing Arrays to Methods, Sorting
Arrays, Searching Anays, Multiple-Subscripted Arrays
Object-Based Programming: Introduction, lmplementing a Time Abstract DataType with a
Class, Class Scope, Controlling Access to Members, Utility Methods, Constructors, Using Overload
Constructor, Using Set and Get Method, Software Reusability, Friendly Members, Finalizers, Static
Class Members, Data Abstraction and Information Hiding
ObJ€ct-Oriented Programming: Introduction, Superclasses and Subclasses, Protected
Members, Using Constructor and Finalizers in Subclasses, Composition vs. Inheritance,
Introduction to polymorphism, Dynamic method building, Final Methods and Classes, Abstract
Superclasses and Concret€ Classes.
String and Characters, Graphics, Exception tlandling, Files and Stream, Java API, Utility Classes,
2D Graphics, CUI, Swing, Events.
Tertbok;
l. Java 2i The complete
Referencc
reference: Patrick Naughton & H. Schildt.
boks:
1. Java How
to program: Deitel & Deitel. 2. Sun Java Tutorial.
CSE 512 Object Oriented Programming Language Lab
5O Mark,2 CYedits,4 tlourslWeek
(R€commended but not llmtted to the following toplcs)
naiting, compiling and executing a Java program usingjdk
)
) Generate the Fibonacci series and keep the Fibonacci terms in an array and print them
) nind out the prime numbers in a Fibonacci series
) Create a simple Student class, Convert Celsius to Fahrenheit
) Ovenide a method in the Student class
) Overloading a method in the Student class
) Exception Handling of Exp. 04
) Creating and executing simple Apptets
) Input from and output to a file
) Multi Threaded programming
) Implementing Simple Client-Server (Connection oriented and Connectionless)
Departrnqt of Cornpder Science and Engin€ei B, Universiv of Chittasong
Page 54
EEE 32lDigital Logic Desigrr
75 Marks, 3 Credits, 3 Hours/lreek
Codes, Logic Gates and Combinational Circuits. Standard/Canonical forms. Algebraic simplification,
the Karnaugh map method, Quine-McCluskey method.
Arithmetic Circuits: Adder circuit. Carry propagation, carry look-ahead adder. IC parallel adder. The
2's corplement addition and subh action system. The BCD adder. Binary multiplier
MSI Logic Circuits: Decodenl,
BCD-to-decimal decoders, BCD-to-7-segment decoder/driver.
Encoders. Multiplexers and nnrlti;rlexer applications. Demultiplexers.
Sequential Circuits: Flip-flops: !;R, JK D and T flip-flops. The D latch. Master-slave FF. Flip-Flop
applicatiors. Edge triggering; FF synchronization.
Counters and Registers: Asynclronous counter, Ripple counter, mod counters, Propagation delay,
Synchronous up/down counters- C ascading counters. Registers; Counter and Register applications.
Finite State Machines: Finite State machine models. Mealy machine, Moore machines. Machine
minimization.
TeBook;
l. Digital logic
and t;omputer design: Morris Mano.
Recommended Books:
l. Switching and Finite automata theory: Zvi Kohavi.
2. Digital systerns: R onald J. Tocci.
3. Digital Fundamentals: FloYd:.
EEn322 Digital Logic Design Lab
25 Marks, I Credil, 2 Hours/llzek
(Recommended but not limited to the following topics)
't
r
'
'.
'
'r
.
'.
'
Irplementation olBasic Logic Gates : AND, OR, NOT
Implementation ot Logic Gates : NOR, NAND, X-OR, X-NOR
Verification of De Morgan's theorem and Logic circuits
kplernent Half r'.dder & Full Adder Circuit
hplement of BC.) adder circuits,
Test & Verification of S -R, J- K T, D Flip-Flop circuit
Inplementation ol Asynchronous Up & Down counter
Inplementation o[ Synchronous Up & Down counter
Desigrr and Irpl(mentation of BCD counter.
Test of IC of Encoder & Decoder
Test of IC of Multiplexer and De-multiplexer
Operation of sevt:n segment display & Design of Digital Lock
Conversion of A,4) and D/A
MAT 331 Complex Variables, Laplace and Fourier Transformations
75 Marks, 3 Credits, 3 Hours/hreek
Complex Yariable: Complex Nu mber and Their Properties, Functions of a Complex Variable, Limit
and Continuity, Cauchy-Riernann Equations, Cauchy's Theorems, Singularity and Poles, Residues,
Simple Contour Integration.
Laplace Transformation: Defirition, Laplace Transformation of Different Functions, Sufficient
Conditions For Existence of Laplace Transformations, Inverse Laplace Transforrnations, Laplace
Transformations of Derivatives, Some Special Theorems on Laplace Transformations, Partial
Fraction, Convolution, Solution of Ordinary Differential Equations by Laplace Transformation,
Application to Differential Equations.
Page 55
Deportm€nt of Co'nputer Science and Engneenng Unlverslty of Chittasong
Fourier Transformations: Fourier Series, Convergence of Fourier Series, Fourier Analysis, Fourier
Transformations and Fourier Integrals.
T&
Books:
l.
2.
Theory of Mathernatics: Frank Ayres'
Mathematical PhYsics: RajPut.
Reference Books:
l. Complex Variable: M.R. SPiege[.
2. Functions ofa Conrplex Variable: B.S. Tyagi'
3. An Introduction to the Theory of Function ofa Cornplex Variable: E'T' Capson'
4. Theory ofFunction of Complex Variable: Shanti Narayan.
5. Complex Variable: V. Churchill.
6. Higher Engineering Mathematics: B.S. Grewall.
7. Mathematical Physics: RajPut.
8. Mathematical Physics: B.D. Gupta.
9. Laplace Transformation: M.R. Spiegel'
STA 351 Probability and Statistical Analysis
75 Marks, 3 Credits, 3 Hours/l eek
Elementary Probability Theory: Terminologies and Classical Definition, Additive and
Multiplicative Laws of Probability, Conditional Probability, Bayes Theorem, Joint and Marginal
Probabilities. Random Variables, Discrete & Continuous Random Variable Expectation and Variance,
Moments and Moment Generating Function. Determination of Confidence interval.
Probability Distributions: Binomial, Geometric, Exponential, Poisson
&
Normal Distributions,
Theorems and Properties ofThe Probability Distribution and Their Applications.
Random Variables and Stochastic Processes, Discrete Time and Continuous Time Markov Chain,
Birth-Death Process, Queuing Models - l[VMll, WM/llK, M/G/I, Open and Closed Queuing
Network. Application of Queuing Models and Network.
T&
Book:
l. Introduction
to Probability Models: Sheldon Ross.
Reference Books:
l.
2.
3.
A first course in probability: Sheldon Ross.
Probability, random Variables and Stochastic Process: Papoulis.
Probability Models for Computer Science: Sheldon Ross.
ECO 381 Economics
75 Marks, 3 Credits, 3 Hours/Il'eek
Basic Concepts of Economics: Definition and Subject Matter of Economics; Microeconomics Vs
Macroeconomics; Law of Economics; Central Economic Problems of Every Society; Different
Economic Systems; Economics and Engineering. Concept of Microeconomics and Macroeconomics.
Theory of Demand, Supply and Consumer Behavior: Law of Demand; Demand Schedule and
Demand Curve; Supply Law, Supply Schedule and Supply Curve; Shift in Demand and Supply;
Equilibrium in The Market; Elasticity of Demand and Supply; Marshallian Utility Analysis; total and
Marginal Utility; Law of Diminishing Marginal Utility; Law of Equi-Marginal Utility.
Theory of Production and Costs: Meaning of Production; Factors of Production; Production
Possibility Frontier; Law of Variable Proportion; Retums to Scale; Isoquants; Concepts of total,
Average and Marginal Costs, Fixed and Variable Costs; Isocost Curve; Least Cost Combinations of
Factors.
Page
5t
Linear Programming and input-Output Analysis: Meaning of Linear Programming; Its
Components; Duality of A Problem in Linear Programming; Graphical, Feasible and Optimal
Solutions; The Simplex Methorl; Meaning of input-Output Analysis; inpurouQut Analysis Model;
Balance Equation; Coefficient lvlatrix; Determination of Final Demand Vector.
Development Planning in Banl;ladesh: Need For Planning in Bangladesh; Various Five Year Plans
in Bangladesh; Development Strrtegies in The Five Year Plans of Bangladesh.
Text Book:
1. Economics: Blrons
&
Stone.
Reference Books:
l.
2.
3.
4.
Economics: Semuelson & Nordhous.
Modern Economic Theory: K. K.Deweft.
Advanced Economic Theory: H. L Ahuja.
Government ofBangladesh Various Five Year Plans.
Deparfir€nt ofComputer Scbrce at'd
hginee E,
Universlry
af Chiftagon1
?age
57
FOURTH SEMESTER
CSE 41l Design and Analysis of Algorithms
75 Marks, 3 Credits, 3 Hours./lVeek
Foundations: The Role of Algorithms in computing, Analyzing and Designing Algorithms, Time
and Space Complexity, Growth Of Functions. Notations For Describing Growth OfFunctions.
Recurrences: The Substitution Method, The Recursion-Tree Method, The Master Method, Proof Of
The Master Theorem.
Divide
&
Conquer Method: Binary Search. Finding The Maximum and Minimum. Merge Sort,.
Quicksort and Randomized Quicksort and Their Anallic Comparison.
The Greedy Method: Knapsack Problem. Minimum Cost Spanning Trees :Prim and Kruskal's
Algorithms. Single Source Shortest Paths - Dijkstra's Algorithm.
Dynamic Programming: Single Source Shortest Paths - Bellman-Ford Algorithm. All Pairs Shortest
Paths. 0/l Knapsack Problem. Matrix Chain Multiplication and Longest Common Subsequence
Algorithms.
Graph Algorithms: Breadth Ffust and Depth First Search in Graphs, topological Sod, Strongly
Connected Components,
Theory Of NP-Completeness. Coping with NP-Hardness. Approximation Algorithms. Heuristic
Algorithms,
TN
BooK:
l. Introduction
to Algorithms: T. Cormen et. al..
Reference Books:
1.
2.
3.
4.
Fundamentals of Computer Algorithms: Ellis Horowitz & Sartaj Sahni.
Algorithms: Robert Sedgwick.
The algorithm design manual; Steven Skiena.
Introduction to the Design and analysis of Alogrithms: Goodmann.
CSE 412 Design and Analysis of Algorithms Lab
50 Marl<s, 2 Credits, 4 Hours/Week
(Recommended but not limited to the following topics)
.
.
.
.
.
.
.
.
.
.
r
.
Link list Experiment : (a) Add and (b) Delete data from link lisr
Stack : (a) Add and (b) Delete form the stack.
Queue : (a) Add and (b) Delete the item from the queue
Binary Search Tree.
Sorting experiment using Quick Sort AJgorithms.
Sorting experiment using Merge Sort Algorithms.
Search experiment using Depth-first search method.
Search experiment using Breadth-first search method.
Inrplement minimum spanning tree using Krusral Algorithms.
Implement minimum spanning tree using prim Algorithms.
Calculate the shortest path using Dijkstra Algorithms.
Implement B Trees Algorithms.
CSE 413 Database Systems
75 Marks, 3 Credils, 3 Hours/Week
lntroduction:
Purpose of Database Systems, Data Abstraction, Data Models, Instances and Schemes,
Data Independence, Data Definition Language, Data Manipulation Language, Database Manager,
&parfnent oFcornputer
Sclerrce dnd ErgJne{:nng Unryersry of Chittagons
Page 58
Database administrator, DatabasJ Users, Overall System Structue, Advantages and Disadvantage
ofa
Database Systems. Data Mining and analysis, Database Architecture, History of Database Systems
Relationship Entity-Model: Entities and Entity Sets, Relationships and Relationship Sets, Attributes,
composite and Multivalued Atrributes, Mapping constraints, Keys, Entity-Relationship Diagram,
Reducing of E-R Diagram to Ttbles, Generalization, Attribute Inheritance, Aggregation, Alternative
E-R Notatios, Design of an E-R l)atabase Scheme.
Relational Model: Structure ol Relational Database, Fundamental Relational Algebra Operations,
The Tuple Relational Calculus, l'he Domain Relational Calculus, Modifuing the Database.
Relational Commercial Language: SQL, Basic structure of SQL eueries, euery-by-Example,
Quel., Nested Sub queries, Conplex queries, Integrity Constraints, Authorizatioq Dynamic SeL,
Recursive Queries, Overview of .,L/SQL.
Relational Database Design: Pi.falls in Relational Database Design, Functional Dependency Theory,
Normalization using Functiona. Dependencies, Normalization using Multivalued Dependencies,
Normalization using join Dependencies, Database Design Process.
File and System Structure: Orerall System Structure, Physical Storage Media, File Organization,
RAID, Organization of Records into Blocks, Sequential Files, Mapping Relational Data to Files, Data
Dictionary Storage, Buffer Manatlement.
Indexing and Hashing: Basic Concepts, Ordoed Indices, B+ -Tree Index Files, B-Tree Index Files,
Static and Dynamic Hash Functi:n, Comparison of Indexing and Hashing, Index Definition in SQL,
Multiple Key Access.
Query Processing and Optimizrtion: Query Interpretation, Equivalence ofExpressions, Estimation
of Query-Processing Cost, Estimation of Costs of Access Using Indices, Join Strategies, Join
Strategies for parallel Processin;3, Structure of the query Optimizer, Transformation of Relational
Expression
Concurrency Control: Schedules, Testing for Serializability, Lock-Based Protocols, TimestampBased Protocols, Validation Ter;hniques, Multiple Granularity, Multiversion Schemes, Insert and
Delete Operations, Deadlock Handling.
Distributed Database: Structure of Distributed Databases, Trade-off in Distributing the Database,
Design of Distributed Databas,:, Transparancy and Autonomy, Distributed Query Processing,
Recovery in Distributed Syste,ms, Commit Protocols, Concurrency Control, Shared Server
Configuration.
Data Mining: Data analysis anc. OLAP, Data Warehouse, Data Mining, Overview of Data Mining
Techniques Information Retrieval and Structured Data. Basic of Ontology.
Administrative Functionalities: Architecture of a Database, Concept of Physical and Logical
Databases Tablespaces, D,rtabase Creation, Maintaining Data Dictionary, Database
Backup./Recovery, Database maintaining and Performance Tuning, Data Guard- Physical, logical and
Standby Database.
Tul Book:
l.
Database System (loncepts (5th edition): Abraham Silberschratz, Henry
K. Korth,
Sudarshan.
Reference Books:
l. OCA Oracle l0g ,a dministration l, BpB publications: Chip Dawes, Bob Bryla
et al.
2. Fundamentals of Database Systems 1994: Benjamin/Cummings.
3. Database Principler;, Programmi ng, 1994. performance: Morgin Kaufmann.
4. A First Course in fratabase Systems, 1997: prentice Hall.
5. Database Managenrent Systems, 1996: McGraw Hil[.
6. Data Mining conctpts and Techniques: Jiawei Han, Micheline Kambsr.
Jian pei.
S.
Page 59
D@artrnent of Computer Science dnd Engin€ering Unrversity of Chittogons
CSE 414 Database Systems Lab
50 Marlrs, 2 Credits, 4 Hours/Week
(Recommended but not limited to the following topics)
'
'.
.
.
.
.
.
.
.
r
.
Basic introduction of different types of DBMS software
Irnplementation ofbasic SQL commands to create and delete tables
Implementation of basic SQL commands for inserting data
Implementation of SQL Commands to modify table structure
Implementation of SQL Commands to modiS table structure data
Case implementation of different queries using SQL
Case production of different queries using SQL
Case implementation & production of different queries using SQL
Advanced SQL commands to implement referential integrity
Advanced SQL commands to implement referential triggers
Demonstrations ofdatabase connectivity of different database server using ODBC
Design ofuser interface to connect to the database server
CSE 4f 5 Microprocessors
75 Marks, 3 Credits, 3 Hours/Week
Information Representation, Measuring Performance.
instructions and Data Access Methods: Operations and Operands of Computer Hardware,
Representing instruction, Addressing Styles.
Arithmetic Logic Unit (ALU) Design: Arithmetic and Logical Operations, Floating Point
Operations, Designing ALU.
Processor Design: Datapaths-Single Cycle and Multicycle Implementations.
Control Unit Design - Hardwared and Microprogrammed, Hazards, Exceptions, Pipeline: Pipetined
Datapath and Control, Superscalar and Dynamic Pipelining.
Memory Organization: Cache, Virtual Memory, Channels, DMA and interrupts, Buses.
Multiprocessors: Types of Multiprocessors, Performance, Single Bus Multiprocessors,
Multiprocessors Connected By Network, Clusters.
TdBook:
1. Intel microprocessors: Architecture, Programming and Interfacing: Berry
& Brey.
Reference Books:
l.
2.
3.
4.
Microprocessor and System Design: Gibson & Cheu.
Microprocessor and Computer based System Design: Md. Rafiquzzaman.
Microprocessor Fundamentals: Tokhein.
Microprocessor and Interfacing: D.V. Hall.
CSE 416 Microprocessors Lab
50 Morks, 2 Credits, 4 Hours/lleek
(Recommended but not limited to the following topics)
.
.
r
.
.
.
Introducing 8086 (MDI) Trainer Board.
Executing simple instmctions in the Trainer Board.
Parity generation and checking (for both single and double dimensional)
CRC generation and checking (8 bit or 16 bit).
8255 Interface from Microprocessor Trainer Board.
8259 Interface from Microprocessor Trainer Board.
Dep.rtnt€nt of Cornputer Sci€rrce ard Ensine(ring Univ€tsiv of Chinasong
r
r
.
.
r
.
Page
6O
Introducing Ass:mbly language programming environment.
Execute a simpl: Assembly program.
Write an assemtrly language program which outputs a lKHz Square wave on D0 of
port FFFAH.
Stepper Motor Control using Microprocessor Trainer Board and pC.
Emulate a printe: using computer parallel port.
500 micro-sec dtlay on 8086 with 33 or 5 MHz clock.
MAT
431 Numerical Methods
75 Marlrs, 3 Credits, 3 Hoursilleek
Errors in Numerical Calculations, Solutions of Non-Linear Equations, interpolation, Curve Fitting,
Numerical Differentiation and integration. Solutions of Ordinary Differential Equations, Solving
Systems of Linear Equations. Sinrplex Method. Linear Programming.
T&Book:
1.
Applied Numerical arralysis: Gerald & Whitney.
Reference Books:
1
2
3
NumericalMethod:,3alagnrrsamy.
Information Technology and Numerical Method: Kahate.
Numerical Method For Engineers: Chapra.
MAT 432 Numerical Methods Lab
50 Marks, 2 Credits, 4 Hours/V,7eek
(Recommended but not limited lo the following topics)
.
.
.
.
.
.
Assignments on h'eMon forward /backward, Lagrange's interpolation.
Assignments on ;rumerical integration using Trapezoidal rule, Sinrpson's 1/3 rule,
Weddle's rule.
Assignments on rumerical solution of a system of iinear equations using Gauss
elimination and Gruss-Seideliterations.
Assigments on numerical solution of Algebraic Equation by Regular-falsi and
NeMon Raphson :nethods.
Assignments on oldinary differential equation: Euler's and Runga-Kutta methods.
Introduction to Software Packages: Matlab / Scilab / Labview / Mathematica
D€partment of Computer ScEnce and Engineering Unlversity of Chittagong
Pa
ge 61
FIFTH SEMESTER
CSE 5Il Operating Systems
75 Marks, 3 Credits, 3 Hours/lleek
Introduction: operating Systems concept, computer system structures, operating
System
Structures, Operating System Operations, Protection and Security, Special-Purpose Systems.
Fundamentals
of OS: OS
Services and Components, Multitasking, Multiprogramming, Time
Sharing, Buffering, Spooling.
Process Management: Process Concept, Process Scheduling, Process State, Process Management,
interprocess Communication, interaction Between Processes and OS, Communication in Client-Server
Systems, Threading, Multithreading, Process Synchronization.
Concurrency Control: Concurrency and Race Conditions, Mutual Exclusion Requirements,
Semaphores, Monitors, Classical IPC Problem and Solutions, Dead Locks - Characterization,
Detection, Recovery, Avoidance and Prevention.
Memory Management: Memory Partitioning, Swapping, Paging, Segmentation, Virtual Memory Concepts, Overlays, Demand Paging, Performance of Demand Paging, Page Replacement Algorithrrl
Allocation Algorithms.
Storage Management: Principles of I/O Hardware, Principles of I/O Software, Secondary Storage
Structure, Disk Structue, Disk Scheduling, Disk Management, Swap-Space Management, Disk
Reliability, Stable Storage Implementation.
File Concept: File Support, Access Methods, Allocation Methods, Directory Systems, File Protectiorq
Free Space Management
Protection & Security : Goals of Protection, Domain of Protection, Access Matrix, Implementation
of Access Matrix, Revocation of Access Rights, The Security Problem, Authentication, One-Time
Passwords, Program Threats, System Theats, Theat Monitoring, Encryption, Computer-security
Classification.
Distributed Systems: Types of Distributed Operating System, Communication Protocols, Distributed
File Systems, Naming and Transparency, Remote File Access, Stateful Versus Stateless Service, File
Replication.
Case Studies: Study ofA Representative Operating Systerns,
T*t
Book:
Operating System Concepts (7th Edition), 2000: Silberschatz & Galvin Wiley.
l.
Reference Books:
l.
2.
3.
Operating System Internals: William Stallings.
Operating Systems Design & Implementation: Andrew Tanenbang Albert S. Woodhull
Pearson.
Modern Operating System: Andrew S. Tanenbaum.
CSE 512 Operating Systems Lab
50 Marks, 2 Credit, 4 Hours/ll/eek
(Recommended but not limited to the following topics)
.
.
.
.
.
.
.
.
Irplementation of System Calls
Implementation of I/O System Calls
Simulation of I,NIX Commands
knplementationofFCFS Scheduling
knplementation of SJF Scheduling
Implementation of Priority Scheduling
Implementation of Round Robin Scheduling
Inter Process Communication Using Shared Memory
D€parfnent of Comgjter Science and ErEir€enr g,
.
.
.
.
Page 62
UnrveJsrty of Chrttagong
Inter Process ,lommunication Using Message Queues
Producer Consumer Problem Using Semaphores
Memory Manlgement Schemes - I
Memory Manlgement Schemes - II
CSE 513 Data Communication
75 Marlrs, 3 Credits, iHours/lVzek
Synchronous
and
Asynchrorrous Communications: Hardware interfaces, Multiplexas,
Concentrators and Buffers, Comm:nication Mediums and Their Characteristics;
Data Communication Services: S,ONET, ISDN, SMDS and ATM;
Error Control
Codes: Linear Block Codes, Cyclic Codes, MLDC Codes, Convolution Codes, Trellis
Code Modulation; Switching Systtms: Space and Time Division Switching;
Digital Switching Technologies: .{TM Switches, Signaling System 7(SS7); Radio System Designl
Fiber Optics Communication: T ransmitter, Receives, Network Components, WDM; Line Coding,
Trunks, Multiplexing; VSAT;
Satellite Communication: Frequency Bands and Characteristics, Types of Satellites, Multiple Access
Techniques;
Cellular Communications: FDM.{, TDMA, GSM, CDMA GPRS, EDGE.
T&Book:
l.
Data Commurjcation and Networking, Mccraw
Hill: Behrouz A. Forouzan.
Reference Book:
l.
Data Commurication Technology: James Martin.
CSE 514 Data Communication Lab
25 Marks, I Credit, 2 Hours/week
(Recommended but nol limited lo
.
.
,
the following topics)
To study different types of transmission media
a. Familiarization with Networking cables (CAT5, UTP), Connectors (RJ45, Tconnector), Hubs, Switches. b. Configuration ofa tlUB/Switch.
PCto-PC Communication with the Data Communication Trainers for
- File Transfer.
- Error detection c rdes, Data Encryption etc.
Experiments using LAN Trainer kit for
- Point-to-Point (lommunication
- Multicast/Broa,lcast Communication
'
.
- Data Encryptio r and security protocols
To make inter-conlections in cables for data communication in LAN and install
LAN
using (a) Tree topology (b) STAR topology (c) Bus topology (d) Token-Ring
topology
Srudy of MODEI\{s: (a) configure the modem of a computer (b) Study Serial
Interface RS-232 and its applications (c) study the parallel Interface and its
applications
Departrnent of Computer Science and Engineering Unvelsit/ of Chittdgong
Page 65
CSE 515 Software Engineering and Design Pattern
75 Marl<s, 3 Credits, 3 Hours/ll'eek
Introduction: Attributes ofGood Software, Professional Software Development, software
rigine".irrg, Software Engineering Diversity, Software Engineering Ethics, Approaches of Software
Engineering
Lifecycle
soiroare i"o""..".' Concepts of Software Process Models or Software Development
Incremental Model, Spiral
6Ol-Cl, predictive SDLC, Adaptive SDLC, Waterfall Model, Iterative and
Model, Prototyping, Agile Model
r"o.ifiUry Stuay:-iro[tem Definition Document (PDD), Format of PDD, Data Flow Diagram (DFD)
of a sy.t"m, Ctst of Software Development, Feasibility Study, operational Feasibility study,
Technical Feasibility Study, Economical Feasibility Study, Feasibility Study Report
Project Management: tioject Management Concept, Responsibilities of Project Manager, Risk
Maiagement: {isk ldentificition, Risk Analysis, Risk Planning, Risk Monitoring, Managing People,
Motiv-ating People, Teamwork, selecting Group Members, Group organization, Group
Communication
Project Plan ng: Project Planning Concept, Software Pricing, Plan-Driven Development, Project
plans, The Planning Process, Project Scheduling, Schedule Representation, Agile Planning,
Estimation Techniques
Requirement Engineering: Requirement Engineering Concept, Functional and Non-Functional
Requirements, The Software Requirements Document, Requirement Specification, Requtement
Engineering Processes, Requirements Elicitation and Analysis, Requirement Discovery, Interviewing.
Scenarios, Use Cases, Ethnogaphy, Requtement Validation, Requirement Management
System Modeling: System Modeling Concept, Context Models, Interaction Models, Structural
Models, Behavioral Models
Architectural Design: Architectural Design Concept, Architectural Design Decisions, Architectural
Views, Architectural Patterns, MVC Architecture, Layered Architecture, Tkee Tier A.rchitecture,
Repository Architecture, Client-Server Architecture, Pipe and Filter Architecture, Application
Architecture
Design and Implementation: Design and Implementation concept, Object-Oriented Design using the
llML, System Context and Interactions, Object Class Identification, Design Models, Interface
Specification
Design Pattern: Concept of Design Pattern, Benefits of Design Pattems, Classification of Design
Pattern: Creational Design Pattern, Structural Design Pattern, Behavioral Design Pattern, Concept of
Singleton, Factory, Decorator. Adapter, Proxy, Fagade, Strategy, Composite and Observer Design
Pattem
Software Testing: Concept of Software Testing, Stages of Testing : Development Testing, Release
Testing, User Testing
Text Book:
Software Engineering: I. Sommerville.
Reference Books:
Software Engineering: Principles and Practice written by Waman S Jawadekar
A Practitioner's approach: R. Pressrnan & Software Engineering
Java Design Patterns, A Programmer Approach : Pankaj Kumar
Object-Oriented Analysis and Design Using UML : Mahesh P. Matha
Java: How to Progranq 8th Edition, written by Paul Deitel and Harvey Deitel
I
I
2
3
4
5
CSE 516 Software Engineering and Design Pattern Lab
50 Marl<s, 2 Credits, 4 Hours/week
(Recommended bul nol Am ed lo the following topics)
Preparation of Problem Definition Document for standard application problems in standard
format.(e.g Library Management Systerq Railway Reservation systerrq Hospital management
Syster[ University Admission system)
l.
Page 64
D@artneflt of Cornpute{ Sci€nc€ drd Ergine€nng Unilersry of ChrttagoB
2.
3.
4.
5.
6.
7.
Preparation
Preparation
Preparation
Preparation
ofFeasibilit'l Report ofthe system
Project Planning Document
of Software Requtement Specification (SRS) Report
of Design Dccument using Use case Diagranq Activity Diagram, class Diagram
and Sequence Diagram
Building the System emg,loying Architectural Pattern and Design pattern
Design Test Script/Test I,lan(both Black box and White Box approach)
CSE 517 Computer Architecture
75 Marks, i Credits, 3 Hours/ tileek
Introduction: Computer Orgarization and Architecture, Structure and Functions, Why
Computer Organization and Architecture?
Computer Evaluation and ['erformance:
A Brief History of
Study
Computers, Designing for
Performance. Pentium and PowerPC Evaluation
Top-Level View of Computer Function and Interconnection: Computer Components, Computer
Function, Interconnection Structures, Bus Interconnection, Peripheral Component Interconnect (PCI),
Design a Simple Computer
Processor Logic Design: Processor Organization, Arithmetic Logic Unit, Design of Arithmetic
Circuit, Design of Logic ctcuit, ))esign of Arithmetic Logic Unit, Status Register Design of shifter,
Processor unit
Control logic Unit: Concept of (lontrol Logic Unit, Conhol Organization, Designing Control Logic
Unit
Memory Organization: Characteristics of Memory Systems, Memory Types, Performance and Cost,
Access Modes, Memory Retenti cn, Other Characteristics of Memory, Random Access Memory
(RAM), RAM Organization, Serniconductor RAMs, RAM Desigrr, Memory System, Multilevel
Memories, Cache: Cache Memory Principles, Cache Organization
Multiprocessor: Characteristics of Multiprocessors, Interconnection Structues, Intsrprocessor
Arbitration, Interprocessor Commrtnication and Synchronization
Text Book:
Computer Organization & Architecture: William Stallings.
Reference Books:
Computer System Architecture: M. Morris Mano.
Digital Logic and Conrputer Design : M. Morris Mano
Computer Organization: V.C. Hamacher, Z.G. Vranesic & S.G. Zaky
Computer Architectur,: and Organization: J.P. Hayes.
Structured Computer Organization: A.S. Tanenbaum.
Computer System Architectue: M.M. Mano.
Computer Architecturt:: Whang.
I
l.
2.
3.
4.
5.
6.
7.
CSE 519 Ethics and Cyber La,r
75 Marks, 3 Credits, 3 Hours/Ileek
Introduction of Cybercrime: Wha: is cybercrime?, Forgery, Hacking, Software Piracy, Computa
Network intrusion.Category of Cybercrime: how criminals plan attacks, passive attack, Active attacks,
cyberstalking. Cybercrime Mobile <t Wireless devices: Security challenges posted by mobile devices,
cryptographic security for mobile devices, Attacks on mobile/cellphones, Theft, Virus,Hacking.
Bluetooth; Different viruses on hptop.Tools and Methods used in cyber crime:proxy servers,
panword checking, Random checking, Trojan Horses and Backdoors; DOS & DDOS attacks; SeL
injection: bufferover flow.Phishing & Identity Theft: Phising methods, ID Theft; Online identity
method.Cybercrime & Cybersecurit y: Legal aspects, indian laws, IT act, Public key certificate
tkpartrnent of Computer Science and Engineenng Unlversiv of Chiltagong
Page 65
Text Book:
l. Cyber security: Nina Gobole & Sunit Belapune; Pub: Wiley India
Reference Book:
I. Cyber law text & cases: Gerald R. Ferrera.
ACC 59f Accounting and Management
75 Marks, 3 Credits, 3 Hours/lleek
Introduction: Meaning Nature, Evaluation, Frurctions, Principles of Management, knpact of Environment On
Management.
Planning: Meaning Importance Types- Premises-Limitation of Planning.
Organization: Theory and Principle ofOrganizing- Division of Works-Decentralization- Span ofManagemenlDalyation of Authority-Committee- Decentralization-Coordination-Conholling.
Personnel Management: Meaning, Importance, Scope, Functions of Personal Management: Motivation,
Participation Managemenq Selection, Promotion-Training, Wages and incentives. Groups-Management of
Organizational Change and Confl icts-Leadership.
Cost & Financial Management: Elements of Costs of Products {alculation of Cost of Production-Cost
Volume- Profit Anal)sis- Relevant Cost For Decision Making, Budget and Budgetary Control.
Marketing Management: Concept-Natue-Function-Marketing, Mix Stralegy, Patents Law.
Technology Management: Management of innovation, Technology Life Cycle.
industrial Law in Bangladesh: Factories Act, industrial Relation Ordinance, Workmen's Compensation Act.
Principles of Accounting: Transactions, Ledger Books, Cash Book, Accounting hocedures, Trial Balance,
Financial Statements, Single Entry Slstem, Company Final Accounts.
Teg Books:
I
2
Management: Robbins.
Management: Griffin.
Reference Books:
l.
2.
3.
4.
Advanced Accounting: Md. Muinuddin Khan.
Bangladesh Labor and Industrial Law: Prof. A.A. Khan.
Cost accounting- a managerial emphasis: Horengren.
Marketing Management: Kotler.
De-partrr'€nt of CoinFder Science and Engine€riE, i_lnivelsity of Ch,ttogong
Page 66
SIXTH SEMESTER
CSE 611 Computer Interfacirrg and Microcontroller
75 Marks, 3 Credits, 3 Hours/ll'eek
Interface Components and Their Characteristics, Microprocessor UO. Microprocessor Bus Signals.
Hardware and Software Intemrpt r\pplicatiors.
Digital Interfacing: Programminll Parallel Ports and VO Handshaking. Interfacing Microprocessor to
Keyboards, Interfacing to Alphanumeric Displays. SCSI. Serial Interface Principles, Asynchronous
and Synchronous, RS232 and EIA.562 Standards.
Analog Interfacing and Control: Op-Amp Characteristics and Circuits, Sersors and Transducers.
D/A and A,/D Converters - T)?es r)perations, Interfacing and Applications.
PCI, ISA Architectures.
Microcomputer System Periphelals: Microcomputer Displays, Computer Vision. Disk Data Storage
Systems. Disk Controllers and Inttrfaces, Magnetic Disk Format, Organization and Head Positioning.
Optical Disks - Optical Positionirg, CD-ROM and DVD Disks. Printer Mechanism and Interfacing.
Speech Synthesis. Barcode.
Texl Book:
Microprocessors and irrterfacing: Hardware and Software: Dauglas V. Hall.
l.
Reference Book:
Computer peripherals: Barry M. Cook.
2.
CSE 6f 2 Computer Interfacing and Microcontroller Lab
25 Marks, 1 Credit, 2 Hours/We ek
(Recommended but not limited to the following lopics)
. Demonstration of TriLiner Board
o Reading data from T;ainer Board to Computer.
o
o
o
o
o
o
o
o
o
.
Write data from corputer. Trainer Board
Design and implemerrt of an IC tester
Design and implement ofan Transistor tester
Design and implemerrt of an Water Level controller
Serial data transfer through port between computers
Parallel data transfer through port between computers
Audio data reading
Audio data Writing
Control ofdigital vol.age
Traffic conkol
CSE 613 Computer Networks
75 Marks, 3 Credits, 3 Hours/W,zek
Introduction to computer Networl:s. Network Protocol Hierarchies, overview of oSI and rcp,{p
Models; topologies, Medium Acc:ss Control Protocols -csMA/cD, token Ring and FDDI. Data
Liink control, HDLC; DLL In Inr ernet; DLL of ATM; LAN protocols: Standar-cl g02.+, Switches,
Hubs and Bridges, FDDI, Fast Ethemet.
Internetworking: Network Interc,)nnection, Routing Algorithms, Multicasting, Flow control;
congestion control, Fragmentation, Firewalls Ipv4, Ipv6, ARp, RARP, Mobile Ip,-Network Layer
of
ATM. Transport Protocols, Transntission Control Protocol: Connection Management, Transmission
Policy UDP' Domain Name Systern and Name Servers. Distributed Applicatilons:
si'mpte Networt
Management Protocol, Telnet and I'Tp, Electronic Mail, I SMTp and
MIME, The www_client and
tkpartrnent of Cornputer Science and Engir€ering, unversry of ChiftaSon3
Page
67
Servers, Network Security: cryptography, DES, IDEA, Public Key Algorithm; Authentication:
Digital Signatures.
Text Book:
1. Computer Network: Andrew S' Tanenbaum'
Relerence Books:
1. Computer Networking: A top down approach: Kuross'
t-ocai Area Networks and Distributed Processing: James Martin'
3. Locat Area Network: Johan E. McNamara.
4. Computer Networks and their Protocols: D'W' Davies'
2.
CSE 614 ComPuter Networks Lab
25 Marla, I Credit, 2 Hours/Week
(Recommended but ,tot lir?riled to lhe following topics)
Study of Wfuing TechnologY
Install and Confrgure Network Cards
Socket Programming
Inrplement Routing Protocols in C and Install and Configure Server
.
.
o
o
o
.
.
o
o
.
.
o
Install and Configure DHCP & DNS
Install and Configure Domain Controller
Install and Configure Web Server and Proxy Server
Install and Confrgure Mail Server
Install and Configure Samba
Testing and Troubleshoot Internet
Local Area Networks Design.
Wide Area Network Design
CSE 615 Web Engineering
75 Marks, 3 Credits, 3 Hours/Week
\Yeb Application: lnhodrction to Web Engine€ring, Requirements Engineoing and Modeling Web
Applications, Web Application Architectues, Technologies and Tools for Web Applications, Testing ard
Maintenance of Web Applications, Usability and Perforrnance of Web Applications, Security of Web
Applications,
The Semantic Web: Vision of Sennntic Web, Architecture of Senrantic Web, Ontology, Ontolog/
Leaming Ontology Integration, Ontology Populatioq Ontology Representation l,anguag+ RDF, OWL,
Linked Open Data.
T*,
Book:
Web Engineering - The Discipline of Systematic Development of Web Applicatiors
Editors: Gerti Kappel, Birgit Prdll, Siegfried Reich, & Wemer Retschitzegger: .
l.
Ref*ence Books:
L
2.
3.
4.
5.
Web Engineering: A Practioner's Approach: Roger Pressman & David Lowe.
MIT Open Course Materials for the course Software Engineering for Web Applications
MIT Open Course Materials for the course Database, Internet, and Systems Integration
Technologies.
Semantic Web: Concepts, Technologies and Applications: Karin Breitmaq Walt
Truszkowski
Sernantic Web Programming, Wiley publishing, lst edition, 2009: John Hebeler,
Matthew Fisher, Ryan Blace , andrew Perez-Lopez , Mike Dean.
Depdrtrnent of Cornputer Science ond Engin€enrg, UnMeErty of Chittagons
6.
Page 68
Linked Data: Evol ring the web into a Globar Data Space, Morgan & claypool,20l 1:
Tom Heath,Christi rn Bizer.
CSE 616 Web Engineering Lab
25 Marks, 1 Credil,2 Hours/t eek
(Recommended but not limited to the
follo.luing ropics)
p, Web Application Frameworks (Example:
LAV
Silverlighr, Adobe Flex),
*Y1.
T:"hnology:
Web 2.0^Sid:
and Web Apis.
IIoT,:Eo9 Technology: HTML, XI{TML, XML. CSS Styling, Layout, Selector, Documenr Object
M_odel and Javascript. crient-I'rogramming: web Apis witl
Javascript 1E*"-pr"-,- C"ogr" aj*
API). MVC: Understanding Molel, View and Controllei Model.
Understanding Web Apis: RESIT, XML, JSON, RSS parsing.
Javascript Exercise: The Goal of rhis Assignment Is To Allow you To Explore and Use As
Many of
Javascript's Objects, Methods, and Propoties As Possible in A Snrall Assignment. Some Functions
Must Be
Written From Scratch. Other Funcrions, Appropriately Attribute( May Be Downloaded From The
Web and
Used As A Part of The Systern Or As The Basis For your Own Frmctions.
PHP Exercise: Build A Sa ofPHP Scripts That Perform Some Dynamic Server Side Functionality.
Understanding Plug-ins: Develqr A Firefox Extension.
Recommended Book:
l.
Internet
& World Wide Web How To Program: Deitel & Deitel.
CSE 617 Theory ofComputation
75 Marks, 3 Credits, 3 Hours/lVeek
Regular Languages: Finite Aut,rmaton, Examples of Finite Automata, Designing Finite automata,
Equivalence of NFAs and DFAs, The Regular Operations - Closure under the Regular Operations.
Regular Expressions. Equivalence with Finite Automata. Non-Regu,"r Languages - The Pumping
Lemma for Regular Lang,rages, Regular Grammar.
Context-Free Languages: Forrnal definition of a Context-Free Grammar (CFG) - Examples of
CFGs. Ambiguity, Chomsky Norral Form. Efficient CFG Parsing with CYK Algorithm, Pushdown
Automata, Formal Definition of a Pushdown Automaton, Examples of Pushdown Automata,
Equivalence with CFG, The Pumping Lemma for Context Free Languages.
Computability Theory: The Church-Turing Thesis. Turing machine, Nondeterministic Turing
Machines, Hilbert's problems.
Decidability: Decidable Languagt:s, Halting Problem - Diagonalization Method.
Complexity Theory: The Classes P, NP, Examples of Problems in these Classes. The P Versus NP
Question. NP-Completeness, Poll nomial Time Reducibility, The Cook-Levin Theorem. Examples of
NP-Complete Problems: The Verlex Cover Problem - The Hamiltonian Path Problem - The Subset
Sum Problem. Approximation Alg,nithm, Probabilistic Algorithms.
T*t
Book:
I
Reference
1.
2.
3.
4.
.
Introduction to the theory of computation: Michael Sipser.
Book:
Introduction to Autonnta Theory, Languages and Computation: Hopcroft, Motwani &
Ullman.
Elements of the theory of computation: Lewis & papadimitriou.
An introduction to forrnal languages and automata: peter Linz.
Switching and Finite Automata Theory: Zvi Kohavi.
Departrnent of Co.nputer Science and Engi,re€ing Unrversrty of Chittagong
Page 69
CSE 618 Mobile Apps Development Lab
50 Marks, 2 Credits, 4 Hours/W'eek
Recommended bul not lirnited to the following topics
write programs to implement Hello World midlet
Write programs to implement multiple midlets
Write programs to implement command class
Write programslo implement check color
Write programs to implement Menu Cretion
Create a MIDP applicatiorl which draws a barp.ph to display. Data values can be
given integer
Create a MIDP application which Examine, that a phone number, which a user
entered in given format.
Create a MIDP Application, which draws a Pie Graph to the display. Data Values can
be given at int[] array. You can enter four data(integer)values to the input text field.
Write a program for quiz midlet
Create a slideshow which has three slides. which includes only text. Program should
change to the new slide after 5 seconds. After the third slide program returns to the
First Slide
Create a slideshow which has three slides, which includes pictures at PNG forrnat.
Program should change to the new slide other 5 seconds.
Write program for creating datagram
Write program for creating login file
.
.
o
.
o
.
.
o
o
.
.
.
.
o
o
EEE 621 Telecommunication Engineering
75 Marks, 3 Credits, 3 Hours/lVeek
Introduction to Telegraphy, Single and Double current Telegraphy, Teleprinters. vFT and carrier
Telegraphy, Manual Switching Systenl Electromechanicat Switching strowger and EMD Systems,
Electronic Switching, Read Relays, Basic Impulsing Circuits, Uniselectors, Group Selectors and Final
Selectors; Trunking Diagrarq Distribution Frames-Testing and Protection of Telephone Principles,
Power Levels, Attention and Delay Distortions, wireless Telephony, carrier Telephony, Repeater,
SBB and Receivers, High Accuracy crystal Laftice crystals, Introduction to vHF and L,IIIF Systems.
Text Book:
1. Communication Engineering: A.P.Godse U.A.Bakshi.
Reference Book:
2. Communication Engineering: J.S.Chitode.
ENG 672 Technical Writing and Presentation
25 Marks, I Credit, 2 Hours/Week
Technical Report writing : i)Report Types (Organizational / Commercial / Business / project
)
ii)Report Format & Organization of Writing Materials iii)Report Writing (Practice Sessions 6!
Workshops)
Language Laboratory Practice: I. Introductory Lecture to help the students get a clear idea of
Technical Communication & the need of Language Laboratory Practice Sessions. II) Conversation
Practice Sessions: (To be done as real life interactions) a) Training the students by using Language
Lab Device/Recommended Texts/cassettes /cd's to get their Listening Skill & Speaking Skill honed b)
Introducing Role Play & honing over all Communicative Competence III) Group Discussion
Sessions: a) Teaching Strategies of Group Discussion. b) Introducing Different Models & Topics of
Dep6rtrn€nt of Computer Sc€nce and Er8in€erir8, Unverst/ of Chttasore
Pa
ge
70
Group Discussion c) Exploring Live /Recorded GD Sessions for mending students' attitude/approach
& for taking remedial meirsure. Interview Sessions: a) Training students to face Job Interviews
confidently and successfully b) Arranging Mock Interviews and Practice Sessions for integrating
Listening Skill with Speaking Skill in a formal situation for effective communication I\.)
Presentation: l)Teaching Presentation as a skill Strategies and Standard Practices of Individual /Group
Presentation II)Media & Means cf Presentation: OHP/POWER POINT/ Other Audio-Visual Aids. V)
Competitive Examination: a) It4aking the students aware of Provincial Nationaylnternational
Competitive Examinations b) Sh ategies/Tactics for success in Competitive Examinations c) SWOT
Analysis and its Applicatioa ia f;1ing Target
Text Book
English Langulge Laboratory: A Comprehensive Manual PHI Learning. 201l:
Nira Konar.
Reference Book
I . Advanced Martual for Communication Laboratories & Technical Report Writing
Pearson Educaticn (W.B. edition), 201l: D. Sudharani.
l.
Page 7l
Depdrtnent of Cornputer Scierre drd Engineenng Unwersiv of Chitt€o.rg
SE VENTTI SEMESTER
CSE 700 Project i Thesis
50 Marks. 2 Credil, 4 Hours/Week
To be decided by respective project supervisor/s
CSE 711 Compilers
75 Marks, 3 Credits, 3 Hours/lleek
Introduction to compilers: Introductory concepts, Types of Conpilers, Applications, Phases of A
Conpiler.
Lexical Analysis: Role of The Lexical Analyzer, Input Buffering, token Specificatiorl Recognition of
tokens, Symbol Tables.
Parsing: Parser and Its Role, Context Free Grammars, topDown Parsing.
Syntrx-Directed Translation: Syntax-Diected Definitions, Construction
of
Syntax Trees, toPDown
Translation.
Type Checking: Type Systems, Type Expressions, Static and Dynamic Checking of Types, Enor
Recovery.
Run-Time Organization: Run-Time Storage Organization, Storage Strdtqlies.
Interrr€diate Code Generation: Intermediate Languages, Declaratiors, Assignment Staternents. Code
Optimization: Basic Concepts of Code Optimization, Principal Sources of Optimization. Code
Generation Features of Some Common Compilers: Characteristic Features of C, Pascal ard Fortran
Conpilers.
Texl Book:
l. Principle of Compiler
Design: Aho, Ulman
& Ravishethi.
Reference Books:
1.
2.
Compiler Design Theory: Philip.
Compiler Construction, Theory and Desigr: Willam A. Barrette.
CSE 712 Compilers Lab
25 Marl<s, I Credit, 2 Hourslll/eek
(Recommended bat no, limited ,o the following topics)
Recognition of parts of speech of every word ofa given sentence.
Simulating a Deterministic Finite Autornaton or DFA.
Simulating a Non-deterministic Finite Automaton or NFA.
Write a progam in LEX to use the start state feature of the LEX program
Write a progtram in LEX to eat up C/C# style comments.
Write a progtram in LEX to count the number of characters, words and lines ofany given
string.
Recognizing word with LEX.
Extend an English language parser to handle a more complex syntax; prepositional
phrases in a subject, adverbs modifring adjective.
Make the parser handle compound verbs better
Add new word and token types for auxiliary verbs.
Some words can be more than one parts of speecb- Ex watch, fly, time, bear. How could
handle them.
Adding a new word and token type NOUN or VERB, and add it as an altemative to the
rules for subject verb and object.
.
o
.
.
.
.
o
.
o
.
.
o
Deportrnent of Con{cute,
tknce
ard EnglrE€'in], Uni\Eslty of Oittagor8
Page
72
CSE 713 Artificial Intelligenco
75 Marlrs, 3 Credits, 3 Hours/l7eek
What Is Artificial Intelligence: fhe AI Problems, The Underlying Assumption, What Is An AI
Technique?
Problerm, Problem Spaces and Search: Defining The Problem As A State Space Search, Production
Systerr! Problem Characteristics.
Heuristics Search Techniques: Generate and Test, Hill Climbing, Best First Search Problem Reduction,
Constraint SatisfactiorL Means-Ends Analysis.
Knowledge Representation Issu')s: Rspresentation and Mappings, Approaches
to
Knowledge
Representatiorg Issues [n Knowledge Representation.
Using Predicate Logic: Representin.g Simple Facts In Logic, Representing Instance and Isa Relationships,
Conputable Functions and Predicates, Resolution.
Representing Knowledge Using Rrrles: Procedural Versus Declarative Knowledge Logic Programming.
Forward Versus Backward Reasoninl; Matching.
Game Playing: Overview, The Mrmimax Search Procedurq Adding Alpha-Beta Cutoffs, Additional
Refi nements, Iterative Deepening,
Ptanning: Overview, An Exanple Domain: The Blocks World, Conponents of A Planning Systerq Goal
Stack Planning
Understanding: What Is Understanding, What Makes Understanding Hard, Undostanding As Corstraint
Satisfaction
Natural Laqguage Processing: Intloductior! Syntactic Processing, Semantic Analysis, Discourse and
Pragmatic Processing.
Expert Systems: Representing and Using Domain Knowledge, Expert System Shells Explanation,
Knowledge Acquisition.
AI Programming Language: Pyhon, Prolog, LISP
Text Book:
1
.
Artificial Intelligence: A modem approach: Russell and Norvig.
Reference Books:
1.
2.
3.
4.
5.
6.
7.
Artificial Intelligence: Nils J. Nilsson.
Artificial Intelligence: Elaine Ritch & Kevin Knight.
Advanced Turbo Prolog: Herbert Schildt.
Introduction to Tu'bo Prolog: Townsend.
Common LISP Language: GuyL. & SteeleJr..
Expert System: Deiter Nesendane.
LISP: Patrick Hemy, Winston Berthol4 Klaus Paul Hom.
CSE 714 Artifrcial Intelligence llab
25 Marks, I Credit, 2 Hours/Wee't
(Recommended but not limited to lhe following topics)
o Implementing basic logic gates in Prolog.
o Implementing human family relation using Prolog
. Inplementing monkr:y-banana problem using Prolog
o Implement the logics for selection process in an interview using prolog
o Using Dynamic Datz base using Prolog
. Implement Fibonacc: number and mn value using Lisp.
. Irnplementation of AND gate with perceptions.
o Implementation of NCR gate with perceptions.
. Irnplementation of X,3R gate with Back propagation Neural Network
.
Implementation of G,:netic Algorithrn, DFS, and BFS.
Departnrent of Compliter Science and Engneenns, UnMersity of Chittdsong
Page 73
CSE 715 Computer Graphics
75 Marlrs, 3 Credits, 3 HoursWeek
Computu Graphics. Display Devices and Software. Basic Raster Graphics Algorithms
Viewing, Clipping and
io. n"Ung 2D primitiva: Two Dimensional and Tfuee Dimensional
Polygon Surfacg B-Spline
Transformations, Projections; Three Dimensional Object Representation:
visible Surface Detection
curves and Surfaces, BSP Trees, octrees. Fractal Geometry Methods;
Methods: Z-Buffer Method, BSP Tree Metho4
Rendering, Ray
nay Castng fvfethod: Illumination Models, Surface Rendering Methods,: Polygon
Texture Mapping;
with
Details
f.,i"i"gt*ii, Visualisation with Height Mapping, Modeling Surface
InlrOdUCtiOn to
Color and Shading Models;
Text Book:
1. Principles and practices in C: James Foley et al: Computer Graphics'
Reference Books:
Procedural Elements of Computer Graphics: David F' Rogers'
1
Theory and Problems of Computer Graphics: A. Plastock & G' Iklley'
Computer Graphics A Programming Approach: Steven Hanin$on'
Pattern Recognition Principle: Gonzaleg.
Principle of Interactive Computu Graphics: Newman-Sprocell
Computer Graphics: Roy A. Plastocl Gordon Kalley.
.
2.
3.
4.
5.
6.
CSE 716 Computer GraPhics Lab
25 Marks, 1 Credil, 2 Hours/Week
(Recommended bat not limited to the following topics)
o
r
o
o
o
o
o
o
o
.
o
o
Draw a wire-cube using slope independent (scan conversion) mid-point line draw
algorithm and projection matrix (using glVertex2i0))
Draw interactively animated RGB color cube (e.g., mouse dragging based rotating cube).
Draw interactively animated RGB color cube (e.g., Keyboard controlled based rotating
cube)
Draw animated RGB color cube, where the rotation and translation is calculated using
geometric transformation matrices
Draw a solid spher{s), where different type of illumination / reflection property is
controlled by keyboard
Draw a solid sphere(s), where position of point light source is controlled by mouse
motion.
Draw a texture mapped solid cube (each face is mapped with diffuent textures)
Draw animated circl(s) using (scan convosion) mid-point circle draw algorithm (e.g.,
slowly moving from left to right)
Draw animated ellipse(s) using (scan conversion) mid-point circle draw algorithm (e.g.,
slowly moving from left to righ|
Draw a texture mapped solid sphae(s)
Draw a wheel using slope independent (scan conversion) mid-point line draw algorithm
and mid-point circle draw algorithm
Draw an animate( ball tlropping on a floor (apply effect of gravity on the ball)
D€porurRrt of ComNter Scierce ard ErEineeins, UniveGity of ChittasorE
Page
711
CSE 717 Information Securiry
75 Marks, 3 Credits, 3 Hours/lyeek
The knowledge unils in this area c.ollectively encompess
thefollowing: f, Recognition that security is
risk management and inherently includes tradeoffs, (ii) Familiarity"witi the iiptications
of hostile
users and misuse cases, (iii) A framework for understanding algorithms and
other technological
measures for enhancing security, and (iv) Strategic and tactical design issues in
information security.
History' overview, and principles: State examples of famous security breaches and denials of
service, Discuss common comp rter crime cost estimates and the difficulty of estimating
them,
Discuss the professional's role in security and the tradeoffs involved, Explain
and defend the use of
each of various security princirles, Explain and defend the use of each of various security
mechanisrns, for example least privilege, fail-saf'e defaults, complete mediation, separation
ol
privilege, and psychological acceptability.
Relevant tools, standards, andror engineering constraints: Discuss the major provisions of a
relevant law such as HIPAA or tre EU Data Protection Directive, Summarize inteliectual property
and export control laws affectin.3 security, especially encryption, Articulate some challengis oi
computer forensics.
Data security and integrity: De{ine confidentiality and integrity, Give examples of systems where
integrity alone is sufficient, Define "perfect forward secrecy" and explain why ii is deshable.
Vulnerabilities and exploitation: Define misuse cases and explain its role in information security,
Perform a simple fault tree analysis, Explain the types of errors that fuzz testing can reveal, Discuss
issues related to the difficulty ofupdating deployed systems, Explain the role code reviews in system
security, Define the problem of insecure defaults, Explain the tradeoffs inherent in responsible
disclosure,
Resource protection models: Explain the pros and cons of various discretionary and mandatory
resource protection models, Illustlate an access control matrix model, Define the Bell-LaPadula
model,
Secret and public key cryptography: State the motivation for putting all encryption algorithm
variability in the keys, Discuss the effect of processing power on the effectiveness of cryptography,
Explain the meaning of and relationship between the thee basic classes of cryptographic attacks:
ciphertext only, known plaintext, chosen plaintext, Discuss the similarities and differences among the
three basic ttpes of cryptographic functions: (zero-, one-, and two-key): hastr, secret key, and public
key, Discuss block and key length irisues related to secret key cryptography, Demonstrate and discuss
the motivations and weaknesses in various methods for applying secret key (block) encrlption to a
message stream such as cipho block chaining (CBC), cipher feedback mode (CFB), and counter
mode (CTR).
Message authentication codes: Explain why hashes need to be rougbly twice as long as secret keys
using the birthday problenr, Discuss the uses of hashes for fingerprinting and signing, Discuss the key
properties of a cryptographic hash function contrasted with a general hash function
Network and web security: Describe the goals of Transport layer security (TLS) and how they are
attained using secret and public key methods along with certificates, Discuss the reasons for using a
firewall, various topologies, and firswall limitations. Describe the basic structure of URLs, HTTP
requests, and HTTP digest authentic'rtion as they relate to security, Explain the use of HTTP cookies
including session cookies, expirati<'n, and re-authentication for key operations, Define cross-site
scripting, Explain an SQL injection attack and various methods of remediation.
CSE 719 OPTION 75
I
Morks, 3 Credils, 3 Hours/Wee,t
Dep€rtrn€nt of Computer Science dnd ErErneenng Unverst/ of Chrttdsong
Pa
ge 75
EIGHTH SEMESTER
CSE 800 Project / Thesis
100 Marks, 4 Credits, S Hours/Week
To be decided by respective project supervisor/s.
CSE 811 Digital Image Processing
75 Marks, 3 Credits, 3 Hours/Week
Introduction; Digitization of Images and Its Properties; Data Struchrres for Image Analysis; Image
Processing; Segmentation: Detection of Discontinuities, Edge Linking and Boundary Detection,
Thresholding, Region Oriented Segmentation, Use of Motion in Segrnentation; Image Transforms: ZTransforn! 2D Fourier Transforn! Discrete Cosine Transfornr, Hadamard Transforrn, Walsh
Transforrn, Slant Transform; Image Compression: Run-Length Coding, Transform Coding, Standards.
Tert Booh:
1. Digital Image Processing: Pearson Education Asia: Rafael C. Gowalez
Woods.
&
Richard E.
Reference Book:
1. Non-Linear
Digital Filter: Principles and Applications, Kluwer Academic Publications: I.
Pitas & A. N. Venetsanopoulos.
CSE 812 Digital Image Processing Lab
25 Marks, I Credil, 2 Hours/ll/eek
@ecommended but not
o
o
o
o
o
o
.
o
o
.
firtted lo lhe lollowing topics)
Display Grayscale Images.
HistogramEqualization.
Non-linearFiltering.
Edge detection using Operators.
2-D DFT and DCT.
Filtering in frequency domain.
Display of color images.
Conversion between color spaces.
DWT of images.
Segmentation using watershed transform.
CSE 8f3 Distributed and Cloud Computing
75 Marks, 3 Credits, 3 Hours/ll/eek
Definition of Distributed Systems. Coals: Connectedness, Transparency, Openness, Scalability.
Communication: Layered Protocols, RPC, Remote Object Invocation, Message and Stream Oriented
Communications. Processes: Threads In Distributed Systems, Clients, Servers and Transparency;
Code Migration: D Agents, Software Agents. Naming: Naming Entities - DNS Example, Locating
Mobile Entities.
Synchronization: Clock Synchronization, Global State, Election Algorithms, Mutual Exclusion,
Distributed Transactions. Consistency and Replication. Fault tolerance and Security In Distributed
Systems;
Page
Dep6rh€nt of Contpder Scidce and Ergin€(inng, Unive6ry of Chttasons
7
6
Distributed Object Based Systems: CORBA, Distributed COM. Distributed File Systems: SUN,
CODA, Plan 9. Distributed Document Based Systems: WWW. Distributed Coordination Based
System : SETI@Home, Grid Computing.
Text Book:
1.
Distributed Systerns: Concepts and paradigms: Andrew S Tanenbaum.
Reference Book:
1. Distributed Systems - Concepts and Design: G. Coulouris, J.
Dollimore & T. Kindberg:
CSE 814 Distributed and Cloud Computing Lab
25 Marks, 1 Credit, 2 Hours/lleek
Lab based on CSE 813 Distributed and Cloud Computing
CSE 815 Machine Learning
75 Marks, 3 Credits, 3 Hours,Week
Introduction: Definition of Learning Systems. Goals and Applications of Machine Leaming. aspecs of
Developing A Leaming System- l'raining Data, Concept Representatior! Function Approxinration.
Inductive Classification: The Concept Leaming Task. Concept Leaming as Search Through A Hypothesis
Space. General-taSpecific Ordoing of Hypotheses. Finding Maxirrully Specific Hypotheses. Version
Spaces and The Candidate Elim nation Algorithrn Leaming Conjunctive Concepts. The Importance of
Inductive Bias.
Decision Tree Learning: Representing Concepts as Decision Trees. Recursive Induction of Decision
Trees. Picking The Best Splitting .A,ttribute: Entropy and Inforrnation Gain. Searching For Sinple Trees and
Conputational Complexity. Occarrls Razor. Overfitting, Noisy Dat4 and Pruning.
Experimental Evaluation of Learning Algorithrs: Measuring The Ac,-'ruacy of Learned Hypotheses.
Conparing Learning Algorithms- Cross-Validatior! I-earning Curves, and Statistical Hypothesis Testing.
Computational Learning Theory: Models of Learnability- Learning In The Limit; Probably
Approximately Correct @AC) f eaming. Sarnple Complexity- Quantifuing The Number of Exanples
Needed to PAC Leam. Computat ronal Complexity of Training. Sanple Conplexity For Finite Hypothesis
Spaces. PAC Results For Leanring Conjunctiors, Kdnf, and Kcnf Sanple Conplexity For Infinite
Hypothesis Spaces, Vapnik-Chervonenkis Dimension.
Rule Learning, Propositional arrd First{rder: Translating Decision Trees Into Rules. Heuristic Rule
Induction Using Separate and Corquer and Information Gain. First-Order Hom-Clause Induction (Inductive
Logic Programming) and Foil. Leurring Recursive Rules. Inverse Resolution, Golerq and Progol.
Artificial Neural Networks: Neurons and Biological Motivation. Linear Threshold Units. Perceptrons:
Representational Limitation and Sradient Descant Training. Multilayer Networks and Baclgropagation.
Hidden Layers and Constructing lntermediate, Distributed Representations. Over6tting, Leaming Network
Sfucture, Recurrent Networks.
Support Vector Machines: Marimum Margin Linear Separators. Quadractic Programming Solution to
Finding Maximum Margin Sepan*ors. Kemels For I-eaming Non-Linear Frmctiors. Bayesian Learning:
Probability Theory and Bayes Rule. Naive Bayes Leaming Algorithrn Parameter Smoothing. Generative
Vs. Discriminative Training. Lc gisitic Regression. Bayes Nets and Markov Nets For Represoting
Dependencies.
Instance-Based Letrning: Constructing Explicit Generalizations Versus Conparing
Exanples. K-Nearest-Neighbor Ai gorithrrr CaseBased Leaming.
to Past
Specific
Text Classification: Bag of Wor<is Representatiorl Vector Space Model and Cosine Similarity. Relevance
Feedback and Rocchio Algorithm Versiors ofNearest Neighbor and Naive Bayes For Text.
Departrnent of Computer Science dnd
EnS
Page
neenns, UnMers ty of Chittasons
77
Clustering and Unsupervised Learning: Leaming From Unclassified Data. Clustering. Hierarchical
Aglomoative Clustering. K-Means Paditional Clustering. Expectation Maximization @M) For Soft
Clustering. Semi-Supervised Leaming with EM Using Labeled and Unlabled Data.
Dimensionatity Reduction: Principle Component Analysis (PCA). Kernel PCA, Linear Discrimirnnt
tunlysis(LDA).
Experimental Evaluation of [,earning Algorithms: Evaluation of performance of a classifia: Holdout
method, Random sanpling Cross-validatioq Bootstrap. Estimating a confidence interval for accuracy.
Conparing the perfornrance of two models. Conparing the performance of two classifiers.
Tat Book:
1. Introduction to machine leaming (2nd edition),
MIT Press, 2010: Alpaydin & Ethem.
Reference Books:
I
Machine Leaming, McGraw Hill, 1997: Tom_Mitchell.
An Introduction to Support Vector Machines and Other Kernel-based Leaming Methods,
Cambridge University Press: Nello Cristianini & John Shawe-Taylor.
Pattern Recognition and Machine Leaming: Chirstopher M. Bishop.
.
2.
3.
CSE 8f6 Machine Learning Lab
25 Marl<s, 1 Credit, 2 Hours/Week
(Recommended but ,tot limited to lhe follol,ing topics)
Machine learning tools in Matlab.
Implementation of supervised and unsupervised leaming.
Digit recognition using ANN, S\/I\4 and Adaboost.
Automatic road sign detection using machine learning tools.
Iris detection using boosted classifiers.
o
.
o
.
o
CSE 817 Option - II
75 Marks, 3 Credils, 3 Hours/Week
o@arfnerrt of Congjt€,
kt6re
d
Page 78
ErEineenr8 Unr\€rsty of ChrttagorB
CSE 719 OPTION -
I
CSE 719 Optical Fiber Communications
75 Marl<s, 3 Credits, 3 Hours/Week
Nature of Light Optics; OpticatFiber Mode, Single Mode Fiber, Graded index Structure.
Signal Degradation in Optical Fibers: Attenuation, Signal Distortion, Pulse Broadening Mode
Coupling.
Optical Sources: LED, Laser Dicdes, Light Source Linearity Modal Partition and Reflection Noise.
Power Launching and Couplilg: Source to Fiber Power Launching, Launching Scheme, Fiber to
Fiber Joints, Splicing Fiber Connectors.
Photo Detectors: Basic Principl:, Photo Detectors Noise, Response Time, Avalanche Multiplication
Noise. Optical Receiver Operation: Receiver Configrration, Digital Receiver Performance
Preamplifiers.
Dlgital Transmission System: Point to Point Lint Line Coding, Eye Pattern, System Performance.
Advanced Systems and Techniques: WDM, Local Area Networks, Optical Amplifier, Photonic
Switching.
Text Book:
l.
Optical I;iber Communications, Principle and Practice: John M. Senior.
Reference Book:
Fiber Oprjcs: Frederick C. Allard.
I
.
CSE 719 Soft Computing
75 Marks, 3 Credits, 3 Hours/vl'eek
Introduction: Introduction to soft computing; introduction to fizzy sets and fiszzy logic systems;
introduction to biological and arlficial neural network; introduction to Genetic Algorithm.
Fuzzy sets and Fuzzy logic systr:rns:
Classical Sets and Fuzzy Sets and Fuzzy relations : Operations on Classical sets, properties of
classical sets, Fuzzy set operatioils,properties of fuzzy sets, cardinality, operations, and properties of
fuzzy relations.Membership furctions : Features of membership functions, standard forms and
boundaries, different fuzzifi catiorr methods.
Fuzzy to Crisp conversions: Lambda Cuts for fuzzy sets, fuzzy Relations, Defuzzification
methods.Classical Logic and Ftzzy Logic'. Classical predicate logic, Fuzzy Logic, Approximate
reasoning and Fvzy ImplicatiorL.Fuzzy Rule based Systerns: Linguistic Hedges, Fuzzy Rule based
system -_ Aggregation of fuzzy Rules, Fuzzy Inference System-Mamdani Fuzzy Models - Sugeno
Fuzzy Models. Applications of Ftzzy Logic: How Fuzzy Logic is applied in Home Appliances,
General Fuzzy Logic controllers, Basic Medical Diagnostic systems and Weather forecasting.
Neural Network
Introduction to Neural Networks: Advent of Modern Neuroscience, Classical AI and Neural
Networks, Biological Neurons zLnd Artificial neural network; model of artificial neuron.Leaming
Methods : Hebbian, competitiv€, Boltzman etc.,Neural Network models: Perceptron, Adaline and
Madaline networks; single layo network; Back-propagation and multi layernetworks.Competitive
leaming networks: Kohonen sell'organizing networks, Hebbian leaming; Hopfield Networks.NeuoFuzzy modelling: Applications ol Neural Networks: Pattern Recogtition and classification.
Genetic Algorithms: Simple (iA, crossover and mutation, Multi-objective Genetic Algorithm
(MOCA). Applications of Genelic Algorithm: genetic algorithms in search and optimization, GA
based clustering Algorithm, Image processing and pattern Recognition.
Other Soft Computing techniql es: Simulated Annealing, Tabu search, Ant colony optimization
(ACO), Particle Swarm Optimization (PSO).
Te* Book:
l. Ftzzy logic with engneering applications: Timothy
J. Ross, John Wiley and Sons.
Depatrnent of Computer Sclenc€ and Ensineerins, University of Chittagons
Page 79
Reference Books:
l.
"Neural Networks, Fttzzy Logic and Genetic Algorithms", PHI: S- Rajasekaran and
G.A.V.Pai.
2. Principles of Soft Computing: S N SivanandanL S. Sumathi, John Wiley & Sons
3. Genetic Algorithms in search, Optimization & Machine Learning: David E. Goldberg
4. Neuro-Fuzzy and Soft conrputing, Jang, Sun, Mizutani, PHI
5. Neural Networks: A Classroom Approach,l/e by Kumar Satish, TMH,
6. Genetic Algorithms in search, Optimization & Machine Learning: David E. Goldberg,
Pearson/PHI
7. A beginners approach to Soft Computing, Samir Roy & Udit Chalaaborty, Pearson
8. Flzzy Sets and Fuzzy Logic Theory and Applications, George J. Klt and Bo Yuan,
Prentice Hall
9. Neural Networks: A Comprehensive Foundation (2nd Edition), Simon Haykin, Prentice
Hall.
CSE 719 E-Commerce
75 Marks, 3 Credits, 3 Hours/Il'eek
From Business to E-Business: E-Commerce Vs. E-Business, B2B Vs B2C, Business Models,
Community Building, Auctions and E-Cards. Starting Site: Distributed Applications, Software
Requirements,
Building The Object Model: Components and Framework. Structudng Online
Store:Design,
Maintenance and Administration. Checkout. Order Processing:Building Pipeline, Creating Extranet,
Security and Authentication: Credit Card Authorization, Finalizing and Canceling An Order. Secure
Communications: Cryptography, Obtaining A Certificate. Hosting, Development and Deployment:
Privacy Statements, Guidelines, Protection. Customer Services. Search tool.
Integration with Other Systems; XML. WAP and Immerging Technologies; Products and Services;
Cell Phone, PDA and Other Handheld Devices. Marketing: Tracking Success, Search Engines,
Banner Advertising, Other Marketing Opportunities.
E-Governance: Governance Via Information Systems. Opportunities and Technical Challenges.
Appropriate Technologies. E-Govemance In Practice: Case Studies; Pitfalls.
Tut Book:
l. E- Commerce, with VE|, ASP,SQL, server 7 and MTS, Wrok press Ltd: Matthew
Reynolds.
Reference Book:
l.
E-Commerce 2Ol1 (7th Edition) (Pearson Custom Business Resowces): Kenneth C.
Laudon.
CSE 7f 9 Robotics
75 Marl<s, 3 Credits,
3
Hours/Ileek
Basics: Introduction, Recursive State Estirnation, Gaussian Filters, Nonparametric Filters, Robot
Motion, Robot Perception.
Localization: Mobile Robot Localization: Markov and Gaussian, Mobile Robot Locatzation: Grid
and Monte Carlo .
Mapping: Occupancy Grid Mapping, The Graphslam Algorithnl The Fastslam Algorithrn
Planning and Control: Markov Decision Processes.
Social Robots (Sociable Creatures): Historical Backgrounds (Cognitive Robotics), Cognitive
Science (Situated CognitiorL Embodied Cognitiorq Ecological Approach,Socio-Cultural Approach),
Studies In Social Interaction @thno Methodologies, Conversation Analysis), Survey of Socially
Interactive Robots, Desigrring Sociable Robots, , Human-Dependent Robots, Interactive Robots In
Autism Therapy.
DepartrrEnt of Cornpner Science and Ensinee
ing
Page
UnMe6rty of Chrtt€ons
80
Tqt Book:
l.
Sebastian Thrun,
press, 2006
W:lfram Burgard and Dieter Fox: Probabilistics Robotics,
The MIT
Reference Book:
1.
Human-Robot Interaction in Social Robotics: CRC Press,September 26,2012: Takaytki
Kanda; HAoshi Ishiguro.
CSE 719 Natural Language .Processing
75 Marks, 3 Credits, 3 Hours/Week
Introductior! Word Modeling, Autornata and Linguistics, Statistical Approaches and Part of Speech
Tagging, Hidden Markov Models, Vitebri Algorithm, Linguistics and Grammars, Probabilistic
Context Free Grammars, Parsir g Algorithms and The Lexicon, Semantic, Feature Parsing, Tree
Banks and Probabilistic Parsinll; Machine Translation, Unsupervised Language Discovery, topic
Models and Language in Social Networks, Evolutionary Models of Language Learning and
Origins.comc
Tut Book:
l. Daniel Jural'sky, James H. Martin: Speech and Language Processing: An
Introduction to Natural Language Processing, Computational Linguistics and
Speech Recognition.
Reference Books:
I
Lawrence
lt.
Rabiner, Ronald W. Schafer: Theory and application of Digital
Speech Proc:ssing.
2
Chris Manning
and
Hinrich Schiitze: Foundations
of
Statistical Natural
Language Processing, MIT Press.
CSE 719 Computer Vision
75 Marks, 3 Credits, 3 Hours/llleek
Introduction: Introduction to Computer Vision, Face Recogrrition
Image Structure: Linear Filters, Finding Lines: From Detection to Model Fitting, Clustering and
Segmentation.
Camera Models: Camera Mode s, Camera Calibration, Epipolar Geometry, Stereo and Multi-View
Reconstruction,
Recognition: Building Blocks: Detectors and Descriptors, Shift and Single Object Recogrition,
Optical Flow and Tracking
Recognition: Objects, Scenes, ,\ctivities: Introduction to Object Recognition and Bag of Words
Model, Object Classification and Detection (Generative and Discriminative Model), Human Motion
Recognition.
T6, Book:
l.
Richard Szeliski: Conrputer Vision: Algorithms and Applications.
Reference Book:
l.
Sebastian Thrun, Wotfram Burgard and Dieter Fox: Probabilistics Robotics,
press, 2006
The MIT
CSE 719 Cryptography and I'letwork Security
75 Marks, 3 Credits, 3 Hours/hreek
Classical Cryptography: Introduction to Simple Cryptosystems, Cryptanalysis; Shannon's Theory:
Perfect Secrecy, Entropy, Product Cryptosystems; Data Encryption Standard: Description of DES,
Differential Cryptanalysis; RS A, System and Factoring: Public-Key Cryptography, RSA
Cryptosystem, Attacks On RSA, Factroing Algorithms; Other Public-Key Cryptosystems: Elgamal
Depdrtrnent of Computer Science and Engineerng Unlversiv of Chittagong
Page
B1
Elgamal
Cr,?tosystem and Discrete Logs, Merkle-Hellman Knapsack System; Signature Sche-mes:
and
Signatures
Functions:
Hash
Signatures;
Sig"atuie Schemes, Digital SiBararure Standar4 Fail-Stop
and
Key
Distribution
Attack;
Key
Hash Functions, Collision-Free Hash Functions, Birthday
Agreement: Key Predistribution, Kerboros, Diffie-Hellman Key Exchange; Identification Schemes.
Nc:twork Security Practice: E-Mail Security, DNS Security, Wireless Security, Ipsec, Web Security,
System Security, Attacks, Intruders, Firewalls.
CSE 719 Object Oriented Analysis and Design
75 Marks, 3 Credits, 3 Hours/Week
Life-Cycle and Tasks for OO Software Development.
Software Development Methodology: Engineering Or Invention, Example Artifacts Using tML.
Analysis: OO Analysis Landscape, Unified Approach, Reuse and Domain Analysis Process,
Cornponents of Analysis Model; OO Analysis : Use-Cases, Class Responsibility Collaborator
Modeling, Structures and Hierarchies, Defining Subjects and Subsystems; Object Relational Model,
Object Behavior Model : Event Identification with Use Cases, State Representations.
Design Issues for OO Systerns: Unified Approach, Partitioning The Model, User, Data and Resource
Management Component, Task Management Component, Subsystem Communications; Object
Design: Object Descriptions, Program Components and Interfaces;
Desigrr Patterns: Describing and Using A Design Pattems. Creational, Structural and Behavioral
Pattems. Examples of Every Pattern In Each Category.
UML Notations and Diagrams to Be Erployed Throughout The Course.
Tut Book:
1.
Grady Booch: Object Oriented Analysis and Design.
Reference Books:
Gamma, Helrn, Johnson and Vissides: Design patterns: Elements of Reusable ObjectOriented software.
l.
2.
3.
CraigLarman: Appllng UML and Patterns.
Booch, Rambaugh, & Jacobson: The Unified Modeling Language user guide.
CSE 719 Bio-Informatics
75 Marlcs, 3 Credits, 3 Hours/Week
Introduction to bioinformatics resources/methods. Accessing, searching, retrieving, and analyzing
data, including sequence alignment, phylogenetic analysis, and structure prediction.
Tqt Book:
l.
Bioinformatics: David W. Mount.
Refercnce Books:
1.
Introduction to computational biology: Chaprnan and HaIVCRC.
2.
Computational molecular biology- An algorithmic approach: Pavel Pevzner.
CSE 719 Data Warehouse Systems
75 Marks, 3 Credits, 3 Hours/ll/eek
Review ofDatabase Concepts: Database design, Conceptual, logical, and physical database design.
Data warehouse @W) Concepts: Business Intelligence, Multidimensional Model, OLAP, OLAP
operations, DW architecture, DW design overview.
Conceptual DW Design: Conceptual modeling of DW, Advanced hierarchies, Source driven and
data driven DW design method.
Logical DW Design: Logical modeling of DW, Relational DW design, Relational implementation of
the conceptual model, Time dimension, Logical representation of hierarchies, Slowly changing
dimensions. Data cube operations.
Page 82
Deparfnent of Computer Science and kEine 4ng, UnMersty of Chittagong
Querying DW: MDX query, S{)L query, Comparison of MDX and SeL query, OLAp tools.
Physical DW design: Physical nodeling of DW, Materialized views, Data cube maintenance.
Extraction, Transformation, and Loading @TL): Business process modelling notation (BPMN),
Conceptual ETL design using BPMN, Integation services and PDI (Kettle).
Exploratory OLAP: DW and the Semantic Web (SW), SPARQL, RDF representation of
multidimensional data, RDF QB vocabulary, QB4OLAP vocabulary, SETL tool.
Text Book:
1
.
2.
Data Warehouse Systems Design and Implementation: Alejandro Vaisman, Esteban
Zimanyi
Data Warehouse l)esign Modern Principles and Methodologies: Matteo Golfarelli,
Stefano Rizzi.
3.
Multidimensional ftatabases and Data Warehousing: Christian S. Jensen, Torben Bach
Pedersen, Christian lhomsen.
CSE 719 Management Information Systems
75 Marl<s, 3 Credils, 3 HoursiWeek
Introduction to Management Inlormation System and Strategic Information Systenr, Hardware and
Software Evaluation In Busineris Environment, Introduction to Telecommunication and Database,
End-User Computing, Decision Support Systenr, Information Reporting Systenr, and Executive
Information System: Business S'rstem Design, Information Ethics and Other Related Issues.
Text book:
Management Infor nation System: Charles Parker.
l.
Reference Book:
1.
Management Infor mation Systems, Fourth Edition, Prentice Hall, 1996: Kenneth C.
Laudon & Jane P. .-audon.
CSE 719 Modeling and Simulation
75 Marla, 3 Credils, i HourstWeek
Simulation Modeling Basics: S ystems, Models and Simulation; Classification of Simulation Models;
Steps In A Simulation Study; Cr,ncepts In Discrete-Event Simulation: Event-Scheduling Vs. ProcessInteraction Approaches, Time-l.dvance Mechanisr4 Organization of A Discrete-Event Simulation
Model; Continuous Simulation Models; Combined Discreet-Continuous Models; Monte Carlo
Simulation; Simulation of Queuitg Systems.
Buitding Valid and Credible Simulation Models: Validation Principles and Techniques, Statistical
Procedures for Conparing Rqrl-World Observations and Simulation Outputs, Input Modeling;
Generating Random Numbers and Random Variates; Output Analysis. Simulation Languages;
Analysis and Modeling of Some Practical Systems.
Text Book:
l.
System Simulation: (ieofhey Gordon.
Reference Book:
l. Discrete-event Systern Simulation: Banks J.
CSE 719 Special Topics Related to CSE
75 Marl<s, 3 Credits, 3 Hours/ll/eek
&
Carson JS.
Page
Departrnent of Compd€r Science and Engine€nng Unrve6rty of Chftagong
CSE 817 Option -
83
lI
CSE E17 Mobile Computing
75 Marks, 3 Credits, i Hours/Week
Introduction to Personal Communications Services (PCS): PCS Architecture, Mobility management,
Networks signatling. Global System for Mobile communication (GSM) system overview: GSM
Architecture, Mobility management, Network signalling.
General Packet Radio Services (GPRS): GPRS Architecture, GPRS Network Nodes. Mobile Data
Communication: WLANs (Wireless LANs) IEEE 802.11 standar4 Mobile IP.Wteless Application
Protocol (WAP): The Mobile Internet standard, WAP Gateway and Protocols, wireless mark up
Languages (WML). Wireless Local Loop(Wll):Introduction to WLL Architecture, wireless Local
Loop Technologies.
Third Generation (3G) Mobile Services: Introduction to International Mobile Telecommunications
2000 (IMT 2000) vision, Wideband Code Division Multiple Access (W-CDMA), and CDMA 2000,
Quality of services in 3G.Global Mobile Satellite Systems; case studies of the IRIDILM and
GLOBALSTAR systems. Wireless Enterprise Networks:Introduction to Virtual Networks, Blue tooth
technology, Blue tooth Protocols.
Server-side programming in Java, Pervasive web application architecture, Device independent
example application
Text Books
l."Pervasive Computing", Burkhardt, Pearson
2."Mobile Communication", J. Schiller, Pearson
3."Wireless and Mobile Networks Architectures", Yi-Bing Lin & Imrich Chlamtac,
John Wiley & Sons, 2001
4."Mobile and Personal Communication systems and services", Raj Pandya, Prentice
Hall of India, 2001.
Reference Books :
1. "Guide to Designing and Implementing wireless LANs", Mark Ciarnpa, Thomson
leaming, Vikas Publishing House, 2001.
2. "Wireless Web Development", Ray Rischpater, Springer Publishing,
3. "The Wireless Application Protocol", Sandeep Singhal, Pearson .
4. "Third Generation Mobile Telecommunication systerns", by P.Stalronlakis,
Springer Publishers
CSE 817 Geographical Information Systems
75 Marks, 3 Credits, 3 Hours,/Week
Introduction: Terminology; Computer assisted Cartography. Remote Sensing, Photog'ammetry and
Land Information Systems; Geographical Data; GIS Data Capture; GIS Displays Etc.
Spatial Analysis and Cartographic Concepts: Points, Lines, Areas and Surfaces; Nominal, Ordinal,
Interval and Ratio Attributes; Socio-Economic Versus Resource and Physical Data; Georeferencing;
Geocodes Etc; Map Projections and Transformations, Their Properties; Co-Ordinate Transformations
In 2D and 3D; Fundamental Spatial Concepts: The Quatity of Spatial Data: Scale: Accuracy,
Precision and Time; Basic Spatial Operations On Lines, Areas and Surfaces. The Object/Layer
Debate.
Technical aspects of GIS: Relationship Between GIS and Other Information Systems; Data Models
for Spatial Data: Arcs, Polygons, topological Data Struchres, Polygon Building; Data Capture
Devices, Digitising and Scanning Techniques State ofThe Art; Special Environment for GIS; Issues
of Display, Hard V. Virtual. Vector V. Raster, Data Resolution; Graphics Output Design Issues: Odes
of Use/GIS Interaction; Temporal and 3D Representation; Line Generalizations; Use and Function of
The Global Positioning System (GPS) In GIS.
Departn€nt of ConprJter Science ord Ergin€eflrl3 Univast/ of ChittdsorB
Page
A4
The Application of Geographical Information Systems: Purpose and Users of GIS, Public Utilities,
Resources Analysis, Urban Pla:rning and Decision Support. Global Scale Applications: Intemational
Initiatives; Global Data Capture and Referencing. GIS In Practice, Map Analysis, Spatial Data
Searches Etc. cost and Benelits of GIS. GIS and Global Science. GIS and spatial cognition.
Knowledge Based Techniques In GIS.
Text Book:
I
Davis: GIS- A Visual Approach.
Reference Books:
L Principles of Geogr aphic Information Systems: O. Huisman, R.A de
2. Application of Geographic Information Systems: Bhuiyan Monwar Alam.
CSE 817 Parallel Computing
75 Marks, 3 Credits,3 Hours/Week
Introduction.-Parallel Processing Environment- Pipelining and Data Parallelism, Scalability, Flynn's
Taxonomy,. (3L) Parallel Processing organization- Mesh, Hlpertree, Plramid, Butterfly, Hypercube
network. Parallel Algorithms -Structure, cost, Analysis; Elementary Algorithms: Broadcast, Prefix
sums, All sums Algorithms o;r Selection problerq Merging-Odd-even merging network, CREW
Merging, N-ary searching. Matrix Transposition ,Matrix Multiplications- 2D Mesh SIMD ,Hypercube
SIMD, Shuffle-Exchange SIMD models. Discrete Fourier Transform, Fast Fourier Transform.
Linear system of equations- Ga,rssian Elimination, Gauss-Seidel algorithrrl Jacobi algorithrq Sorting
Enumeration sort, Odd-even transposition sort, Bitonic merge Ellis's Algorithm.Graph Algorithms,
Spanning Tree Algorithms, Parallel Programming Languages FORTRAN 90, OCCAM
Text Book:
l. Parallel Computing -Theory and Practice -Michael J. Quirm (McGraw
Hill Inc.)
Reference Book:
Design and Analysis of Parallel Algorithms- S.G. Akl (PH)
l.
CSE 817 VLSI Design
75 Marks, 3 Credits, 3 Hours.Week
VLSI Desiga Methodology: t,)p-Down Design Approach, Technology Trends. NMOS, CMOS
Inverters, Pass Transistor and Pass Gates: Dc and Transient Characteristics- Brief Overview of
Fabrication Process: NMOS, Clv'IOS, Bi-CMOS Process. NMOS and CMOS Layout, Stick Diagram
and Design Rules. CMOS Circuit Characteristics and Performance Estimation: Resistance and
Capacitance, Rise and Fall Timt:, Power Estimation. Buffer Circuit Design. tntroduction to Bi-CMOS
Circuits.
Conplex CMOS Gates. CM()S Building Block: Multiplexer, Barrel Shifter, Adder, Counter,
Multipliers. Data Path and Memcry Structures. Design Style: FPGA and Plds.
Introduction to HDL: Basic Digital Design Using VHDL.
Text Book:
1.
Introduction to VLSI System, Addision-Wesley, USA, 1980.
Reference Books:
1.
2.
3.
Basic VLSI Design system and ctcuits, Pentice Hall International Inc, Second Edition,
New Dlhi, 1993, ISIIN-81-205-0616-3: Douglas A. Pucknell & KAMRAN Eshraghiam.
Logic Synthesis and optimization, Kyusnu Institute of Technology, lizuka, Japan:
Tsutomu SASAo.
HDL made easy, Prt:ntice-Hall, 1996: David Pellerin & Douglas Taylor.
Departrnent of Computer Science and Engineering, Unrversit/ of Chttagong
Page A5
CSE 817 Data Engineering
75 Marks, 3 Credits, 3 Hours/lleek
Introduction, data engineering and data science, Data representation I: Objects, relationships, and
inforrrntion about them. File representations and file manipulation. XML, JSON, YAML.
Reading/writing/transforming data. Command-line processing. Finding specific information:
querying, filtering, regular expressions. Cleaning data. Data representation II: Relational databases,
Key-value (noSQL) databases. Structured data: information architecture, ER representations, table
structure. SQL. Indexes. NoSQL databases.Big data and API: Distributed file systems, Map/reduce,
Hadoop (what's that? when is it useful?). Related big data technologies/platforms: Pig, HBase
Programmatic access to get (and post) data. Example: get data from web source, process locally,
visualize using visualization API. Predictive models I: Data representation for predictive modeling,
models, data-driven-model applications. Evaluating models, metrics for model Quality.
Predictive models II: Leaming models from data. Training. How does that work for selected
models? Overfitting, holdout evaluation, cross-validation, overfitting avoidance.
Text Book:
l.
Data Science for Business: Fundamental principles of data mining and data
analytic thinking: Provost & Fawcett.
Reference Book:
l. Doing data science: O'Reilly Media.
CSE 817 Human Computer Interaction
75 Marks, 3 Credits, 3 Hours/Week
Human Perception, Ergonomics, Cognition, and Psychology, Task Analysis, User Interface Design,
Interface Programming, System Evaluation, virtual reality, usability engineering.
T*t
Book:
l.
Human Computer Interaction: Alan Dix, Janet Finlay.
Reference Book:
l. Designing the User Interface, 5'h Edition: Ben Shneiderman and Catherine Plaisant.
CSE 817 Wireless Sensor Network
75 Marks, i Credits, 3 Hours/Week
Introduction of ad-hoc/sensor networks, Key definitions of ad-hoc/sensor networks, Advantages of
ad-hoc/sensor networks, Unique constraints and challenges, Driving Applications, Wireless
Communications,/Radio Characteristics, Ad-Hoc wireless networks, Media Access Control (MAC)
Protocols, Issues in designing MAC protocols, Classifications of MAC protocols, MAC protocols,
Routing Protocols, Issues in designing routing protocols, Classification of routing protocols,
Networking Sensors, Unique featues, Deployment of ad-hoc/sensor networh Sensor tasking and
control, Transport layer and security protocols, Sensor Network Platforms and Tools, Berkley Motes,
Sensor network programming challenges, Embedded Operating System, Simulators, Applications of
Ad-Hoc/Sensor Network and Future Directions, tlltra wide band radio communication, Wireless
fidelity systems.
Text Book:
l.
Protocols and Architectures for Wireless Sensor Networks WILEY (ISBN: 0-470-09510-5):
Holger Karl and Andreas Willig.
Reference Books:
l. Ad Hoc Wireless Networks: Architectures and Protocols: C. Siva Ram Murthy and B. S.
Manoj (Prentice Hall, 2004)
Departnent of Computer ScEnce and Engtn(tenns, Unversity of Chttdgons
Page A6
CSE 817 Graph Theory
75 Marks, 3 Credits, 3 Hour::/7[/eek
Graphs and Simple Graphs, Digraphs, Subgraphs, Vertex-Degrees, Walks, Paths and Cycles; Trees,
Spanning Trees In Graphs, Distance In Graphs; Complementary Graphs, Cut-Vertices, Bridges and
Blocks, K-Connected Graphs; IJuler tours, Hamiltonian Cycles, Chinese Postman Problerrl Traveling
Salesman Problem; Matching :rnd Factors, Network Flow Problems Chromatic Number, Chromatic
Polynomials, Chromatic Index, Vizing's Theorenq Planar Graphs, Perfect Graphs.
T6t Book:
l.
Introduction to Graph Theory: Douglas West.
Reference Book:
l.
Graph Theory: Reinhard Diestel.
CSE 817 Multimedia Systerns
75 Marks, 3 Credits, 3 Hours/Week
Overview to Multimedia Systeros, Multimedia Storage, Data Compression Techniques for Audio and
Video, Synchronization, Multirnedia Networking and Protocols, QOS Principles, Video Streams On
ATM, Mobile Multimedia Corrmunications, Operating System Support for Multimedia, Hlpermedia
Systenl Standards for Multimerlia, Multimedia Database and Multimedia Applications.
Toct Book:
l. Multimedia P:ogramming Objects, Envtonments and Framework: Simon J. Gibbs
& Dionysios (1. Tsichritzis.
Reference Books:
1.
2.
Multimedia Oomputers and Communications, Tata McGraw Hill, 1992: N.
Seshhagiri & ,\ram Akopov.
Building Hypr:rmedia Applications - A software development guide, McGraw Hill,
1992: Graw Thomas Howell.
CSE 817 Digital Signal Pror:essing
75 Marks, 3 Credits, 3 Hours/Week
Discrete-time signals:
Concept of discrete-time signal, basic idea of sampling and reconstruction of signal, sampling
theorem, sequences - periodic. energy, power, unit-sample, unit-step, unit-ramp, real & complex
exponentials, arithmetic operations on sequences.
LTI
Systems:
Definition, representation, irrqrulse response, derivation for the output sequence, concqrt of
convolution, graphical, anallical and overlap-add methods to compute convolution supported with
examples and exercises, properties of convolution, interconnections of LTI systems with physical
interpretations, stability and cauJality conditions, recursive and non-recursive systems.
Z-Transform:
Definition, mapping baween sllane and z-plane, unit circle, convergence and ROC, properties ofZtransforrrl Z-transform on sequ3nces with examples and exercises, characteristic families of signals
along with ROCs, convolutio:r, correlation and multiplication using Z-transfornl initial value
theorem, Perseval's relatiorq irrverse Z-transform by contour integration, power series & partialfraction expansions with examples and exercises.
Discrete Fourier Transform:
Concept and relations for DFT/IDFT, Twiddle factors and their properties, computational burden on
direct DFT, DFT/IDFT as linear transformations, DFT/IDFT matrices, computation of DFT/IDFT by
matrix method, multiplication o i DFTs, ctcular convolution, computation of circular convolution by
Page a7
Deparfnent of Cornputer Science and Engineenng, Unrversry of ChittagorB
graphical, DFT/IDFT and matrix methods, linear filtering using DFT, aliasing error, filtering of long
data sequences - Overlap-Save and Overlap-Add methods with examples and exercises.
Fast Fourier Transform:
Radix-2 algorithm, decimation-in-time, decimation-in-frequency algorithms, signal flow gaphs,
Butterflies, computations in one place, bit reversal, examples for DIT & DIF FFT Butterfly
computations and exercises.
Filter Design:
Basic concepts of IIR and FIR filters, difference equations, design of Buttoworth IIR analog filter
using impulse invariant and bilinear transforrns, design of linear phase FIR filters, no. of taps,
rectangular, Hamming and Blackrnan windows.
Digital Signal Processorl
Elementary idea about the architecture and important instruction sets of TMS320C 541616713
processor, writing of small programs in Assembly Language.
FPGA:
Architecture, different sub-systems, design flow for DSP system design, mapping of DSP algorithms
onto FPGA. 3L
Text Book:
l.
Digital Signal Processing - Principles, Algorithms and Applications: J.G.proakis &
D.G.Manolakis, Pearson Ed.
Reference Books:
1.
2.
Digital Signal processing
-A
Computer Based Approach: S.K.Mitra,TMH publishing
Co.
Digtal Signal Processing Signals, Systems
and Filters:
A. Antoniou, TMH publishing
Co.
3. \ILSI Digital Sigral Processing Systems
4.
5.
6.
Design and Implementation,Wiley
Intemational Publication.
Digltal Signal Processing with Field Programmable Gate Arrays: U.Meyer-Baese,
Springer.
Digital Signal Processing: P. Rameshbabu, Scitech publications (India).
Digital Sigral Processing: S.Salivahanan, A.Vallabraj & C. Gnanapriya, TMH
Publishing Co.
CSE 817 Special Topics Related to CSE
75 Marks, 3 Credits, 3 Hours/Week
D€partnent of CornFxner Scrence and En3ineern3, UnN,eEity of Ch togong
Page 88
9. PostgraduatePrograrn
9.1. Ordinance ofthe NLS. Engineering program
flniversity of Chittagong
Faculty of Engineering
Academic Ordinance for the degree of Master of Science in Engineering
(\o.or.to!8
rlbbreviated as M.S. Engg.
qRF{\TiOvlfiffirq{srB:oqrEE tn\frqE € r.s.ob.to)8 qfu@e qffirrtr ffi&
w*r attfr tg o< c+treft-+4tEfur rErs ffi rrftF q{rflfrq)
nqf{ 8il
ffwcqfitqr{{
1. DEFINITIONS
1.1
1.2
1.3
1.4
1.5
1.6
'University' means University of Chittagong, Bangladesh.
'Syndicate' means the Syndicate of the University.
'Academic Council' mean; the Academic Council of the University.
'Committee of Courses anri Studies' means the Committee of Courses for Undergraduate and
Postgraduate Studies ofa I)egree Awarding Department ofthe University formed as per rules
ofthe University.
'Faculty' means the Faculty of Engineering ofthe University.
'Academic Committee' mrans Academic Committee of a department formed as per statute of
the University.
2. DURATION AND STRU(ITURE OF THE M.S. Engg. PROGRAMME
2.1
M.S. Engg. programme w.ll consists of three semesters with a thesis or project and shall be
completed by a student in not more than 3 (three) academic years.
2.2
The curricula ofthe M.S. Engg. degree in different departments shall be as proposed by the
Committee of Courses and Studies and approved by the Syndicate on the recommendation of
the Academic Council.
2.3
The Committee of Courses and Studies of each department shall review the curricula at least
once in two consecutive Academic Years and recommend changes and revisions if any and
must be approved by the raculty. The committee of courses will also recommend a list of
courses along with their rnarks and credits. The recommendations of the Faculty will be
placed to the Academic Council for approval.
2.4
Teaching of the courses ir; reckoned in terms of credits and the credits allotted to various
courses will be determined by the Cornmittee of Courses under the following guidelines:
hour.
Nature ofcourse
No. ofcredits
.contact
(rn a semester)
Theoretical Lecture :
1
I hour/week
Project
:
8
24 hours/week
Thesis
:
12
36 hours/week
2.5
Contact Hours/week: Th: total contact hours for the regular students including lecture,
tutorial, class tests etc. shrrll be between 12 - 36 periods per week, each period being 45
minutes in duration. The academic committee of the concerned department will allocate
courses from the approved list of courses in each semester considering the available expert
faculties of the department.
Deportment of ComMer Scrence dnd En3neerins, Unrversty of
Ch
ttasons
Page B9
3. DEGREE AWARDING DEPARTMENTS
The Faculty shall consist ofthe following Degree Awarding Departrnents:
3.
I
3.2
Department of Computer Science and Engineering abbreviated as CSE.
Department
of
Applied Physics, Electronics and Communication Engineering
abbreviated as APECE.
3.3
Any other department to be approved in future.
4. DEGREES OFFERED
The Faculty shall offer programmes leading to the award of the following degrees
4.1
4.2
4.3
M.S. Engg. in Cornputer Science and Engineering
M.S. Engg. in Applied Physics, Electronics and Communication Engineering
Any other degree that may be awarded by a depadment on the approval ofthe Syndicate
on the recommendation of the Faculty of Engineering and the Academic Counci[ of the
University.
5. BRANCHES
There shall be not more than four branches in a Department. The number ofbranches will be decided by
the Academic Committee of the concemed Department on the basis of the diversity of the courses and
the availability of sufficient number ofbranch related teachers.
6. ADMISSION
The qualification for admission to the M.S. Engg. programme is four-year B.Sc. Engg. degree
obtained in the same department from this University. The candidates who have appeared at the 4th
year B.Sc. Engg. examination may be admitted provisionally to the M.S. Engg. programme. The
confirmation of admission of such students into the M.S. Engg. Programme is subject to their
passing the B.Sc. Engg. examination. Student who has not been admitted within two academic years
after obtaining their four-year B.Sc. Engg. degree is not eligible for admission to this programme.
7. REGISTRATION
7.1
University Registration: Every student admitted into the University shall be required to
register on payment of the prescribed fees within the stipulated time.
7.2
Course Registration: A student admitted into a department of the Faculty shall be
required to register his/her courses in the department in each semester within 2 weeks of
semester commencement.
7.2.1 A candidate shall attain studentship ofthe Univosity on admission to a programme as per
rules. S/he shall be required to be registered separately with the University through such
processes and on payment of such fees as determined by the Univosity from time to time
and it will be valid for two years.
Page
D@arfrEnt of Compder Sctence 6nd Ergineer ng Univeryt/ of ChittasorB
9O
7.2.2 A, student shall never take admission in more than one department other
certificate/diploma ,)ourses.
If it is so
reported./found, his/her studentship
examinations, even il appeared, shall be immediately cancelled-
than
and
8. GROUPS
Each department/branch will ha,/e two groups: Project Group and Thesis Group. Considering the
facilities and the number ofteaclers in the department, a limited number of students, on the basis of
merit, may be taken in Thesis goup. The number of students and minimum CGPA of B.Sc. Engg.
required for thesis will be deciderl by the Academic Committee of the Department in every academic
year. Students willing to undertrLke thesis shall apply to the Chairman through the Supervisor for
approval of the Academic Comrrittee of the concerned Department within four weeks from the
beginning of the programme. Thr: students who are not considered in the thesis group will be in the
project goup.
9. COURSE IDENTIFICATION SYSTEM
Each course shall be de;ignated by three to five letters for the department/discipline as
decided by the concerned depart nent followed by a three digit number starting with M e.g. CSE
Ml01 for the a course in Computer Science and Engineering; APECE M203 for a course in Applied
Physics, Electronics and Communication Engineering.
10. NATURE OF COURSES AND DISTRIBUTION OF
MARKS
10.1 The M.S. Engg. prograrxne shall be carrying a total of 900 marks as distributed below:
Theoretical M.rks
Theoretical Cours(s
distribution in e.ch
Project
Group
First
Third
Second
First
Second
'I
I
h(sis
hird
l otal
]'l arks
rotrr
Semester
4
Project
12 credits
for course
work or y
12 credits
Thesis
for course
work only
I
credits for
12 credits
for course
work orily
+ 8 credits
lor project
l2 credits
for course
12 credits
I
300
300
300
300
300
300
900
150
300
900
I
**
Please note that credits allocated for any theoretical course must not be more than 4
and less than 2.
10.2 The Committee of Corrses and Studies of the concerned department shall prepare the
syllabus.
lO.3
of each thecretical course of both project and thesis group students shall be
awarded by the coursc teacher on the basis of attendance, class tests, assignments,
presentation or any other style as deemed appropriate by the course teacher. The rcst i5vo
marks of each theoreticrrl course shall be evaluated by a written examination of 4 hours
duration for courses of .i or 4 credits and 3 hours duration of courses of 2 credits by two25yo marks
I
creaits
D€portriEnt ot Compder Scierrce and En9ineenng Unrversit/ of Chittagong
Page
91
examiner system (one internal and the other external). The paper setters will be from the
panel of examiners usually from public universities. Ifthe difference of marks given by two
examiners is more than 15% (difference of marks 8,12 or 15 fot 50, 75 or 100 marks
courses respectively) then the course wilt have to be examined by the third examiner. The
average of the closest two marls will be taken. Medium of instruction and answer in the
examination script will be in English.
10.4
The courses may be chosen from sets of choices to be determined by the Academic
Committee of the concerned Department, if applicable.
10.5 For project group, 35% of the marks allotted shall be awarded on the basis of the class
performance during the project (to be evaluated by the supervisor), 35%o of the project
marks shall be awarded on the basis of viva-voce performance to be conducted by the
examination committee at the final examination, and the rest 30% of the project marks on
the basis of performance / result / display or any other way to be determined and evaluated
by the examination committee.
10.6 For thesis group, 30% of the thesis marks shall be awarded on the basis of viva-voce
examination to be conducted by the concerned examination committee at the final
examination and the rest 70% ofthe thesis marks will be awarded by averaging marks given
by two external examiners. If the difference of marks given by two external examiners is
more than l5% then the thesis will have to be examined by the third external examiner. The
average ofthe closest two marks will be taken. Examination script will be in English.
TT.
MARKS AND CORRESPONDING CREDITS
Theoretical / projecVthesis of50, 75, 100, 200 and 300 marks are equivalent to 2, 3, 4, 8 and 12
credits respectively.
I2. ACADEMIC CALENDAR
12.1 The academic
progratnme shall be divided into three semesters. There shall be two
semesters in an academic year.
12.2
There shall be final examinations at the end of each semester conducted by the respective
Examination Committee of the Departments.
Academic calendar for the academic year shall be announced for general notification before the start
of the academic year, on the approval of the Academic Committee. The calender may be prepared
according to the following guidelines:
Page 92
Deparbnart of Cornputer Sciace and Ensineering Un,\€rstt/ of ChittngorE
First Semester
1!) weeks
Number ofweeks
Teaching
Preparatory Leave
Examination Period
Result Publication
11 (66 working days)
2
I
,_1
3-4 ]'
l9
Second Semester '19 weeks
Teaching
Preparatory Leave
Examination Perio,J
Result Publication
11 (66 working days)
)
2-3
3-4
5
t9
t4
Vacation (Summer, Ramadan, and
Others) include Inter Semester Break.
Total:152
Third Semester
26 weeks
Cours e work (1 I weeks)
Prepa
and
exam: nation (2 weeks)
Comtr letion, Presentation
and S ubmission of Project
and e. raluation processes.
6 weeks
Completi rn, Presentation and
Submission of Thesis and
evaluatio:r processes.
.
o
Project
Thesis
ratory leave
.
Vacation (Sumrr.er, Ramadan,
Others) include
Intir
Number of weeks
r9
19
and
07
Total:
26
Semester Break
However the academic committee may reschedule the above academic calendar
if
and when
necessary.
I3. ELIGIBILITY
FOR APPEARING AT THE EXAMINATION
13.1 In order to be eligible for
13.2
appearing as a regular candidate at the semester final
examinations, a student shall have to attend an average ofat least 70oZ ofthe total number
of lectures held in all <rourses during a semester.
A student whose attendance falls short of 70% but not a below 60%o in arry course as
mentioned above ma1 be allowed to appear at the final examinations as non-collegiate
student and he/she shall not be eligible for the award of any scholarship or stipend. A
student, appearing at t.'le examination under the benefit ofthis provision shall have to pay,
in addition to the relplar fees, the requisite fine prescribed by rhe syndicate for the
purpose.
13.3
13.4
The Course mentionel above shall mean a course of study as described in the curricula
and it is a theoretical course.
Students having less than 607o attendance in lecture of any course will not be allowed
to appear at the final r:xaminations ofthe semester.
hrun€nt
of Cornputer Science and Engir€?rns, Universlv of Chitt€or€
Page 95
13.5 The conoerned course teacher for a course shall prepare an attendance rcport of
the
students. The reporr
will be submitted to the chairman of the Department within tttlee
days of the last class
ofthe course.
14. STRIKING OFF
TIIE NAMES AND READMISSTON
l4.lThenamesofthestudentsshallbestruckofftherollsonlhefollowinggtounds:period, or
14.1.1 l.to.r_puy-""i or university fees and dues within the prescribed of the
failure to appear at the semester examination due to shortage
minimum required percentage of class attendance'
14.1.2
Failure to eam required GPA to get himself,iherself promoted to the next
higher semester oi failo." to appear at the semester examination after
depositing examination fees.
14.1.3
Forced to discontinue his/her studies under disciplinary rules and
14.t.4
Withdrawal of names from the rolls of the University on grounds acceptable
to the Vice-Chancellor of the University after having cleared all dues.
name has been struck off the rolls under clause l4.l.l seeks
readmission before the start of that semester with the batch that immediately follows
on recommendation of and with the date fixed by the academic committee of the
department on payment ofall the fees and dues.
14.2 In case a student, whose
14.3 In case a student, whose name has been struck off the rolls
under clause 14.1.2 seeks
readmission before the start of next higher semester with the batch that immediately
follows on recommendation of and with the date fixed by the academic committee of the
department on payment of all the fees and dues.
14.4 In case a Student, whose name has been struck off
the rolls by exercise of the clause
14.1.3, seeking readmission alier expiry of the suspension period, shall submit an
application to the Chairman of the Department before the commencement of the semester
to which hdshe seeks re-admission. The Chairman of the Department shall forward the
application to the Deputy Registrar (academic). In case the readmission is allowed, the
student will be readmitted on payment of all the fees and dues within l0 working days
from the date ofpermission given by the proper authority.
14.5 In
case any application for readmission is rejected the student may appeal to the
Academic Council for re-consideration. The decision ofthe Academic Council shall be
final.
student who has withdrawn his/her name under clause 14.1.4 shall be given
14.6 No
readmission-
14.7 All
re-admission should preferably be completed before the semester starts. The
percentage of attendance of the readmitted student shall be counted from the date of
readmission.
14.8 The application of a student for readmission will only be considered if helshe applies
within one year from the date he/she discontinues his/her studies in the University. The
maximum period of studies for M.S. Engg. degree under no clrcumstance will exceed
three academic years.
14.9 Dropping out: candidates failing to earn the required GpA after completing regular
examinations and subsequently fail again after taking readmission in the iame iemester
shall be dropped out of the programme. A candidati
win be dropped out if he/she fairs
twice within two academic years.
Deparanent of Co(Itrx(6 SciT€e ard
En$n:aing
Page 94
UnN€Grty of Chttagong
15. GRADING SYSTEM
l5.l
The letter grade system for assessing the performance ofthe students shall be as follows:
I
Numerical grad(
80o% or above
75% to less than 807,
70oZ to less than 75ol,
650% to less than 7ffi,
607o to less than 65Yo
Grade Point
(GP)
4.00
Cr€dit
Credit point
= GP x Credit
B
2.7 s
5070 to less than 55%
450lo to less than 50olo
40o% to less than 45oZ
less than 40olo
C+
2.50
1
4
4
4
4
4
4
C
2.2s
4
D
2.00
-1
F
0.00
-1
10.00
9.00
8.00
0.00
Incom lete/Absent
x
x
4
x
55%o
15.2
Letter Grade
(LG)
to less than
3.7 5
B
3.50
3.25
3.00
B+
60%0
16.00
15.00
14.00
13.00
12.00
I1.00
A Grade Point Averrrge (GPA) shall be calculated for each semester as follows
GPA=
TotalCreditPoints
lc
-
G
i=l
TotalCreditOffered
(D
S.
?''
where, z is the number ofcourses offered duing the semester, Ci is the numb€r of credits
auotted to a particular t;ourse and G1 is the grade point eamed for that course'
15.3
The cumulative Grade Point Average (CGPA) giving the cumulative perforrnance
the students of the whole programme will be calculated as follows:
CGPA=
it*o*
k=t;
Ic*
of
(iD
k=1
where, rz is the total number of courses offered in the whole programme, Ct is the
number of credits allotte d to a particular course and Gr is the grade point earned in that
course,
15.4
A Grade Point Average (GPA) shall be calculated at the end ofeach semester'
15.5
GpA, CGPA will be rounded up to the second place of decimal for reporting if the 3'd
digit is 5. For instance, CGPA=2.215 shall be rounded off as CGPA:2'22'
15.6
|s.7
obtains
theoretical course in which a student
-*;;d-;y
Earned Credit: The creCits assigned to a
a
which
in
course
Anv
the student
'F'
will
minimum'D'will be ""'"t"0 "it i'Jaiit
grade
t<rwards his/her' earned credit
student obtains 'F' grade will ""iU" ""'"'"a
*iit .tuy ot ttr" Grade Sheet and transcripts'
not be counted for Cpe .uf"rrfoil"rr-t-.'rt
part and noneither of them comes up with fractional
the 2"" digit
In GPA or CGPA calcul rtion' if
point'
affer the decimal
+;'digiiio
u"oo'
l'J
tt"
in
appears
value
zero
'J::,{Ti'i#.i1ql:xaF*$#J:ll#l;i'liiik#:'iliil#;H:
wh
hisftrer GPA will be 3'52
O€partm€nt of Computer
f --
kierrce dnd Ergr€eing,
Page 95
Unrversity of Chttagong
offie[in
andistudent earns total point secured (TP S) of 84 in that
a c]
will
be
3.24 while the precise value is 3.230769..., (iii) suppose,
GPA
then
his/her
class,
a total of 160 credits are offered in a 4-year program and a student earns total point
secured (TPS) of 585 in that program, then his/her CGPA will be 3.66 while the precise
value is 3.65625. (ol.oe.\o)c srkrrt qf6v ,!41rsfi-{ TlBfrrf,{ t\b, \e-{ IEr{ 1) {( fr51g {n\
irediis-are
)e.oe.to)c Etfrr{
q6o fiffi<
ebs
sr
T\,-K
84( fr6re c\rqlGu)
I6. DURATION OF EXAMINATION
I
puration of Theoretical examination of different courses at the end of each semest er shall be of
hours duration for courses of 3 or 4 credits and 3 hours duration of courses of 2 credits
41
I
I7. CONDUCTING EXAMINATION
17.1
An academic year shall be divided into two semesters (details are given in Section 12 of
the
17.2
17.3
17.4
t7.5
Ordinance).
I
There shall be final examinations conducted by the concerned Examination Committee
of the Departments at the end of each semester.
The results shall be finalized at the end of each semester. Individual course grades and
GPA shall be announced within a date ordinarily not later than four weeks after the end
of the semester final examinations.
Minimum passing grade: The minimum passing grade in a tbeoretical course will be D.
Examination for backlog and/or improvement:
17.5.1
t7 .5.2
t7 .5.3
t7 .5.4
t7 .5.5
If a student
does not appear or fail in a course or intends to improve his,iher
grade of a concerned paper then he./she must appear at the semester final
examination with the batch that immediately follows as the case may be;
provided that the student will not get more than B grade in that course.
However, if the candidate fails to improve the grade of the course then the
grade obtained by him/her at the immediate past examination will be retained.
Grades obta red by a student in the courses in which he/she appeared at the
backlog courses will be recorded for final assessment and the grade obtained
by him/her in those courses at the regular final examination shall
automatically be treated cancelled.
A re-admitted student shall not be allowed to irnprove results under any
consideration.
No improvement shall be allowed in project / thesis and viva-voce
examination.
For improvement of hisiher results, the student shall apply to the Chairman of
the Department at least 4 weeks before the start ofthe next examination.
8. PROMOTION TO HIGHER SEMESTER
fA,
student must eam minimum GPA 2.20 to be promoted to next higher semqster.
9. PUBLICATION OF RESULTS
19.1
2M
A student must successfully complete the courses of all the semesters within a maximum
ofthree academic years as outlined by the Committee of Courses in order to be eligible
for the award of M. Sc. Engineering degree. The student must earn CGPA 2,25 or
higher and he/she must have to earn 32 credits.
illolli l\t[qil-pasltr!! ol altuda![
o]f e;r!h
degcc.avadrne dQartrnqnrcha[lp ]
Page
D@artnsrt of Cqlput€r Science and ErEiftzng Un,\qsrty of ChittdsorE
96
determined on the basis of his/her CGPA of two semesters ofthe program.
19.3
Honours: Candidatr:s for Master's degree in engineering will be awarded the degree with
Honours if their CGPA is 3.75 or higher.
19.4
Recording of Result: The overall results of a successful student covering all semester's
examinations shall be declared on the basis of CGPA with the corresponding letter grade
(LG). The transcrip.s in English will show the course designation, course title, credit,
Ietter grade and gracle point of individual courses. GPA of each semester, CGPA for the
overall result.
20. EXAMINATION
COMI{ITTEE:
There shall be one Examinalion Committee for each semester in the department. The Committee
shall consist of one chafumar, two internal Members and one external Member (fiom other public
University). If there is mor€ than one branch, there shall be one member from each branch. If
there is no student in a branch then there shall be no additional representative fiom that branch in
the cofirmittee.
2I. SUBMISSION OF THESIS/PROJECT
A
student shall submit thesilr in quadruplicate within 19 weeks from the start of third semester.
Project shall have to be subrLitted within 6-8 weeks fiom the date of last theoretical examination.
This time limit may be ertended (if necessary) by the recommendation of the Academic
Committee of the concernec Department. The thesis shall be examined independently by two
external examiners (from another public University/Govemment Research Organization) to be
nominated by the relevant E;ramination Committee. One copy of thesis will be preserved in the
Departmental seminar library.
22. DEGREE REQUIREME\T
For the M.S. Engg degree,
l
student shall require to
fulfill
the following conditions:
A student must earn minirnum GPA 2.20 to be promoted to next higher semester.
22.1
22.2
22.3
A student must eam
a
mirimum CGPA2.25 failing which
s,/he shall be declared
failed in the
programme.
A student must eam a minimumGP 2.25 at the thesis/project.
22.4 A student eaming CGPA
4.00 shall be awarded M.Sc. Engg. with distinction and citation so
made in the academic transcript.
23. FAILED STUDEl'!-T
23.1
If
a student fails to earn required GPA in a semester, s,/tre will be treated as failed. The
failed student shall be allowed to appear in the failed course/s with the batch that
immediately follovzs as an irregular candidate, failing which s/he shall be dropped out of
the programrne.
23.2
If a student fails t: appear at the examination after depositing examination fees, s/he
shall be allowed to appear at the examination with the batch that immediately follows as
an irregular candidate without re-admission, failing which s,/he shall be dropped out of
the programme.
23.3
The failed student Irhall appear at the examination as an irregular candidate, generally as
Dep6rtrn€nt of Cornputer Scierrce dnd Engin€€nng Unrv€rsit/ of Chjftdsor€
23.3
Page 97
per syllabus in effect \,\.ithout re-admission. If any drastic changes in the syllabus are
made, the irregular candidate shall appear at the examination in his/her original syllabus
on the recommendation of the Academic Committee of the Department.
A student failing to eam required GP in thesis/project shall have to resubmit it and
reappear at the thesis/project viva-voce examination with the irnmediate oext batch only
as an irregular candidate, failing which s,/he shall he declared failed in the progamme.
24. READMISSION
If a student fails to appear at the examination due to shortage of required percentage of class
attendance or any other reason, he/she shall have to get himselflherself re-admitted as an irregular
student with the batch that irnmediately follows on recommendation of and within the date fixed by
the Academic Committee of the Department. S,tre must have to fulfill the requisite class attendance
for appearing at the examination as an irregular candidate. The student shall be allowed to appear at
the examination only once with the batch that immediately follows as an irregular candidate, failing
which s,4re shall be dropped out of the programme.
25. ADMISSION OF THE EXPELLED STUDENT
Ifa student is expelled from the university for any reason as the case may be, he/she shall have to
get hirnself,/herself re-admitted in Masters programme for once only. Generally, the syllabus in
affect for the examination concerned will be applicable for such a student. Ifany drastic changes in
the syllabus arc made, s,/he shall have to appear at the examination with his./her original syllabus on
the recommendation of the Academic Committee or the department.
26. GENERAL RULES AND LREGULATIONS FOR THE B.Sc. Engg., M.S. Engg. ,
M. PhiI. AND AI{Y OTHER DEGREE/CERTIFICATE/DIPLOMA EXAMINATIONS
OF THE UNIVERSITY
26.1 Functions of the Academic Committee/Chairman/Director of the Departments/Institutes
shall be according to General rules and regulations no, l.
26.2 Functions of the Examination Committee shall be according to General rules and
26.3
26.4
26.5
26.6
regulations no. 2
Functions of the Chairman of the Examination Committee shall be according to General
rules and regulations no. 3.
Functions of the course teacher/examiner shall be according to General rules and
regulations no. 4.
Functions of the tabulators for finalization of the results shall be according to General
rules and regulations no. 5.
Functions of the Controller of Examinations regarding examinations and publication of
results shall be according to General rules and regulations no. 6.
27. REVIEW OF THE ORDINANCE
The ordinance may be reviewed by the Academic Council on recommendation of the Committee.
28. EFFECT OF THE ORDINANCE
This ordinance shall be effective from the Academic session 2013-2014.
(Engineer Md. Alamgir Chowdhury)
Registrar
(Ir-ch.rse)
University of Chittagong
Chinagong, Bangladesh.
&
Member Secretary
Ordinance Committee
Page 98
Departnent of Computer Science 6nd Engneenns, UnMersty of Chttagons
9.2.
Detailed Syllabus of the M.S. Engineering program
Department of l3omputer Science and Engineering
Syllabus for the Degree of Master of Science in Engineering (M. S. Engg.)
Session: 2013-2014,2014-2015,2015-2016,2016-2017 , 2017-2018 and 2018-2019
1. Degree Structure: l\I.S. Engg. in Computer
Science and Engineering
First Semester
llourse Title
Course Code
CSE
CSE
CSE
MINN
MINN
M1NN
Course
I
- Selecte
I
NC
Course 2 - Selecte 1
A/C
Course 3 - Selecte,l b NC
Total Credits and Contad HoJrs
/ Week forthis
Semester
Credits
HoursAl'eek
4
4
4
.{
4
4
t2
t2
Credits
Hours/Week
4
4
4
4
Second Semester
Course Code
M2NN
CSE M2NN
CSE M2NN
CSE
Title
NC
NC
NC
and Contact Hotlrs / Week for this Semester
C )urse
I
- Selected I
Course 2 - Selected I
Course 3 - Selected I
Course
Total Credits
4
4
Cumulative Total
l2
t2
24
24
Third Semester (Project Group / Thesis Croup)
ect Grou
Course Code
CSE M3NN
CSE M398
Course Title
Credits
HourVWeek
NC
4
4
Coursel-SelectedL
ect
8
Total Credits and Contact Ho!rs / Week for this Semester
Cumulative Grand Total ( Theory + Projeco
t2
28
35
52
Credits
Hours/Week
l2
36
Week forthis Semester
l2
36
Cumulative Grand Total ( Theory + Thesis)
36
60
I
Thesis G
Course Code
CSE M399
Cr urse
Title
Thesis
Total Credits and Contad Hours
/
?age 99
D@rtrnent of Co.npjter sc€nce and ErEin€glnsi Unrversity of Chittdsf,rlg
2. List of Courses
The list ofcourses consists of different wings ofthe Computer Science and Engineering. The
academic committee of the department shall choose different cowses from the list of courses
to offer in different semesters. During course offering in a semester, the course code will be
{tnalized for respective semesters based on the following principle.
Principle for Course Code: The course code format is CSE MXNN where 'CSE' stands for
name of the Department of Computer Science and Engineering, 'M' stands for Master, 'X'
stands for semester, e.g., 'X' is ' I ' for first semester, '2' for second semester and '3' for
third semester, and 'NN' stands for course identification number, it has range from 00 to 99.
Suppose course code "CSE MX3 l " with course title "Advanced Database Systems" is
selected to offer in the fnst semester, then the course code of the course title "Advanced
Database Systems" shall be "CSE M I 3 1". The course format is shown in below.
M
CSE
!
Oor
;g
Course Code
CSE MXOI
CSE MXO2
CSE MXO3
CSE MXO4
CSE MXO5
CSE MXO6
CSE MXOT
CSE MXO8
CSE MXO9
CSE MXIO
CSE MXl I
CSE MX12
CSE MX13
CSE MXI4
CSE MXI5
CSE MXI6
CSE MXIT
CSE MXl8
x
N
N
f
*
voo
ah
9>
;E8
+.E
-.
t
E5B
z xd
cl
oo
ld,
ji6
zi
zz
Theory / Algorithms / Languages / Systems /Architecture
Course Title
Advanced Algorithms
Advanced Operating Systems
Advanced Computer Architectue
Advanced Microprocessor
Advanced Microprocessor Based Systems
Design and Construction of Compilers
Object-Oriented Systems Analysis and Design
Electronic Commerce Technologies
Process Modeling
Modeling and Simulation for Systems Engineering
Requirement Capture and Modeling
Geographical Information Systems
Parallel Computer Architecture
Information Retrieval
Real-Time Systems Design
Real Time Computing for Embedded System
Graph Theory and Application
Combinatorial Optimization
Marks
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
Credit
4
4
4
4
4
4
4
4
4
4
4
4
4
4
4
4
4
4
4
D€partrnent of Cornputer Science and En3ineering Unrversiv of Chittagong
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
MX19
MX20
MX21
MX22
MX23
M]{24
MX25
MX26
MX27
MX28
lvIX29
Parallel Algorithms
VLSI Layout Algorithms
Advanced VLS I Design
Computability and Complexity
Computer Organization and Design
Human Compu.er Interaction
Extreme Java
Programming L anguages
Formal Specifi <,ation Techniques
Multivariate Deta Analysis
Special Topics :elated to CSE
Page
100
100
100
100
100
100
100
100
100
100
100
1OO
4
4
4
4
4
4
4
4
4
4
4
Data Scien,:es / Databases / Software Engineering
Course Code
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
I\O(31
ND(32
NDG3
MX34
MX35
MX36
MX37
I\DG8
MX39
MX40
t!D(41
Course Title
Advanced Database Systems
Data Warehousing And Mining
Big Data and Data Mining
Distributed and Cloud Computing
Client Server technology and System Programming
Distributed Search Techniques
Distributed Cornputing Systems
DBMS Models and Implementation Techniques
Parallel and Dis.tributed Computing
Advanced Softrvare Engineering
Software Proje<:t Management and Quality Assurance
Marks
100
100
100
100
100
100
100
100
100
100
100
Credit
4
4
4
4
4
4
4
4
4
4
4
lletworks / Security / Privacy
Course Code
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
MX51
MX52
MX53
MX54
MX55
MX56
MX57
MX58
MX59
Course Title
Advanced Computer Networks
Advanced Wireless Networks and Mobile Computing
Distributed Syslems and Intemet Technology
Crypto graphy and Network Security
Pervasive Conrputing and Communications
Advanced Wireless Sensor Network
Advanced Information Security
Internet and Wr:b-based Technologies
Advanced Digit al Communication
Marks
100
100
100
100
t00
100
100
100
100
Credit
4
4
4
4
4
4
4
4
4
Page 101
D€parfn€nt of Computa Science and Ensineenng UnMersit/ of Chittagong
Computer Vision / Graphics / Image and Signal Processing
Course Title
Course Code
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
MX61
MX62
MX63
MX64
MX65
MX66
MX67
MX68
MX69
Advanced Digital Image Processing
Advanced Computer Graphics and Visualization
Advanced Multimedia Systems
Advanced Computer Vision
Multimedia Data Compression
Multimedia and Virnral Reality
Digital Speech Processing
Speech Recognition
Advanced Digital Signal Processing
Marks
100
100
100
100
100
100
100
100
100
Credit
4
4
4
4
4
4
4
4
4
Intelligent Systems / Robotics / Bioinformatics / Health Informatics
Course
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
CSE
Code
MX71
MX12
MX73
MX74
I\D(75
MX16
l'/{X77
MX78
MX79
MX80
MX81
MX82
MX83
MX84
MX85
Course
Title
Advanced Artificial Intelligence
Advanced Neuro-Fuzzy Systems
Statistical Machine Translation
Decision Analysis and Decision Support Systems
Intelligent Decision Techno logies
Evolutionary Computing with Novel Techniques
Machine Intelligence and Expert Systems
Social Network Analysis
Robotics
Advanced Pattern Recognition Techniques
Semantic Web Processing
Soft Computing
Automata and Natural Language Processing
Computational Biology
Bioinformatics Computing
Marks
100
100
100
100
100
100
100
100
100
100
100
100
100
100
100
Credit
4
4
4
4
4
4
4
4
4
4
4
4
4
4
4
Thesis / Project
Course Title
Course Code
CSE M398
CSE M399
Proj ect
Thesis
Marks
Credit
200
300
t2
8
D@artrn€nt of Computer Scierce and kgin€enng Unrverst/ of ChrttasorE
Page
1,02
3. DETAILED SYLLABUS FOR THE DEGREE OF M. S. ENGINEERING
Session: 2013-2014 and 2014-2015
Theory / Atgorithms / Languages / Systems /Architecture
CSE
MX01
Advanced Algorithms
100 Marl<s, 4 Credits, 4 HoursAYeek
Algorithms: Definitions, Notation and Description (pseudo.code, structured English) Analysis of algorithms
Coordinate System and Transformz.tion. Cartesian, polar and global coordinate systerq latitude and longitude,
storing coordinates, precision, Rot rtion, translation, scaling, reflectiorl affine transformation in GIS, rubber
sheeting. Representation of spatial data as objects. Definition of objecl4pes: Points, lines, polygons. Arc
based data structures, representi.tion of topology. Geographic Entity Types and Definitions. Zizes
Generalization: Elements of line (]eneralization and Linear Simplification Algorithm. Algorithms for Line
Interseclion'. The intersection of two lines, Algorithms and heuristics, Simple lines, special cases and
complex lines. Algotilhnts fot Pt'lygons: Area, Centroid, Point-in polygon. Polygon overlay: Operations
requiring overlay, General conceptl;, Computational complexity and sliver removal. Formal models ofspatial
relations: Intersection model, region-region relations, Line-region relations, higherJevel concepts and
cognitive perspective. Digital Elevtion models: Data sources, Estimating elevation, slope and aspect and
determining drainage networks. A'lditional Algorithm for Gridded DEMS: Determining drainage networks
and visible aras. The TIN (Triangulated lrregular Network) Data Model: Choosing vertices, Triangulation
algorithms, Storing TINs, Contouri rg and other algorithms. Temporal and three dimensional representations:
Temporal dimensions of geogapt.ic phenomena, Methods of representation for 3-D. Hierarchical data
structutes: Quad{rees, Indexing pixels, run-encoding, scan order and decoding. Quad-trees algoilhms and
spalial indices: Area, overlay, adjacency and overlay, vectorization etc. Spartal Interpohrton I: Surface and
fields, point-based Interpolation, Thread surfaces, distance-weighted averages, etc. Spatial Interpolalion II:
Areal Intopolation and other Interpolation issues. Parallel Processing Algorithm for GIS: Concepts,
Terminology and techniques.
Reference Boolcs :
l. Dexter Kozen: The I)esign and Analysis of Algorithms
2. V.V. Muniswamy: Design and Analysis of Algorithrns
3. Chandra Mohan: Der ign and Analysis of Algorithms
MX02
Advanced Operrrting Systems
100 Marl<s, 4 Credits, 4 Hours/llzek
CSE
Overview, Sequential Processes, Banker's Algorithms, Concurrency, Functional Systems, Mutual Exclusion,
Processes Cooperation, Process Cornmunication, Semaphores, Conditional Critical Regions, Event Queues,
Deadlock, Processor Management, i;hort term and Long term scheduling problems, Scheduling algorithms,
Queuing system model, Non-preenptive Scheduling, Pre-emptive Scheduling, Virtual Memory, Storage
Management, VO Programming anrl Intemrpt Structues, Device Management, Information Management,
Security. Distributed Operating Systems Concept, File Systems, Mode of Computation, Load Balancing,
Event Ordering, Synchronization, D stributed Mutual Exclusion, Drinking Philosophos Problem. Deadlocls
in Distributed Systems Feature of UI[X.
CSE
MX03
Advanced Computer Architecture
100 Marks, 4 Credits, 4
HoursMtek
Architectural Abstraction, Classification schemes, Parallelism: Pipelining, Multiprocessing. Issues in Branch
performance, Synckonization in Vxltiprocessing, High Performance Processor Design Issues: Pipeline
design, Memory system design, L'O design. Instruction level parallelisnr, Tlread and process level
parallelisrL Data parallelism. Vector machines, Dependency Analysis, Vectorizatior! Optimization in Vector
Processing, Vector Chaining, Exar!)le systems. Associative Processors and Algorithms Super-scalar and
VLIW processors, Example systems zrnd main issues in design. Multiprocessors: Shared Memory, Distributed
D€partrnent of Computer ScEnce and EnsineerinS, Universiv of Chittagor€
Page
1O3
Memory Architectures; Multiprocessor Interconnections, Memory systems for Multiprocessors, Example
systems; Cache Memory, coherence issues, protocols. Multiprocessor Simulation and Measurement.
Reference Books:
l.
2.
3.
4.
5.
D. Sima, T. Fomtain, P. IGcsuk, "Advanced Computer Architectures: A Design Space
Approach", Addison WesleY, 1997.
J. Flynn, "Computer Architecture: Pipelined and Parallel Processor Design", Narosa
Publishing Housd Jones
K. Hwang, "Advanced Computer Architecture: Parallelisnr, Scalability, Programmability",
McGraw-Hill, Inc
Hwang and Briggs, "Computer Architecture and Parallel Processing, McGraw Hill.
B. Bames, Modeling and Performance Measurement of Computff Systems, MIT Press.
CSE MX04 Advanced Microprocessor
100 Marl<s, 4 Credits, 4 Hours/ll/eek
Review of different microprocessors: 80486, 68040, V70, Gmicro processors; Comparing the architectures:
RISC and CISC; Instruction set of machines: SPARC, INTEL, and MIPS; Study of microprocessors: Pentium
lI, Npha 21064, MIS 6400, PA-RISC; Math coprocessors and microprocessors.
CSE MX05 Advanced Microprocessor Based Systems
100 Marlrs, 4 Credits, 4 Hours/Ileek
Introduction: Basics of Von Neumann Architecture and the early Microprocessors, CISE and RISC concepts;
Parallelism in Processor Architecture: Pipelining, Super-scalar, Super-pipeline and \ILIW
Architectures, Low-power Architecture; Built-in Multiprocessing support; Coprocessors; Processor
Architecture with hierarchical memory organization: Cache memory.
CSE MX06 Design and Construction of Compilers
100 Marlrs, 4 Credits,4 Hours/ll'eek
Review
of compiler fundamentals - lexical
analysis, parsing, semantic analysis, error recovery and
intermediate code generation: Runtime storage management; Code generatioq Code improvement - peephole
optimization, dqrendence analysis and redundancy elimination, loop optimization, procedural and interprocedural optimizatior! instruction scheduling, optimization for memory hierarchy; Compilation for high
performance architecture; Portability and retarget ability; Selected topics from compilers for imperative,
object-oriented and mark-up languages, parallel and distributed programming and concurrency.
CSE
MX07
Object-Oriented Systems Analysis And Design
100 Marlrs, 4 Credits, 4 Hours/Week
Object Concepts: Objects, Classes, inheritance, Objecfitem Oriented Type Systems.
Software Development Methodology: Engineering or invention? , Example Artifacts using UMI
Requirement Capture: Introductiorl Business Perspective, Developer Perspective.
Analysis: Introduction, Static Analysis, Dynamic Analysis.
System Desigtr: Introduction, Networked System Topologies, Choosing Technologies, Partitioning
Software.
Subsystem Design: Designing the Business Logic, Persistence using a Relational Database,
Finalizing the User Interfaces, Designing the Business Services, Thread Safety.
Code Specificatior: Background, Object-Oriented Specifrcation, Informal Specification in Java.
UML Notation rnay be considered throughout the course unit.
Reference Book:
1. Object-Oriented Analysis and Design with Applications (3rd Edition) by
Grady
Booch, Robert A. Maksimchuk, Michael W. Engle , Bobbi J. Young, Jim Conalle&
Departmg\t of Comflter Scie.lce and Eryarx:erins, Uni\€rsity of Chittngorg
2.
3.
Page lO4
Kelli A. Houstor, Addison-Wesley Professional.
Grady Booch, Ii.obert A. Maksimchulq Michael W. Engle , Bobbi J. Young, Jim
Conallen, Kelli A. Houston: ObjecrOriented Analysis and Design With Applications
(3rd Edition).
Ronald J. Norman: ObjecfOriented Systems Analysis and Design
CSE MX08 Electronic Cornmerce Technologies
100 Marks, 4 Credits,4 Hours/'leek
The Sociologt & psychologt of electronic cornrnunitiesi Building, recognizing, managing and
making use of online communities in web-based env onments( such as communities of practice,
communities ofpurpose). Theories of online presence and cooperation. A Guide to e-commerce in
General: How to differentiate e -commerce today from e-commerce yesterday. Current problems of
e-commerce. Interesting solutions and approaches to those problems. A guide to knowledge
Commerce: Understanding Knowledge as a commodity and as a process, and representing it in web
-based environments. fir'eb architecturc: Structural design of e-commerce systems. Clienfserver
architecture ,2-,3-,n-tie design,server farms, sealebility. Integration oflegacy systems. Java Beans,
Enterprise Java Beans (EJB),Ja'la Server Pages(JSP). Data interchange: Exchanging data over the
Intemet XML, style sheets, dor;ument types definition (DTD); metadata and document discovery.
Interchange ofprocesses using'MSDL and SOAP (as example). Usabilily: User interface design for
web-sites. Use of HCI methodologies in evaluating user interface. Electronic payments.
technologies that support the processing of electronic payments. Characteristics and properties of
electronic payment systems. Irormalisms of correctness. Mass personalitralion and the virtual
customer: Automation of the crLstomer relationship. Use of data to customize the web experience.
Cookies and their risks. Obtaining and using personal information. Rule- based filtering, implicit
profiling, collabomtive fi ltering.
Reference Books:
1. Gary Schneider: Electronic Commerce
2. Kenneth C. Laudon anl Carol Traver: E-Commerce 2014 (lfth Edition)
3. Mehdi Khosrow-Pour: Cases on Electronic Commerce Technologies and Applications
(Cases on Informatiorr Technology Series)
4. Zongqng Zhou: E-Cornmerce and Information Technology in Hospitality and Tourism
CSE
MX09
Process Modeling
100 Marl<s, 4 Credits, 4 Hours/W'eek
their software, socio-technical perspective, interaction basis of
organizational process, process of co-ordination layer, process and software evolution. OPM
Notalion: OPM conceptual models, OPM Role activity Diagrams, modeling conventions . OPM
Background (Posilioning): Organization : Interactions and goals, evolution. Systems lheory:
origins, application to organizations. Software engineering: software process , evolutionary
software systems, process versus data. OPM Method: Managing the modeling exercise ,
participation of users, creating tt.e model , modeling the system, modeling the goals, modeling the
method, designing for process support technolo gy. Case Study: Introduction to the group case study.
Process concepts: Role Activit r Interaction paradigrq generic processes, operational and meta
processes, passive models and ar:tive models, process domains. Process Evolutioa: Meta-process,
process for process Evolution (P2E), process instance evolution. Process Technology: opM method
model and active model, requirernents for active model technology, example process web model,
process support system architecture, process web web PML (Process Modeling Language), process
Intoducrion: Organizations
Web user interface.
anc.
Departrnent of CompLrter Science and Ensineering UnMe6ity of Chrttagoflg
Page
1O5
Reference Boolc:
l.
Suresh G. Advani and E. Murat Sozer: Process Modeling in Composites
Manufacturing, Second Edition
2. B. Wayne Boquette: Process Control: Modeling, Design and Simulation
3. Suresh G. Advani, E. Murat Sozer: Process Modeling in Conposites Manufacturing
4. Morton M. Denn: Process modeling
5. Ian T. CamerorL Katalin Hangos: Process Modelling and Model Analysis
CSE
MX10
Modeling and Simuhtion for Systems Engineering
100 Marl<s,4 Credits, 4 Hours/Week
Introdaction lo Srstem Simulation: Introduction to Simulation, Simulation Exanples, Genoal Principles,
Simulation Software. Malhernatical and Stafisrtcd Models: Slatistical Models il Simulatioq Queueing
Models. Random Numbers: Random-Number Generation, Random-Variate Generation. Analysis of
Simulalion Data: lnput Modeling, Verification and Validation of Simulation Models, Output Analysis for a
Single Model, Comparison and Evaluation of Altanative System Designs. Applications: Simulation of
Manufacturing and Material-Handling Systems, Simulation of Computer Systems, Simulation of Computer
Network.
Reference Book:
l.
2.
3.
4.
5.
CSE
MXll
Discrete-Event System Simulation (5th Edition) by Jerry Bank, John S. Carson II, Barry L.
Nelson, David M. Nicol; Prentice Hall.
Devendra K. Chaturvedi: Modeling and Simulation of Systems Using MATLAB and
Simulink
Dean C. Kamopp and Donald L. Margolis: System Dynamics: Modeling, Simulatiorq and
Control of Mechatronic Systems
Averill Law and W. David Kelton: Simulation Modeling and Analysis (Industrial
Engineering and Management Science Series)
Byoung Kyu Choi and DongHun Kang: Modeling and Simulation of Discrete Event Systerns
Requirement Capture and Modeling
Hours/lleek
100 Marlrs, 4 Credits, 4
Role of requirements engineering techniques, organizational requirements, group session
approaches,
requirements capture, verification and validation of requirements, Modeling of functional and non functional
requirements, enterprise and process modeling, design rational approaches, ObjecrRole Modeling, Modeling
time and incomplete information. Meta-modeling as an approach to speci$ different modeling methods,
Enterprise knowledge Modeling and goal modeling.
CSE MXf 2 Geographical Information Systems
100 Marlrs, 4 Credits,4 Hours/Ileek
Intoduction:, What
is a GIS? ;
Terminology; Computer Assisted Cartogaphy, Remote Sensing,
photograrnrnetry and Land Information Systems; What is Geographical data? GIS data Capture; GIS displays
etc. Spatial Analysis and Cartographic Concepts: Point, lines, areas and surfaces,
Nominal, ordinal, interval and ratio attributes; Socio-economic versus resource and physical data, Georeferencing; Geo-codes etc. Map projection and ransformations, properties thereof; Co-ordinate
transformation in 2D and 3D; Fundamentals spatial concepts: distance. orientation. pattern, proximity and
connection; The quality of spatial surfaces: including generalization and enhancement, perimeter, area,
polygon reclassification and overlaying techniques; The object/Layer d6ate. Technical Aspect of GISI
Relationship between GIS and other Inforrmtion Systerns; Data models for spatial data: Arcs, polygons,
topological data structures, polygon building; Data capture devices, digitizing and scanning techniques- state
of the art; Special environment for GIS; Issues of display, hard v. Virtual, vector v. Raster, data resolution;
Graphics output design issues: Odes of use GIS Interaction; Temporal and 3D representation; Line
D@ tn€nt
of Corngn€I Scldlc€ o.d ErBlneanr.g UnNersty of Chitagq"g
Page 1O6
Generalization; Use and functiorL of the Global Positioning System (GPS) in GIS. Ilre Application of
Geographical Informalion Syslemst Who uses them and what for public utilities, resources analysis, urban
planning and decision support. C lobal scale application: international initiatives; global data capture and
referencing. The actual use of GIli, map analysis, spatial data searches etc. Cost and benefit ofGIS. GIS and
Global science. GIS and Spatial Cognition. Knowledge based techniques in GIS.
Reference Boola:
l.
2.
3.
CSE
MX13
Paul A. Longley, Ivlike Goodchild David J. Maguire, David W. Rhin: Geographic
Information Syste:ns and Science
By James Conolly Mark Lake: Geographical Information Systems in Archaeology
Fahui Wang: Geolgaphic Information Systems and Crime Analysis
Parallel Computer Architecture
100 Marl<s, 4 Credits, 4 Hours/l.Teek
Theoretical aspects of parallel and pipeline computation; time and processor bounds on classes of
computations; data alignment netv,ork speed and cost bounds; conllict-free access memories; and overall
computer system ideas. Parallel processing: Importance, architecture. Hardware and software issues,
Architectures for parallel processirtg-classifications, comparative study of different architectures, hardware
issues in parallel processing, parall,i programming, Distributed processing: Definition, Impact of distributed
procession on organization, pitfalls .n distributed processing.
CSE MX14 Information Retrieval
100 Marlts, 4 Credits,4 Hours/l!eek
Boolean retrieval, The term voczbulary and postings lists, Dictionaries and tolerant retrieval, Index
construction, Index compression, Scoring, term weighting and the vector space model, Computing scores in a
complete search systerq Evaluation in information retrieval, Relevance Ibedback and query expansion, XML
retrieval, Probabilistic information letrieval, Language models for information retrieval, Text classification
and Naive Bayes, Vector space clas;ificatioq Support vector machines and machine leaming on documents,
Flat clustering, Hierarchical clustering, Matrix decompositions and latent semantic indexing, Web search
basics, Web crawling and indexes and Link analysis.
Reference book:
l.
2.
3.
CSE
MXls
Christopha D. Manring, Prabhakar Raghavan, Hinrich Schiitze: Introduction to Inforrnation
Retrieval
Stefan Buettcher and Charles L. A. Clarke: Information Retrieval: Implementing and
Evaluating Search Engines
Ricardo Baeza-Yates and Berthier Ribeiro-Neto: Modem Information Retrieval: The
Concepts and Techn:logy behind Search (2nd Edition)
Real-Time Systerns Design
100 Marks, 4 Credits, 4 Hours/Week
Introduction lo real time systerL emb,:dded systems and reactive systems; Hard and Soft Real Time Systems;
Handling real time; Specification and Modelling; Design methods; Real Time operating systerns; Validation
and Verification; Real time Process arrd Applications; Distributed Real Time Systems.
CSE
MX16
Real Time Computing for Embedded System
100 Marl<s, 4 Credits,4 Hours/Week
Definition of real-time, temporal and e r'ent determinisr& design principles and practice; Architecture review and
interfacing, interrupts, traps and events, response times and latency, real-time clocks; Operating systerns: Structure
of an RTOS, nucleus, servers, schedulers and dispatchers; Synchronization and communication: priority and
distribution queues, system Modeling, static scheduling, priority drive scheduling; Real-time communicatioD,
device drivers, operating systerns; l-angrages in real-time, concurrency issues, Real-time programming.
D"partrnent of Cofitput€r Scioce dnd Ergin€enng Universiv of Chittasor8
Page
lO7
CSE MX17 Graph Theory and Application
100 Marks. 4 Credits, 4 HoursMeek
Introduction to gaphs and digraphs; Fundamental concepts: isomorphisn! adjacency and connectivity; Trees,
Salesman
spanning ,.""", ko*"., paths, distances in graphs; t{amiltonian aod Eulerian graphs, Travelling
optimal
theorerq
marriage
pioble-l Chinese Postman problem; Matching and covers: Hall's theorenr,
assignment, veitex covers, edge covers; Connectivity and cuts: vertex and edge connectivity, Menger's
theoiem, Max-flow Min-cut theorem in networks; Graph coloring: vertex coloring and edge coloring, kchromatic graphs, application to scheduling; Planar graphs: embeddings, dual graphs, Euler's formula,
Kuratowski's theorem; Perfect graphs.
CSEMX1S CombinatorialOptimization
100 Marl<s, 4 Credits, 4 Hours/llreek
Introduction to Optimization; Linear Programming: Diffoent forms. Simplex Method Primal-Dual theory;
Max-Flow: The Max-Flow-Min-Cut Theorern Ford-Fulkerson Labeling Algorithr4 Dijktra's Algorithrq The
Floyd-Warshall Algorithm; SOME-Network Flow Algorithms: The Minimum Cost Network Flow Method,
Transportation; Problem; Capacitated Transportation ProblenL Assignment Problem; Integer Linear
Programming; Relaxation; Cutting-Plane Algorithm; Branch and Bound Technique; Dynamic Programmingl
NP Completeness; TSP and Heuristics; Approximation.
CSE
MX19
Parallel Algorithms
100 Marks, 4 Credits, 4 HoursMeek
Introductiorl parallel processing, parallel models, performance of parallel algorithms, work-time presentation
ftamework; Basic techniques: Pointer jumping, balanced trees, divide and conquer, pipelining, partitioning,
symmetry breakhg; List ranking, Euler tour technique, tree contraction; Parallel searching, merging and
sorting; Connected components; Minimum spanning trees; Bi-connected components; Simulation between
PRAM models: EREW, CREW and CRCW.
CSE MX20 VLSI Layout Algorithms
100 Marks, 4 Credits, 4 HoursMeek
lnhoduction: WSI design process, layout styles, difficulties in physical design, definitions and notations;
Circuit Partitioning: problem definition, cost functions and constraints, Kernighan-Lin algorithm and its
variations, simulated annealing; Floor plarming: problem definition, models, cost functions and constraints,
cluster growth, simulated annealing, dual graph technique; Placement: problem definition, models and cost
functions, approaches to placement; Grid routing: problem definitioq cost functions and constraints, maze
routing algorithms, line search algorithms; Global routing: problem definition, cost functions and constraints,
routing regions, sequential global routing, hierarchical global routing; Channel routing algorithms; Layout
generation.
CSE MX21 Advanced VLSI Design
100 Marlcs, 4 Credits, 4 Hours/ll/eek
Overview of VLSI technology; Review of CMOS logic circuits; Scaling And Interconnect Issues; Deep
submicron design issues; Advanced clocking strategies; Clock distribution trees; High speed switching
circuits; Low power desigu Memory circuit design trends, Performance optimization; SOI technology and
circuits; VLSI circuit in signal processing, VLSI circuit in wireless communication; Introduction to ASIC
design.
CSE
MX22
Computability and Complexity
100 Marl<s, 4 Credits, 4 HoursMeek
Overview : This course will cover NP-completeness, diagonalization, oracle computations, space complexity,
Turing machines with alternating quantifies, Boolean circuits and circuit lower bounds, randomized
D@6.tm€nt of Comgner
Page
krerce 6nd ErBin€ang, Universv of Chrttagor€
1O8
computation, interactive proofs, derrndomization, pseudorandom constructions, and probabilistically
checkable proofs.
Ref*ence Books:
L
S. Arora and B. Barak, Computational Complexity:
University Press,
CSE
MX23
A
Modem Approach, Cambridge
11009
Computer Orga.nization and Design
100 Marks, 4 Credits,4 Hours,frbek
Classification and addressing model, Operands and Operations for Media and signal processing, instructions
for control flow, Encoding an instrlction set. Pipelined and Superscalar processors. Data hazards, Dynamic
scheduling. Branch prediction, Ha:dware based speculation. Thread level parallelism. ILP with software
approaches: Compilo Techniques, static branch predictioq static multiple issue, advanced compiler support
for ILP. Basic Techniques of Integer Arithmetic, Floating-point Arithmetic, Speeding up Integer Additioq
Speeding up Integer Multiplication and Division, Memory technology, RAIDs, organization for improving
poformance, Virtual memory and protection. Cache organization. Reducing cache miss rate and penalty.
Busses, Performance measures. Designing I/O system, Reliability, Dependability and Availability. Symmetric
shared memory architectures, Cr.che coherence protocols, Distributed shared memory architectures,
Synchronization, Models for menrory consistency. Multithreading. Interconnection Networks- Practical
issues. Network on chip. Designing cluster. Advanced RISC, CISC and Embedded processors architectures.
CSf, MX24 Human Computer Interaction
100 Marlrs, 4 Credits,4 Hours/\4'eek
Introduction to HCI methods. Interaction styles and general design. Various user interfaces and interaction
strategies. Programming usable irterfaces. Software architectures for user interface. Human factors of
interface design. Interface maaphors and conceptual models. Screen design, HCI and World Wide Web. Task
analysis. Usability evaluation. Collaborative systems. Groupware and Coordination technologies.
Reference Book:
2. Human Computer Interaction: Alan Dix, Janet Finlay.
3. Designing the User Interface, 5b Edition: Ben Shneiderman
CSE
MX25
and Catherine Plaisant.
Extreme Java
100 Marks, 4 Credits, 4 Hours/Weer
Perfornance and Programming Sry/e: What is Performance? , Improving Performance, Programrning Tips
and Tricls. Persistence in Java: Serialization, Java Database Connectivity (JDYC). Common Objea Request
Broker Architectare (CORBA)'. C ORBA and IIOP, Hello Worl4 Interface Definition Language (IDL),
Mapping to Java, Host Implementation. Reflection and JavaBeans: Inspecting Classes at Run Time, Working
with Inspected Classes. What is a Software Component?, Implementing Software Components. "I4va
Foundation Class (JFC): Swing Components, Swing Feature, Accessibility, JTC and the Abstract
Windowing Toolkit (AWT). Remote Method Invocation (RMI): RMI Architecture, RMI API. Java Native
Inle{ace (JNI): Callng Native Functions from Java, Calling Java Methods from Native Code.
Manipulating Java objects in Nativ: Code, Garbage Collection and JNI, Invoking a Virtual Machine from
Native code. SecuiE: Security Olerview, jar - Managing Java Archives, key tool - Managing Keys and
certificates, jar signer - Signing and veri$ing JAR Files, policy tool - Managrng Security policies.
Overview of Oprtonal Packages: The Optional Packages, Otho players.
Reference Books:
1. Eic
2.
3.
M. Burke and ,\ian M. Coyner: Java Extreme programming Cookbook
Lindsay peters and rim Lavers: Swing Extreme Testing; The Ex;me
appioach to comptete
Java application tesring
Anil Hemrajani: Agile Java Development with Spring, Hibernate
and Eclipse.
Page
Departrnent of Computer Science and Engln€eing, University of Chittasong
CSE
MX25
1O9
Programming Lenguages
100 Marlrs, 4 Credits, 4 Hours/Week
Overview : This course is an in-depth investigation of the theory ofprogramming languages. The course
covers the fundamental tools used in the analysis and design ofprogamming languages, including semantics,
type theory, abshact interpretation, metaprogrammi ng, and partial evaluation. We will also consider their
appticationio imperative, functional, and object-oriented languages. Topics to be covued include: Semantics:
opiational, denotational, axiomatic Lambda calculus and domain theory Typing safety, subtyping, recursive
types, polymorphism Data abstraction, objects, inheritance, mixirs Additional topics may include concurrent
languages, continuations, and metaprogranrming
Reference Boolcs:
l.
CSE
MX27
Types and Programming Languages. Benjamin C. Pierce, The
MIT
Press, 2002.
Formal Specilication Techniques
100 Marlc, 4 Credits, 4 Hours/Week
Overview : Pre-/postconditions, refinement, state-based approaches, event based approaches, algebraic
specifications, Petri nets, temporal logic, properties ofprograms, specification verification and validation.
The main objective is to introduce students to commonly used formal state-base4 eventbase4 and algebraic
techniques to speciff and verifr software systems. The course ains as well to foster understanding of the
mathematical foundations of these specification techniques, and the development ofthe skills needed to set up
and manipulate mathematical models for relevant features of software systems.
Reference Bool<s:
1.
Rigorous Software Development
An Introduction to Program Verification, by Jos'e
Bacelar Almeida, Maria Jo-ao Frade, Jorge Sousa Pinto, and Sim-ao Melo de Sousa.
Springer, London, 201 I .
-
CSE MX28 Multivariate Data Analysis
100 Marl<s, 4 Credits, 4 Hours/Week
Multivariate Data And Multivariate Statistics: Introduction, Types of Data - nominal, ordinal, interval,
ratio missing observations, Basic Multivariate Statistics - mean, variance, covariance, correlation, The Aims
of Multivariate Analysis data exploration, inference.
Exploring Multivariate Data Graphically: Introduction, The scatterplot, Scatterplot Matrix, Enhanced
Scatterplots - bubble plots, smoothing, density estimates, bivariate boxplots, Coplots and Trellis Graphics conditioning plots, dimension reduced graphs, Probability Plots- Quantile and normal plots, Other Plots - 3D spir, Star plots, Chernoff Faces.
Principal Components Analysis: Introduction and Motivation- data dimension reduction, linear
combination of variables, Presentation of Method- eigenvalues and vectors, loadings, scores, Extensions,
Graphical Methods- biplots, Applications and Examples.
Correspondence Analysis: Introduction and Motivation - categorical scatter plots and maps, A Simple
Exanple, Two-Dimensional Tables - correspondence analysis, Applications, Multiple Correspondence
Analysis.
Multidimensional Scaling (MDS): Inhoduction and Motivation, Proximity Matrices, Classical MDS, Metric
LS MDS, Non-metric MDS, Non-Euclidean metrics, Three-way MDS, Inference in MDS.
Cluster Analysis: Introduction and Motivation - classificatioq Agglomerative Hierarchical
Clustering Techniques -inter-cluster dissimilarity, single linkage, complete linkage, Optimization Methods total, within and between group dispersion, Finite Mixture Models for Cluster Analysis- mixture distributions.
The Generalized Linear Models (GLM): Linear Models, Non-linear Models, Link Functions, Error
Distributions.
Regression and MAIIOVA: Introduction and Motivation, LS Estirnation and ANOVA models, Direct and
Indirect Effects-path diagams.
Log-Linear snd Logistic Models: Introduction and Motivation-categorical, binary response, MLE -
Page
Departrnent of Computer Science and Ergineetng, Unvectty of Chltt€ons
sampling scherne, likelihood function, model selection, Transition Models
-
11O
longitudinal study, Markov
chains.
Multivariate Response Models: Introduction and Motivation - multivariate response vs. multivariate
explanatory variables, Repeated lleasures, Multivariate Tests, Random Effects, Logistic Models binary
response, Marginal Models for Binary Response, Marginal Modelling, Generalized Random Effects.
Discrimination, Classilicatiorq
and Pattern Recognition: Introduction and Motivation,
Exanrple, Allocation Rules, Fisher's Discriminant Function, Assessing Discriminant Function, Quadratic
Discriminant Functior! More thzn Two Groups, Logistic Discrimination, Variable Selection, Other
Methods,Pattern Recoglitior! Neur ll Networks.
Exploratory Factor Analysis: Intrcduction to Factor Analysis-latent variable, Basic Factor Analysis Model-
factors, factor loadings, commu ralities, factor scores, Estimation
of the FA Model,
Rotation of
Factors, Estimating Factor Scores, I'actor Analysis vs. PCA
Conlirmatory Factor Analysis and Structural Equations Models: Introduction, Path Analysis and Path
Diagrams. Structural Equations Mo,lels (SEM's), Assessment of Fit.
CSE
MX29
Special Topics r€lated to CSE
100 Marl<s, 4 Credits,4 Hours/\|'eek
Data Sciences / Databases / Software Engineering
CSE
MX31
Advanced Data rase Systems
100 Marl<s, 4 Credits,4 Hours/\|'eek
Object-based Databases : Data Mocel, Design, Languages; Object Relational Database: Complex data types,
Querying with complex data types, Design; XML : Query Processing and Optimization: Database System
Architectures : Parallel Databases : Different ty?es ofparallelisnl Design ofparallel database; Distributed
Databases Levels of distribution transparency, Translation of global queries to fiagment queries.
:
Optimization of access strategies, N{anagement of distributed transactions, Coacurrency control, Reliability,
Administration; Data Warehousing and Mining : Basic Concepts and algolithms. Spatial and Temporal
Data and Mobility: Multimedia Databases. Multimedia Database Systems Basic concepts, Design,
Optimization of access strategies, Management of Multimedia Database Systems, Reliability.
Reference Books :
l.
Abraham Silberschrrtz., Henry F. Korth, S. Sudarshan, DATABASE SYSTEM CONCEPTS,
SIXTH EDITION , Published by McGraw-Hill, ISBN 978-0-07-352332-3
CSE MX32 Data Warehousing And Mining
100 Marks, 4 Credits, 4 Hours/Week
Data warehousing requirements. Dalabase technology underpinning data warehousing and data mining. Data
warehouse architectures. Data warthouse logical design: star schemas, fact tables, dimensions, snou'flake
schemas, dimension hierarchies. OI,AP architectures, OLAP operations. SQL extensions for OLAP. Data
warehouse physical design: partiti rning, parallelisnq cornpression, indexes, materialized views, column
stot6. Data warehouse conslruclion: data extraction, transformation, loading and refreshing. Data warehouse
support in Oracle. Warehouse metzdata. Specialized warehouse architectures. MapReduce and warehouse
architectures: Hive. Data mining introduction, Classification: decision trees, Bayesian classifiers, support
vector machines. Cluster analysis: k means and its variants, hierarchical and density based clustering. Clusta
evaluation. Association analysis using item sets and association rules. Evaluation ofassociation patterns. Data
mining tools and applications, Data visualization. Anomaly Detection, Web Mining, Data Mining
applications.
Reference Bool<s:
D@artrnent of Cornpder scie,rc€ and EngrneeriE, Uni!€rstt/ of chittasorE
Page 111
l. Kimball, Ross, Thomthwaitg Mundy &
Becker: The Data Warehouse Lifecycle Toolkit (2nd
ed.)
2. Jiawei Han, Micheline Kamber, Jian Pei: Data Mining: Concepts and Techniques (3rd ed.)
3. Mclaren & Mclaren: Data Warehousing and Data Mining.
4. Efiem G Mallach: Decision Support and Data Warehouse Systems.
5. Michael J. A. Berry, Gordon S. Linoff: Mastering Data Mining
6. Marakas: Modem Data Warehousing Minning, and Visualization Core Concepts
7. Dunham: Data Mining: Introductory and Advance Topics
CSE
MX33
Big Data and Data Mining
100 Marks, 1 Credits, 4 Hours/Week
Introduction; Data warehousing and OLAP technology for data mining; Data preprocessing; Data mining,
primitives, languages and systems; Descriptive data mining- characterization and comparison; Association
analysis; Classification and prediction; Cluster analysis; Mining complex types of data; Applications and
trends in data mining. Big data and API: Distributed file systems, Map/reduce, Hadoop (what's that? when
is it useful?). Related big data technologies/platforms: Pig, HBase Programmatic access to get (and post) data.
Example: get data from web source, process locally, visualize using visualization API. Predictive models I:
Data representation for predictive modeling, models, data-driven-model applications. Evaluating models,
metrics for model Quality. Predictive models II: Learning models from data. Training. How does that work
for selected models? Overfitting, holdout evaluation, cross-validation, overfitting avoidance.
Reference Book:
l.
2.
CSE
MX34
Data Science for Business: Fundamental principles of data mining and data analyic thinking:
Provost & Fawcett.
Doing data science: O'Reilly Media.
Distributed and Cloud Computing
100 Marks, 4 Credits,4 Hours/ll'eek
Definition of Distributed Systems. Goals: Connectedness, Transparency, Openness, Scalability.
Communication: Layered Protocols, RPC, Remote Object Invocation, Message and Stream Oriented
Communications. Processes: Th,reads In Distributed Systems, Clients, Servers and Transparency; Code
Migration: D Agents, Software Agents. Naming: Naming Entities - DNS Example, Locating Mobile Entities.
Synchronization: Clock Synchronization, Global State, Election Algorithms, Mutual Exclusion, Distributed
Transactions. Consistency and Replication. Fault tolerance and Security In Distributed Systems;
Distributed Object Based Systems: CORBA, Distributed COM. Distributed File Systerns: SUN, CODA,
Plan 9. Distributed Document Based Systems: WWW. Distributed Coordination Based System.
Overview: Defmition and characteristics (elasticity, multi-tenant, on-demand ubiquitous access, usage
metering, self-service, sla-monitoring); Cloud Conputing and Service Oriented Architecture; Enterprise
Cloud drivers and adoption trends; Typical Cloud Enterprise workloads; Cloud service models/types (public,
private, hybrid, and community clouds); Cloud deployment models; Cloud ROI models; Cloud reference
architectures; Cloud standards ; Technology providers vs. Cloud providers vs. Cloud vendors; Planning Cloud
transformations (suitability assessment, future state definitioq financial assessment and platform selection,
roadmap definition). Infrastructure As A Service (Iaas): Evolulion of infrastructure migration approaches
(viroalization, adaptive virtualization, Cloud Computing and on-demand resource provisioning); Cloud
lnfrastructure services (storage, compute, services management, cloud brokers); IaaS vendor solutions; IaaS
mainstream offerings. Platform As A Service (Paas): Evolution of computing paradigms and related
components (dishibuted corputing, utility computing, Cloud computing, grid computing); Cloud platform
services (monitoring and management, application servers, messaging, data management, development and
testing, integration, business intelligence); PaaS vendor solutions; PaaS mainstream offerings. Software As A
D@artn€nt of ComoJter Sci:nce and Ergine
rng
Univeryty of ChittngorE
Page 17,2
Service (Saas): Cloud application development lifecycle SaaS platform sovices (application development,
application migation, SaaS implernentation, business intelligence - Cloud-based,/big data/real time analyics);
SaaS vendor horizontal solutiorx; SaaS vendor vertical solutions; SaaS mainstream offerings. Business
Process As A Service (Bpaas): BPM on the Cloud and BpaaS sample solutions; BPaaS platform services;
BPaaS vendor solutions; BPaaS mainstream offerings.Cloud Security: Cloud security challenges; Cloud
security approaches: encr)?tion, t:kenization/obfuscation, cloud security alliance; standards, cloud security
models and related patterns; Clorrd security in mainstream vendor solutions; Mainstream Cloud security
offerings. Enterprise Cloud-Based High Performance Computing Applications: High Performance Computing
(HPC) on Cloud; Enterprises HPC apptications (high-performance grid computing, high-performance big data
computing/analytics, high perfornance reasoning); HPC Cloud vendor solutions: compute grids (Windows
HPC, Hadoop, Platform Symphony, Gridgain), data grids (Oracle coherence, IBM Object gid, Cassendra,
Ilbase, Memcached, HPC hardwar,:; HPC on Cloud mainstream offerings.
Reference Book:
CSE
2.
3.
1.
Distributed Systens: Concepts and paradigms: Andrew S Tanenbaurn
Distributed Systen$ - Concepts and Design: G. Coulouris, J. Dollimore & T. Kindbog.
Michael J. Kavis: Architecting the Cloud: Design Decisions for Cloud Computing Service
Models (SaaS, PazS, and IaaS)
4.
Thomas
5.
6.
7.
Technology & Arc hitecture
John Rhoton: Cloud Computing Explained: Implementation Handbook for Enterprises
D. Casal: Cloud C,rmputing for Programmers: Software Development in the Age of Cloud
Banie Sosinsky: Cloud Computing Bible
MX35
Erl
,
R
icardo Puttini
,
Zaigham Mahmood: Cloud Computing: Concepts,
Client Server tr:chnolog/ and System Programming
100 Marl<s, 4 Credits, 4 Hours/hlleek
The Client server model and softvare desig4 concunent processing in client-server software, Application
interface to protocols, The socket,rtPL, Algorithm in client software desiga, Iterative connectionless servers
(JDP), Concurrent connection ori(:nted server (TCP), Multi service serv€r (TCPruDP ), RPC concept and
protocols, Telnet programs.
Reference Bool<s:
ffali
l. Robert
and Drrn Harkey: Client/Serva Programming with Java and CORBA (2nd ed.)
2. Ray Horak: Commu'rications Systerns and Networks
3. Anthony T. Holdener III: Ajax: The Definitive Guide
CSE
MX36
Distributed Search Techniques
100 Marl<s, 4 Credits, 4 Hoursfr'eek
Large-scale distributed systems: pr(,perties and examples; search requirements in service discovery, peer-topeer content sharing and distributed XML databases, unstructured techniques: intelligent flooding, hinlbased
routin& etc-i basic structured techniques: Chord. CAN, Tapestry, Kademlia, etc.; advanced structured
techniques: pSearch Squi( SkipN et, etc.; Signature search techliques using Bloom Filters; Distributed
Pattem Matching (DPM) problem and its applications; distributed crawling and indexing techniques.
CSE
MX37
Distributed Conrputing Systems
Hoursfl eek
100 Marl<s, 4 Credits, 4
Distributed object systems, Retrievirrg and caching of distributed information, Distributed data replication and
sharing, Performance issues, Algorithms for deadlock detection, Concurrency control and synchronization in
distributed system. Models for distributed computation. Networking facilities and resource control and
management methods in network ard distributed operating systems, Collaborative applications, Wide area
network computing. Web based commerce, Agent systems and Market based computing.
Deportnent of Computer Science and Engine€nng Unrversiv of Chittasons
Page 115
MX38
DBMS Models and Implementation Techniques
100 Marl<s, 4 Credits, 4 HoursMeek
CSE
Design Theory for Relational Database: Functional Dependencies, Decomposition of Relation schemes,
Normal Forms for Relatiors. Schemes, Multivalued and other kinds of Dependencies'
of Selections in
Quuy Optimization: Basic Optimization Shategies, Algebraic Manipulation, Optimization
Equivalence.
Weak
under
Syrt"rr,, t^u"r Optimization ior a Subset of Relational Queries, Optimization
Database Protection: Integrity, Constraints in Quoy-by-Exarnple, Security, Security in query-by-Example,
Security in Statislical Databases. Concurrent Operations on the Database: Basic Concepts, A simple
Transaction Model, Model with Read- and write-Locls, Read-only, write-only Model, concurrency for
Hierarchically Structured Iterns, Protection against Crashes, Optimistic Concurrency Control. Principles of
Distributed Data Bases, Framework for distribution. Translation of global queries into fragment queries.
Quoy optimization and management of distributed transaction. Concurrency control and reliability in
distributed databases.
Administration of Distributed Data Bases. Example Systems.
Reference Books:
l.
2.
3.
J.D.tlllman, Principles of Database Systems, Galgotia, New Delhi.
S.Ceri, G. Relagatti, Distributed Databases, McGraw-Hill.
C. Papadimitriou, The Theory ofDatabase concurency Control, Computer Science Press.
MX39
Parallel and Distributed Computing
100 Marl<s, 4 Credits,4 Hours/Week
CSE
Introduction to Parallel Computing: Supercomputus and grand challenge problems, Modern Parallel
Computers, Data Dependence Graph, Data Parallelisrq Functional Parallelisnr, Pipelining and Data
Clustering. Interconnection Network: Switch Network Topologies, Direct and Indtect Network Topology,
Bus, Star, Ring, Mesh, Tree, Binary Tree Networ( Hyper Tree Networlq Hybri4 Hypercube, Perfect Shufile
Network, Torus and Buttafly Network. Performance Analysis: Introduction, Execution Time, Speedup,
Linear and Superlinear Speedup, Efficacy and Efficiency, Amdahl's Law and Amdahl Effect, GustafsonBarsis's [aw, Minsky's Conjecture, The Karp-Flatt
Metric, The Isoefiiciency Metric, Isoefliciency Relatioq Cost and Scalability. Parallel Computational
Models: Flynn's Taxonomy, PRAM, EREW, CREW, ERCW, CRCW, Simulating CRCW, CREW & EREW,
PRAM algorithms. Introduction to Parallel Algorithms: Parallel Programming Models, PVM, MPI
Paradigms, Parallel Programming Language, Brent's Theoren! Simple parallel programs in MPI
environments, Parallel algorithms on networlg Addition of Matices, Multiplication of Matrices. Distributed
Systems, Communication in distributed systerns, processes and processors in distributed systems. Threads,
systems Models, Process allocation, scheduling in distributed systems, fault tolerance, real-time distributed
systems. Theoretical issues in distributed systems: Logical cloclg mutual exclusion, deadlock detection,
agreement protocols, resource security and protection, concurrency contol. Distributed File System: Design
and implementation, trends. Distributed shared Memory, consistency models, page-based distributed shared
memory, shared variable distributed shared memory, objecrbased distributed shared memory. Multiprocessor
OS, Database OS: General features and theoretical issues. Case Studies: Amoeba, Mac[ chorus, DCE, etc.
Multimedia Opoating Systems: Proccs scheduling, File system, caching, Disk scheduling for multimedia.
Reference Books:
1.
Hwang and Briggs, Computo Architecture and Parallel Processing, McGraw Hill.
2. Crichlow, Introduction to Distributed and Parallel Computing, PHI.
3. M.J.Quinn, Designing Efficient Algorithms for Parallel Cornputers, McGraw-Hill.
4. A.S. Tanenbaunr, Distributed Operating Systenq Prentice-Hall, 1995.
5. M. Singhal and N. G. Shivaratri, , Advance Concepts in Opoating Systems, McGraw-Hill,
1994.
Page 114
Deparunent of cornpder sc@nce and Engineanng unr./erst/ of chittogons
CSE MX40 Advanced Soflware Engineering
100 Marlrs, 4 Credils, 4 Hours/Week
Socio-technical systems; Requirernents engineering processes; Distributed systans design; Service-oriented
software urgineering; Component..based software engineering; Software evolution; Aspect-oriented software
engineering; Software managemr:nt; Software cost estimation; Software quality management; Process
improvement; Critical systems, C()TS-based system engineering.
Reference Books:
1.
Software Engineeling by Ian Sommerville
Software Metrics- A fugorous & Practical Approach, Fenton & Pleeger, Intemational
Thomson Comput:r Press.
Software Architecture- Perspectives on an Emerging Discipline, Shaw & Garlan, Prentice-
2.
3.
Hall.
4.
UML- in a nutshell- A Desktop Quick Refource, Albir, O'Reilly.
CSE MX41 Software Project Management and Quality Assurance
100 Marl<s, 4 Credils, 4 Hours/lveek
Foundations of software project mlnagement; organization structure and staffing; motivation, authority and
influence; conflict management; proposal preparation; a large engineoing software system management;
client management; managing soffware project teams; project planning and scheduling; risk management;
configuration management; pricing estimation and cost control; quality assurance and accreditation; factors
affecting software quality; softwar: quality assurance plans; business context and [ega[ issues for software
projects; software measurement: t:sting, upgrading and maintenance; network systems; and international
project management.
Definition and concept of software quality assurance (SQA); quality models; specification of quality
requirements; product development & delivery issues; software developmant processes & maturity; software
quality management process: total luality management, improvement cycle, SQA planning & management,
organizing the SQA effort; softwar; verification and validation; tlpical software development errors; Fagan
inspections; software audit; softw,rre testing: testing objectives & testing fundamentals, testing theory,
coverage criteria, equivalence clasr testing, value-based testing, decision table, syntax & state transition
testing, statement & path testing, branch & condition testing, data flow testing, thread-based testing,
integration
&
integration testin& system testing; testing
in
object-oriented systems; test tools
&
test
automation; test management; probl rm reporting & conective action.
Networks / Security / Privacy
CSE
MX51
Advanced Computer Networks
100 Marlrs, 4 Credits, 4 Hours/lVzek
Networks Architectare: layering z.nd protocols, OSL Architecture, TCP/P conccpt, technologics and
protocoh: Address resolution proto)ol (ARP), LJDP, ICMP, SIV{TP, SNMP, MIME, HTIP, DNS, Routing
protocols: RIP, IGRP, BGP, OSPF. )'P address: IPv4 and IPv6.
Reference Books:
1.
2.
Andrew S. Tanenbarrm and David J. Wetherall: Computu Networks (5th Edition)
Tyler Wrightson: Arlvanced Persistent Threat Hacking: The Art and Science of Hacking Any
Organization
3.
Wai-Kai Chen: Aclive Network Analysis (Advanced Soies in Electrical and Computo
Engineuing)
Depdrtment of Computer Sc€nce and EnSneering, UnMersty of Chtt6song
Pa
ge ll5
CSE MX52 Advanced Wireless Networks and Mobile Computing
100 Marlrs, 4 Credils,4 Hours/Week
Introdacrion to wireless networkingi Advantages and disadvantages of wireless networking, topics of current
interest in wireless and mobile communications and networking. The Radio Mediun: Characteristics ofradio
propagation, Radar equation, Fraunhofer/ Fresnel region. Interference in multi path propagation: Fading,
Muiti-pattr propagation, Interference, System capacity, Inter symbol interference. Channel model
descriptiont Channel modet Description, Definition of Broad./ Narrow Band Wiener-Khinthine Theorem,
Channel Frequency Response.
dwal fiansmissior: Definition of bit-rate and signaling rate. Introduction to synchronous
The
need for pulse shaping, synckonization and line-coding. PCM waveforms (line-codes) in
transmission.
common use Calculation of bit-error probabilities when the channel is affected by the addition of Gaussian
noise. Band-pass digital modulation: The need for modulation, Biaary and multi-level (M-ary) amplitudeshift keying (ASK), frequency-shift keying (FSK) and phase-shift keying (PSK), Minimum-shift keying
(MSK) and Gaussian MSK as used in GSM mobile phones, Vector modulator, Coherent and non-coherent
detection, Constellation diagrams, Differential PSK, Quadrahre phase shift keying(QPSK). Mulli-kvel
digital modulation standards: Orthogonality, Carrier derivation and symbol timing recovery, Combined
amplitude and phase shift keying (QAM and APK). Malrt-user access for wireless communicarionz
Frequency, time and code division multiplex access (FDMA, TDMA and CDMA) technique as currently used
Introduction to
in mobile telephony, Frequency hopping, Direct sequence CDMA, orthogonal frequency division
multiplexing (OFDM) for wireless cdmputer network (e.g. Hiperlan2), Wideband CDMA for third generation
mobile communication systems. Introduction to MATHLAB for transmission simulation, Mediam access
confiol (MAC): MAC protocols for digital cellular system such as GSM, MAC wireless LANs such as
IEEES02.II and HIPERLAN I and II. The near far effect, Hidden and exposed terminals. Collision
Avoidance (RTS-CTS) protocols. Protocols supporting mobility: Mobile nefwork layer protocols such as
mobile-IP, Dynamic Host Configuration Protocols (DHCP). Mobile transport layer protocols such as mobileTCP, indirect-TcP, Wireless Application Protocol (WAP).
Reference Bool<s:
L
2.
CSE
MX53
Asoke K Talukdo and Roopa Yavagal : Mobile Computing: Technology, Applications, and
Service Creation (McGraw-Hill Communications Engineering)
Frank Adelstein and Sandeep KS Gupta: Fundamentals of Mobile and Pervasive Conputing
Distributed Systems and Internet Technology
100 Marlrs, 4 Credits, 4 Hours,rWreek
Capabilities and limitations of the intemet. An understanding of the basic internet technologies Interfacing
Internet Server applications to corporate databases XML as a universal data language XML transformations.
Refermce Books;
l. Ram Ramanujanr, Srini Ramaswamy: Distributed Computing and Internet Technology
2. Sushil K. Prasad, Mahadeo P. Jaiswal, Bundit Thipakorq Sartaj Sahn! Hanick M. Vin:
3.
Information Systerns, Technology and Management
Kenneth P. Birman: Reliable Distributed Systems: Technologies, Web Services, and
Applications
MX54
Cryptography and Network Security
100 Marl<s, 4 Credits,4 HoursWeek
CSE
Conryater Securily Co ceptsi The OSI Security Architecture, Security Attacks, Security Services, Security
Mechanisms, A Model for Network Secwity. Symmetric Ciphersl Classical Enc4Ttion Techniques, Block
Ciphers and the Data Encry?tion Standard, Basic Concepts in Number Theory and Finite Fields, Advanced
Encryption Standard, Block Cipher Operatiorq Pseudorandom Number Generation and Stream Ciphers.
Asyn metric Ciphersz More Number Theory, Public-Key Cryptography and RSA, Other t\blic-Key
Data Integrity Algorilhmsz Cryptographic Hash Functions, Message
Authentication Codes, Digital Signatures. Mutual Trusl: Key Management and Distributiorq User
Authentication. Network And Intemet Secarity: Network Access Control and Cloud Security, TransportCry?tosystems. Cryptographic
Deportrn€nt ol Cornplter
kEnce and kgin(:enng,
University of Chittagong
Page 116
Level Security, Wireless Networli Security, Dlectronic Mail Security, Ip Security.
Reference Book:
1. Cryptography anrl Network Security: Principles and pyactice (6th ed.)
2. Behrouz Forouzan: Cryptography & Network Security
5. Christof Paar and Jan Pelzl: Understanding Cryptography: A Textbook
for Students and
hactitioners
CSE MX55 Pervasive Computing and Communications
7OO
Marks, 4 Oedits, 4 flou"slweek
Introduction to Pervasive Conputing: Past, present, future; the pervasive computing market, mBusiness, Challenges and fu:ure of Pervasive Computing. Application Examples of Pervasive
Computing: Retail, Airline Che<.k-in and booking, Sales force automation, Healthcare, Tracking, Car
Information Systems, Email Ac:ess via WAP and voice. Device Technologr for Pervasive Computing:
tlardware, Human-machine inlerfaces, Biometrics, Operating Systems, Java for pervasive devices,
Outlook.Device Connectivity: notocols, Security, Device Management. Web application concepts for
pervasive computing: History, rly'WW architecture, hotocols, Trans-coding, Client Authentication via
the Internet for pervasive cornputing. WAP and beyond: Introduction, Components of the WAP
architecture, WAP infrastructJre, WAP security issues, Wireless Markup Language, WAP push,
Products, i-Mode, Outlook. Voice Technology: Basics of Speech Recognition, Voice standards,
Speech Applications, Speech and Pervasive Computing, Security. Personal Digital Assistants:
History, Device Categories, Personal Digital Assistant Operating Systems, Device Characteristics,
Software Components, Standalds, Mobile applications, Personal Digital Assistant Browsers. Serverside programming (Java) for pervasive computing: Java 2 Enterprise Edition (Overview), Servlets,
Enterprise Java Beans, Java Server Pages, Extensible Markup Language, Web Services, Model-viewController pattern. Pervasive VIeb application architecture: Background, Scalability & Availability,
Development of pervasive coml)uting Web Applications, Pervasive Application Architecture. Dxample
Pervasive Application: Introdu(tion, User Interface Overview, fuchitecture, lmplementation. Access
from PCs: Smart-card authentication via the lnternet, Ordering goods. Access via WAP: WAP
functionality, Implementation. Access from Personal Digital Assistants: Extending the example
application to personal digital ..ssistants, Implementation for synchronized devices, lmplementation
for intermittently connected (levices, Implementation for connected devices. Access via Voice:
Extending the example applicalion to voice access, Implementation.
Reference Books:
1.
2.
5.
4.
5.
6.
7.
CSD
Jochen Burkhardt, norst Henn, Stefan flepper, Thomas Schaec & Klaus Rindtorff: Pewasive
Computing: Technolosr and Architecture of Mobile lntemet Applications, Pearson
Education, New Dt:lhi, 2006.
Stefen Poslad: Ubi,Iuitous Computing: Smart Devices, Environments and Interactions,
Wiley, Student [di1ion, 2010.
Bahul Banedee: k:cture Notes in Pervasive Computing, BITS Pilani, 2012. <To be uploaded
at th€ cours€ pag€ of the LMS for registered students in read-only format, after October 15,
2012.>
Cenco, S. Sorce: Pervasive Systems and Ubiquitous Computing, MT Press, 2012.
Ajith Abraham (Ed.): Pervasive Computing, Springer-Verlag, 2012.
Guruduth S. Banarar, Norman H. Cohen, Chandra Naralanaswami: Pervasive Computing:
An Application-Based Approach, Wiley Interscience, 2012.
Frank Adelstein, S K S Gupta, OC Richard & L Schwiebert: Fundamentals of Mobile and
Peryasive Computing, Tata Mccraw-tlill, New Delhi, 20O5.
IlX56 Advanced llrlreless S€nsor Network
7OO Marks,
4 Gedits, 4 llourslWeek
Latest res€arch in the area of wireless n€tworking (mobile ad hoc and sensor networks)
which includes
media access control, routing, flow control and cross-layer architectures, quality
or sewice (eo.s), energr
Pa g
Deparfn@t of Conputer Science and Er€in€€rirE; Universiv of ChittasorB
e
1.1.7
conservation, reliability and mobiliq/ management. Securny issues of sensor architecture.
Heterogeneous sensor networks, area coverage issue, MAC layer issues, WSN applications.
csD !tx57 Advanced Information Security
7OO
Marks, 4 Credits, 4 lTourslweek
The knowledge units in thb arca collectiuely encompass the following: (i) Recognition that security
is risk management and inherently includes tradeoffs, (ii) Familiarity with the implications of hostile
users and misuse cases, (iii) A framework for understanding algorithms and other technological
measures for enhancing security, and (iv) Strategic and tactical design issues in information security.
nistory, overview, and prlnclples:
State examples of famous security breaches and denials of
service, Discuss common computer crime cost estimates and the difftculty of estimating them, Discuss the
professional's role in security and the tradeoffs involved, Explain and defend the use of each of various
security principles, Explain and defend the use ofeach ofvarious security mechanisms, for example least
privilege, fail-safe defaults, complete mediation, separation of privilege, and psychological acceptability,
Relevant tools, standards, and/or englneerlng constraints:
Discuss the major provisions
of
a rele\ant law such as HIPAA or the EU Data Protection Directive, Summarize intellectual property and export
control laws affecting security, esp€cially encryption, Articulate some challenges ofcomputer forensics.
Data s€curity and tntegrtty: Define conlidentiality and integrity, Cive examples of systems where
integrity alone is suflicient, Define "perfect forward secrec/' and explain why it is desirable.
Vulnerabillties and €xploitatlon:
Define misuse cases and explain its role in information security,
Perform a simple fault tree analysis, Explain the types of enors that fuzz testing can reveal, Discuss issues
related to the difftculty of updating deployed systems, Explain the role code reviews in system security,
Define the problem of insecure defaults, Explain the tradeoffs inherent in responsible disclosure,
Resource protection models: Explain the pros and cons of various discretionary and mandatory
resource protection models, ustrate an access control matrix model, Define the Bell-LaPadula model,
Secret and publlc key cryptography: State the motivation for putting all encryption algorithm
variability in the keys, Discuss the effect of processing power on the effectiveness of cryptography,
Explain the meaning ofand relationship between the three basic classes of cryptographic attacks:
ciphertext only, known plaintext, chosen plaintext, Discuss the similarities and differences among the
three basic types of cryptographic functions: (zero-, one-, and two-key): hash, secret key, and public key,
Discuss block and key length issues related to secret key cryptography, Demonstrate and discuss the
motivations and weaknesses in various methods for applying secret key (block) encryption to a message
stream such as cipher block chainins (CBC), cipher feedMck mode (CFB), and counter mode (CTR).
I[essage authentlcatlon codes: Explain why hashes need to be roughly twice
as long as secret
keys using the birthday problem, Discuss the uses ofhashes for fingerprinting and signing, Discuss the
key properties ofa cryptographic hash function contrasted with a general hash function.
Network and veb securlty:
Describe the goals of Transport layer security (TLS) and how they are
attained using secret and public key methods along with certificates, Discuss the reasons for using a
firewall, various topologies, and firewall limitations. Describe the basic structure of URLS, HTTP requests,
and flTTP digest authentication as they relate to security, Dxplain the use of IITTP cookies including
session cookies, expiration, and re-authentication for key operations, Define cross-site scripting, Explain
an SQL iqjection attack and larious methods of remediation.
CSE !I)Ga Internet and Web-based Technologies
7OO Marks, 4 Credits, 4 lTourslWeek
Name services and configuration:' DNS, DHCP, X500 directory sewices, LDAP, Internet security basics of
authentication and encryption, SSL, Digital Signature, Kerberos, Network management: SNMP. CQI scripts.
Scripting Languages - Perl, PtlP, Javascript, VBscript. Web Sewices -XML, SOAP, UDDI, WSDL., Platforms
for Web S€wices Development - NET, J2EE, E-Commerce - S€cure Electronic Transactions over the Web.
D€p fi|€rrt of Cflfcd€r kknce dd kgn.ering
CSE
MX59
UnMaslV of Chtt Sons
Page 118
Advanced Dilftal Communication
100 Marks, 4 Credits, 4 Hours,Week
Baseband, narrowband and wideband signals and noise rqrresentation and characteristics of communication
channels, Linear and optimal filte'ing. Baseband binary signal transmission Inter-symbol interference bit time
recovery and errors, partial resporse signalling, ine codes. M-ary
signals orthogonal representatioq (Gram-Schmidt procedure, signal space concepts, bandwidth efficient
digital modulation techniques, and carrier synchronization. Spread spectrum techniques-codes, transmitters,
receivos, and poformance.
Computer r/ision / Graphics / Image and Signal Processing
MX6f
Advanced Digital Image Processing
100 Marl<s, 4 Credits,4 Hours/W'eek
CSE
Digital irnage fundamentals: imagi) digitization, sampling and quantization image resolution, color perception
& processing, image processing: pxel based transformation, geometric transformation,
local processing (edge detection subpixel location estimation) restoration (degradation, inverse fitting &
Wiener filtering) binary image processing: thresholding, run length encoding, distance transforms, medial
axis transforms, morphological operations, region segmentation & representation- split & merge algorithnr,
region growing image filtering- histogram modification, linear and Gaussian filters, contours - digital
curves, polyling splitting. Hop- lJong algorithm Conic & Splines Hough transfornl Fourier description,
textures: statistical syntactic and model based methods, image transforms - Fourier, Hadamard, discrete
cosine. wavelets and other ortho;;onal transforms, conpression image (predictive compression methods,
vector quantization, hioarchical & progressive methods, JPEG & MPEG), case studies.
Reference Books:
l.
2.
CSE
MX62
Digital Innge Pro<ressing: Pearson Education Asia: Rafael C. Conzalez & Richard E. Woods.
Non-Linear Digital Filter: Principles and Applications, K|r',ver Academic Publications: I.
Pitas & A. N. Ven,:tsanopoulos.
Advanced Computer Graphics and Visualization
100 Marl<s, 4 Credits, 4 Hours/Ttleek
Gruphics Devices: the characterist cs and mode of operation of vector and raster display devices, pointing
devices and hardcopy devices. The concept of workstations, segmentation and the output and input
primitives. Scan convercion algor.ilhms: the generation of rasterised images of lines, arcs, text and filled
aras. Object representalion and nanipulation: the representation of objects in two and tkee dimensional
co-ordinate space; the implementation of clipping; and segment and viewing transforrnations ( rotation,
scaling, translation and projection) in two and tkee dimensions. Graphics libraries: two systems will be
compared and contrasted: Open GL and Direct X. Image rendering: hidden line and surface elimination,
sirple and interpolative shading models, Z-buffer and scan line algorithms, ray-tracing; color and shading,
texrure mapping, Virtual envftonme 1ts.
Reference Books :
l.
Haim Levkowitz: Oolor Theory and Modeling for Conrputer Graphics, Visualization, and
multimedia applications
2.
3.
Richard S. Gallagl,o, Solomon Press: Computer Visualization: Graphics Techniques for
Engineering and Sc entific engineering analysis
Tamiya Onodera, liatoru Kawa: A Formal Model of Visualization in Computer Graphics
Systerns
D€partment of Computer Science and Englneenng, Unversiry of Chrttagor8
Page 119
CSE MX63 Advanced Multimedia Systems
100 Marlrs, 4 Credits,4 Hours/Iileek
Overview to Multimedia Systems, Multimedia storage, Data compression techniques for audio and video'
Synckonization, Multimedia networking and protocols, QoS principles. video streams on ATM, Mobile
multimedia communications, Operating iystem support for multimedia. Hypermedia system. Standards for
multimedia, Multimedia database and Multimedia Applications.
CSE MX64 Advanced Computer Vision
100 Marlrs, 4 Credits, 4 Hours/Week
Image Formation: Camera models, Colors, Lenses, projection, sensing, texture descriptors. Image
processingt Preprocessing, image correction, Enhancing features and corecting impafections, Addressing
noise, lens distortion, filtering, bluning. Grouping arul Jitting: Finding edges and lines, Gradients, zero
crossing detectors, line models, Boundary tracing, line fitting, Hough transforrq Guzman, Clowes and
Huffman, Waltz. Geometric Calibralionz Interior and exterior calibration, rectification, epipolar geometry,
correspondence, triangulation, Two-view and multi-view stereo reconstruction. Feature eulraclion'. Shape,
histogranr, color, spectral, texture. Featue analysis, distance /similarity measures. 3D Shape: Parts, Skeleton,
Surface models, Aspect Graphs. Representing the environment and Matching: Clouds, generalized
cylinders, Semantic nets, Matching line and region groups to object representations (high-level).
Recognition: SIFT & Single Object Recognition, Bag-of-Words Models, Object classification and detection:
a part-based generative model (Constellation model), a Part-based Discriminative Model (Latent S\&{), Face
Detection & Recognition: Viola-Jones Descriptor, Scene Analysis & Understanding. Segmentation: With
low-level features, high-level semantics, using machine learning-based approaches. Object Tracking:
Kalman filter, condensation, tracking humans. Structure from Motion: Multiframe reconstruction under
affine and puspective projection geometry. Mobile Robols: Sinrple robot control, planning for navigation.
Reference Books:
l.
Digital Image Processing - R.C.Gonzalez & P.Wintz
2. Computer Vision - D.H.Ballard & C.M.Brown
3. Pattern Recognition - A Statistical Approach - P.A. Devijver and J. Kiftler
4. Richard Szeliski: Computer Vision: Algorithms and Applications.
5. Sebastian Thrun, Wolfram Burgard and Dieter Fox: Probabilistics Robotics, The
MIT press,
2006
CSE MX65 Multimedia Data Compression
100 Marks, 4 Credits,4 Hours/l eek
Digital Image & Video, Image And Video Compression Fundamentals, Coding Standards: Jpeg And Mpeg,
Video Coding Standards- H.261, H.263 And H.261, Motion Estimation And Compensatioq Transform
Coding, Entropy Coding, Pre - and Post-Processing, Rate, Distortion And Complexity, Trarxmission Of
Coded Video, Platforms, Video Codec Design, and Future Developments.
Reference Book:
1.
Iain E. G. Richardson: Video Codec Design, Developing Image and Video Compression
2.
Madhuri A. Joshi and Mehul S. Raval: Image and Video Compression: Fundamentals,
Techniques, and Applications
John W. Woods: Multidimensional Signal, Image, and Video Processing and Coding, Second
Edition
Roger J. Clarke: Digital Compression of Still Images and Video (Signal Processing and its
System
3.
4.
Applications)
D@argn€nt of Cqmute. Science ard ErEineer r|g Uni\€Gtt/ of Chittagorg
Page 12O
CSE MX66 Multimedia and lirtual Reality
100 Marks, 4 Credits, 4 Hours/llteek
Introduction of interactive multinredia and VR technology. Design problems inherent in multi sensory
user interfaces, information overlcad, lost in cyberspace, naturalness, and sense ofpresence. Multimedii
and web UI, Virtual reality and atLgmented reality, models of interaction with multimedia and VR user
interfaces comparison with traditional GUIs. Outline ofdesign process, user centered design, prototyping,
evaluate and design cycles. Desi6,n support and tools: design support tools for multimedia- authoring
environment. Virtual world devr:lopment environments, interactive devices- speech, haptic input,
datagloves, trackers and other senr,ors. Cognitive psychology relevant to multimedia,A/R design. Vision,
hearing, haptic sense, integration ofsensory input, and perception ofself. Information processing models,
limitations of working memory, selective attention and Cognitive resources for multisensory interaction.
Design principles based on human cognition. Requirements analysis and specification of information
content. Task, domain and requirernents analysis, selection of interaction metaphors, format and layout of
virtual worlds. Specification ofag€nts, and user-system cooperation. Applications for simulations, setting
communication, and usability- gr,als, planning multimedia presentations and user-system dialogues.
Definitions of media and informat on types. Selecting media to represent different types of information.
Scripting and integrating multim,:dia presentations. Design to control attention, highlighting salient
information and creating coherent :hreads across multimedia. Transforming task and domain models into
design ofvirtual worlds. Scriptin6, interactive sequences, storyboards, mock-ups and early prototypes.
Introduction to and selected guidelines from ISO standard 14915 for multimedia UIs. Interaction designselection of interaction modalities and communication devices, scripting dialogues, design of active
objects, agents, gesture in collaborative VEs, user presence in VEs, controls for navigation, browsing,
viewpoint control, manipulation and task support. Evaluation- definitions ofusability and performance
efficiency in multi sensory user interfaces. Evaluation techniques- checklists and heuristic evaluation,
observation of users problems and diagnostic evaluation, role of protocols, logging interaction,
performance testing for memory and learning. Limitations and the future of multi sensory user interfaces.
Integration of intelligent UIs and natural language interaction. Future of computer mediated
communication, avatar agents, virtrral communities and cyber populations. Limitations ofhaptic devices,
communication by olfaction and 1;ustation. Future ofmultisensory interaction, wearable, mobile UIs,
whole body immersion, neural sersory interfaces. Social implieauons of multisensory user interfaces,
benefits for the disabled, merging rr;al with the virtual.
Reference Books:
l.
Richard Brice: Mrrltimedia and Virtual Reality Engineering
2. Antonio S. Camar a, Jonathan Raper: Spatial Multimedia and Virtual Reality
3. Peter Brusilovsky, Piet Kommers, Norbert Streitz: Multimedia, Hypermedia, and Vimral
Reality: Models, liystems, and applications
CSE MX67 Digital Speech Protessing
100 Marks, 4 Credits,4 Hours/LVeek
Speech production models: Acoustic theory ofspeech production, discrete-time speech model, lossless
model ofthe vocal tract; Speech perception, digital processing ofspeech signals: Short-term processing of
speech, linear prediction analysis, cepstral analysis; Speech coding: LPC, MRA, enhancement, human
auditory system, quality assessment, speech synthesis; Speaker recognition and verification systems.
CSE MX68 Speech Recognition
100 Marl<s, 4 Credits, 4 Hours/llzek
Introduction; Modeling human sprech perception: Auditory, neural and cognitive processing, pattern
matching, linguistic processing; Representations ofspeech signal: Band-pass filter energies, formants, LPC
and ARMA, cepstrum and melcepstrum, auditory-model based representations, difference coefficients,
comparison of parametric represerrtations; Recognition modes and modalities: Speaker dependency,
isolated and continuous words, vocabulary size, speaking environment, perplexity, real{ime operation;
Stochastic models, linguistic moc els, prosodic knowledge sources; Knowledge-based approaches:
Templates versus features, segmeltation, Iabeling, fuzzy reasoning; Stochastic approaches: Hidden
Markov Models (HMM),
Dep.rtrn€nt of Compder Science and Engneenng University of Chittagong
Page 12l
testing algorithrns; Connectionist approaches: Neural networks, leaming algorithms;
Applications: Dictation systems, voice-based communications, system control, security systems, speaker
training
and
verification.
CSE
MX69
Advanced Digital Signal Processing
Hours/l|eek
100 Marks, 4 Credits, 4
Overview of digital signal processing: Bandpass lowpass equivalent signals, Bandpass sampling, concept of
digital fiequency, DFT-based filtering, windows, frequency measuremenl; Spectral estimation: Introduction
and periodoganr, classical methods, minimum variance method, parametric methods; Multirate sigaal
processing: Applications motivation, decimation and interpolation, sample rate conversion for rational D/1,
approximate sample rate conversion for irrational D/I, pollphase implementation ofsampling rate conversion,
DFT filter banks, general filter banks - alias cancellation and perfect reconstruction; Adaptive signal
processing: Applications motivation, Wiener filtaing, the Widrow LMS algorithnl performance analysis of
LMS algorithrq introduction to the RLS algorithm; Probability and random processes: Overview of
probability, probability density function, mean, variance, correlation/covariance, Gaussian random variables,
overview of random processes, classification, multiple random processes, examples.
Intelligent Systems / Robotics / Bioinformatics / Health Informatics
MXTf
Advanced Artificial Intelligence
CSE
100 Marks, 4 Credits,4 Hours/Week
Introduction; Advanced search techniques in AI, knowledge based system design, advanced plan generating
systems; Probabilistic Reasoning, decision networks; Making complex decisions: Sequential decision
problems, partially observable Markov decision problems (POMDP$; Multiple agent theory: Cooperation
among multiple agents; Learning fiom observations: Inductive learning, decision trees, ensemble leaming;
Knowledge in leaming: Use of logic, explanation based leaming, inductive logic programming; Statistical
leaming: Complete data, hidden nodes (EM method), instance based leaming, neural network and neural
belief networks; Fuzzy logic and genetic algorithm.
Reference Books:
l.
Daniel Graupe: Principles of Artificial Neural Network (Advanced Series in Circuits and
Systems)
2. B. Yegnanarayan: Artificial Neural Networks
3. George A. Alastassiou: Intelligent Systems: Approximation by tutificial Neural Networks
4. Nestor A. Schmajuk: Alimal Learning and Cognition: A Neural Network Approach
5. Rabuial, Juan R.: Artificial Neural Networks in Real-Life Applications
CSE
MX72
Advanced Neuro.Fuzzy Systems
100 Marks, 4 Credits,4 HoursMeek
Overview of artificial neural networks; Nzuro-Models; Simple neural networls; Multi-layer neural network:
Multilayer Perceptions (MLP), logistic activation functioq backpropagation algorithm; Neural network
applications; Overview of fuzzy system; Crisp sets to fuzzy sets; Operations on fuzzy sets, fuzzy arithmetic,
fuzzy relations; Applications.
CSE
MX73
Statistical Machine Translation
100 Marl<s, 4 Credits,4 Hours/Week
Introduction: Statistical versus structured natural language processing (NLP), basic statistics and statistical
model, linguistics essentials, corpus-based NLP; Models and techniques: Collocations, statistical Inferance,
word sense disambiguation, lexical acquisition, Markov models; Grammar: Part-of-speech tagging,
probabilistic context free grammars, probabilistic parsing Applications and techniques: Statistical alignment,
clustoing, information retrieval, text categorization.
Departsnent of Compder Sc ence dnd Engin€en
CSE
MX74
i9
UnMe6ty of Chittagons
Page
1,22
Decision Analysis and Decision Support Systems
100 Marks, 4 Credits,4 Hours/Week
An overview of Decision technologies. Introduction to different types of decision making: strategic, tactical
and operational. Decision making in organization. Extension to other 'non organizational' areas of decision
making, e.g. military and emergenc) management. Studies ofhuman cognition in relation to decision making
and the assimilation of informatior. Cultural issues, Inrplications for design of decision making support.
Communication issues. Normative, descriptive and prescriptive analysis: requisite modeling. Contrast with
recognition primed decision tools. Itecision support Systemsi Configuration, Definition, Characteristics and
capabilities, Data Management subs/stem, knowledge-Based management subsystems, Model Management
Subsysterrb User lnterface Subsystenr, DSS hardware. Data Warehouse, Access, Analysis, Mining and
Visualization nets, data mtning, Modeling Techniqaes: Oplimization and Simulation, Linear Progamming,
Dynamic Programming, Heuristic Programming. DSS Developmen: Introduction, Traditional SDLC,
Alternative Development Methodologies, DSS development platforms, DSS development tool selection. Risk
assessment. Decision analysis and strategic decision support, Group decision support system and decision
conferencing, Cutting-edge decision support technology, Quality assurance and Validity ofdecision support.
ReJbrence Books:
l.
2.
3.
4.
5.
CSE
MX75
Andrew P. Sage: Decision support systems engineering
Timothy L. Nyerg:s, Piotr Jankowski: Regional and Urban GIS:
A Decision Support
Approach
Daniel J. Power: De,:ision Support Systerns: Concepts and Resources for Managers
Antonio Marcomini Glenn Walter Suter ll, Andrea Critto: Decision Support Systems for
fusk-Based Managernent of Contaminated Sites
Manos, Basil: Decis;on Support Systems in Agriculture, Food and the Environment: Trends
Intelligent Decision Technologies
100 Marl<s, 4 Credits, 4 Hours/Week
Decision making, systems, modeling and support , knowledge based decision support and Artificial
Intelligence; Fundamentals of exp€rt systems; Knowledge engineering, acquisition and representation;
Reasoning in knowledge based syst(ms; Basic concepts of fuzzy set theory; fuzzy decision making; basic
concepts of neural network: structur,), supervised and unsupervised leaming; application in decision making;
Hybrid intelligent systems: fuzzy neural networks, co-operative neuro-fuzzy models; Basic concepts of
genetic algorithms: evolutionary algo.'ithms, evaluation, optimization problems.
Reference Books:
l.
2.
3.
4.
5.
E
MX76
Jurzo Watada, Toyohide Watanabe, Gloria Phillips-Wren, Robert J. Howlett, Lakhmi C.
Jain: Intelligent Deci;ion Technologies
Jatinder N.D. Gupta, Guisseppi A. Forgionne, Manuel Mora T.: Intelligent Decision-making
Support Systerns: Forrndations, Applications and challenges
David Schuff, David Paradice, Frada Burstein, Daniel J. Power, Ramesh Sharda: Decision
Support: An Examinurtion of the DSS Discipline
lgnac Lovrek, Robert J. Howlett, L. C. Jain: Iftrowledge-based Intelligent Information and
Engineering Systems
Danrel S. Yeung: Ad rances in Machine Learning and Cybernetics
Evolutionary Corrputing with Novel Techniques
100 Marks, 4 Credits,4 Hours/Week
Risk evaluation in failure mode and effects analysis using fuzzy weighted geometric mean, A designdecision support Framework for evah ation of design options/proposals using a fuzzy-logic-based composite
struch[e methodology, Estimating the attribute weights through evidential reasoning and mathematical
programming, Integating DEA oriented performance assessment and target setting using interactive MCDA
methods, Using interactive multi-obrective methods to solve DEA problem with value judgements, A
Departrnent of Computer Science and Engr€enng, Unversiv of Chitt€ong
Page
7,23
methodology to model causal relationships on offshore safety assessment focusing on human and organizational
factors, Group-based ER-AHP system for producl project screening, Ship selection using a multiple criteria synthesis
approach, An evidential reasoning-interval based method for new product design assessment, Self-tuning offuzzy
beliefrule bases for engineering system safety analysis, Development ofa fuzzy FMEA Based Product Design System,
An algorithm for training parameters in beliefrule bases based on the gradient and dichotomy methods, Evidential
reasoning based preference programming for multiple attribute decision analysis under uncertainty, The scheduling of
deliveries in a production-distribution system with multiplebtyers, Design of inlegrated manufacturing planning,
scheduling awl contrcl systemi a new framework for automation, Consistence and grouping consistence ofstatistical
inference in the Dempster-Shafer theory ofevidence, Entropy-based complexity measures for dynamic decisionmaking, A Bayesian network approach for offshore risk analysis through linguistic variable, Measuring the
performance of decision making unils using interval efficiencies, Three new models for preference voting and
aggregation, Assessment ofstrategic R&D project for car manufactures based on the evidential reasoning approach,
Application of intelligent decision system to nuclear waste depository option analysis, Self-assessment of conflict
management in client-supplier collaborative new product development, Measuring the performance ofdecision r4akmg
units using geometric average efficiency, Optimization models for training beliefrule based systems. Facilitation
practices in decision workshops, Dealing with Heterogeneous Information in Engineering Evaluation Processes, On the
Combination and Normalization of interval valued Belief structures, ltrference and learning methodology of belief rule
based expert system for pipeline leak detection, Retum policy model of supply chain managemenl for single-period
products, Intelligent decision system and its application im business innovative capability assessment, The evidential
reasoning approach for multiple attribute decision analysis using interval beliefdegrees, Environmental Impact
Assessment Using the Evidential Reasoning Approach, The ER approach for multi-attribute decision analysis under
inierval uncertainties, On the centroids offuzzy numben.
Reference Bool<s :
L Agoston
E. Eiben, James E. Smith: Introduction to Evolutionary Computing
2. Ian C. Pamee: Evolutionary and Adaptive Computing in Engineering Design
3. T.Y. Lin and N. Cercone: Rouglr Sets and Data Mining: Analysis oflmprecis€ Datr
CSE MX77 Machine Intelligence and Expert Systems
100
Marla, 4 Credits,
4
HoursMeek
Inhoduction to AI, Problem Space Representation, Heuristic Search Techniques, Knowledge Representation, Predicate
Logic Reasoning Under Uncertainty, Statistical Reasoning, Game Playing, Planning, Leaming, Expert System Design,
Expert Syslem Shell. Case Studies ofTypical Expert Systems, PROLOG.
Introductioni Goals and applications ofmachine learning. Aspects ofdeveloping
a learning system: training data,
function approximatiot Induclive Classificationl Conceptleaming as search lhrough a hypothesis space. General-tospecific ordering of hypotheses. Finding maximally specific hypotheses. Learning conjunctive concepts. The
importance ofinductive bias. Decisioz Tree Learning; Picking the best splitting attribute: entropy and information
gain. Searching for simple trees and computational complexity. Occam's razor. Overfitting and pnning. Ensemble
Leaming: Using committees of multiple hypotheses. Bagging, boosting, and DECORATE . Expeimental Evaluation
of Learning Algorilims: Measuring the accuracy of learned hypotheses. Comparing learning algorithms: crossvalidation, leaming curves, and statistical hypothesrs testing. Compulational Leaming Theory: Leaming in the limit;
probably approximately correct (PAC) learning. Quantifying the number of examples needed to PAC learn.
Computational complexity oftraining. Sample complexity for finite hypothesis spaces. Rule Leaning: Translating
decision trees into rules. Heuristic rule induction using separate and conquer and information gain. Learning recursive
rules. Artiftcial Neural Nelworkst Perceptrons: representational limitation and gradient descent training. Multilayer
networks and backpropagation. Hidden layers and constructing inlermediate, distributed representations. Leaming
network structure, recurrent networks. Supporl Vector Maciizes: Maximum margin linear separators. Quadractic
programming solution to hnding maximum margin separators. Kernels for leaming non-linear functions. EaJssiar
Learning; Probability theory and Bayes rule. Naive Bayes leaming algorithm. Parameter smoothing. Generative vs.
discriminative training. Logisitic regression. Bayes nets and Markov
Deparunent of Cornputer Sctence and Engine(:nns, Untversty of Chittasoos
Page 124
nets for representing dependencier;. Instance-Based Learning: Corstttcting explicit generalizatiors versus
comparing to past specific exam:les. k-Nearest-neighbor algorithm. Text Classificatioa: Bag of words
representation. Vector space morlel and cosine similarity. Relevance feedback and Rocchio algorithm.
Versions of nearest neighbor and Naive Bayes for text. Clustering arul Unsupemised Learningt Leaming
from unclassified data. Clustering. Hierarchical Aglomerative Clustering. k-means partitional clustering.
Expectation maximization (EM) frr soft clustering. Semi-supovised leaming with EM using labeled and
unlabled data. Language Learninl,: Word-sense disambiguation, sequence labeling. Hidden Markov models
(HMMb). Forward-backward EM,lgorithm for training the parameters of HMM's. Use of HMM's for speech
recognition, part-of-speech tagging and information extraction. Conditional random fields (CRF's).
Reference Book:
1.
2.
3.
Richard Duda, Pe:er Hart and David Stork, Pattem Classification, 2nd ed. John Wiley
&
Sons. 2001.
Tom Mitchell, Machine Leaming. McGraw-Hill, 1997.
Trevor Hastie, Robert Tibshirani and Jerome Friedman. The Elements
of
Statistical
Leaming. Springer, 2009
CSE MX78 Social Network Analysis
100 Marks, 4 Credits,4 Hours/k/eek
to
Social Network Analysis: The Social Network Perspective, Historical Foudations,
Fundamental Conc epts in Network Analysis, Distinctive Features of Social Networlq Related statistical tools
of Social Network Mathematical Representation of Social Networks: Notation for Social Network Data,
Graph Theoretic Notation, Sociometric Notation, Algebraic Notation, Graphs and Manices Graphic
Techniques for Exploring Social lletwork Data and Centrality: Degree centrality, Betweenness centrality,
Closeness centrality, Igenvector ,)entrality, Transitivity and Reciprocity Software for Social Network
Analysis: Introduction to the Tools :fSocial Networks,
Overview on Gephi and Netlogo ivlodels and Methods in Social Network Analysis: Random Graph Model,
Small World Model, Preferential 1\ttachment Model and powerJaws Diftrsion on Networks: Information
Dilirsion and Cascade Model, Epidemics SIR & SIS Model, Threshold Model, Simple and complex
contagion Application of Data Mining in Social Networks: Overview or: Data Mining and its various
techniques, Overview on Web Mining Recommendation system: Concept, Content-based method,
Introduction
Collaborative fi ltering, Applicatioru.
Reference Book:
1.
2.
CSE
David Easley and J:n Kleinbog, Networks, Crowds, and Markets: Reasoning
about a Highly Connected World, Cambridge University Press, 2010
Zafaruni, Abbasi ar.d Liu, Social Media Mining: An Introduction, Cambridge
University Press, 2{)14
MX79
Robotics
Hours/Ileek
100 Marl<s, 4 Credits,4
Basics: Inroduction, Recursive State Estimation, Gaussian Filtus, Nonparametric Filters, Robot Motion,
Robot Perception.
Localization: Mobile Robot
Loca.
ization: Markov and Gaussiaq Mobile Robot Localization: Grid and
Monte Carlo.
Mapping: Occupancy Grid Mappinl;, The Graphslam Algorithrq The Fastslam Algorithm.
Planning and Control: Markov De:ision Processes.
Social Robots (Sociable Creatures): Historical Backgrounds (Cognitive Robotics), Cognitive Science
(Situated Cognition, Embodied Cogrition, Ecological Approach,Socio-Cultural Approach), Studies In Social
Interaction (Ethno Methodologies, (lonversation Analysis), Survey of Socially Interactive Robots, Designing
Sociable Robots, , Human-Depender.t Robots, Interactive Robots In Autism Therapy.
Department of Computer Scrence and Engneering, Unversiv of Chittdsong
Page 125
Reference Boolcs:
L
Sebastian Thrun, Wolfram Burgard and Dieter Fox: Probabilistics Robotics,
The MIT
press,
2006
2. Human-Robot Interaction in Social Robotics: cRC Press,september 26,2012: Takayuki Kanda;
Hiroshi Ishiguro.
CSE MX80 Advanced Pattern Recognition Techniques
100 Marks, 4 Credits,4 Hours/lleek
Explain basic theories and techniques ofcomputer vision and pattern recognition, Identiff various approaches
ofcomputer vision and pattern recognition and design the components ofthe systems for computer vision and
pattem recognition, Describe and discuss the advance topics in pattem recognition, Desigrr simple systems for
compuler vision and pattem recognition which can handle certain problem, Apply some new techniques to
computer vision and pattern recognition, Have a deeper appreciation ofresearch issues in this field.
Classical Classification Approaches: A) Statistical Method, B) Structural Method, and C) Hybrid Method.New
Techniques: A) Wavelet Transform B) Fractal C) Hidden Markov Model D) Neural Network Approach E)
Fuzzy Method F) Others, and Applications related to the field of Pattem Recognition.
CSE MX8l Semantic Web Processing
100 Marks, 4 Credits,4 Hours/LV'eek
History of Studies in Semantics from Information System perspective : With historical notes on semantics
in other fields, Relevant views by Meersman, Weiderhold, etc. Ontology for semantic underpinning in
Information Systems: Historical notes about origins in philosophy to recent definitions by Gruber and
Gurino; covering ontologies, conceptual modeling, knowledge representation, Ontology, Knowledge Base,
Conceplual Schema, Systems for knowledge organization: Dictionary, Taxonomy/Classification, Ontology,
etc. Ontology representation: expressiveness vs computability; representation choices: RDF(S), OWL,
DAML+OlL, SUO bonowing from classifications by Mcllaraith, Finin, etc. Types and purpose of ontology:
Dimension 1 (Gruber) , Formal: supports inferencing, unification, Semi-formal: supports matching and
similarityiequality computations, Informal: Machine readable, but human interpretable (e.9., semantics of
indentation, but not subsumption), Types ofontology: Dimension 2, Upper ontology (time, space, etc),
General purpose ontologies (Cyc, CIRCA, WordNet, Cyc, UMLS medical ontology, EDR), Domain
ontologies, Application & Task ontologies, Ontology creation and management, Social process; human
definition: Tools for manual and semi-automatic ontology creation (e.g., S-CREAM). Creating ontologies
from unstructured text corpus: Named entity extraction, relationship extraction, Ontology definition exnaction
(e.g., Ontominer), Human definition of ontology and subsequent automatically knowledge extractions from
tmsted knowledge source, Tools for ontology creation, import, export, maintenance, lifecycle (brief), Literature
Overview
Fundamental Issues in semantics: Entity Disambiguation and Matching, Mismatch, Integration: Ontology
mismatch and integration, Distinction between schema integration and ontology integration. Multi-ontology
systems. Comprehensive literature overview.
Automatic Classification: Overview ofresearch and techniques for automatic classification, Statistica[,
Machine Leaming, Language Based and Knowledge Based techniques, Classifier committee.
S€mantic Metadata and Information Annotation: Metadata classification: from Syntax to Semantics,
Metadata representation and choices for annotation, Extracting metadata from semi-structured data including
research, techniques and tools, Extracting metadata from unstructured text, including research, techniques and
tools. Comprehensive lilerature review
Relationships at the heart of semantics: Identification, Representation, Discovery, and Validation of
complex relations, Comprehensive literature review.
CSE MX82 Soft Computing
100 Marlc, 4 Credits, 4 HoursWeek
Introduction: Introduction to soft computing; introduction to fuzzy sets and fuzzy logic systems; introduction to
biologicat and artificial neural network; introduction to Genetic Algorithm.
DeparYnent of Compner Science and Ensine(:nns, University of Chitt€ong
Page 126
Fuzzy sets and Fuzzy logic systems: Classical Sets and Fuzzy Sets and Fuzzy relations : Operations on Classical sets,
properties of classical sets, Fuzzy set )perations,properties of fuzzy sets, cardinality, operations, and properties of firzzy
relations.Membership functions : F3atues of membership functions, standard forms and boundaries, different
fuzzificatioEr methods.
Fuzzy to Crisp conversions: Lambda luts for fuzzy sets, fuzzy Relations, Defuzzification methods.Classical Logic and
Fuzzy Logic: Classical predicate logi,:, Fuzzy Logic, Approximate reasoning and Fuzzy Imptication.Fuzzy Rule based
Systems: Linguistic Hedges, Fuzzy Rr le based system - Aggregation of firzzy Rules, Fuzzy Inference System-Mamdani
Fuzzy Models - Sugeno Fuzzy Model;. Applications ofFuzzy Logic: How Fuzzy Logic is applied in Home Appliances,
General Fuzzy Logic controllers, Basir: Medical Diagnostic systems and Weather forecasting.
Neural Network: InEoduction to fleual Networks: Advent of Modern Neuroscience, Classical AI and Neural
Networks, Biological Neurons and Alificial neural network; model of artificial neuron.Leaming Medrods : Hebbian,
competitive, Boltzman etc.,Neural Ne:work models: Perceptron, Adaline and Madatine networks; single layer network;
Back-propagation and multi layernetnorks.Competitive leaming networks: Kohonen self organizing networks, Hebbian
leaming; Hopfield Networks.Neuo-Fuzzy modelling: Applications of Neural Net'works: Pattern Recognition and
classification.
Geretic Algorithms: Simple GA, cro! sover and mutation, Multi-objective Genetic Atgorithm (MOGA). Applications of
Genetic Algorithm: genetic algorithms in search and optimization, GA based clustering Algorithm, Image processiog
and pattem Recognition.
Other Soft Computing techniques: Sinrulated Annealing, Tabu search, Ant colony optimization (ACO), Particle Swarm
Optimization (PSO).
Reference Bool<s :
t.
2.
3.
4.
5.
6.
7.
CSE
MX83
Fuzzy logic with enljneering applications: Timothy J. Ross, John Wiley and Sons.
Principtes of Soft Computing: S N Sivanandam, S. Sumathi, John Wiley & Sons
Genetic Algorithms in search, Optimization & Machine t€aming: David E. Goldberg
NeureFuzzy and Scft computing, Jang, Sun, Mizutani, PHI
Neural Networks: A Classroom Approach,l/e by Kumar Satish, TMH,
A beginners approach to Soft Computing, Samir Roy & Udit Chakaborty, P€arson
Fuzzy Sets and F'tzzy Logic Theory and Applications, George J. Klir and Bo Yuan, Prentice Hall.
Automata and \atural Language Processing
100 Mqrks, 4 Credits,4 Hours/Week
Module-l: Deterministic finite automuton and non-deterministic finite automaton. Transition diagrams and Language
Recognizers. Finite Automata: NFA with i transitions Significance, acceptance of languages. Conversions and
^Equivalence: Equivalence between NFA. with and without I transitions. NFA to DFA conversion. Minimization of FSM,
Limitations of FSM.
Module-2: Regular l,anguages: Regulx sets. Regular expressions, identity rules. Constructing finite Automata for a
giyen regular expressions, Regular saing accepted by NFA,/DFA Pumping lemma of regular sets. Closue properties of
regular sets. Grammar Formalism: Regular grammars-right linear and left linear grammars. Equivalence between regular
linear grammar and FA.
Module-3: Context Free Grammar and Constituency, Some common CFG phenomena for English, Top-Down and
Bottom-up parsing, hobabilislic Cor text Free Gramrnar, Dependency Parsing Push down Automata: Push down
automata, definition. Turing Machine: luring Machine, definition, Design ofTM
Module 4: Regular Expressions and 'l'okenization Introduction to NLP Word Tokenization, Normalization, Sentence
Segmentation, Named Entity Recognition, Multi Word Extraction, Spell Checking Bayesian Approach, Minimum Edit
Distance Morphology, Morphology - Inflectional and Derivational Morphology, Finite State Morphological Parsing,
The Lexicon and Morphotactics, Mo4rhological Parsing with Finite State Transducers, Orthographic Rules and Finite
State Transducers, Porter Stemmer
Module 5: Introduction to N-grams, Chain Rule, Smoothing - Add-One Smoothing, Witten-Bell
Discounting; Backofl Deleted Interpol rtion, N-grams for Spelling and Word hediction, Evaluation of language models.
Module 6: Text Classification, Naive Blyes' Text Classification, Evaluation, Sentiment Anallsis
Opinion Mining and Emotion Analysis. Resources and Techniques.
Module 7: Introduction to Lexical Semrmtics - Homonlmy, Polysemy, Sl,nonyny, Thesaurus WordNet, Computational Lexical, Semrrntics Thesaurus based and Distributional Word Similarity
Reference Books:
1.
2.
3.
4.
Hopcroft H.E. and Ullman J. D., Introduction to Automata Theory Language and
Computation, Pearson.
Mishra and Chandrashekaran, Theory of Computer Science, Automata
Languages and comprtation, PHI
D@ttn€]lt of CdWJter kience
5.
6.
CSE
and tuEineeirg, Unrve6,ty of Chttasong
PageJ 127
C.K.Nagpal, Formal Languages and Automata Theory Oxford
Manaing and Schutze, Foundation of Statistical Natual Language Processing, MIT Press
MX84
Computational BiologY
100 Marks, 4 Credits, 4 Hours/lleek
Introduction to Biology, Introduction to Biology the cenfal dogma, Introduction to genomics, Biology databases, Data
capture, Capturing micro-array data, Proteomics seminar, The gene ontology, Resource meta-data, Data delivery, HCI
and bioinformatics, Dealing with heterogeneous, distributed data, Bioinformatics and gnd Data analysis, Integrated
approaches to post-genome data.
Reference Books:
L
2.
3.
4.
CSE
MX85
Michael S. Waterman: Introduction to Computational Biology: Maps, Sequences and Genomes
Jones and Pavel A. Perzner: An Introduction to Bioinformatics Algorithms (Computational
Molecular Biology)
Ratbbe Wiinschiers: Computational Biology: A Practical Inhoduction to BioData Processing and
Analysis with Linux, MySQL, and R Hardcover
Bruce R. Donald: Algorithms in Structural Molecular Biology (Computational Molecular Biology)
Neil C.
Bioinformatics Computing
100 Marks,4 Credits, 4
Hours/lkek
Introduction to the genome: DNA, RNA, amino acids, and proteins; lnformation flow ftom the genome: genes,
transcription, and translation; Integration of biological data: data integration systems, biological queries, query
processing, data warehouses, and data visualization; Genome and protein sequencing and analysis, spectrum gaphs;
Clustering and classificalim: microarrays, gene expression analysis, hierarchical clustering, k-means clustering,
clustering and classification algorithms; Drug discovery: technologies and shategies, identification of drug target
molecules, drug design approaches.
Re/erence Books :
2.
3.
4.
Bioinformatics: David W. Mount.
Introduction to computational biology: Chapman and HaIUCRC.
Computational molecular biology- An algorithmic approach: Pavel Perzner.
Thesis / Project
CSE
M398
Project
200 Marlc, 8 Credits, 24 Hours/Week
CSE
M399
300 Marks,
Thesis
l2 Credits, 36 Hours/Llteek
Departn€rt of
Cofiplftr
Scienc€ aM Engir€eing Uni\,€Islv of
Page 12A
Chitt€orc
The General rules for B.Sc. Engg., M.S. Engg., M.Phil and PhD
10.
program
IJniversity of Chittagong
GENERAL RULES AN]) REGULATIONS FOR HONOURS, MASTERS, M.PHIL.
AND ANY OTHER DEGII.EE/CERTIFICATE/DIPLOMA EXAMINATIONS OF THE
IJNIVERSITY OF CHITTAGONG.
I
FTJNCTION
(IT THE ACADEMIC COMMITTEE/CHAIR}IAN/DIRECTOR OF
THE DEPARI'MENTS/INSTITUTES REGARDING EXAMINATION
l.
The academic C,)mmittee of the Departnentylnstitutes/RcMPs shall constitute the examination
Committees as prr ordinances ofthe University.
l1
The Academic Committee of the Departments/Institutes/RcMPs shall constitute the Examination
Committee at lesst 50 da)s for semester and 75 days for annual system before the date of
commencement
\{.o{.\o))
stftc{ q-{6s
q$Eufi-{
llI
the examinations.
The ChairmaniD rector of the Departments/Institutes/RcMPs with the approval of the Academic
Committee shall rrnnounce detailed schedule ofeach ofthe examinations.
lY
Ifany examinaticn
is postponed
postponed exar ination
dEfuqr
\tt !r{ Te-k
)8
(f
and
for any reason, the Academic Committee shall refix the date ofthe
it
shall be circulated by the Chairrnan/Dkector
of
the
Departmentylnsttutes according to decision of the Academic Committee.
If
{\
the University authorities postpone any examination due to unavoidable circumstanc€s, the
frhIN q<t
Academic Committee ofthe Departmurts/Institutes/RcMPs, subject to approval ofthe University
\9.8.io1)
authority, shall refix the date
EIftI{si6s
fift5rort{
81ts{ IE];t
Departmentylnstitutes/RCMPS
Y1
of
the
Chairman//Dkector
of
the
shall make arrangement to circulate the same.
The Chairman iD rector of the Departments/lnstitutes,/RcMPs
term paper, class test, field works, field
ai\fr6nq{
{lrtjl{
examination and
tou,
will
preserve sessional (tutorial,
study tour, class attendance etc.) marks submitted by
the course teach,)r and pass three copies of the same to the Chairman of the Examination
Committee at least one month before the Final Examination in sealed covers.
ffi-1
(viii)
vlI
I..r.lRE
The Chairman/Director of the Departments/lnstitutes/RCMPS will preserve practical marks of
students on the brsis of their class performance submitted by the course teacher and pass three
copies of the sarr e to the Chaiman of the relevant Examination Committee at leasl one month
before the Final Examination in sealed covers.
\'1ll
Students having l:ss than 70% class attendance
pay non-collegiate fee ofTk=600.00
will
be aeated as non-collegiate and sball have to
students having less then 60% ofclass attendance
will not
be allowed to sit f,rr the examination.
2.
FUNCTIONS (IF THE EXAMINATION COMMITTEE
l.
The intemal merr bers of the Examination Committee will recommend for the appointment of
"paper setters" an,i "script examiners" fiom the panel of examiners as prepared by Committee of
Courses and Studi,:s ofthe Departments/lrstitutes and approved by the concerned authorities ofthe
University to the ('ontroller ofExaminations ofthe University.
"There shall be
tro
paper setters and two
sc pt examiners to be called Ist and 2nd Examiner for
each course 2nd E <aminer prefarably from other public University/Go!'t. Research Institules/Go!1.
Research Organisations."
Departrnalt of Compute,
u
kierr.e
Page 729
at:d Engireqtng Unir€rity of ChrthgoaB
The Examination Committee will moderate question papers, fix dates to conduct practical
examination, seminar and viva-voce and prepare the results. The members from the
related/langUage course will moderate question papers of related{angttage courses and conduct
practical examinations of related courses only.
The Examination Committee
will finalize all
the sessional (tutorial, tsmr paper, class test, field
works, field tour, study tour, class attendance etc.) marks for tabulation.
The Examination Committee shall post the class performance marks of practical course to the
answer script of respective practical examination.
The Examination Committee
will recommend
the name of three tabulators (at least two tabulators
shatl be from the members of the Examination Committee) to the Controller of Examinations for
appointrnent.
vl
The Examination Committee shall take decision for third examination of scripts of the unmarked
answer/s which
vll
will report by the tabulators in a meeting.
The Examination Commifiee shall take decision on tabulators report, regarding third examination
of scripts of course/courses in a meeting presided over by the Chairman and recommend to the
Controller of Examinations the name ofa relevant third examiner for each course for appointment
from the panel of examiners other than a memhr of the Examination Committee or tabulators,
provided further that he/she was not an examiner ofthis course.
vlll
The Examination Committee shall compare tabulation sheet and finalize the results submitted by
tabulators with
all
documents. The same tabulation sheets duly signed
by the Chairman
and
Members of the Committee shall be submitted to the Controller of Examinations for publication
of
results.
lx
The Examination Committee shall recommend the name of preparer and comparer of Grade
Sheet/Academic Transcript who will be the members of the Committee to the Conholler of
Examinations. The Grade Sheet/Academic Transcript will prepare showing course-wise grades and
the GPA,/CGPA of the candidate.
x
The results of the examination shall be finalised for publication within 30 days (for semester) and
45 days (for annual system) from the date of last theoretical course examination.
xl
The answer scripts of candidates at University examination shall not be re-examined.
FUNCTIoNS oF THf, CHAIRMAN OF THE EXAMINATIoN CoMMITTEE:
3
The Chairman of the Examination Committee shall:
Convene a meeting of the Examination Committee for
making list of paper setters and script
examiners and send it to the Controller of Examinations for necessary action.
1l
llt.
iv.
Convene a meeting ofthe Examination Committee for moderation ofquestion papers and inform
it
to the Controller of Examinations. In case of any vacancy or inability of a member to attend the
meeting or if the manuscript is not received either from first or second examiner the moderation
work shall not be invalidated.
Convene a meeting to fix dates to conduct practical and viva-voce examination.
Make arrangement for writing and printing ofthe question papers.
Be responsible for safe custody ofmanuscript and question papers and will act as Chief Supervisor
of the Examination hall, in absence, the senior most member of the Committee will act as Chief
Supervisor.
Issue insEuctions conceming the standard to be adopted in waluating scripts.
Departnent of Compner Science and
\rl1
Enginee
Page 15O
ins, Unrversv of Chittagong
Code the answer script and give
it to lst script examiner and on receipt Aom lst script examiner
shall distribute to the 2nd examiner along with necessary papers for eyaluations ifthe 2nd examiner
within this University.
vl[.
Hand over all documents for tabulating the results to the tabulators.
lx
Present all kinds ofreport from the tabulators regarding tabulation ofthe results in a meeting
ofthe
Examination Conunittee.
x.
Send tbree copi€r tabulated results in final form and Cnade SheetvAcademic Transqipt sheets to
the Controller of lxaminations for the announcement ofthe finalresults along with a set of copies
of all documents.
xl
Or hiVher nominr:e (committee member) compares the result sheet of that examinatiqr which will
be prepared by thr: Controller ofExaminations and then sign in the Fepared result sheet.
xll
Hand over a set
oi
copies of all documents after publication ofresults regarding examination of the
year to the Chairnran/Director of the Departaenulnstitutes.
xlll
Preserve the exanined scripts up to thre€ months. The evaluated scripts shall not be handed over to
any other authority outside the University within three months. After that, scripts shall be disposed
offto
4.
the office ol the Controller of Examinations ofthis University.
FUNCTIONS ,fF COURSE TEACHER / EXANIINER:
The course teachr:r shall provide the students with the course outline indicating the textbooks to be
followed, probab e dates of sessional (tutorial, term paper, class test, field works, field tour, study
\c.b.\o))
tour, class attendince etc.) at the beginning ofthe session.
qkr{
q-i6-s
ll
works, field torx, study tour etc. and he/she shall sign on the scripts of these examinations.
,4TIrcfi-s
Tutorial, term papq, class test shall be taken according to the syllabus in force.
slBffrf{
lle s{
The course teacher shall conduct and evaluate the script or tutorial, term paper, class test, field
111.
The course teach
r
shall take at least three class tests/tutodal examinations in theoretical paxt of a
course and shall rrubmit four copies
cqir t) 4\
ofthe
average
ofall
sessional (tutorial, term pap€r, class test,
field works, fielc tour, study tour, class attendance etc.) mark to the Chaiman/Director of the
frqtg.{<\
e.)).{o!!
qfo.{
Department/ln stitutes.
will give theoretical (if any) and practical marks to the students on the basis of
their class performance and four copies of mark sheets submitted to ChairmaniDirector of the
The course teachtrs
q{6t
Bffir
Deparhnen[ilnstitutes within a week ofcompletion ofa course.
I qqE{
The teachers of the Department{nstitute/RcMPs in this University shall be responsible for
Iq3t ql\
fiqlrsd
{KEII
invigilation works, tabulation, finalization of results and such other works connected with the
examinations.
\1
The teacher who
vill
be the lst examiner of any examination shall receive the answer scripts with
acknowledgemen . from the Chairman of the Examination Committee along with necessary papers
on the date at th,r end of each semester/annual examination. If Vhe fails to receiye the answer
scripts on the drte of examination, s/he will collect the same as soon as possible from the
{Fr-s (iii)
xr,fl&s
Chairman.
\11.
viii
If thae is any relation ofteacher s,he shall not participate in any activity ofthe examination.
Each examiner (l $ and 2nd) will be given time to evaluate scripts at the rale ofsix, eight and ten
answer sqipts per day for 100, 75 and 50 marks respectively and additional ten dals from the date
of receipt ofthe answer scripts by the chairman ofthe Examination comminee/ the controller of
Examinations. The examiner shall prepare four copies of detailed marks sheets and give three
copies to the chairman of the Examination committee and one copy to the controller of
Examinations.
Cqrp{rE SciqEe dd R€iE€ring {Jri,a'ity of OiUago(E
Page
13l
D€p(urErt
oa
lx.
Two examiners neither of whom shall be aware ofthe marks assigned by the other examiner shall
independently examine each script.
x.
Each examiner should give his total marks in round figure and not in fiactions. If there be a
be increased to the next whole
fraCtiOn in the sum total of marks assigned to a candidate it should
number.
xl
Ifthere is any excess answer in the scripts, the last answer will be cancelled.
5
FTJNCTIONS OF TABTJLATORS AND FINALIZATION OF THE RESULTS:
i.
l1
Three tabulators shall tabulate the result ofthe semester/annual examination. The Chairman of the
Examination Committee shall hand over all marks and necessary documents to the tabulators.
The tabulators will have to veri$ separately whether mark is assigned to each answer, all the
marks are correctly entered and added up or have been left unmarked or answered excess. If any
discriminancies arise it should be reported to the Chairman of the Examination Committee.
The tabulators will prepare course-wise list of scripts where marks of lst and 2nd examiners vary
by more than 15, 12, 8 and 4 marks out of 100, 75, 50 and 25 marks, respectively and shall report
lv.
to the Chairman of the Examination Committee for third examination of the answer scripts. Each
tabulator should give his/her average marks in rormd figure and not in fractions.
In case of thtd exarnination, the average of the two nearest marks would be taken. In the event of
equal difference of marks among the three exarninos, the average ofthe two higber marks shall be
awarded. In case of third examination of unmarked question/s in the scripts/s, the marks of the
examiner who evaluated partially will not be considered and the average of the marks of the rest
two examiners shall be awardedTabulators will individually post the marks of each candidate and finalize all dre results and hand
over to the Chairman of the Examination Committee.
For the irregular and improvement categories, tabulators will individually post the improved marks
along with all other marks ofa particular candidate ftom the previous year's tabulation sheet to the
current tabulation sheet and hand over to the Chairman of the Examination Committee.
vll.
Tabulators shall deposit the tabulation sheets after finishing the tabulation to the Chairman of the
Examination Commi$ee duly signed by them along with all documents and their comments for
fi
6
nalization of results.
FUNCTIONS OF THE CONTROLLER OF EXAMINATIONS RE,GARDING
EXAMINATIONS AND PUBLICATION OF THE RESULTS:
will issue appointment letters to the Chairman and members of the
Examination Committee, paper setters, script examiners, tabulators, and who will prepare and
compare the grade sheet/academic transcript subject to the approval of the authority.
The ConEoller of Examinations
It
111.
If
the script examiners are from outside of this University, the Controller of Examinations shall
distibute the answer scripts to the 2nd examiner appointed from other University.
The Contoller of Examinations will prepare three different R?es of tabulation sheets for the
regular, irregular/improvement categories of students in each examination or as decided by the
University Authority from time to time. These tabulation sheet and grade sheeuacademic tanscript
should be in English.
I
Page
D@artl\4t of Ccnp(lte, Sciance and Eryine,nnS, Universiv of ChitiasorB
tv.
7.32
The Controller of Examrnations will receive three copies tabulated results in final form from the
Chairman of the Examinrtion Committee for the annormcement of the final results along with a set
ofcopies ofall cormectetl working papers including grade/academic transcript sheets.
The Controller of Exanrinations may compare the result submitted by the Chairmaa of the
Examination Committee. If there is any discr€pancy may send back to the respective Chairman of
the Examination Commitlee for necessary correction.
The Controller of Exarrinations shall prepare result sheet of each examination that will be
compared by the Chairaan of the Examination Committee or his/her nominee (committee
member)
The Controller of Examirations shall publish the results of the programme and shall provide the
grade sheet/academic transcript showing course-wise grades and the GPA./CGPA of the
vll
candidates.
The Conaoller of Examinations shall publish final results of each examination provisionally
subject to approval ofthe Vice-Chancellor and report to the Syndicate and thereafter send a copy
of the tabulation sheet duly signed by him/her with date to the Chaiman/Dtector of the concerned
vlll
DepartmentYlnstitutes.
The above rules and re 3ulations are also applicable to the affrliated colleges/institutes of
the Chittagong Univers: ty.
7
The above rules and regulations framed herein and being passed by the appropriate
authority shall come into force immediately and anything in any ordinance of the
University for any Dq;ree/Certificate/Diploma contrary to the provision herein shall
be deemed cancelled and invalid.
per recommcndatian o/f 221't E4raordinary meetinB of tfie i,ca[emic Counci[
rtile resofutbn no-l (ffii) fieff on 24-07-2010 {, apprwe[ fu 46Vn meeting of tfie
Synticate ai[e resofution no. 6 fre[[ on 09-08-2010 4n[ kter on anen[e[ dn[
revise[ as per tfre Sln[icate empowetment).
/s
(Professor Dr. Muhammad Shah Alam
Doted, August..28, 2070
Chittogong University
chittogong
)
Registrar
(rr<hrrB.)
University of Chittagong
Chittrgong, Banglad€sh.