1 Table of Content 1. Welcome Note from Head of Department ……………………………………………….2 2. List of Principal Officers of the University ……………………………………………... 3 3. Vision, Mission and Philosophy ………………………………………………………….4 4. Objectives of the Programme.…………………………………………………………….4 5. Administrative Structure of the Department ……………………….…………………….5 6. Staff Profiles ………………………………………………………………...…..…........11 7. Academic Contents and Requirements …………………..……………………..………14 8. Course Description……………………………………………….……………….….….24 9. List of Laboratories and Equipment……….……………….……………………….…..33 10. Laboratory Staff ………………………………….……..... …………………….….…..35 11. Activities of the Programme …….…..……………………….…………………...........36 12. Research Clusters and Accomplishments ………………………………………...........36 13. Awards & Accomplishments …………………………………………………………..36 14. Linkages and Collaborations ………………………………………………………......38 15. Community Impact …………………………………………………………………….39 16. Future Pathways ……………………………………………………………………….39 COVENANT UNIVERSITY DEPARTMENTAL HANDBOOK FOR COMPUTER SCIENCE PROGRAMME
Transcript
1
Table of Content
1. Welcome Note from Head of Department ……………………………………………….2
2. List of Principal Officers of the University ……………………………………………... 3
3. Vision, Mission and Philosophy ………………………………………………………….4
4. Objectives of the Programme.…………………………………………………………….4
5. Administrative Structure of the Department ……………………….…………………….5
Welcome to the Department of Computer and Information Sciences. The department contributes to the mission of the University in training undergraduate and graduate students with requisite skills needed to solve complex technological problems of modern society and the attainment the Vision 20:2020 and the Millennium Development Goals (MDGs).
Current research focus includes Software engineering, Management Information Systems and Bioinformatics. The CIS department offers degree programs leading to the B.Sc, M.Sc and M.Phil/Ph.D. in Computer Science and Management Information Science respectively.
The Department is adequately staffed with qualified and experienced faculty and staff to impart quality education on students. Also, there are well-equipped laboratories with the state-of-the-art facilities such as Grid computers as well as current and modern programming languages that place our graduates at the same pedestal as their foreign counterparts.
The HOD’s Profile
Ayo C. K. holds a B.Sc. M.Sc. and Ph.D in Computer Science. He is a Professor of Computer Science and the immediate past Director of Academic Planning Unit of the Covenant University. His research interests include: Mobile computing, Internet programming, eBusiness, eGovernment and Software Engineering. He is a member of the Nigerian Computer Society (NCS), and Computer Professionals (Registration Council) of Nigeria (CPN). Similarly, he is professionally certified in CISCO and Microsoft products. Professor Ayo is a member of a
number of international research bodies such as the Centre for Business Information, Organization and Process Management (BIOPoM), University of Westminster, London; the Review Committee of the European Conference on E-Government ECEG); the programme committee, IADIS Information Systems; the Editorial Board of a number of international journals. Furthermore, Professor Ayo is an External Examiner to a number of Nigerian universities at both Undergraduate and Postgraduate levels in Ladoke Akintola University of Technology, Ogbomoso; the Redeemers University, Ogun State; Lagos State University, Ojo, Lagos; University of Ibadan, Ibadan Oyo State; and many others. He has supervised about 200 postgraduate projects at Postgraduate Diploma, Masters and Ph.D levels, and he has several publications in scholarly journals and conferences.
3
2. LIST OF PRINCPIAL OFFICERS
Vice-Chancellor Professor Aize. Obayan, B.Ed, M.Ed,.Ph.D
Deputy Vice-Chacellor
Professor Charles Ogbulogo, B.A,. Ed., M.A., Ph.D
Registrar Mr. Joseph N, Taiwo, M,Sc., ACIB
Director, Centre for Learning Resources Mr. Chris Nkiko, B.Sc, M.Sc,. M.L.S.
Ag. Director, Finacial Services
University Chaplain Pastor
Dean, Student Affairs
Director,Physical Planning & Development
Ag. Director, Centre for Systems Information Services Engr. Bayo Ajala
DEANS OF COLLEGES & SCHOOL OF POSTGRADUATE STUDIES
Dean, College of Development of Studies
Dean, College of Science and Technology
Dean, School of Postgraduate Studies Professor Christopher Awonuga, B.A., M.A., Ph.D
4
3. VISION, MISSION AND PHILOSOPHY
The department has adopted a broad strategy of human resource development that encompasses educational, technological, cultural, social, political and spiritual development such that our graduates will be sufficiently equipped to make valuable contributions to national development towards the attainment of the Vision 20:2020 of Nigeria and the Millennium Development Goals as set by the global community. The Department intends to nurture graduates, who by leveraging on their sound foundational training and skills in the computing sciences would become globally relevant in the industrial and academic domains, and eventually emerging as future leaders in the fields of Computing, Computational Sciences, and Information and Communication Technology, both in Nigeria and the global community. The department is committed to producing highly creative and innovative graduates that are competent enough to be self-employed in the field of Information Technology and its allied disciplines, or in the least be immediately employable.
Research-wise, the department aims to make significant contributions to the advancement of the broad field of Computer Science. To achieve this, the department has two vibrant research groups that are engaged in high quality research. The Bioinformatics research unit is actively involved in bioinformatics research in their quest to combat the menace of Malaria, HIV/ AIDS and other chronic diseases that are prevalent in the African continent. The Software Engineering and Intelligent Systems unit is committed to research in the key thematic areas of Mobile Computing, E-Health, E-Learning, E-Tourism, E-Governance, and Data mining that would ultimately engender the eradication of poverty, increased wealth creation, and literacy level, and reduction of child mortality rate.
4. OBJECTIVES OF THE PROGRAMME
Specifically, the objectives of the department are as follows:
(i) To develop graduate with skills and knowledge needed to meet the requirements of a rapidly advancing and challenging field of ICT.
(ii) To produce graduates with IT skills and prepare them for the industry and global competitiveness.
(iii) To produce highly creative and innovative graduates that are competent enough to be self-employed in the field of Information Technology and its allied disciplines, or in the least be immediately employable.
(iv) To develop human capital with emphasis on creating a knowledge-based society. (v) To develop manpower to pursue careers in a wide range of professions including software
development, web design, and system administration, project management, and computational sciences, that would foster the attainment of the Vision 20:2020 and the Millennium Development Goals.
(vi) To provide a broad and balanced foundation in computer science knowledge and practical skills.
(vii) To provide students with knowledge and skills base for further studies in computer science or multi-disciplinary studies involving computer science.
5
5. ADMINISTRATIVE STRUCTURE OF THE DEPARTMENT
Keys: HOD - Head of Department R & D - Research and Development AS&QA - Academic Services and Quality Assurance DISC - Disciplinary Committee
(a) How Staff are involved in the Decision-making process and in General Administration
All academic staff and technologists in the department participate actively in decision making through regular meetings. The entire faculty and staff of the department have avenues to discuss freely both formally and informally with colleagues and the Head of Department. Departmental decisions are taken collectively.
Academic Committee
Secretary
Teaching Support Services
Programme Coordinator
Lecturers
Students
Academic Advisers
Administrative Officer
Students Office Assistant
R & D AS&QA DISC Exam Timetable
Head of Department
6
The Department appoints Level Advisers for each level (Class), who are in charge of registration, welfare and counseling of students. The Head of Department liaises with the advisers and other staff in the running of the Department.
Furthermore, the Department constitutes some committees that address specific departmental issues, which include: Research and Development, Quality Assurance and Academic Standards, Disciplinary, and Examinations Committee amongst others.
(b) Policy and Practice on Staff Development
The University has a robust staff development programme in place. Any academic staff employed in the University who has no Ph.D at the point of appointment is expected to commence immediately a postgraduate programme in-house, fully sponsored by the University, except there is a strong evidence that such staff is making satisfactory progress in postgraduate programme elsewhere. Furthermore, each faculty of the University is entitled each year to conference sponsorship in Nigeria, Africa and abroad depending on individual rank.
(c) Staff Promotion
The Staff promotion process is in line with the University policy that rewards quality scholarship.
STUDENT’S WELFARE (a) Handling of academic grievance There is a level adviser for each level of our programmes. Students having grievances or/and suggestions can discuss either with their level advisers, the staff concerned, or/and the HOD. Every student has unrestricted access to all the staff and particularly the level advisers in the Department, to the HOD, and to the Dean. In fact, at the University level, there is a scheme tagged in-loco parentis, where faculty and staff act as the parents of students. Through this scheme, faculty and staff are able to interact with students as parents on all issues such as academic, social and welfare. (b) Student academic advising Academic advising is done at different levels for all students in the university. At the departmental level, the level advisers are primarily responsible for interacting with the students at a specified level and to ascertain that all issues bothering on academic matters are addressed promptly. Such typical issues include registration, continuous assessment and health challenges among others.
7
EXAMINATION (a) Setting, conduct, evaluation scheme, moderation schemes-internal and external for
degree examination and the issuance of results. The course lecturers of each course are responsible for drawing questions, according to the stipulated departmental format in the courses taught. All examination papers and marking schemes are subjected to internal moderation. The answer scripts are likewise subjected to internal moderation as part of the quality assurance measures of the university to ascertain that minimal/no errors go into examination processing. However, all final year questions and marking schemes are subjected to external moderation through a qualified Professor in the discipline. ACADEMIC ENVIRONMENT
The Department operates in a conducive atmosphere provided by the University Management. This is reflected, among others in the following:
1. Regular academic calendar devoid of strikes, student demonstration or other forms of Disruption;
2. Conducive classroom environment in the form of adequate space, well arranged, adequate and ventilated sitting arrangement;
3. Provision of up-to-date working tools for academic staff such as Computers, Public Address System, Multimedia facilities and regular access to the Intranet and Internet;
4. A functional library with current books and journals, and access to several reputable on-line academic outlets;
5. A convenient Laptop Acquisition Scheme for staff and students that enables them access to ownership of their computer facilities;
6. Regular payment of salaries;
7. Conducive office and residential accommodation for staff and students;
8. A serene cult-free campus environment that guarantees peace and safety of staff and Students; and
9. Adequate infrastructural facilities such as electricity and water supply.
8
EXAMINATIONS, GRADING PROCEDURES AND RESULTS
1. Course Assessment i. All courses shall normally be evaluated by examinations and continuous assessment.
ii. Scores from continuous assessment shall constitute 30% of the final marks, 70% for the Semester Examination.
2. Examinations i. Each course shall normally be completed and examined at the end of the semester in
which it is offered. There is however a maximum of one compulsory mid-semester examination for all courses and at least one other test and one assignment.
ii. A written examination shall last for a minimum of one hour for a one-unit course and a maximum of two/three hours for a two/three-unit course respectively.
3. Conduct of examinations i. Candidates must be seated at least 15 minutes before the commencement of each
examination; no candidate may be allowed into the examination room except at the discretion of the Chief Invigilator. Similarly, except with the special permission of the Chief Invigilator, candidates will not normally be allowed to leave the examination venue. Outside these periods, candidates may leave the room temporarily only if accompanied by an attendant.
ii. Candidates shall not be allowed to take into the examination venue or have in their possession during the examination any book or paper, printed or written document (whether relevant to the examination or not) unless specifically authorized to do so. Any candidate who does so will be disqualified from the said examination. Normally no textbook of any sort should be found at the examination venue.
iii. Any proven attempt made by a candidate directly or indirectly to influence the process of examination or any part thereof with a view to obtaining undue advantage shall lead to the candidate’s disqualification from the whole examination.
iv. Silence shall be maintained throughout the period of examination, and communication between candidates shall not be allowed.
v. Candidates shall comply with all instructions set out in the examination and communication materials. They shall also comply with all instructions given to them by the invigilators.
vi. Whenever there is an alleged examination malpractice, the candidate involved shall be required to make a signed statement immediately. The candidate will then face the disciplinary committee. A proven case of examination malpractice shall lead to dismissal from the University.
vii. Candidates must present themselves at all University examinations for which they have duly registered. Candidates who fail to do so for reasons other than illness or accident, attested to by the Chief Medical Officer of the University, shall be deemed to have scored 0.0 in that examination.
9
4. Examination Malpractice The University frowns seriously at any act of examination malpractice, the penalty for which is dismissal.
5. University Grading System Each course has three grading components which include:
i. Percentage Score Grade ii. Letter Grade iii. Grade Point
Percentage Score Letter Grade Grade Point 70 and above A 5 60 – 69 B 4 50 – 59 C 3 45 – 49 D 2 0 – 44 F 0
Degree Classification
Cumulative Grade Point Average (CGPA Class of Degree 4.50 – 5.00 First Class Honours 3.50 – 4.49 2nd Class Honours (Upper Division 2.50 – 3.49 2nd Class Honour (Lower Division) 1.50 – 2.49 Third Class
6. Students’ Academic performance/ Assessment All courses taught during each semester are examined at the middle and end of the semester. Students shall be assessed by examinations of all registered courses at the end of the semester. Each courses shall have a total mark of 100 with 70 marks for the examination and 30 marks for continuous assessment. The minimum pass mark shall be 45%. Grade point Average (G.P.A.) shall serve as a means of checking whether a student is in good standing or not. The cumulative G.P.A. (CGPA) at the end of the programme shall indicate the class of degree. A student who does not have a Grade Point Average up to 1.5 in any semester is placed on academic probation and is required to remedy this by the next semester; otherwise he will be advised to withdraw from the programme. Calculation of GPA and CGPA Students are required to be familiar with the computation of their academic standing so that they can monitor their performance and make necessary adjustment in order to have a fulfilling academic career in the University Students should be familiar with the following terms used in computing their academic records. TUT: Total Units Taken (this applies to each semester) TUP: Total Units passed (per semester) CUT: Cumulative Units taken (which is the sum of the previous semester’s TUT and the current semester’s TUT or the sum of the last CUT and the current Semester’s TUT)
10
CUP: Cumulative Units Passed (which is the sum of the previous semester’s TUP and the current semester’s TUP or the sum of the last CUP and the current semester’s TUP
GP: Grade Point for a course is a product of score point and the number of units assigned to the course. For example, a 3-unit score for which the student returned an A grade is calculated using the formular: Grade point for the course = point of grade score x unit of course; i.e. 5x3=15
TGP: (Total Grade Point): This is the sum of the grade point for TUT. For example, the TGP for five course A, B, C, D, E = A+B+C+D+E
GPA: Grade Point Average (this is the mean of the TGP) This, GPA = TGP/TUT CGP: Cumulative Grade Point (this is the sum of grade points of all semesters to date) CGPA: Cumulative Grade Point Average and is calculated using the formula: CGPA + CGP/CUT
11
6. STAFF PROFILES
S/N NAME OF LECTURER
QUALIFICATION PROFESSIONAL STATUS DESIGNATION PROGRAMME OF
SPECIALISATION
1 Prof. C. K. Ayo Ph.D, M.Sc, B.Sc MNCS, MCPN,MCP,CCNA Professor / HOD Computer Science/
MIS
2 Prof. E. F. Adebiyi Ph.D, M.Sc, B.Sc MNCS, MCPN, ASBCB, ISCB, NISEB Professor Computer Science/
Bioinformatics
3 Dr. N. A. Ikhu-Omoregbe Ph.D, M.Sc, B.Sc MNCS, IEEE Senior Lecturer Computer Science
4 Dr. J. O. Daramola Ph.D, M.Sc, B.Sc MNCS, MCPN Senior Lecturer Computer Science
5 Dr. V. C. Osamor Ph.D, M.Sc, B.Sc ASBCB, MNCS, MCPN Lecturer I Computer Science
6 Dr. Mrs. Oladipupo O. Ph.D, M.Sc, B.Sc MNCS, MCPN Lecturer I Computer Science
7 Dr. O. J. Oyelade Ph.D, M.Sc, B.Sc ASBCB, MNCS, MCPN Lecturer I Computer Science
8 Dr. A. A. Adebiyi Ph.D, M.Sc, MBA, B.Sc
MNCS, MCPN Lecturer I M I S
9 Dr. A. A. Azeta Ph.D, M.Sc, B.Sc MNCS, MCPN Lecturer I Computer Science
10 Dr. M. O. Oyelami Ph.D, M.Sc, B.Sc MNCS, MCPN Lecturer I Computer Science
11 Mr. Z. O. Omogbadegun M.Sc, B.Sc MNCS, MNYAS Lecturer I Computer Science
12 Dr. S. A. Fatumo Ph.D, M.Sc, B.Sc ASBCB, MNCS, MCPN Lecturer II Computer Science
13 Dr. I. T. Fatudimu Ph.D, M.Sc, B.Sc MNCS, MCPN Lecturer II Computer Science
14 Mr. A. G. Musa M.Sc, B.Sc MNCS, MCPN Asst. Lecturer Computer Science
15 Mrs. M. O. Adebiyi M.Sc, B.Sc ISCB,ASBCB, IEEE,WIE, MNCS,
Asst. Lecturer Computer Science
16 Ms. C. P. Ekenna M.Sc, B.Sc Asst. Lecturer Computer Science
17 Mrs. S. R. Okuboyejo M.Sc, B.Sc Asst. Lecturer MIS
18 Ms. M. I. Ewejobi M.Sc, B.Sc Asst. Lecturer Computer Science
19 Mrs. A. A. Oni M.Sc, B.Sc Asst. Lecturer MIS
12
20 Mr. O. Emebo M.Sc, B.Sc Asst. Lecturer Computer Science
22 Mr. A. A. Ezenwoke M.Sc, B.Sc Asst. Lecturer Computer Science
23 Mr. B. O. Odusote M.Sc, B.Sc Asst. Lecturer Computer Science
24 Mr. C. Ajieh M.Sc, B.Sc CCNA Asst. Lecturer Computer Science
25 Mr. I.O. Eweoya M.Sc, B.Tech Asst. Lecturer Computer Science
GRADUATE ASSISTANT/RESEARCH FELLOW
1 Mr. A.O. Adewumi
B.Sc
Graduate Assistant
Computer Science
2 . Mrs. O.T. Oladimeji
B.Sc Graduate Assistant Computer Science
VISITING PROFESSORS/LECTURERS
1 Prof. V. Mbarika Ph.D Professor MIS
2 Prof. M. Sanjay Ph.D Professor Computer Science
3 Dr. P. B. Shola Ph.D MNCS, MCPN Snr. Lecturer Computer Science
4 Dr. P. A. Adewole Ph.D Snr. Lecturer Computer Science
ADJUNT LECTURERS
1 Dr. P. Alege Ph.D Snr. Lecturer Economics
2 Prof. K. Adeyemi Ph.D Professor Business
3 Dr. T. Abioye Ph.D Snr. Lecturer Languages
4 Dr. I. Chiluwa Ph.D Snr. Lecturer Languages
5 Prof. N. Kwofie Languages Professor Languages
6 Dr. M. Geshinde Ph.D Snr. Lecturer Psychology
7 Prof. A. Obayan Ph.D Professor Psychology
7 Dr. P. Olarenwaju Ph.D Snr. Lecturer Mathematics
13
ADMINISTRATIVE STAFF
1 Mr. S.A. Ige HND, PGD NIM Admin. Officer 1 Business/Admin.
2 Ms. R. Eno-Abara, OND Office Assistant Business/Admin.
14
7. ACADEMIC CONTENTS AND REQUIREMENTS (a) Programme Title:
B.Sc (Hons) Computer Science
(b) Admission Requirements
i. General Requirements: The Minimum entry requirement for admission into Covenant University is a Credit level pass in five (5) subjects, including English and Mathematics, obtained at not more than two sittings. In addition, Covenant University conducts Screening Exercises for all candidates seeking admission into the University. Candidates are also to note that there are other requirements that may be specific to a College and / or a Programme.
ii. Additional Admission Requirements
Credit level pass in five (5) subjects in the SSCE/GCE/NECO O/L or their equivalent must be obtained at not more than two sittings and must include Physics, Chemistry and either Biology or Agricultural Science.
15
(c) Graduating Requirements To graduate from the 4-year Bachelor of Science degree programme in Computer Science, students must have successfully completed a minimum of 165 Credit Units as shown below.
Graduating Required Units for B.Sc Computer Science Programme
Level 100 200 300 400 Total
Core/ Compulsory
31 29 14 32 106
Electives 6 6 9 21
SWEP 0
Industrial Training [SIWES]
6 6
College Courses
0
University Courses
4 4 2 4 14
NUC Courses
10 6 2 18
TOTAL 45 45 30 45 165
16
100 Level Computer Science ALPHA SEMESTER
Compulsory Courses
Course Code Course Title Status Units Pre-
Requisite
PHY111 Mechanics and Properties of Matter C 2
BIO111 General Biology I C 3 MAT111 Mathematics I: Algebra C 3
MAT112 Mathematics II: Trigonometry and Geometry C 2
PHY119 Physics Practical I C 1 CSC111 Introduction to Computer Science C 3 CHM111 General Physical Chemistry C 3 CHM119 General Chemistry Practical I C 1
18
University Courses
EDS111 Entrepreneurial Development Studies I C 1
TMC111 Total Man Concept I C 1
TMC112 Total Man Concept – Sports C 0
2
NUC General Courses
CST111 Use of Library, Study Skills and Information Communication Technology I
C 2
GST111 Communication in English I C 2
4 Total (α) 24
17
100 Level Computer Science OMEGA SEMESTER
Compulsory Courses
Course Code Course Title Status Units Pre-
Requisite
PHY121 Electricity and Magnetism C 3
PHY122 Atomic and Nuclear Physics C 2
MAT121 Mathematics III: Calculus C 3
MAT122 Mathematics IV: Vector Algebra C 2
PHY129 Physics Practical II C 1
CSC121 Intro. To Problem Solving C 2
13
University Courses
EDS121 Entrepreneurial Development Studies II C 1
TMC121 Total Man Concept II C 1
TMC122 Total Man Concept – Sports C 0
2
NUC General Courses
CST121
Use of Library, Study Skills and Information Communication Technology II
C 2 CST111
GST121 Communication in English II C 2 GST111
GST122 Communication in French C 2
6 Total (Ω) 21 Total (α + Ω) 45
18
200 Level Computer Science ALPHA SEMESTER
Compulsory Courses
Course Code Course Title Status Units Pre-
Requisite
CSC211 Computer Programming I C 3
CSC212 Fundamentals of Data Structure C 3
CSC213 Structured Programming C 3
CSC214 High Performance Computing & Data Management I
C 3
CSC215 Mathematical Methods C 3
15
Electives Courses
Note: Select 3 units from Elective MAT212 Linear Algebra I E 3
Electronic/ Modern Physics E 3
ECO111 Introduction to Economics I E 3
ACC111 Introduction to Accounting I E 3
3
University Courses
EDS211 Entrepreneurial Development Studies III
C 1
TMC211 Total Man Concept III C 1
TMC212 Total Man Concept – Sports C 0
2 NUC General Courses
GST211 Logic, Philosophy and Human Existence C 2
2 Total (α) 22
19
200 Level Computer Science OMEGA SEMESTER
Compulsory Courses
Course Code Course Title Status Units Pre-
Requisite
CSC221 Computer Programming II C 3
CSC222 Discrete Structure C 3
CSC223 Computer Hardware C 3
CSC224 Foundation of Sequential and parallel Programming C 2
CSC225 Operating System C 3
14
Electives Course
Note: Select 3 units from Elective MAT222 Linear Algebra II E 3
MIS221 Intro. Management Information System E 3
3
University Courses
EDS221 Entrepreneurial Development Studies IV C 1
TMC221 Total Man Concept IV C 1
TMC222 Total Man Concept – Sports C 0
2
NUC General Courses
GST221 Nigerian People and Culture C 2
GST222 Peace Studies and Conflict Resolution C 2
4 Total (Ω) 23 Total (α + Ω) 45
20
300 Level Computer Science
ALPHA SEMESTER
Compulsory Courses
Course Code Course Title Status Units Pre-
Requisite
CSC311 Object Oriented Programming C 3 CSC211
CSC312 Computer Architecture & Organization C 3
CSC313 Compiler Construction I C 3
CSC314 System Analysis & Design C 3
CSC315 Internet Programming C 2 14
Elective Note: Select 6 units from these Electives
CSC316 Theory of Computing E 3 CSC317 Operation Research E 3
CSC318 Statistical Computing E
3
6
University Courses
EDS311 Entrepreneurial Development Studies V C 1
TMC311 Total Man Concept V C 1
TMC312 Total Man Concept – Sports C 0
2 NUC General Courses
GST311 2
Total (α) 24
21
300 Level Computer Science
OMEGA SEMESTER
Compulsory Courses
Course Code Course Title Status Units Pre-
Requisite
SIWES CSC329
Student Industrial Work Experience Scheme (SIWES)
C 6
6
University Courses
NUC General Courses
Total (Ω) 6 Total (α + Ω) 30
22
400 Level Computer Science ALPHA SEMESTER
Compulsory Courses
Course Code Course Title Status Units Pre-
Requisite CSC411 Survey of Programming Language C 3
CSC412 Computational Science & Numerical Method C 3
CSC413 Software Engineering C 3
CSC414 High Performance Computing & Data Management II C 3 CSC214
CSC415 Algorithms & Complexity Analysis C 3
CSC416 Artificial Intelligence C 3
18
Electives
Note: Select minimum of 3 units from these Electives
CSC417 Computer Graphics and Visualization E 2
CSC418 Modeling & Simulation E 3 CSC419 Information Technology Law E 3
3
University Courses
EDS411 Entrepreneurial Development Studies VII C 1
TMC411 Total Man Concept VII C 1
TMC412 Total Man Concept – Sports C 0
2 Total (α) 23
23
400 Level Computer Science OMEGA SEMESTER
Compulsory Courses
Course Code Course Title Status Units Pre-
Requisite CSC421 Human Computer Interface C 2
CSC422 Computer Network / Communication C 3
CSC423 Organization of Programming Language C 3
CSC429 Project C 6 14
Electives
Note: Select minimum of 6 units from these Electives
CSC424 Computational Biology & Interdisplinary Topics E 3
CSC425 Computer System Performance Evaluation E 3
CSC426 Queuing System E 3 CSC427 Distributed Computing System E 3 MIS424 Project Management E 3
6
University Courses
EDS421 Entrepreneurial Development Studies VIII C 1
TMC421 Total Man Concept VIII C 1
TMC422 Total Man Concept – Sports C 0
2 Total (Ω) 22 Total (α + Ω) 45
24
8. COURSE DESCRIPTION
CST 111: Computer Application I (2 Units) (L20: T0: P10) Identification of PC parts and peripheral devices: functions, applications, and how to use them. Safety precautions. Procedure for booting a PC. Filing system: directory, sub-directory, file, path, and how to locate them. Word processing: principle of operation, application, demonstration and practical hand-on exercises in word processing using a popular word processing package. Internet: services available, principle of operation, application, demonstration and hand-on practical exercises on e-mail and www using popular browsers. Schematic diagram of a computer hardware, computer software, understanding computer memory and storage preparing to use the computer, categories of computers, advantages and disadvantages of using computers, caring for your computer, ergonomics, analog and digital signals , modes of data transmission, communication hardware, computer networks, types on network, network topologies, home networking, network architectures, computer and society-e-Learning, e-Government, e-Health , e-Banking, e-Commerce, e-Jury, e-Court, e-Filling. PHY 111 Mechanics and Properties of Matter (2 Units) (L22: T8: P0) Units and dimensions, Scalar and vectors, Particle kinematics, Newtons laws, Friction, Work, Energy, Centre of mass, Simple harmonic motion, Rigid body dynamics, Kepler’s laws, Pressure in fluids, Intermolecular forces, Hooke’s law, Young modulus, Fluid flow Streamline turbulence, Strooke’s law surface tension. MAT 111: Algebra I (3 Units) (L30: T15: P0) Algebra of set theory: Definition of concepts, laws of algebra of sets, Venn diagram and application. Real Number: Rational numbers, theory of surd, sequences and series (including AGP), binomial theorem, theory of quadratic, cubic and quadratic equations, indices and logarithms, mathematical induction, partial fractions, theory of equations, inequalities and polynomials (including factor and remainder theorems). Complex Numbers: Algebra of complex numbers, Argand diagram, multiplication and division of numbers in polar form, nth root of unity, and Demoivre’s theorem, expansion of Sin nØ, Cos nØ, Tan nØ. MAT 112: Trigonometry and Geometry (2 Units)(L22: T8: P0) Trigonometry and analytic geometry in (2-D & 3-D): Elements of trigonometry, circular measure, elementary treatment of circles, coordinate geometry: straight lines in (2B-D); plans. Functions and relations: permutation and algebra of functions, Binary operations, Permutation and combination, elementary treatment of logic. PHY 119: Physics Practical I (1 Unit) (L0: T0: P15) CSC 111: Introduction to Computer Science (3 units) (L30: P45) Definition of computer science. History of computer science and their generations, Computer Hardware: functional components, Modern I/O units. Software: Operating Systems, Application Packages Program: Development; Flowcharts and Algorithms; Program Object; BASIC or VISUAL BASIC Fundamentals.
25
CHM 111 General Physical Chemistry (3 Units) (L35: T10: P0) General Physical Chemistry: Atoms, Dalton’s atomic theory law, atom masses. Fundamental particle of the atom. Atomic structure. Modern electronic, theory of atoms. Periodicity of the elements. Mole of concept, Chemical formulae, equations, and calculations. State of matter: gas liguid, and solid. Engergetics and thermochemistry. Chemistry kinetics, equilibra and electrochemistry. General inorganic Chemistry: periodic table and periodic properties, chemical bonding, structures of solids. The chemistry of selected representative elements. Hybridization. CHM 119: Chemistry Lab. I (1 Unit) (L0: T0: P45) BIO 111: General Biology I (3 Units) (L30: P0: T30) Cell structure and organization, functions of cellular organelles, diversity, characteristics and classification of living things, general reproduction, interrelationship of organisms; heredity and evolution, elements of ecology and types of habitat. CST 121: Computer Application II (2 Units) (L15: T0: P15) Spreadsheet: principle of operation, application, demonstration and practical hand-on exercises in spreadsheet using a popular spreadsheet package. Database Management: principle of operation, application, demonstration and practical hand-on exercises in using a popular relational Database Management package. Report presentation software package: principle of operation, application, demonstration and practical hand-on exercises in using a popular report presentation package such as Power Point package. Mini-Project to test proficiency in use of the software packages. PHY 121: Electricity and Magnetism (3 Units) (L22: T8: P0) Electricity, coulomb’s law, Ohm’s law. Gauss’s theorem, Capacitors, Kirchoffs laws, Electrical energy, DC, Bridges potentiometer, Magnetic effect of current, Electromagnetic induction, Moving coil and ballistic galvanometers, Multimeters, DC and AC motors, and generators, Hysteresis, Power in AC circuits, Semi conductors, Conductivity and Mobility, Rectification. PHY 122: Atomic and Nuclear Physics (2 Units) (L22: T8: P0) Atomic & Nuclear physics: Theory of atomic structure. Thompson, Rutherford and Bohr’s theories, the hydrogen atom. Properties of nucleus, Natural radioactivity, wave particles duality of light, X-rays, Photo-electricity, Thermionic emission, Diode valve. MAT 121: Calculus (3 Units) (L22: T8: P0) Functions of real-variables: Graph, limits, and concepts of continuity. Techniques of differentiation of algebraic and trigonometric functions, higher order derivatives, maxima and minima, Liebnitz rule, application of differentiation. Integration as inverse of differentiation, methods of integration, definite integral. Application to areas, volume, moment of inertia. Approximate integration: Trapezoidal and Simpson’s rule. Taylor’s and Maclaurin’s theorems, partial differentiation and implicit differentiation.
26
MAT 122: Vector Algebra (2 Units) (L22: T8: P0) 3-D Cartesian coordinate systems. Definition and representation of vectors; Algebra of vectors: multiplication of a vector by a scalar, addition of vectors, scalar product of two vectors, vector product of two vectors, direction cosines, calculus of vector function: differentiation of vector function, integration of vector function; conic: circles, parabola, ellipse and hyperbola; kinematics of a Particle: basic concepts, motion under constant acceleration, motion under variable acceleration: rectilinear motion, motion in a plane. Force. PHY 129: Physics Lab. II (1 Units) (L0: T0: P15) Hands on practical for CST122, 123 CSC 121: Introduction to Problem Solving (3 Units) Problem solving strategies, Roles of algorithm in problem solving process, implementation strategies, concepts and properties of algorithm. Using C-language. CSC 211: Computer Programming I (3 Units) (L30: P45) Introduction to problem solving methods and algorithm development, designing, coding, debugging and documenting programmes using techniques of a good programming language style, programming language and programming algorithm development. A widely used programming language should be used in teaching the above. E.g. C/C++ language. CSC 212: Fundamental of Data Structure (3 Units) Primitive types, Arrays, Records, Strings and String processing , Data representation in memory, Stack and Heap allocation, Queues, TREES. Implementation Strategies for stack, queues, trees. Run time Storage management; Pointers and References, Linked structure. CSC 311: Structured Programming: (3Units) Structured Programming elements, structured design principles, abstraction modularity, stepwise refinement, structured design techniques. Teaching of a structured programming language etc. CSC 214: High Performance Computing & Database Management I (3 Units) (L30: T8: P7) Information storage & retrieval, Information management applications, Information capture and representation, analysis & indexing, search, retrieval, Information privacy; integrity, security, efficiency and effectiveness. Introduction to database systems: Components of database systems DBMS functions, Database architecture and data independence use of database query language. Overview of Database Systems: model, schema, instance. Database Systems vs. File Systems. Data abstraction levels, database languages, system architecture. Classification of DBMS. Data modeling: Entity-Relationship(ER) Model, Entities and Entity types, Relationship and Relationship type, Constraints, Weak Entity Types, ER Diagrams. Semantic object model. Process of database design: Requirement analysis, conceptual database design, database schema design. Database design using entity-relationship and semantic object models, database application design.
27
CSC 215: Mathematical Method I (3 Units) (L35: T10: P0) Sequences of real numbers, Monotone sequence, Convergence, Absolute and conditional convergence, Infinite series, Convergence tests, Addition and multiplication of series. Power series, Radius of convergence, Taylor and Maclaurin series and their applications, Taylor polynomials and Taylor's formula, The binomial theorem and binomial series. Matrices and linear transformations, Matrix operations, Solutions of linear systems by matrices, Rank and inverse, eigenvalues and eigenvectors, canonical forms, Jordan form, generalized inverse of a matrix. Complex numbers and their properties, complex numbers as vectors, The complex plane, Complex algebra, Functions of a complex variable. CSC 221: Computer Programming II (3 Units) (L30: T0: P45) Principles of good programming, structured programming concepts, Debugging and testing, string processing, internal searching and sorting, recursion. Use a programming language different from that in CSC 201 e.g C# or VB.net CSC 222: Discrete Structure (3 Units) (L30: P0) Basic Set Theory: Basic definitions, Relations, Equivalence Relations Partition, Ordered Sets. Boolean Algebra & Lattices, Logic, Graph theory: Directed and Undirected graphs, Graph Isomorphism, Basic Graph Theorems, Matrices; Integer and Real matrices, Boolean Matrices med m, Path matrices. Adjacency Vectors/Matrices: Path adjacency matrix, Numerical & Boolean Adjacency matrices. Applications to counting, Discrete Probability Generating Functions. CSC 223: Computer Hardware (3 Units) (L45: P0) Computer circuits; diode arrays, PIAs etc, Integrated circuit fabrication process. Use of MSI, LSI and VLSI IC hardware Design. Primary and secondary memories; core memory, etc. Magnetic devices; disks, tapes, video disks etc. Peripheral devices; printers, CRT’s keyboards, character recognition. Operational amplifiers; Analog-to-Analog computer. CSC 224: Foundations of Sequential and Parallel Programming (3 Units) (L45: P0) The relationships between H/L languages and the Computer Architecture that underlies their implementation: basic machine architecture, assembles specification and translation of P/L Block Structured Languages, parameter passing mechanisms. CSC 225: Operating System II: (3Units) Overview of O/S: Role & Purpose, Functionality Mechanisms to support Client-server models, handheld devices, Design Issues influences of Security, networking, multimedia, Windows. O/S Principle: Structuring methods Abstraction, processes and resources, Concepts of APIS Device organization interrupts. Concurrency: States & State diagrams Structures, Dispatching and Context Switching; interrupts; Concurrent execution; Mutual exclusion problem and some solutions Deadlock; Models and mechanisms (Semaphones, monitors etc.) Producer-Consumer Problems and Synchronization. Multiprocessor issues. Scheduling & Dispatching Memory Management: Overlays, Swapping and Partitions, Paging & Segmentations Placement & replacement policies, working sets and Trashing, Caching.
28
MAT 212 Linear Algebra I (3 Units) (L35: T10: P0) Vector space over real field. Subspaces, linear independence, basis and dimension. Linear transformations and their representation by matrices-range, null space, rank. Singular and non-singular transformation and matrices. Algebra of matrices. MAT 222 Linear Algebra II (3 Units) (L35: T10: P0) Systems of linear equation change of basis, equivalence and similarity. Eigenvalues and eigenvectors. Minimum and characteristic polynomials of a linear transformation (Matrix). Caley-Hamilton theorem. Bilinear and quadratic forms, orthogonal diagonalisation. Canonical forms. CSC 311: Object-Oriented Programming: (3 Units) Basic OOP Concepts: Classes, Objects, inheritance, polymorphism, Data Abstraction, Tools for developing, Compiling, interpreting and debugging, Java Programs, Java Syntax and data objects, operators. Central flow constructs, objects and classes programming, Arrays, methods. Exceptions, Applets and the Abstract, OLE, Persistence, Window Toolkit, Laboratory exercises in an OOP Language. CSC 312: Computer Architecture and Organization (3Units) (L45: P0) Fundamental building blocks, logic expressive immunization, sum of product forms. Register transfer notation, Physical considerations. Data representation, and number bases, Fixed and Floating point systems, representation memory systems organization and architecture. CSC 313: Compiler Construction I: (3Units) Review of compilers assemblers and interpreters, structure and functional aspects of a typical compiler, syntax semantics and pragatics, functional relationship between lexical analysis, expression analysis and code generation. Internal form of course programme. Use of a standard compiler (FORTRAN<COBOL/PL) as a working vehicles. Error detection and recovery. Grammars and Languages: the parsing problem. The scanner. CSC 314: Systems Analysis and Design: (3Units) (L30:P45) System Concept; System Development Life Cycle. Analysis: Fact gathering Techniques, data flow diagrams, Process description data modeling. System Design: Structure Charts, form designs, security, automated Tools for design. System Development Techniques and Methodologies CSC 315: Internet Programming (3Units) (L45:P0) Distributed Computing, Mobile & Wireless computing, Network Security; Client/Server Computing (using the web), Building Web Applications. CSC 316: Theory of Computing ( 3 Units) (L30: T15: P0) Chomsky Hierarchy: Type 0, type 1, type 2 and type 3 grammar. Finite Automata: Deterministic and non-deterministic finite automata; Conversion of non-deterministic finite automata to deterministic finite automata; Regular expressions and their relationships to finite automata. Pushdown Automata and Context-Free Grammars: Deterministic and non-
29
deterministic pushdown automata; Context-free grammars; Useless productions and emptiness test; Ambiguity; Context-free grammars for pushdown automata and vice-versa. Properties of Context-Free Languages: Pumping lemma; Closure properties; Existence of non-context-free languages. Turing Machines, Decidability and Undecidability. CSC 317: Operations Research (3 Units) (L30: T15 P0) Overview of the operation research Modeling approaches. Linear programming model; assumption of linear programming; Simplex method; Two-phase Method; Artificial Variable Technique; Minimization and maximization Two-Phase method. Transportation simplex method: tableau initialization, optimality test, and iteration; Assignment Problems: Formulation and Solution. Directed network; Shortest-path problem: Algorithm for minimum spanning tree problem; Maximum cost flow problem; Minimum cost flow problem; Network simplex method; Project planning and control with PERT-CPM. Deterministic Model; Continuous Review: Economic order quality model (EOQ); Periodic review: Production planning; Stochastic Models: Single Period model; Two-period inventory model; Multi-period model. One-dimensional Search: Golden section search derivations; Taylor series and conditions for local optima; Convex / Concave function and global optimality; Gradient search; Newton's method; Quasi-Network method and BFGS search. Lagrange multipliers method; Karush-Kuhu-Tucker optimality conditions; Penalty and barrier method. CSC 318: Statistical Methods (3 Units) (L30: T15: P0) Review of probability as a measure of uncertainty, sample points and events, combination of events. Binomial, Exponential, Normal, Gamma, Chi-Squared distributions; probability function, mean, variance, and moment generating function. Joint probability distribution and joint probability density function, marginal distribution, expected value, covariance and correlation; Statistical independence; Transformation of variable; Moment and moment generating function; Linear combination of random variable; Multinomial and Normal Bivariate distributions. Sampling distribution of , and S2; Central Limit Theorem; Approximation for discrete distributions; Sampling distribution for t and F. Point Estimation: Bias and unbiased estimator; principle of minimum variance unbiased estimation; Method of moment; Maximum Likelihood estimation. Interval Estimation: Population mean and difference between two population mean using z - distribution and t - distribution; CSC 329: Student Industrial Work Experience (SIWES) Training Scheme (6 Units) During the SITS, each student will undergo a practical on the job training in IT industry approved for its relevance to the student’s major for a minimum of 14 weeks starting immediately after the alpha semester’s examinations at 300 level. A program of training will be drawn by the College and the Industry for each student, and a prescribed log book with daily recording of the student activities is to be kept by each student and appropriately signed. At the end of the program, a written report is to be submitted to the college and each student to present a seminar on his/her industrial experience. Each student must pass a prescribed certification examination during this second industrial training. CSC 411: Survey of Programming Languages (3 Units) (L45: P45) Overview of programming languages: History of programming languages, Brief survey of programming paradigms (Procedural languages, Object-oriented languages, Functional
30
languages, Declarative – non algorithmic languages, Scripting languages), the effects of scale on programming methodology; Language Description: Syntactic Structure (Expression notations, abstract Syntax Tree, Lexical Syntax, Grammars for Expressions, Variants of Grammars), Language Semantics (Informal semantics, overview of formal semantics, Denotation semantics, Axiomatic semantics, Operational semantics); Declarations and types: The concept of types, Declaration models (binding, visibility, scope, and lifetime), overview of type-checking, Garbage collection; Abstraction mechanisms: Parameterization mechanisms (reference vs. value), Activation records and storage management, Type parameters and parameterized types, Modules in programming languages; Object oriented language paradigm; Functional and logic language paradigms. CSC 412: Computational Science and Numerical Methods (3 Units) Operations research, Numerical Computation, Graphical computation, Modeling and simulation, High performance computation. CSC 413: Software Engineering (3 Units)(L45: T15: P0) Software Design: Software architecture, Design Patterns, O.O. analysis & Design, Design for re-use. Using APIS: API programming Class browsers and Related tools, Component based computing. Software tools and Environment: Requirements analysis and design modeling Tools, Testing tools, Tool integration mech. CSC 414: High Performance Computing & Data Management II (3Units) (L30: P45) Rational Databases: Mapping conceptual schema to relational Schema; Database Query Languages (SQL) Concept of Functional dependencies & Multi – value dependencies. Transaction processing; Distributed databases. Text: CJ Date. Terminology in Relational Data Model, Integrity Constraints, Primitive Operations on Relations, Relational Algebra (RA), Relational Algebra Operations, Relational Completeness, Additional Operations on Relations. Foundations of relational implementation. Structured Query Language (SQL): DML Features in SQL, DDL in SQL, Updates in SQL, Views in SQL, Embedded SQL, Query-by-Example (QBE). Concurrency, recovery and security issues. Amstrong’s inference rules and minimum covers, normal forms. Current trends in database systems: Client-Server database systems, Open Database Connectivity (ODBC) standard, Knowledge-Based Systems, Object-Based Systems, data warehousing and data mining concepts, Web databases. CSC 415 Algorithms and Complexity Analysis: (3 Units) Basic algorithmic analysis: Asymptotic analysis of upper and average complexity bounds; standard Complexity Classes Time and space tradeoffs in algorithms analysis recursive algorithms. Algorithmic Strategies: Fundamental computing algorithms: Numerical algorithms, sequential and binary search algorithms; sorting algorithms, Binary Search tress, Hash tables, graphs & its representation.
31
CSC 416: Artificial Intelligence: (3 Units) Introduction to artificial intelligence, understanding natural languages, knowledge representation, expert systems, pattern recognition, the language LISP. CSC 417: Computer Graphics and Visualization (2Units) (L30: P45) Hardware aspect, plotters microfilm, plotters display, graphic tablets light pens, other graphical input aids Facsimile and its problems Refresh display refresh huggers, changing images, light pen interaction. Two and three dimensional transformation, perspective Clipping algorithms. Hidden line removal bolded surface removal. Warmock’s method, shading, data reduction for graphical input. Introduction to had writing and character recognition. Curve synthesis and fitting. Contouring. Ring structures versus doubly linked lists. Hierarchical structures. Data structure: Organization for interactive graphics. CSC 418: Computer Simulations (3Units) (L30: P45) Basic Definitions and Uses, Simulation Process, Some basic statistic Distributions Theory, Model and Simulation. Queues; Basic components, Kendal notation, Queuing rules, Little’s Law, Queuing networks, Special/types of queues. Stochastic Processes; Discrete state and continuous state processes, Markov processes, Birth-Death Processes, Poisson Processes. Random Numbers; types of Random Number Exercises. CSC 421: Human-Computer Interface (HCI) (2Units) (L30: P0) Foundations of HCI, Principles of GUI toolkits; Human-centred software evaluation and development; GUI design and programming. CSC 422: Computer Networks/ Communication (3 Units) (L30: P45) Introduction, wares, Fourier analysis, measure of communication, channel characteristics, transmission media, noise and distortion, modulation and demodulation, multiplexing, TDM FDM and FCM Parallel and serial transmission (synchronous Vs analynchronous). Bus structures and loop systems, computer network Examples and design consideration, data switching principles broadcast techniques, network structure for packet switching, protocols, description of network e.g. ARPANET, etc. CSC 423: Organization of Programming Languages: (3Units) Language definition structure. Data types and structures, Review of basic data types, including lists and tress, control structure and data flow, Run-time consideration, interpretative languages, lexical analysis and parsing. Pre-requisite – CSC 211, 221, 214, 312. CSC 424: Computational Biology & Interdisciplinary Topics (3 Units) (L45: T0: P0) Introduction: Computational approaches in bioinformatics. An overview of artificial neural network algorithms. Graphical Models: Mathematical formalism of graphical models. Graphical models of network architectures. Molecular and cellular structures. Probabilistic graphical models. Gene expressions. Sequence analysis. Computational Modeling: Computational modeling of genetic and biochemical networks. Models of gene activity. Models of interactions among gene products. Computational Models for Analysis: Machine learning approaches. Neural networks, Hidden markov models, belief networks. Model Visualization: Visualizing protein
32
structures. Modeling Kinetics and Physiology. Sequence data visualization. Networks and pathway visualization. CSC 425: Computer System Performance Evaluation (3 Units) Measurement techniques, simulation techniques; techniques, workload characterization, performance evaluation in selection problems, performance evaluation in design problems, evaluation of programme performance. CSC 426 Queuing Systems: (3 Units) Introduction; Birth-death queuing systems; Markovian queues, the queue M/GI bounds, inequalities and approximations. CSC 427: Distributed Computing Systems (3Units) (L30: P45) Introduction: Definitions, Motivation; Communication Mechanisms: Communication Protocols, RPC, RMI, Stream Oriented Communication; Synchronization: Global State, Election, Distributed Mutual Exclusion, Distributed Transactions; Naming: Generic Schemes, DNS, Naming and Localization; Replication and Coherence: Consistency Models And Protocols; Fault Tolerance: Group Communication, Two- And Three-Phase Commit, Check pointing; Security: Access Control, Key Management, Cryptography; Distributed File Systems: NFS, Coda etc. MIS424: Project Management (3Units) (L30: P45) Team Management, Project Scheduling, Software measurement and estimation techniques, Risk analysis, Software quality assurance, Software Configuration Management, Project Management tools. CSC 429: Project (6Units) Students should embark on work that will lead to substantial software development under the supervision of a member of staff.
33
9. LIST OF LABORATORIES
1. Computing Laboratory
Number Size Student Population
Facilities Qty
1 2 3 4 5 6 7 8 9 10 11
400m2 200 Hardware Computer System, Dual-core CPU, 3.20GHz, 2GB RAM, 500GB Hard drive. Printers Lexmark T630 Printer UPS 2 Digital Energy LP series UPS 1 MGE Galaxy 3000 UPS system 1 MGE Comet UPS system Public Address System Server HP Proliant ML350 Server Intel Xeon, 1 Terabyte hard drive E-Board Television Air-conditioning Swivel Chairs Photocopier Xerox Software -Ubuntu Operating system -Window 7 Professional OS -Java Compiler -Visual Studios -C/C++ Compiler -Visual Studio 2008 -MATLAB -Microsoft Office -Sage
2 Printers 1 Lexmark T630 Printer HP Colored LaserJet 1600 (HP LaserJet 1320 under repairs)
2
3 UPS 2 units of 2.2KVA APC 2 units of 3.0KVA APC 1 unit of Dell 4u Rack UPS
5
4 Switches 1 unit DLink 24 Port DE5- 1024D 1 unit Dell PowerEdge 180AS- 8 Port KVM 1 unit Cisco Switch Catalyst 2960
3
5 Server Dell PowerEdge R410 Server 2x Intel Xeon E5507, 4C, 2.26GHz, 4M Cache, 4.80GT/s, 80W TDP, Turbo, HT, DDR3- 800MHz/2x 300GB, SAS 6Gbps, 3.5 –in, 15K RPM, Hard Drive (Hot Plug)/ 24GB Memory for 2 CPUs, DDR3, 1333MHz (6x4GB Dual Ranked RDIMMs)/ 16X DVD+/-RW Drive SATA with SATA cable/ C7 Hot-Swap. T-Net Rack 64ports.
4
6 E-Board 3 7 Air conditioners (2 under repairs) 5 8 Swivel Chairs 35 9 Software
Windows Server 2008 Standard – 5 Cals SUSE Linux Enterprise Server
10 Projector Dell 12105 – DLP
1
11 Refrigerator Heir Thermocool 135A
1
35
10. LABORATORY STAFF Name Rank/Designation/
Date of First Appointment
Qualifications, Dates Obtained Membership of Professional Association
Duties Performed/Course Taught
Mrs Adelaju Oluwatoyin Funmi
Lab Attendant/ 23rd March, 2010
OND, 2004 Care of Lab equipments and assistance to student users
Mr Akunana Stephen Lab Attendant/ 23rd March, 2010
OND, 2009 Care of Lab equipments and assistance to student users
Mr. Adewumi A. Graduate Assistant B.Sc (Computer Sc.) Conducting Students Practicals
Mrs. Oladimeji T. Graduate Assistant B.Sc (Computer Sc.) Conducting Students Practicals
36
11. ACTIVITIES OF THE UNITS Currently, the department has two research clusters, these are:
Bioinformatics Units: this unit is engaged in frontline bioinformatics research with the specific objective of using computational approach to combating the menace of the malaria diseases in Africa.
Software Engineering & Intelligent System Unit: this unit is committed to exploring the intersection and synergy of the broad fields of Software Engineering and Artificial Intelligence for solving real-life problems in the thematic areas of E-Governance, E-Health, E-Tourism, E-Learning, and Mobile Computing.
12. RESEARCH CLUSTERS AND ACCOMPLISHMENTS
The two existing research clusters in the department have been involved in very productive research activities that have culminated in the award of high quality postgraduate degrees at the Master and Doctoral levels, attraction of vital research linkages and collaborations, publication of results in top quality journals and conferences, and patentable products. The activities of these two groups have led to the successful hosting and organisation of the following international conferences and workshops:
The 1st International Workshop on Pattern Discovery in Biology was hosted in the department from 18th – 27th April 2005.
The department also hosted International Conference on New Trends in the Mathematical and Computer Sciences with Application to Real World Problems from June 17th - June 23th 2006.
The 2nd International Workshop on Pattern Discovery in Biology was hosted in the department from 6th – 11th July 2009.
The 1st International Conference and Workshop on Software Engineering and Intelligent Systems (Theme: Towards the Evolution of Smart Systems) from 5th – 9th July 2010.
13. AWARDS AND ACCOMPLISHMENTS
A significant number of our staff have won reputable fellowships with top international institutions to help further their exposure and development. Some of these include:
Covenant University, Senate Research Award, 2004 (=N=498,000.00) Federal Ministry of Education and Research Germany for 1 year study at the
University of Cologne (2006). Microsoft Aspire Programme Award for Doctoral Students (2006). Deutsch Akademiker Austauch Diest (DAAD) aka German Academic Exchange
Service Scholar (2007)
37
CPN Fellowship for Young African Scientists, German Cancer Research Center (DKFZ), Heidelberge, Germany (2007)
Temporary Research Fellowship by Center for Mobile e-Services, University of Zululand, South Africa (2006-2009).
Teaching Fellowship award by University of Heidenheim, Germany (2009). Junior Fulbright Fellowship for Doctoral students, (2010). European Research Consortium for Informatics and Mathematics (ERCIM) ‘Alain
Bensoussan’ Post Doctoral Fellowship Award (2010-2011)
38
14. LINKAGES AND COLLABORATIONS
i) Linkages
The department has succeeded in attracting very useful academic linkages with a number of foreign institutions in its quest to promote research and remain highly resourced in the two main areas of its research focus of Software Engineering and Bioinformatics. The existing linkages are:
S/N Institution Contact
1. University of Zululand, South Africa Prof. Matthew Adigun
2. University of Heidelberg, Germany Prof. Roland Eils
3. German Cancer Research Center, Germany Prof. Roland Eils
4. University of Texas A&M, U.S.A Prof. Nancy Amato
5. VSB-Technical University, Ostrava, Czech Republic Prof. Vaclav Snasel
ii) Research Collaborations
The department is currently in active research collaborations with a number of institutions in the area of Software Engineering and Bioinformatics. The collaborating institutions include:
S/N Institutions Contacts
1. Hebrews University of Jerusalem, Israel Prof Hagai Ginsburg
2. Department of Parasitology, University of Heidelberg, Germany
Prof. Michael Lanzer
3. Bioquamt, at the University of Heidelberg Prof. Roland Eils, Dr. Benedict Brors and Dr. Rainer Koenig
4. DKFZ, Heidelberg, Germany Dr. Lars Kaderali
5. Centre for Mobile E-Services, Department of Computer Science University of Zululand, SA
Prof. Matthew Adigun
6. Faculty of Computer Science and Electrical Engineering, VSB-Technical University, Ostrava, Czech Republic
Prof. Ajith Abraham; Prof. Vaclav Snasel
39
15. COMMUNITY IMPACT
Over the years the department has a good track record of making laudable contributions in the area of community development. The department regularly organises workshops and conferences of international standard geared at enabling forum for sound scholarly interaction and human capacity building for national development.
Specifically, the department has successfully organized and hosted the following international conference and workshop:
The 1st International Workshop on Pattern Discovery in Biology was organised and hosted by the department from 18th – 27th April 2005.
The department also organised and hosted International Conference on New Trends in the Mathematical and Computer Sciences with Application to Real World Problems from 19th – 23rd June 2006.
The 2nd International Workshop on Pattern Discovery in Biology was organised and hosted by the department from 6th – 11th July 2009.
The 1st International Conference and Workshop on Software Engineering and Intelligent Systems (Theme: Towards the Evolution of Smart Systems) was organised and hosted by the department from the 5th – 9th July 2010.
Furthermore, the Department organizes yearly Computer training programme for the staff and students of two (2) schools within its community. They are:
16. FUTURE PATHWAYS The department is committed to pursuing the principles of a World Class Department of Informatics for Sustainable Excellence. Thus, we are committed to:
Recruiting, training, and retaining World Class employees/Students Building and maintaining a robust IT infrastructure Managing projects and portfolios effectively Ensuring partnerships within the IT department and with the business Developing a collaborative relationship with external partners
