These are the Madonna University Computer Science Courses for Hardware, Software and Networking
COURSE CODING AND NUMBERING
CODING
NUMBERING
PROGRAM STRUCTURE
100 LEVEL 1ST SEMESTER
COURSE DESCRIPTION
COMPUTER SCIENCE CORE COURSES
CSC 112: PRINCIPLES OF COMPUTER SCIENCE (3 UNITS)
CSC 122: INTRODUCTION TO COMPUTER SCIENCE (3 UNITS)
CSC 211: COMPUTER PROGRAMMING I (3 UNITS :45 lecture hours and 30 practical hours)
CSC 215: COMPUTER PROGRAMMING II (3 UNITS :45 lecture hours and 45 practical hours)
CSC 213: COMPUTER PROGRAMMING III (3 UNITS)
CSC 231: MANAGEMENT INFORMATION SYSTEM ( 3 UNITS)
CSC 233: COMPUTER APPLICATION (2 UNITS)
CSC 241: INTRODUCTION TO COMPUTER SYSTEMS (2 UNITS)
CSC 218: INTRO. TO OBJECT ORIENTED PROGRAMMING OOP(3 UNITS)
CSC 222: FILE PROCESSING (3UNITS)
CSC 244 INTRO. TO ASSEMBLY LANGUAGE PROGRAMMING (2 UNITS)
CSC 251: NUMERICAL METHOD 1 (2 UNITS)
CSC252: DISCRETE MATHEMATICS FOR COMPUTER SCIENCE (3 CREDITS)
CSC 311 INTRO. TO DIGITAL DESIGN AND MICROPROCESSORS (3 UNITS)
CSC 313: COMPUTER ARCHITECTURE 1 (3 UNITS)
CSC 315 DATA STRUCTURES AND ALGORITHMIC ANALYSIS (3 UNITS)
CSC 317: ADVANCED PROGRAMMING IN C++ (3 UNITS)
CSC 321: OPERATING SYSTEMS OF DISTRIBUTED COMPUTING(3 UNITS)
CSC 335 SYSTEM ANALYSIS AND DESIGN (2 UNITS)
CSC 341 OPERATIONS RESEARCH (2 UNITS)
CSC 332: DATABASE DESIGN AND MANAGEMENT (2 UNITS)
CSC389: RESEARCH METHODOLOGY & TECHNICAL WRITING (2 CREDITS)
CSC 399: INDUSTRIAL TRAINING (10 UNITS)
CSC 411: ORGANIZATION OF PROGRAMMING LANGUAGE (3 UNIT)
CSC 417: COMPUTER SYSTEMS PERFORMANCE EVALUATION MODELS AND SIMULATIONS (2 UNITS)
Queueing network models of computer systems and operational analysis techniques for performance modeling and capacity planning. Mean Value Analysis (MVA) methods for open and closed systems and for multiple jobs classes; Basic probability theory and the use of transform methods for analysis;
Birth-death processes, bn Markov/Semi-Markov processes, queuing theory foundations, queueing analysis of various variants of M/M/1 and M/G/1 systems, and analytical models for systems modeled a closed ndtwork of queues;
System simulation methods based on event-driven as well as process-oriented techniques. Methods for random number generation in simulators and techniques for analyzing simulation data would be studied. The students would develop simulation models using various programming frameworks such as CSIM, JavaSim, and the NS-2 network simulator, use of program execution monitoring tools such as perfmon;
Web server workload characterization and benchmarks for performance analysis of servers. Benchmarks and workload models for Clouds, such as Yahoo Cloud Serving Benchmark (YCSB);
Applications of performance analysis methods would be studied using several case studies, which would include modeling and performance evaluation of Web servers, multi-stage/multi-tier execution models in cluster-based systems, application scheduling and task placement in cluster-based and Cloud based hosting platforms, and communication protocols in network systems.CSC 431: SOFTWARE ENGINEERING I (3 UNITS)
CSC 435: COMPUTER GRAPHICS AND VISUALIZATION(2 UNITS)
CSC 452: NUMERICAL METHODS 11 (2 UNIT)
CSC431: DATABASE DESIGN AND MANAGEMENT II(3 UNITS)
CSC 410: NET COMPUTING AND DATA MINING (2 UNITS)
CSC 426: TECHNICAL & LEGAL ISSUES ON COMPUTER INSTALLATION AND MANAGEMENT (2 UNITS)
CSC 443: COMPUTER ARCHITECTURE 11 (2 UNITS)
CSC 434: ARTIFICIAL INTELLIGENCE/EXPERT SYSTEM (3UNIT)
CSC 442: COMPILER CONSTRUCTION (3 UNITS)
CSC 462: DATA COMMUNICATIONS/NETWORK (2 UNITS)
CSC 489: COMPUTER SCIENCE PROJECT (6 UNITS)
REQUIRED AUXILIARY COURSES
BIOLOGY
BIO 111: GENERAL BIOLOGY I (2 UNITS)
CHEMISTRY
CHM 111 GENERAL CHEMISTRY 1 (2 UNITS)
CHM 131: GENERAL CHEMISTRY II ( 2 UNITS)
CHM 171: BASIC CHEMISTRY PRACTICALS (I UNITS)
CHM122: GENERAL CHEMISTRY III: (3 UNITS)
CHM 172: BASIC CHEMISTRY PRACTICALS II (I UNITS)
PHYSICS
PHY111: GENERAL PHYSICS I (2 UNITS)
PHY 151/152: BASIC PRACTICAL PHYSICS (1 UNITS)
PHY 122: GENERAL PHYSICS II (2 UNITS)
PHY224: ELECTRO MAGNETIC THEORY (3 UNITS)
MATHEMATICS
MTH111: ELEMENTARY MATHEMATICS I (2 UNITS)
MTH124: ELEMENTARY MATHEMATICS II (2 UNITS)
MTH126: ELEMENTARY MATHEMATICS III (2 UNITS)
MTH227: ELEMENTARY DIFFERENTIAL EQUATIONS (2 CREDITS)
MTH231: LINEAR ALGEBRA (2 CREDITS)
STA122: INTRODUCTION TO STATISTICS (3 CREDITS)
STA224: STATISTICS FOR PHYSICAL SCIENCES (3 credits)
COURSES OFFERED TO OTHER DEPARTMENTS
CSC301: COMPUTER STUDIES THEORY AND PRACTICAL (2 CREDITS)
CSC302: COMPUTER APPLICATIONS TO PHARMACY I (2 CREDITS)
CSC304: COMPUTER APPLICATION TO MEDICAL SCIENTIST
CSC305: COMPUTER APPLICATION TO NURSING
DEPARTMENTAL REGULATIONS
a) Teaching Method
b) Role of Instructors
c) Class Attendance
d) Role of Student
e) Guides For Effective Note Taking
Take a close look at note-keeping. Good notes are extremely important!
Learn to take good class notes and improve your note-taking skills
Listen for speaker's organizational structure during lecture
Review class notes each and every day
Take your own notes during lecture
Identify central ideas in textbook passages
Use a system that shows the relationship among the facts rather than a list of facts
Vary the format of taking notes according to the content of the material
Consolidate information taken from several sources into a master set of notes
Consistently update and summarize the information learned
Use abbreviations for long words
Be organized and meticulous in keeping your notesf) Study Skills
Study time must be schedule every day!
Make up a "to-do" list for tomorrow and set priorities.
Realistic study goals must be set each and every day.
Make up a weekly list of things to accomplish
Reward yourself for finishing items on your "to-do" list.
Create your own study area for serious studying.
Class attendance is very important.
Set your purpose before beginning to read or study.
Break time into manageable units to increase productivity.
Keep track, on paper, of the amount of time you've spent studying and what you accomplished.
Pace study to allow adequate time for reviewing and memorizing.
Memorize only after understanding information.
Reinforce information through timely repetition at intervals ranging from the same day to several weeks after.
Practice remembering the information (reciting and writing) without the aid of notes, text, internet notes, or study sheets. Remember, you won't have these during the exam.
Use organized system for learning new vocabulary words.
As you survey a reading selection, formulate questions you will answer as you read. (Who, What, Where, How, Why, Significance).
Form a study group and spend time asking each other questions and "teaching" one another the most important material.g) Test Skills
Predict test questions while studying and be certain you can answer them to ensure you know the material
Read test instructions!
Read questions carefully and identify key terms
Attempt to define key terms in a question before working through the question
Determine the intent of the test question without over-interpretation
Use a problem-solving strategy rather than guessing when uncertain of an answer
Apply consistent logic to answer choice within a test questionh) Laboratory Preparations
The general laboratory with 40 modern computers and a digital projector
The Research laboratory with 40 modern computers and a digital projector
The architectural (hardware) laboratory with different computing devices (new and old)
The network laboratory with over 60 computer systems
Three alphabet letters and three numerals shall be used for coding of courses. The following combination of letters will be used to denote the courses in the computer science department;
CSC= Computer Science (Core Course)
MTH= Mathematics (Required Course)
PHY= Physics (Required Course)
BIO= Biology (Required Course)
CHM= Chemistry (Required Course)
STA= Statistics (Required Course)
GST=General Studies (University Requirement)
The Numbers attached to each letter coding will have the following significance
a). First Digit indicate the level offering the course (!00 level, 200 level, 300 level, 400 level, 500 level, etc.)
b). The second digit indicates the area of concentration
0: Courses for a departments other than computer science
1: Programming
2:Hardware
3:Software
4:Principles of Design
5:Principles of Computations
6:Communications
c). The last digit will represent the semester with Odd number representing first semester and Even numbers representing second semester.
100 LEVEL 2ND SEMESTER
200 LEVEL 1ST SEMESTER
200 LEVEL 2ND SEMESTER
300 LEVEL 1ST SEMESTER
300 LEVEL 2ND SEMESTER
400 LEVEL 1ST SEMESTER
ELECTIVES
400 LEVEL 2ND SEMESTER
CSC101:HANDS-ON-COMPUTER (1 UNIT)
This course is totally practically oriented to encourage the student in a carrier in computer science. The course allow the student to spent at least 2 hours each week on the computer laboratory to learn typing, playing games, running simple simulation programs, moving around the computer.
The history of computer science; The relationship between computer science and other sciences; The role of a computer Scientist; Terminology in computer science; Specialized branches of computer science (E.g Cognition science, Computer Vision; Robotic science, etc.), Computer societies. Problem solving strategies; Role and concept of Algorithms in problem solving process; implementation strategies; Basic Notion of writing a workable a Computer program in BASIC or VBasic
The History of the origin of the computer, classification: Analog, Digital and Hybrid.
Types of Digital computers: mainframe, mini and microcomputer models of digital computers, The generation of computer types, the meaning of a programme and a "job". Computer Hardware; Functional Components, Modern I/O units. Computer Software: Operating Systems, Application Packages. The two levels of computer languages: The high-level and low-level Languages. Program development: flow charts. Data processing and data processing centers. Criteria for using a computer. Type of computer users' interface. Introduction of the internet.
A review of binary, octal, decimal, and Hexadecimal number systems. The basic logic operation: AND, NAND, OR NOR and OXR; Problem solving flowchart. An introduction to general purpose high-level language. Variables, Constance, Operators and expressions. Looping and transfer of control. Arrays and subscripted variables. Function and subroutines: (A high level language is required e.g. BASIC, PASCAL, FORTRAN).
Pre-requisite: CSC122, CSC112
Problem solving methods and algorithm development, designing, coding, debugging and documenting programs using techniques of a good programming languages style; programming algorithm development. Data types, character types, strings. Boolean types and variable control statement to define data, reserved words and variable names. Self Documentary codes, Comments, Input and Output statements, Print Statements, re-statement and data statement, Input and output to files (The high level language must be different from that used in CSC 211). Good program design style and expression, Debugging and testing large programs (with special note on variables, constants, operations and expressions, looping and transfer of control using list, arrays, and subscripted variables) Selection of a particular high level language such not be restricted to those already taught)
Pre-requisite: CSC122, CSC112
Functions and subroutines programming exercises. The selection of specific high-level languages would not e restricted to those given as examples above but will always be motivated by current requirements in industry. The language used here is different from the language used in CSC211. Preference is given to FORTRAN95 OR C programming language.
This course comprises of introduction/definition; management framework, management hierarchy, analysis and designing information system, concepts, planning for systems development, objectives of system plan, stages in the system life cycle, Need for change. Techniques of gathering analysis and design data File/File processing Systems, information communication, the attributes of information, attributes of a set of information, data/information, information transmission, sources of information. Practical: MIS and applied to following areas– payroll, order processing, office automation, management Document security, stock control, production control, labor control, network analysis. Application of computer in modern business management such as internet, e-commerce, e-business, etc.
Pre-requisite: CSC122,CSC112 (Lecture45hs,
This course emphasizes the use of various application packages in the market. Application packages differentiate among system software, software program, generators and application packages, modes of acquisition in-house, purchase, and lease.
Criteria for package acceptability, good documentation, user-friendly, efficiency, appropriateness. List various types of packages and examples; word processing, DBMS, spreadsheet should be studied e.g Microsoft Excel and students should be efficient in using Excel or any other spreadsheets
Students should be able to work with D-base
Creation of a database.
Students should be taught how to capture data in D-base
A complete structure Of DBMS should be reviewed and students should master these structures.
Students should be made to know the vital role computer plays in all aspects or human endeavor.
Pre-requisite: CSC122,CSC112
This course is both practical and theory.
Historical Background, Computer structure and assembling, Architectural developments and styles, Technological developments, Introduction to performance measures, Introduction to Machine and assembly languages, Introduction to computer arithmetic (complements arithmetic). Computer circuits,: Diode arrays, PIAs, Integrated circuits fabrication process, Use of MSI, LSI and VLSI IC hardware design. Primary and Seconday memories: Peripheral devices, printers, CRT, keyboards, character recognition. Operational Amplifiers: Analog to digital and Ditital to Analog converters.
Pre-requisite: CSC122,CSC112
This courses covers the basics of object oriented programming. Introduction to problem solving methods and algorithm development, designing, coding, debugging and documenting programs using techniques of a good programming language style; computer organization; programming algorithm development. Data types, character types, strings, Boolean types and variable names. Others are input and output statements print, input, re-statements and data statements.
Pre-requisite: (CSC211 or CSC215) and CSC213
The objectives if these course are:
(a) To introduce concepts and techniques of structuring data on bulk storage devices;
(b) To provide experience in the use of bulk storage device:
(c ) To provide the function for applications of file processing.
TOPICS COVERED INCLUDE:
File processing environment: Definition 0f records, file blocking, compacting and database sequential access: physical characteristics of sequential media (tape, cards etc.). external sort/merge algorithms, file manipulation techniques for updating, deleting and inserting records in sequential file.
Random access physical characteristics of disk/drum and other bulk storage devices, algorithm and techniques for implementing invented list, multilist, index sequential and hierarchical structures.
File input/output file control systems and utility routines, 11 specification statements for allocating space and cataloging files.
Pre-requisite: CSC231 and CSC233
225: INTRODUCTION TO OPERATING SYSTEM AND FILE PROCESSING (3unit)
Overview of O/S: Role and purpose, Functionality Mechanisms to support Client Server models, hand-herd devices, Design issues influences of security, networking, multimedia, Windows. File Storage and retrieval, File manipulation techniques, Indexing, File merge. Random access physical characteristics of disk/drum and other bulk storage devices, algorithm and techniques for implementing invented list, multilist, index sequential and hierarchical structures. File input/output file control systems and utility routines, 11 specification statements for allocating space and cataloging files.
CSC 227: GENERAL COMPUTER HARDWARE LABORATORY
This course teaches the basics of computer assembling and cloning in the hardware laboratory. Students are expected to clone their own systems with desired specifications. Both desktops and laptops cloning will the done in the laboratory. All classes shall take place in the hardware laboratory. After this course students are expected to start servicing computers of other students from other departments.
CSC 234:FUNDAMENTALS OF DATA STRUCTURES
Primitive types; Arrays; Records; Strings and string processing; Data representation in memory; Stack and heap allocation; Queues; TREES, Implementation strategies of Stacks, Queue and trees;
Assembly language programming: 8-bit (or 32-bit) processors (example INTEL 8088/8086, E80). Specific areas covered include general machine structure, instruction set, addressing modes and structured microcomputer programming.
Pre-requisite: CSC213 and CSC241
Number systems and errors: representation of integers. Function: floating point arithmetic; error propagation. Solution of non-linear equations:Bisection, Secant, Newton, iteration, etc.. Matrices and systems of linear equation: Gaussian elimination, triangularization methods. Interpolation and approximation: differentiation and integration.
Pre-requisite:CSC215, MTH231 and MTH227
Propositions, propositional logic and proofs; • Mathematical induction, recursion; • The stable marriage problem; • Modular arithmetic; • Polynomials and their applications: error-correcting codes, secret sharing; • Diagonalization, self-reference, and uncomputability; • Probability and probabilistic algorithms: load balancing, hashing, expectation, variance, Chebyshev and Chernoff bounds, conditional probability, Bayesian inference, law of large numbers,Recursive sequence and implementation algorithms, Nth terms of recursive sequences, Differencing; first, second and higher order differences, Difference equations, Relations and mappings, Discretization of sets and functions.
Pre-requisite:CSC215, MTH231 and MTH227
CSC262:INTRODUCTION TO INFORMATIOIN SECURITY (2 units)
Overview of information technology, IT tools, Benefits and Problems Associated with IT and IT tools. Security bridging: Internal and external security, Methods of security bridging. Methods of controlling and maintaining security (internal and external). Security cracking and security controlling software. Protocol layers and security protocols. Intranets and extranets. Mobile computing. Electronic commerce. Security architectures in open-network environments. Cryptographic security protocols. Threats, attacks, and vulnerabilities. Security services: confidentiality; authentication; integrity; access control; non-repudiation; availability. Security mechanisms: encryption; data-integrity mechanisms; digital signatures; keyed hashes; access-control mechanisms; challenge-response authentication; traffic padding; routing control; notarization. Key-management principles. Distributed and embedded firewalls. Security zones
The objectives of this course are to introduce the organization and structuring of the major hardware components of computers and to understand the machines of information transfer and control within a digital computer system.
Topics covered include: Present the various binary systems suitable for representing information in digital systems.
Introduce logic gates and basic concepts for designing gate circuits, Boolean algebra, Karnough maps and map simplification techniques.
Combinational circuit analysis and design.
Sequential circuit concepts and design.
Hardware implementation and block and sequencing of instruction fetch, address construction, and instruction execution data flow and control, block diagram of a simple microprocessor. Concept of micro program and analog with control, interrupts, modes of communication with processors, study of an actual simple minicomputer of microcomputer systems.
Pre-requisite:CSC224; PHY222
Data representation;-Fixed, and Floating points, Number systems, integer arithmetic, floating point arithmetic, , instruction set architecture, architecture of processing units;-CPU, register set, Datapath, CPU instruction cycle, control unit.
Pre-requisite:CSC224; PHY222
linear structures and list structures; Arrays; Records; Pointers, Abstract Data Structures; Linked List, Stacks, Queues, Tree structures, Graph, Set and relation, Sequence. Each of these structures will be implemented practically using Pascal, Fortran, C or C++ programming language.
Students are expected to compare various algorithm and calculate the order of an algorithm. Asymptotic analysis of upper and average complexity bounds: standard complexity classes in time and space. Emphasis will be on the following topics: Big-O and Big-Omega Notations, Recurrence relations, Iterative algorithms, Recursive algorithms, Search Algorithms, Sort algorithms, Greedy algorithms, Optimal search tree, Profilers, string processing, deficiency of algorithm.
Pre-requisite:CSC315
Introduction to problem solving methods and algorithm development, designing, coding, debugging and documenting programs using techniques of a good programming language style: computer organization programming algorithm development. Data types, character types, string, Boolean types and variable control statement to define data, reserved words and variable names. Others are input and output statements print, input, re-statement and data statement.
Pre-requisite:CSC202
Introduction to processes, management, memory management, multiprogramming concepts and requirements. Multiprocessing systems. Other related issues based on semaphore and monitor concepts. Issues in analyzing and designing operating systems, memory management, memory protection and resource allocation, overlays, swapping and partitions, paging and segmentations placement and replacement policies, working sets and trashing, caching. Operating systems of distributed computing: motivations; Communication mechanism: communication protocols, RPC, RMI, stream oriented communication; Synchronization:Global state, election, distributed mutual exclusion, dictributed 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 point; Distributed file systems: NFS, Coda etc.: Characteristics of distributed computer real time operation systems.
Pre-requisite:CSC222
Techniques for the analysis of existing systems using methods like interview, old records, observation, sampling, preparation of system flowcharts, definition of new system requirements and design of new systems. Input design, forms designs, code design. Facts Recording;- Requirements documents, Requirements Specification documents, System analysis project (Students will undertake a project along side this course)
Pre-requisite:CSC211 and CSC222
Linear programming, application to product mix, resource allocation and transportation. Deterministic inventory control, Critical path analysis, probabilistic inventory problems and maintenance, decision making criteria and decision trees. Technology forecasting, dynamic programming, computer aided management, group and individual programming exercise.
Pre-requisite:MTH122, STA224 and MTH124
Database management system: review of basic concepts; functions and components for DBMS. Information storage and retrieval, Information management applications, information capture and representation, analysis and indexing, File design and access path: feature directions in DBMS: Programming and application in a D-base environment. A specific database should be uses: SQL, MsAcess and Oracle should be compared. Database project (Students are expected to carry out a database project)
Pre-requisite: CSC315, CSC321 and CSC335
Types of research; Methods of data collection; Methods of data recording; Methods of data analysis; Methods of system evaluation; IT report writing; Seminar report writing; Project report guidelines; Chapters and Chapters-heading selection; Formating a report; Citation and Referencing
Pre-requisite:GST121 and GST122
CSC 389: SEMINAR IN COMPUTER SCIENCE (6 Units)
Students during their industrial training will be given topics to carry out a research and present their findings in an academic seminar. All topics will be chosen from the main subject areas of computer science. All findings must include but not limited to software and hardware principles as applied to the topic.
Six-month industrial training period in two semester-three months each this is industrial training period begins immediately after 2nd year and extends to the 1st semester of 3rd year of the 4th year academic program. Students work schedule during this period is as follows:
Familiarization with routine operation in the industry (1 week ); Practical considerations of single phase and three-phase power supplies(1 week ); Safety precautions( week); Wiring and Assembly of Electronic Equipement including computers and computer related products (1week); Systematic approach to hardware and software fault-tracing(1 week); Preventive maintenance of hardware( weeks); Quality control standard and monitoring procedure(1 week); Testing and integration of computer application programs(2 weeks); Software maintenance duties(2 weeks); General review and report writing(1 week).
This course consists of language definition. Classification of programming languages (Imperative and Declarative). Standardization of programming languages. Genealogy of programming languages (Time line). Structure of Programming Languages: Editor, Compiler, Debugger, Interpreter, Linker, Loader. Comparison of Control Flows (control structures and data flow) in different programming languages. Run-time consideration. Interpretative languages. Programming language design models.
Pre-requisite:CSC317, CSC315
This course covers measurement techniques; simulation techniques; analytic techniques; statistical measurements; Work load based characterization; performance evaluation in design problems; evaluation of program performance; evaluation of systems; Experimental Designs; System Turning; Efficiency and Amdahi's law; the language LISP and pattern recognition. Concepts and techniques used in modeling and simulation methodology and a suitable simulation language; modeling; generation of random variables, transformation of random number, parameter, estimation, experimental design, factorial design optimization Evaluation project exercise: Student will undertake an actual evaluation assignment project in groups. Models for consideration include;
Pre-requisite:CSC241, STA224
This course introduces Engineering principles applied to Software. Principles of software design, Software Job scheduling, Team work Management, Software Authenticity and legal rights, Software Processes re-engineering. Software Engineering project management: team management, project scheduling, software measurement and estimation techniques, risk analysis, software quality assurance, software configuration management. Software evaluation: human centered software evaluation and development, GUI design and Programming. Software project management tool kits, GUI toolkits. Student group project (A maximum of 3 students per project will work together to develop a software simple and effective software).
Pre-requisite:CSC335 and CSC317
Review of the Cathode Ray Tube (CRT) and point plotting displays, computer control of pointing displays, vector generation-dot, lines line length estimate digital and analog methods.
Display processor: Controlling a vector-draw display channels and display processors, character generators. Display file compilers: Display code generation, graphical functions. The viewing algorithm, segmented display files, free, storage allocations display subroutines; graphical data structures; 2-Dimensional transformations: The need for transformation, concatenation, matrix representation. Clipping and windowing: Clipping, Viewpoint, windows and instances.
Transformations Systems: Adding transformation to display compiler. The transformation of sub pictures, pseudo display files, transformation display file procedures, practical programming exercise to test understanding of the subject matter.
Some of this topic can be treated as well:
Graphical input Devices: Pointing and positioning devices, tablets, the light pen, comparators,
Interrupt Handling: Device handling, Interrupts, attention queue and task schedulers, interrupt from graphical input devices and their handling.
Interactive Graphical Techniques: A compendium of graphical input techniques, position in line specification by end-point positions scales, guidelines, and constrains to drawing and positioning, dragging, subbed and lines, dimensions and graphical potentiometer, pointing, light buttons and menus, inking, no-line character recognition.
3-Dimensional graphics: 3-D transformations, generating a wire-frame perspective display, worked examples, perspective depth and hidden-line elimination. Command languages, and dialogues, Features and definitions of command languages, control-oriented languages, and language processor designs. The of interactive languages. Brief review of programming la nguages for computer graphics, system selection.
Pre-requisite: CSC335 and CSC321
CSC441:HUMAN COMPUTER INTERFACE
History and Foundations of HCI, Architecture of input/output devices, Principles of GUI, GUI toolkits; Human-centred software evaluation and development; Principles of Display design, The power of HCI, GUI design and programming, Algorithmic design and complexities for HCI design and implementation ( some recent algorithms applied to Brain Computer Interface, Gesture recognition interface etc.) Validating HCI. Some Advanced (recent) HCI e.g BCI should be studied in details.
Floating-point arithmetic, use of mathematical sub-routine pack, interpolation; approximation, Error analysis, Numerical integration and differentiation, Numerical solution of ordinary differential equations. Solution of differential equations, Boundary-value problems in ordinary differential equations.
Pre-requisite:CSC352
Theoretical and Practical Knowledge of database design and management is necessary for all graduates of computer science in this course. Relationships (mapping conceptual schema to relational schema), concepts of functional and multi-valued dependencies, transaction processing, distributed databases, database languages (SQL). Entity relationship models (All students will present a seminar on the design and management of a particular enterprising database which they may further in the construction of a management system).
Distributed computing, Mobile and wireless computing, Systematics study of the web, its features and Services. Cloud and Grid computing. The Web is the largest technological artefact in existence, comprising a global network of information sites and services. The objective of the course is to introduce the students to recent developments of the computer and the Web. Rudiments of web site designs; Architecture of web-based learning, Web Archiving, Web crimes and Control, Cloud Computing, Grid computing. Data Mining concepts; PHP and Java Scrpts
Pre-requisite:CSC411 and CSC419
This course is a practical hand-on training-on training on computer installation and maintenance. Topic covered (1) requirements and service clearances, temperature, dust and humility control techniques. Factors affecting sitting and installation of computer equipments power supply requirements (single phrase three phrase etc) uninterruptible power supplies and elimination of floor vibration in computer rooms preliminary checks prior to start up of an inactive computer system, start-up procedures, uses of maintenance aids in a computer environment.
Aims and used of specification as they apply to computer peripherals and the application of tolerance levels to ascertain specifications. Disassembling, repairing and re-assembling of peripherals and interfaces: cards readers, card punches, tape divers, line printers, graph plotters, disk drives, terminals and work stations. Serving of video display units' moderns, and Teleprompters. Interconnecting sketches and diagrams to depict the way the units of a computer system are to be assembled. Installation procedures for mainframe. Minis and micros. Preventive maintenance techniques: identification and elimination of nose digital hardware routine power line cheeks. Corrosion prevention and correction computer systems. Information technology laws; Ethics in Computer science: User and professional ethics (student group project)
Pre-requisite:CSC321 and CSC417
This course exposes students on system; general characteristics of memory operation. Memory System, Memory addressing, memory hierarchy, virtual memory, control systems, hardware control, micro programmed control. Asynchrous control, 1/0 controls. Introduction to the methodology of fault-tolerant computing.
Instruction set, memory management and hierarchy, input/output and buses, pipelining techniques, branch prediction, RISC architectures, VLIW architectures and specific compiling techniques, superscalar architectures, out of order execution, parallel architectures and multiprocessors.
Pre-requisite:CSC313 and CSC417
Introduction to artificial intelligence: Understanding natural language, knowledge representation, expert system, pattern recognition, the language LIST. What is expert system?. Basic concepts for building expert system; Architecture of expert systems; constructing of expert system: Tools for building expert system, reasoning about reasoning, evaluation of expert system: languages and tools knowledge engineering.
Pre-requisite:CSC419
Phases of a compiler; Processes of compilation; Tombstone representations; Regular expressions, Finite automata; Introduction to Formal languages; Ambiguous grammar, Operator precedence, higher order proceed bounded context transition matrices. The language using P1, calling semantic routines case studies. Error Recover: Recovery from semantic errors, recovery from syntactic error. Code generation: Generating code or simple arithmetic expressions, addressing operands, extending code generation to other quadruple types. Compaction code generation object modules. Code optimization.
Pre-requisite:CSC411, CSC414, CSC313 and CSC445
Introduction wares, Fourier analysis, measure of communication, channel characteristics, transmission media. Noise, noise and distortion, modulation and demodulation and demodulation, multiplexing TDM, FDM, and FCM. Parallel and serial transmission (synchronous vs asynchronous). Bus structure and loop system, computer network, example and design consideration, data switching principles, broadcast techniques, network structure for packet switching, protocols, description of network, example ARPANET, DSC.
Pre-requisite:CSC313
Each final year (fourth) student is expected to work on a topic approved by his/her supervisor or H.O.D. computer science the project report most show the students understanding/familiarity of the area covered by the topic and must include appropriate computer programme (s) with output/results.
Embryology: gametogenesis, fertilization and cleavage as demonstrated by Amphioxus,
Genetics: The cell and distribution of genetic material mitosis, meiosis, inheritance, sex determination and sex related inheritance.
Histology: cells, tissues, organ formation and main features. Physiology: functioning of mammalian skin, muscles/skeleton, alimentary system/nutritional requirements and deficiencies (2 Lectures, 1 practical/week).
Atomic Structure and periodic table. Development of Configuration of Elements. Stoichiometry and mole concept. Electronic theory of atoms and valency. Chemical bonding. Formular and IUPAC basic nomenclature of compounds, Radioactivity and its application. Phase equilibrium, study of one and two components systems.
Structure of solids. Kenetic theory of gases and gas laws. Colligative properties of dilute solutions. Raoult's law, Henry's law and molecular waight determination. Thermochemistry and Hess's law. Chemical equilibrium. Law of mass action, reaction rate and chemical energetics. Electrochemistry, Ionic equilibria. Theory of acids, bases and indicators.
The theory and practice of simple volumetric and qualitative analysis. Simple organic preparations, reaction of functional groups and physical determinations.
Historical survey of the development and importance of organic chemistry, IUPAC nomenclature and classification of organic compounds. Homologous series. Elemental analysis and molecular formular. Structural isomerism, isolation and purification methods, concept of fuctional group resonance and aromaticity.
Electronic theory in organic chemistry. (brief) saturated and unsaturated hydrocarbons, cyclichydrocarbons, alcohols alkylhalides, ethers, aldehydes and ketones, carboxylic acids, amines and aromatic compounds, comparison of phenols with alcohols, photochemical reactions and basic electrochemistry.
More on theory and practice of simple volumetric and qualitative analysis. Simple organic preparations, reaction of functional groups and physical determinations.
Mechanics and properties of Matter
Scalars and vectors: Addition and resolution of vectors. Rectilinear motion and Newton's law of motion. Inertial mass and gravitational mass: free fall; projectile motion: deflecting forces and circular motion. Newton's law of gravitation; satellites, escape velocity. Gravitational potential ; potential well; special case of circular motion. Momentum and the conservation of a momentum. Work, power energy for a gravitational field and elastic bodies.
Thermal Physics And Properties of Matters:
Temperature, heat, work, heat capacities; second law, Carnot cycle, thermodynamic ideal gas temperature scale. Thermal conductivity, radiation, black body and energy spectrum, Stelan's law.
Kinetic model of gas: Equation of state, concept of diffusion mean free path, molecular speeds. Avogadro's number, behaviour of real gases.
A model for a solid; Crystalline structure; Model for matter Inter-particle forces in solids, liquids and gases.
This laboratory bases course emphasize qualitative measurement, the treatment of measurement and graphical analysis. A variety of experimental techniques will be employed. The experiments include studies of maters, the oscilloscope, mechanical systems, electrical and mechanical resonant systems, light, heat, viscosity, etc. covered in PHY 111 and PHY122.
ELECTROMAGNETISM AND MODERN PHYSICS
This course covers electrostatics induction, Coulomb law, Gauss law, electric field; electrostatic potential, capacitance, dielectric, electric current, circuits, analysis, alternating current, electromagnetic waves, particle duality, the Bohr theory of the hydrogen atom, nuclear properties, radioactive decay, nuclear fission and fusion; elementary particles theory.
This course covers DC circuits; Kirchoff's Laws, Sources of EMF and current; network Analysis and circuits theorems. AC circuits, Inductnace, capacitance, the transformer, sinusoidal wave-forms, RMS and peak values, power, impedance and admittance, series RLC circuit, Q-factor, Resonance, Circuit filters. Semiconductors, bipolar transistors, Characteristics and equivalent circuits; amplifiers, feedback and oscilloscope.
Pre-requisite:PHY122
Real number system: simple definitions of integrals, rational and irrational numbers. The principle of mathematical induction. Real sequences and series: elementary notion of convergence of geometry, arithmetic and other simple series. Theory of quadratic equations.
Simple inequalities: absolutes values and the triangle inequality.
Identities, partial fraction.
Sets and subsets: union, intersection, compliments. Properties of some binary operations of sets: distributive, closure, associative, commutative laws with examples. Relations in a set: equivalence relation. Properties of set functions and inverse set functions.
Permutations and combinations. Binomial theorems of any index.
Circular measures, trigonometric function of angles of any magnitudes. Addition and factor formulae.
Complex numbers: algebra of complex numbers, the Argand diagram, De Moivre's theorem, n-th root of unity.
This course is a continuation of the course MTH111. The main areas to be covered include; Axioms of real numbers, Absolute values, Real values functions, Properties, Domain of function, Limit of functions, Continuity, Differentiability, Integreability. The abstract definitions of these concepts should be stated; prove of limit existence theorems, finding limits of functions, proving continuity of functions, differentiating and integrating functions. Techniques of limit, differentiation and integration.
This course consist of geometric representation of vectors in 1, 2 and 3 dimensions, components direction cosines; addition of scalar, multiplication of vectors; linear independents, scalar and vector products of two vectors, Vector equation of a line, plane and sphere; Vector valued functions, Domain, Limit, Continuity, Differentiation and Integration of vectors with respect to scalar variables,; straight lines, circles, parabolas, ellipse, hyperbolas. Tangent and normals, kinematics of particles. Component velocity and acceleration of moving particles on a plane, force and momentum, newton's laws of motion; motion of simple pendulum, impulse and change of momentum, impact of two smooth elastic spheres. Direct and oblique impacts, Arc length, Moment of Initial and Center of mass
Notion of differential equations, Classification, Origin of differential equations, Primitives, Existence and uniqueness of solution of differential equation: (No prove is required of theorems). Solving first order differential equations, Solving second order differential equations with constant coefficients. Solving systems of first order differential equations.
Complex Numbers; Geometric representation of vectors in 3-dimensions, Components direction cosines; Lines and Planes; Linear Subspace Space; Vector Space; linear independents vectors; Linear transformation and matrices of linear transformation; Systems of linear equations;
Pre-requisite:MTH122 and MTH124
MTH222:MATHEMATICAL ANALYSIS
Real value functions of real variable, review of differentiation and integration; applications of differentiation and integration, mean value theorem, taylor series, real-valued functions of two or three variables, partial derivatives, chain rule, extrama, langrange multipliers, increments, differentials and linear approximations. Evaluation of line integrals, multiple integrals.
This consist of combinatorial analysis. Probability models for the study of random phenomena in finite sample spaces. Probability distributions of discrete and continous random variables. Expectations and moments generating functions. Cebyshev's inequality. Bivariate marginal conditional distribution and moments. Convolution of two distributions, the central limit theorem and its uses.
Elements of probability and probability distribution; Normal binomial, poison. Geometric, negative binomial distribution. Estimation and tests of hypotheses concerning the parameters of distributions. Regression, Correlation, and Analysis of variance. Contingency tables. Non-parametric inference.
Overview of Information and Communication technology and their application in contemporary society; Computer Types (Main frame, Mini, Macro computers) Hardware and software; Input devices, Output devices, Computer system; Computer Internal Components; Computer performance; Computer Software; Operating Systems, Software drivers
Application software (word processing) Graphical software; Database management system (Access), Pharmacy Accounting Management systems, Point of sale systems, Airline reservation systems.
Application software (word processing) Graphical software; Database management system (Access), Medical laboratory systems (Hardware and software and their manufacturers). Medical
Application software (word processing) Graphical software; Database management system (Access), Nursing information systems (Hardware and software).
CSC401:COMPUTER APPLICATION TO PHARMACY II
Banking and financial management systems, Networking and Internet, Analysis of data using statistical packages, Online and offline drug information systems,
CSC303: COMPUTER APPLICATION TO MEDICAL LABORATORY SCIENCES
Introduction to software and Management information systems, clinical information systems, laboratory diagnostics systems, information transmission in a distributed system.
Lectures are combined with a novel pedagogic technique that involves formal and informal cooperative learning in which students play major roles. Encouraged emphasis are made in concept and reasoning. Questions and discussion are stressed during the lecture time.
The instructor is responsible for all materials in the lectures and is committed to providing students with an excellent and challenging course. Students who have problems in understanding the lectures or getting difficulties in preparing for exams/test should contact the lecturer right away and not at the end of the semester. The lecturers will encourage students but not force them to remain in class even if he is failing. They will use different pedagogic approaches to make sure majority of the students have understood the lecture. No lecturer will give a make up test for students without justifiable reasons for not being in class.
Attendance at lectures is imperative for students to understand the material covered in each course. Lecturers expect that students attending their lectures should focus their entire attention upon the lecture. As usual, disruptive students will be asked to leave class. Regular attendance in class is an important factor that will increase the probability that students will [a] develop a better understanding of the material, [b] be able to demonstrate that understanding on exams and [c] earn a higher grade in class. Students should note that examinations may include materials, covered in lectures that are not in the textbook or class notes. Students who failed to attend classes are not allowed to disturb lecturers with questions in concepts that were explained during the missed lectures. Attendance in class, motivation and good preparation for exams are the key factors toward succeeding in the Department of Biochemistry. Students are advised to make serious effort to attend to class particularly those getting low grades. However, students who do not study or attend classes should not complain to anybody for low scores. No student should ever go to a lecturer's office at the end of the courses asking for higher scores. Such act will tantamount to examination malpractice. Both the lecturer and student shall face the consequence for such act. If a student intends to graduate with his batch, he should always read the course syllabus carefully prepare well and plan accordingly.
The Faculty of Science lecture timetable provides time and venue for different lecturers in the various departments. A class always starts and finish on time. Students are advised to make every effort to enter the class before the lecturer in order not to distract other student's attention.
Please do not leave the lecture hall without the consent of the lecturer. Lecturers shall only permit students who fall ill or have some other unavoidable circumstances to leave the hall. Students, who have appointments with any school authority such that they need to leave early, should kindly inform the lecturer of such matters before the commencement of the class. Such students should sit in a seat at the back of the classroom. When leaving the class, such students should minimize distracting others.
Students should be considerate of their fellow students and the lecturer by making every effort not to cause unnecessary noise. Students are expected to make comments and ask reasonable questions in class. Lecturers will always endeavor to address them as they are raised. Food and beverages are not allowed to be consumed in class. However, students who have difficulty or disability that requires recording of lectures must get approval from the lecturer. All cellular phones and beepers should be switched off during classes. Social conversations are not allowed in class.
With time, concentration, and some effort it is easy to get good grades.
Don't fall behind! Talk to your professor, go for
For best performance of laboratory exercises and best understanding of the materials, students should approach the exercises in an organized fashion. This includes reading each exercise and writing laboratory preparation report on what they are going to do during class before going to the laboratory. Such reports should include background materials as well as a statement of the objective or purpose of the exercise.
Laboratory Notebook
Students are expected to maintain an up to date notebook of all laboratory exercises. Such note books should use the same format as the laboratory report, but are not expected to be vigorous. However, for convenience and in order to maintain good records, the laboratory note book has been incorporated into the manual. Laboratory exercises should be integrated into the note book, and should be supplemented to maintain a full record of your activities in the laboratory, as well as the results you obtain, the interpretations and conclusions made from them.
Laboratory Reports
Students shall be required to generate five formal laboratory reports during the semester. Exercises to be based on shall be listed in each laboratory outline. Each report should have a name, be well integrated and follow the format specify by the subject master. Generally laboratory reports in biological sciences are organized as follows:
1. Introduction
a) Background: What are the scientific bases of the approach or techniques used- how does it work.
b) Purpose: What will / did the experiment accomplished.
2. Materials and methods
a) Materials: What were the essential supplies used.
b) Methods: Step wise explanations of how the experiment was performed.
3. Results
a) Tables or graphs that presents the data in the most appropriate format for later interpretation
b) Text that explains the trend of the results contain in the table.
4. Discussion
It involve stating inferences from the practical work. Students are expected to state clearly how their findings relate to current trends in microbiological discoveries. When possible some citations
LABORATORIES
The department of computer science has four (04) main laboratories for the training of students:
COURSE CODING AND NUMBERING
CODING
NUMBERING
PROGRAM STRUCTURE
100 LEVEL 1ST SEMESTER
| COURSE CODE | COURSE TITLE | CREDIT UNIT |
| BIO111 | GENERAL BIOLOGY | 3 |
| CHM111 | GENERAL CHEMISTRY 1 | 3 |
| MTH111 | ELEMENTARY MATHEMATICS 1 | 3 |
| PHY111 | GENERAL PHYSICS 1 | 3 |
| PHY113 | BASIC PRACTICAL PHYSICS | 1 |
| GST111 | COMMUNICATION IN ENGLISH I | 2 |
| GST121 | USE OF LIBRARY & STUDY SKILLS | 2 |
| GST113 | NIGERIAN PEOPLES & CULTURE | 2 |
| GST123 | COMM. IN FRENCH | 2 |
| GST125 | INTRO. ENTRP. SKILLS | 2 |
| CSC101 | HANDS-ON-COMPUTER | 1 |
| GER111 | COMM. IN GERMAN | 0 |
| TOTAL | 24 |
| CRS. CODE | COURSE TITLE | CREDIT UNIT |
| CSC112 | PRINCIPLES OF COMPUTER SCIENCE | 3 |
| CSC122 | INTRODUCTION TO COMPUTER | 3 |
| MTH126 | ELEMENTARY MATHS II | 3 |
| MTH124 | ELEMENTARY MATHS III | 3 |
| PHY122 | GENERAL PHYSICS II | 3 |
| PHY152 | GENERAL PHYSICS LAB II | 1 |
| STA122 | INTRO. TO STATISTICS FOR COMPUTER SCIENCE | 3 |
| GST122 | COMMUNICATION IN ENGLISH II | 2 |
| GST112 | LOGIC, PHILO & HUMAN EXISTENCE | 2 |
| GST114 | SOCIAL SCIENCE | 1 |
| TOTAL | 24 |
| COURSE CODE | COURSE TITLE | CREDIT UNIT |
| CSC 211 | COMPUTER PROGRAMMING I | 3 |
| CSC 215 | COMPUTER PROGRAMMING II | 3 |
| CSC 227 | GENERAL COMPUTER HARDWARE LABORATORY | 1 |
| CSC 231 | MANAGEMENT INFORMATION SYSTEMS | 2 |
| CSC 235 | INTRODUCTION TO OPERATING SYSTEMS AND FILE PROCESSING | 2 |
| CSC 241 | INTRODUCTION TO COMPUTER SYSTEMS | 2 |
| CSC 251 | NUMERICAL METHODS I | 2 |
| MTH 227 | ELEMENTARY DIFFERENTIAL EQUATION | 2 |
| MTH 231 | LINEAR ALGEBRA I | 2 |
| GST 215 | INTRO. TO ENTRP. STUDIES II | 2 |
| TOTAL | 21 |
| COURSE CODE | COURSE TITLE | CREDIT UNIT |
| CSC 218 | INTRO. TO OBJECT ORIENTED PROGRAMMING (OOP) | 3 |
| CSC 234 | FUNDAMENTALS OF DATA STRUCTURES | 3 |
| CSC 262 | INTRODUCTION TO INFORMATION SECURITY | 1 |
| CSC 244 | INTRODUCTION TO ASSEMBLY LANGUAGES | 2 |
| CSC 256 | DESCRETE MATHEMATICS & THEORETICAL COMPUTER SCIENCE | 3 |
| MTH 222 | MATHEMATICAL ANALYSIS I | 2 |
| PHY 224 | ELECTRIC CIRCUITS AND ELECTRONICS | 3 |
| STA 224 | STATISTICS FOR PHYSICAL SCIENCES | 2 |
| GST 222 | PEACE AND CONFLICT RESOLUTION | 2 |
| TOTAL | 21 |
| COURSE CODE | COURSE TITLE | CREDIT UNIT |
| CSC 311 | INTRODUCTION TO DIGITAL DESIGN | 2 |
| CSC 313 | COMPUTER ARCHITECTURE AND ORGANISATION I | 3 |
| CSC 315 | DATA STRUCTURES & ALGORITHMIC ANALYSIS | 3 |
| CSC 317 | OBJECT ORIENTED PROGRAMMING II (C++) | 3 |
| CSC 321 | OPERATING SYSTEMS AND DISTRIBUTED COMPUTING | 3 |
| CSC 332 | DATABASE DESIGN & MANAGEMENT I | 2 |
| CSC 335 | SYSTEM ANALYSIS & DESIGN | 2 |
| CSC 337 | SURVEY OF PROGRAMING LANGUAGES | 2 |
| CSC 351 | OPERATIONS RESEARCH | 2 |
| CSC 389 | RESEARCH METHODS & TECHNICAL WRITING | 2 |
| TOTAL | 24 |
| COURSE | COURSE TITLE | CUR. UNIT |
| CSC 391 | RESEARCH SEMINAR IN COMPUTER SCIENCE | 5 |
| CSC 399 | INDUSTRIAL TRAINING | 10 |
| TOTAL | 15 |
| COURSE CODE | COURES TITLE | CREDIT UNIT |
| CSC411 | ORGANIZATION OF PROG. LANGUAGES | 3 |
| CSC415 | FORMAL METHODS AND SOFTWARE DEVELOPMENT | 3 |
| CSC423 | ARTIFICIAL INTELLIGENCE / EXPERT SYSTEM | 3 |
| CSC439 | SOFTWARE ENGINEERING | 3 |
| CSC441 | HUMAN COMPUTER INTERFACE | 2 |
| CSC443 | COMPUTER ARCHITECTURE AND ORGANISATION 11 | 3 |
| ELECTIVE | 2 | |
| TOTAL | 19 |
| COURSE CODE | COURSE TITLE | CREDIT VALUE |
| CSC 403 | QUEUING SYSTEM PERFORMANCE EVALUATION | 2 |
| CSC 417 | COMPUTER SYSTEMS PERFORMANCE EVALUATION | 2 |
| CSC 435 | COMPUTER GRAPHICS/VISUALIZATION | 2 |
| CSC 445 | MODELLING AND SIMULATION | 2 |
| CSC 453 | NUMERICAL METHODS II | 2 |
| CSC 461 | OPTIMIZATION TECHNIQUES | 2 |
| COURSE | COURSE TITLE | CUR. UNIT |
| CSC410 | NET COMPUTING AND DATA MINING | 3 |
| CSC426 | TECHNICAL AND LEGAL ISSUES ON COMPUTER INSTALLATION AND MANAGEMENT | 2 |
| CSC432 | DATABASE DESIGN AND MANAGEMENT II | 3 |
| CSC442 | COMPILER CONSTRUCTION | 3 |
| CSC460 | DATA COMMUNICATION / NETWORKS | 2 |
| CSC499 | RESEARCH PROJECT | 6 |
| TOTAL | 19 |
COMPUTER SCIENCE CORE COURSES
CSC 112: PRINCIPLES OF COMPUTER SCIENCE (3 UNITS)
CSC 122: INTRODUCTION TO COMPUTER SCIENCE (3 UNITS)
CSC 211: COMPUTER PROGRAMMING I (3 UNITS :45 lecture hours and 30 practical hours)
CSC 215: COMPUTER PROGRAMMING II (3 UNITS :45 lecture hours and 45 practical hours)
CSC 213: COMPUTER PROGRAMMING III (3 UNITS)
CSC 231: MANAGEMENT INFORMATION SYSTEM ( 3 UNITS)
CSC 233: COMPUTER APPLICATION (2 UNITS)
CSC 241: INTRODUCTION TO COMPUTER SYSTEMS (2 UNITS)
CSC 218: INTRO. TO OBJECT ORIENTED PROGRAMMING OOP(3 UNITS)
CSC 222: FILE PROCESSING (3UNITS)
CSC 244 INTRO. TO ASSEMBLY LANGUAGE PROGRAMMING (2 UNITS)
CSC 251: NUMERICAL METHOD 1 (2 UNITS)
CSC252: DISCRETE MATHEMATICS FOR COMPUTER SCIENCE (3 CREDITS)
CSC 311 INTRO. TO DIGITAL DESIGN AND MICROPROCESSORS (3 UNITS)
CSC 313: COMPUTER ARCHITECTURE 1 (3 UNITS)
CSC 315 DATA STRUCTURES AND ALGORITHMIC ANALYSIS (3 UNITS)
CSC 317: ADVANCED PROGRAMMING IN C++ (3 UNITS)
CSC 321: OPERATING SYSTEMS OF DISTRIBUTED COMPUTING(3 UNITS)
CSC 335 SYSTEM ANALYSIS AND DESIGN (2 UNITS)
CSC 341 OPERATIONS RESEARCH (2 UNITS)
CSC 332: DATABASE DESIGN AND MANAGEMENT (2 UNITS)
CSC389: RESEARCH METHODOLOGY & TECHNICAL WRITING (2 CREDITS)
CSC 399: INDUSTRIAL TRAINING (10 UNITS)
CSC 411: ORGANIZATION OF PROGRAMMING LANGUAGE (3 UNIT)
CSC 417: COMPUTER SYSTEMS PERFORMANCE EVALUATION MODELS AND SIMULATIONS (2 UNITS)
Queueing network models of computer systems and operational analysis techniques for performance modeling and capacity planning. Mean Value Analysis (MVA) methods for open and closed systems and for multiple jobs classes; Basic probability theory and the use of transform methods for analysis;
Birth-death processes, bn Markov/Semi-Markov processes, queuing theory foundations, queueing analysis of various variants of M/M/1 and M/G/1 systems, and analytical models for systems modeled a closed ndtwork of queues;
System simulation methods based on event-driven as well as process-oriented techniques. Methods for random number generation in simulators and techniques for analyzing simulation data would be studied. The students would develop simulation models using various programming frameworks such as CSIM, JavaSim, and the NS-2 network simulator, use of program execution monitoring tools such as perfmon;
Web server workload characterization and benchmarks for performance analysis of servers. Benchmarks and workload models for Clouds, such as Yahoo Cloud Serving Benchmark (YCSB);
Applications of performance analysis methods would be studied using several case studies, which would include modeling and performance evaluation of Web servers, multi-stage/multi-tier execution models in cluster-based systems, application scheduling and task placement in cluster-based and Cloud based hosting platforms, and communication protocols in network systems.CSC 431: SOFTWARE ENGINEERING I (3 UNITS)
CSC 435: COMPUTER GRAPHICS AND VISUALIZATION(2 UNITS)
CSC 452: NUMERICAL METHODS 11 (2 UNIT)
CSC431: DATABASE DESIGN AND MANAGEMENT II(3 UNITS)
CSC 410: NET COMPUTING AND DATA MINING (2 UNITS)
CSC 426: TECHNICAL & LEGAL ISSUES ON COMPUTER INSTALLATION AND MANAGEMENT (2 UNITS)
CSC 443: COMPUTER ARCHITECTURE 11 (2 UNITS)
CSC 434: ARTIFICIAL INTELLIGENCE/EXPERT SYSTEM (3UNIT)
CSC 442: COMPILER CONSTRUCTION (3 UNITS)
CSC 462: DATA COMMUNICATIONS/NETWORK (2 UNITS)
CSC 489: COMPUTER SCIENCE PROJECT (6 UNITS)
REQUIRED AUXILIARY COURSES
BIOLOGY
BIO 111: GENERAL BIOLOGY I (2 UNITS)
CHEMISTRY
CHM 111 GENERAL CHEMISTRY 1 (2 UNITS)
CHM 131: GENERAL CHEMISTRY II ( 2 UNITS)
CHM 171: BASIC CHEMISTRY PRACTICALS (I UNITS)
CHM122: GENERAL CHEMISTRY III: (3 UNITS)
CHM 172: BASIC CHEMISTRY PRACTICALS II (I UNITS)
PHYSICS
PHY111: GENERAL PHYSICS I (2 UNITS)
PHY 151/152: BASIC PRACTICAL PHYSICS (1 UNITS)
PHY 122: GENERAL PHYSICS II (2 UNITS)
PHY224: ELECTRO MAGNETIC THEORY (3 UNITS)
MATHEMATICS
MTH111: ELEMENTARY MATHEMATICS I (2 UNITS)
MTH124: ELEMENTARY MATHEMATICS II (2 UNITS)
MTH126: ELEMENTARY MATHEMATICS III (2 UNITS)
MTH227: ELEMENTARY DIFFERENTIAL EQUATIONS (2 CREDITS)
MTH231: LINEAR ALGEBRA (2 CREDITS)
STA122: INTRODUCTION TO STATISTICS (3 CREDITS)
STA224: STATISTICS FOR PHYSICAL SCIENCES (3 credits)
COURSES OFFERED TO OTHER DEPARTMENTS
CSC301: COMPUTER STUDIES THEORY AND PRACTICAL (2 CREDITS)
CSC302: COMPUTER APPLICATIONS TO PHARMACY I (2 CREDITS)
CSC304: COMPUTER APPLICATION TO MEDICAL SCIENTIST
CSC305: COMPUTER APPLICATION TO NURSING
DEPARTMENTAL REGULATIONS
a) Teaching Method
b) Role of Instructors
c) Class Attendance
d) Role of Student
e) Guides For Effective Note Taking
Take a close look at note-keeping. Good notes are extremely important!
Learn to take good class notes and improve your note-taking skills
Listen for speaker's organizational structure during lecture
Review class notes each and every day
Take your own notes during lecture
Identify central ideas in textbook passages
Use a system that shows the relationship among the facts rather than a list of facts
Vary the format of taking notes according to the content of the material
Consolidate information taken from several sources into a master set of notes
Consistently update and summarize the information learned
Use abbreviations for long words
Be organized and meticulous in keeping your notesf) Study Skills
Study time must be schedule every day!
Make up a "to-do" list for tomorrow and set priorities.
Realistic study goals must be set each and every day.
Make up a weekly list of things to accomplish
Reward yourself for finishing items on your "to-do" list.
Create your own study area for serious studying.
Class attendance is very important.
Set your purpose before beginning to read or study.
Break time into manageable units to increase productivity.
Keep track, on paper, of the amount of time you've spent studying and what you accomplished.
Pace study to allow adequate time for reviewing and memorizing.
Memorize only after understanding information.
Reinforce information through timely repetition at intervals ranging from the same day to several weeks after.
Practice remembering the information (reciting and writing) without the aid of notes, text, internet notes, or study sheets. Remember, you won't have these during the exam.
Use organized system for learning new vocabulary words.
As you survey a reading selection, formulate questions you will answer as you read. (Who, What, Where, How, Why, Significance).
Form a study group and spend time asking each other questions and "teaching" one another the most important material.g) Test Skills
Predict test questions while studying and be certain you can answer them to ensure you know the material
Read test instructions!
Read questions carefully and identify key terms
Attempt to define key terms in a question before working through the question
Determine the intent of the test question without over-interpretation
Use a problem-solving strategy rather than guessing when uncertain of an answer
Apply consistent logic to answer choice within a test questionh) Laboratory Preparations
The general laboratory with 40 modern computers and a digital projector
The Research laboratory with 40 modern computers and a digital projector
The architectural (hardware) laboratory with different computing devices (new and old)
The network laboratory with over 60 computer systems
Three alphabet letters and three numerals shall be used for coding of courses. The following combination of letters will be used to denote the courses in the computer science department;
CSC= Computer Science (Core Course)
MTH= Mathematics (Required Course)
PHY= Physics (Required Course)
BIO= Biology (Required Course)
CHM= Chemistry (Required Course)
STA= Statistics (Required Course)
GST=General Studies (University Requirement)
The Numbers attached to each letter coding will have the following significance
a). First Digit indicate the level offering the course (!00 level, 200 level, 300 level, 400 level, 500 level, etc.)
b). The second digit indicates the area of concentration
0: Courses for a departments other than computer science
1: Programming
2:Hardware
3:Software
4:Principles of Design
5:Principles of Computations
6:Communications
c). The last digit will represent the semester with Odd number representing first semester and Even numbers representing second semester.
100 LEVEL 2ND SEMESTER
200 LEVEL 1ST SEMESTER
200 LEVEL 2ND SEMESTER
300 LEVEL 1ST SEMESTER
300 LEVEL 2ND SEMESTER
400 LEVEL 1ST SEMESTER
ELECTIVES
400 LEVEL 2ND SEMESTER
CSC101:HANDS-ON-COMPUTER (1 UNIT)
This course is totally practically oriented to encourage the student in a carrier in computer science. The course allow the student to spent at least 2 hours each week on the computer laboratory to learn typing, playing games, running simple simulation programs, moving around the computer.
The history of computer science; The relationship between computer science and other sciences; The role of a computer Scientist; Terminology in computer science; Specialized branches of computer science (E.g Cognition science, Computer Vision; Robotic science, etc.), Computer societies. Problem solving strategies; Role and concept of Algorithms in problem solving process; implementation strategies; Basic Notion of writing a workable a Computer program in BASIC or VBasic
The History of the origin of the computer, classification: Analog, Digital and Hybrid.
Types of Digital computers: mainframe, mini and microcomputer models of digital computers, The generation of computer types, the meaning of a programme and a "job". Computer Hardware; Functional Components, Modern I/O units. Computer Software: Operating Systems, Application Packages. The two levels of computer languages: The high-level and low-level Languages. Program development: flow charts. Data processing and data processing centers. Criteria for using a computer. Type of computer users' interface. Introduction of the internet.
A review of binary, octal, decimal, and Hexadecimal number systems. The basic logic operation: AND, NAND, OR NOR and OXR; Problem solving flowchart. An introduction to general purpose high-level language. Variables, Constance, Operators and expressions. Looping and transfer of control. Arrays and subscripted variables. Function and subroutines: (A high level language is required e.g. BASIC, PASCAL, FORTRAN).
Pre-requisite: CSC122, CSC112
Problem solving methods and algorithm development, designing, coding, debugging and documenting programs using techniques of a good programming languages style; programming algorithm development. Data types, character types, strings. Boolean types and variable control statement to define data, reserved words and variable names. Self Documentary codes, Comments, Input and Output statements, Print Statements, re-statement and data statement, Input and output to files (The high level language must be different from that used in CSC 211). Good program design style and expression, Debugging and testing large programs (with special note on variables, constants, operations and expressions, looping and transfer of control using list, arrays, and subscripted variables) Selection of a particular high level language such not be restricted to those already taught)
Pre-requisite: CSC122, CSC112
Functions and subroutines programming exercises. The selection of specific high-level languages would not e restricted to those given as examples above but will always be motivated by current requirements in industry. The language used here is different from the language used in CSC211. Preference is given to FORTRAN95 OR C programming language.
This course comprises of introduction/definition; management framework, management hierarchy, analysis and designing information system, concepts, planning for systems development, objectives of system plan, stages in the system life cycle, Need for change. Techniques of gathering analysis and design data File/File processing Systems, information communication, the attributes of information, attributes of a set of information, data/information, information transmission, sources of information. Practical: MIS and applied to following areas– payroll, order processing, office automation, management Document security, stock control, production control, labor control, network analysis. Application of computer in modern business management such as internet, e-commerce, e-business, etc.
Pre-requisite: CSC122,CSC112 (Lecture45hs,
This course emphasizes the use of various application packages in the market. Application packages differentiate among system software, software program, generators and application packages, modes of acquisition in-house, purchase, and lease.
Criteria for package acceptability, good documentation, user-friendly, efficiency, appropriateness. List various types of packages and examples; word processing, DBMS, spreadsheet should be studied e.g Microsoft Excel and students should be efficient in using Excel or any other spreadsheets
Students should be able to work with D-base
Creation of a database.
Students should be taught how to capture data in D-base
A complete structure Of DBMS should be reviewed and students should master these structures.
Students should be made to know the vital role computer plays in all aspects or human endeavor.
Pre-requisite: CSC122,CSC112
This course is both practical and theory.
Historical Background, Computer structure and assembling, Architectural developments and styles, Technological developments, Introduction to performance measures, Introduction to Machine and assembly languages, Introduction to computer arithmetic (complements arithmetic). Computer circuits,: Diode arrays, PIAs, Integrated circuits fabrication process, Use of MSI, LSI and VLSI IC hardware design. Primary and Seconday memories: Peripheral devices, printers, CRT, keyboards, character recognition. Operational Amplifiers: Analog to digital and Ditital to Analog converters.
Pre-requisite: CSC122,CSC112
This courses covers the basics of object oriented programming. Introduction to problem solving methods and algorithm development, designing, coding, debugging and documenting programs using techniques of a good programming language style; computer organization; programming algorithm development. Data types, character types, strings, Boolean types and variable names. Others are input and output statements print, input, re-statements and data statements.
Pre-requisite: (CSC211 or CSC215) and CSC213
The objectives if these course are:
(a) To introduce concepts and techniques of structuring data on bulk storage devices;
(b) To provide experience in the use of bulk storage device:
(c ) To provide the function for applications of file processing.
TOPICS COVERED INCLUDE:
File processing environment: Definition 0f records, file blocking, compacting and database sequential access: physical characteristics of sequential media (tape, cards etc.). external sort/merge algorithms, file manipulation techniques for updating, deleting and inserting records in sequential file.
Random access physical characteristics of disk/drum and other bulk storage devices, algorithm and techniques for implementing invented list, multilist, index sequential and hierarchical structures.
File input/output file control systems and utility routines, 11 specification statements for allocating space and cataloging files.
Pre-requisite: CSC231 and CSC233
225: INTRODUCTION TO OPERATING SYSTEM AND FILE PROCESSING (3unit)
Overview of O/S: Role and purpose, Functionality Mechanisms to support Client Server models, hand-herd devices, Design issues influences of security, networking, multimedia, Windows. File Storage and retrieval, File manipulation techniques, Indexing, File merge. Random access physical characteristics of disk/drum and other bulk storage devices, algorithm and techniques for implementing invented list, multilist, index sequential and hierarchical structures. File input/output file control systems and utility routines, 11 specification statements for allocating space and cataloging files.
CSC 227: GENERAL COMPUTER HARDWARE LABORATORY
This course teaches the basics of computer assembling and cloning in the hardware laboratory. Students are expected to clone their own systems with desired specifications. Both desktops and laptops cloning will the done in the laboratory. All classes shall take place in the hardware laboratory. After this course students are expected to start servicing computers of other students from other departments.
CSC 234:FUNDAMENTALS OF DATA STRUCTURES
Primitive types; Arrays; Records; Strings and string processing; Data representation in memory; Stack and heap allocation; Queues; TREES, Implementation strategies of Stacks, Queue and trees;
Assembly language programming: 8-bit (or 32-bit) processors (example INTEL 8088/8086, E80). Specific areas covered include general machine structure, instruction set, addressing modes and structured microcomputer programming.
Pre-requisite: CSC213 and CSC241
Number systems and errors: representation of integers. Function: floating point arithmetic; error propagation. Solution of non-linear equations:Bisection, Secant, Newton, iteration, etc.. Matrices and systems of linear equation: Gaussian elimination, triangularization methods. Interpolation and approximation: differentiation and integration.
Pre-requisite:CSC215, MTH231 and MTH227
Propositions, propositional logic and proofs; • Mathematical induction, recursion; • The stable marriage problem; • Modular arithmetic; • Polynomials and their applications: error-correcting codes, secret sharing; • Diagonalization, self-reference, and uncomputability; • Probability and probabilistic algorithms: load balancing, hashing, expectation, variance, Chebyshev and Chernoff bounds, conditional probability, Bayesian inference, law of large numbers,Recursive sequence and implementation algorithms, Nth terms of recursive sequences, Differencing; first, second and higher order differences, Difference equations, Relations and mappings, Discretization of sets and functions.
Pre-requisite:CSC215, MTH231 and MTH227
CSC262:INTRODUCTION TO INFORMATIOIN SECURITY (2 units)
Overview of information technology, IT tools, Benefits and Problems Associated with IT and IT tools. Security bridging: Internal and external security, Methods of security bridging. Methods of controlling and maintaining security (internal and external). Security cracking and security controlling software. Protocol layers and security protocols. Intranets and extranets. Mobile computing. Electronic commerce. Security architectures in open-network environments. Cryptographic security protocols. Threats, attacks, and vulnerabilities. Security services: confidentiality; authentication; integrity; access control; non-repudiation; availability. Security mechanisms: encryption; data-integrity mechanisms; digital signatures; keyed hashes; access-control mechanisms; challenge-response authentication; traffic padding; routing control; notarization. Key-management principles. Distributed and embedded firewalls. Security zones
The objectives of this course are to introduce the organization and structuring of the major hardware components of computers and to understand the machines of information transfer and control within a digital computer system.
Topics covered include: Present the various binary systems suitable for representing information in digital systems.
Introduce logic gates and basic concepts for designing gate circuits, Boolean algebra, Karnough maps and map simplification techniques.
Combinational circuit analysis and design.
Sequential circuit concepts and design.
Hardware implementation and block and sequencing of instruction fetch, address construction, and instruction execution data flow and control, block diagram of a simple microprocessor. Concept of micro program and analog with control, interrupts, modes of communication with processors, study of an actual simple minicomputer of microcomputer systems.
Pre-requisite:CSC224; PHY222
Data representation;-Fixed, and Floating points, Number systems, integer arithmetic, floating point arithmetic, , instruction set architecture, architecture of processing units;-CPU, register set, Datapath, CPU instruction cycle, control unit.
Pre-requisite:CSC224; PHY222
linear structures and list structures; Arrays; Records; Pointers, Abstract Data Structures; Linked List, Stacks, Queues, Tree structures, Graph, Set and relation, Sequence. Each of these structures will be implemented practically using Pascal, Fortran, C or C++ programming language.
Students are expected to compare various algorithm and calculate the order of an algorithm. Asymptotic analysis of upper and average complexity bounds: standard complexity classes in time and space. Emphasis will be on the following topics: Big-O and Big-Omega Notations, Recurrence relations, Iterative algorithms, Recursive algorithms, Search Algorithms, Sort algorithms, Greedy algorithms, Optimal search tree, Profilers, string processing, deficiency of algorithm.
Pre-requisite:CSC315
Introduction to problem solving methods and algorithm development, designing, coding, debugging and documenting programs using techniques of a good programming language style: computer organization programming algorithm development. Data types, character types, string, Boolean types and variable control statement to define data, reserved words and variable names. Others are input and output statements print, input, re-statement and data statement.
Pre-requisite:CSC202
Introduction to processes, management, memory management, multiprogramming concepts and requirements. Multiprocessing systems. Other related issues based on semaphore and monitor concepts. Issues in analyzing and designing operating systems, memory management, memory protection and resource allocation, overlays, swapping and partitions, paging and segmentations placement and replacement policies, working sets and trashing, caching. Operating systems of distributed computing: motivations; Communication mechanism: communication protocols, RPC, RMI, stream oriented communication; Synchronization:Global state, election, distributed mutual exclusion, dictributed 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 point; Distributed file systems: NFS, Coda etc.: Characteristics of distributed computer real time operation systems.
Pre-requisite:CSC222
Techniques for the analysis of existing systems using methods like interview, old records, observation, sampling, preparation of system flowcharts, definition of new system requirements and design of new systems. Input design, forms designs, code design. Facts Recording;- Requirements documents, Requirements Specification documents, System analysis project (Students will undertake a project along side this course)
Pre-requisite:CSC211 and CSC222
Linear programming, application to product mix, resource allocation and transportation. Deterministic inventory control, Critical path analysis, probabilistic inventory problems and maintenance, decision making criteria and decision trees. Technology forecasting, dynamic programming, computer aided management, group and individual programming exercise.
Pre-requisite:MTH122, STA224 and MTH124
Database management system: review of basic concepts; functions and components for DBMS. Information storage and retrieval, Information management applications, information capture and representation, analysis and indexing, File design and access path: feature directions in DBMS: Programming and application in a D-base environment. A specific database should be uses: SQL, MsAcess and Oracle should be compared. Database project (Students are expected to carry out a database project)
Pre-requisite: CSC315, CSC321 and CSC335
Types of research; Methods of data collection; Methods of data recording; Methods of data analysis; Methods of system evaluation; IT report writing; Seminar report writing; Project report guidelines; Chapters and Chapters-heading selection; Formating a report; Citation and Referencing
Pre-requisite:GST121 and GST122
CSC 389: SEMINAR IN COMPUTER SCIENCE (6 Units)
Students during their industrial training will be given topics to carry out a research and present their findings in an academic seminar. All topics will be chosen from the main subject areas of computer science. All findings must include but not limited to software and hardware principles as applied to the topic.
Six-month industrial training period in two semester-three months each this is industrial training period begins immediately after 2nd year and extends to the 1st semester of 3rd year of the 4th year academic program. Students work schedule during this period is as follows:
Familiarization with routine operation in the industry (1 week ); Practical considerations of single phase and three-phase power supplies(1 week ); Safety precautions( week); Wiring and Assembly of Electronic Equipement including computers and computer related products (1week); Systematic approach to hardware and software fault-tracing(1 week); Preventive maintenance of hardware( weeks); Quality control standard and monitoring procedure(1 week); Testing and integration of computer application programs(2 weeks); Software maintenance duties(2 weeks); General review and report writing(1 week).
This course consists of language definition. Classification of programming languages (Imperative and Declarative). Standardization of programming languages. Genealogy of programming languages (Time line). Structure of Programming Languages: Editor, Compiler, Debugger, Interpreter, Linker, Loader. Comparison of Control Flows (control structures and data flow) in different programming languages. Run-time consideration. Interpretative languages. Programming language design models.
Pre-requisite:CSC317, CSC315
This course covers measurement techniques; simulation techniques; analytic techniques; statistical measurements; Work load based characterization; performance evaluation in design problems; evaluation of program performance; evaluation of systems; Experimental Designs; System Turning; Efficiency and Amdahi's law; the language LISP and pattern recognition. Concepts and techniques used in modeling and simulation methodology and a suitable simulation language; modeling; generation of random variables, transformation of random number, parameter, estimation, experimental design, factorial design optimization Evaluation project exercise: Student will undertake an actual evaluation assignment project in groups. Models for consideration include;
Pre-requisite:CSC241, STA224
This course introduces Engineering principles applied to Software. Principles of software design, Software Job scheduling, Team work Management, Software Authenticity and legal rights, Software Processes re-engineering. Software Engineering project management: team management, project scheduling, software measurement and estimation techniques, risk analysis, software quality assurance, software configuration management. Software evaluation: human centered software evaluation and development, GUI design and Programming. Software project management tool kits, GUI toolkits. Student group project (A maximum of 3 students per project will work together to develop a software simple and effective software).
Pre-requisite:CSC335 and CSC317
Review of the Cathode Ray Tube (CRT) and point plotting displays, computer control of pointing displays, vector generation-dot, lines line length estimate digital and analog methods.
Display processor: Controlling a vector-draw display channels and display processors, character generators. Display file compilers: Display code generation, graphical functions. The viewing algorithm, segmented display files, free, storage allocations display subroutines; graphical data structures; 2-Dimensional transformations: The need for transformation, concatenation, matrix representation. Clipping and windowing: Clipping, Viewpoint, windows and instances.
Transformations Systems: Adding transformation to display compiler. The transformation of sub pictures, pseudo display files, transformation display file procedures, practical programming exercise to test understanding of the subject matter.
Some of this topic can be treated as well:
Graphical input Devices: Pointing and positioning devices, tablets, the light pen, comparators,
Interrupt Handling: Device handling, Interrupts, attention queue and task schedulers, interrupt from graphical input devices and their handling.
Interactive Graphical Techniques: A compendium of graphical input techniques, position in line specification by end-point positions scales, guidelines, and constrains to drawing and positioning, dragging, subbed and lines, dimensions and graphical potentiometer, pointing, light buttons and menus, inking, no-line character recognition.
3-Dimensional graphics: 3-D transformations, generating a wire-frame perspective display, worked examples, perspective depth and hidden-line elimination. Command languages, and dialogues, Features and definitions of command languages, control-oriented languages, and language processor designs. The of interactive languages. Brief review of programming la nguages for computer graphics, system selection.
Pre-requisite: CSC335 and CSC321
CSC441:HUMAN COMPUTER INTERFACE
History and Foundations of HCI, Architecture of input/output devices, Principles of GUI, GUI toolkits; Human-centred software evaluation and development; Principles of Display design, The power of HCI, GUI design and programming, Algorithmic design and complexities for HCI design and implementation ( some recent algorithms applied to Brain Computer Interface, Gesture recognition interface etc.) Validating HCI. Some Advanced (recent) HCI e.g BCI should be studied in details.
Floating-point arithmetic, use of mathematical sub-routine pack, interpolation; approximation, Error analysis, Numerical integration and differentiation, Numerical solution of ordinary differential equations. Solution of differential equations, Boundary-value problems in ordinary differential equations.
Pre-requisite:CSC352
Theoretical and Practical Knowledge of database design and management is necessary for all graduates of computer science in this course. Relationships (mapping conceptual schema to relational schema), concepts of functional and multi-valued dependencies, transaction processing, distributed databases, database languages (SQL). Entity relationship models (All students will present a seminar on the design and management of a particular enterprising database which they may further in the construction of a management system).
Distributed computing, Mobile and wireless computing, Systematics study of the web, its features and Services. Cloud and Grid computing. The Web is the largest technological artefact in existence, comprising a global network of information sites and services. The objective of the course is to introduce the students to recent developments of the computer and the Web. Rudiments of web site designs; Architecture of web-based learning, Web Archiving, Web crimes and Control, Cloud Computing, Grid computing. Data Mining concepts; PHP and Java Scrpts
Pre-requisite:CSC411 and CSC419
This course is a practical hand-on training-on training on computer installation and maintenance. Topic covered (1) requirements and service clearances, temperature, dust and humility control techniques. Factors affecting sitting and installation of computer equipments power supply requirements (single phrase three phrase etc) uninterruptible power supplies and elimination of floor vibration in computer rooms preliminary checks prior to start up of an inactive computer system, start-up procedures, uses of maintenance aids in a computer environment.
Aims and used of specification as they apply to computer peripherals and the application of tolerance levels to ascertain specifications. Disassembling, repairing and re-assembling of peripherals and interfaces: cards readers, card punches, tape divers, line printers, graph plotters, disk drives, terminals and work stations. Serving of video display units' moderns, and Teleprompters. Interconnecting sketches and diagrams to depict the way the units of a computer system are to be assembled. Installation procedures for mainframe. Minis and micros. Preventive maintenance techniques: identification and elimination of nose digital hardware routine power line cheeks. Corrosion prevention and correction computer systems. Information technology laws; Ethics in Computer science: User and professional ethics (student group project)
Pre-requisite:CSC321 and CSC417
This course exposes students on system; general characteristics of memory operation. Memory System, Memory addressing, memory hierarchy, virtual memory, control systems, hardware control, micro programmed control. Asynchrous control, 1/0 controls. Introduction to the methodology of fault-tolerant computing.
Instruction set, memory management and hierarchy, input/output and buses, pipelining techniques, branch prediction, RISC architectures, VLIW architectures and specific compiling techniques, superscalar architectures, out of order execution, parallel architectures and multiprocessors.
Pre-requisite:CSC313 and CSC417
Introduction to artificial intelligence: Understanding natural language, knowledge representation, expert system, pattern recognition, the language LIST. What is expert system?. Basic concepts for building expert system; Architecture of expert systems; constructing of expert system: Tools for building expert system, reasoning about reasoning, evaluation of expert system: languages and tools knowledge engineering.
Pre-requisite:CSC419
Phases of a compiler; Processes of compilation; Tombstone representations; Regular expressions, Finite automata; Introduction to Formal languages; Ambiguous grammar, Operator precedence, higher order proceed bounded context transition matrices. The language using P1, calling semantic routines case studies. Error Recover: Recovery from semantic errors, recovery from syntactic error. Code generation: Generating code or simple arithmetic expressions, addressing operands, extending code generation to other quadruple types. Compaction code generation object modules. Code optimization.
Pre-requisite:CSC411, CSC414, CSC313 and CSC445
Introduction wares, Fourier analysis, measure of communication, channel characteristics, transmission media. Noise, noise and distortion, modulation and demodulation and demodulation, multiplexing TDM, FDM, and FCM. Parallel and serial transmission (synchronous vs asynchronous). Bus structure and loop system, computer network, example and design consideration, data switching principles, broadcast techniques, network structure for packet switching, protocols, description of network, example ARPANET, DSC.
Pre-requisite:CSC313
Each final year (fourth) student is expected to work on a topic approved by his/her supervisor or H.O.D. computer science the project report most show the students understanding/familiarity of the area covered by the topic and must include appropriate computer programme (s) with output/results.
Embryology: gametogenesis, fertilization and cleavage as demonstrated by Amphioxus,
Genetics: The cell and distribution of genetic material mitosis, meiosis, inheritance, sex determination and sex related inheritance.
Histology: cells, tissues, organ formation and main features. Physiology: functioning of mammalian skin, muscles/skeleton, alimentary system/nutritional requirements and deficiencies (2 Lectures, 1 practical/week).
Atomic Structure and periodic table. Development of Configuration of Elements. Stoichiometry and mole concept. Electronic theory of atoms and valency. Chemical bonding. Formular and IUPAC basic nomenclature of compounds, Radioactivity and its application. Phase equilibrium, study of one and two components systems.
Structure of solids. Kenetic theory of gases and gas laws. Colligative properties of dilute solutions. Raoult's law, Henry's law and molecular waight determination. Thermochemistry and Hess's law. Chemical equilibrium. Law of mass action, reaction rate and chemical energetics. Electrochemistry, Ionic equilibria. Theory of acids, bases and indicators.
The theory and practice of simple volumetric and qualitative analysis. Simple organic preparations, reaction of functional groups and physical determinations.
Historical survey of the development and importance of organic chemistry, IUPAC nomenclature and classification of organic compounds. Homologous series. Elemental analysis and molecular formular. Structural isomerism, isolation and purification methods, concept of fuctional group resonance and aromaticity.
Electronic theory in organic chemistry. (brief) saturated and unsaturated hydrocarbons, cyclichydrocarbons, alcohols alkylhalides, ethers, aldehydes and ketones, carboxylic acids, amines and aromatic compounds, comparison of phenols with alcohols, photochemical reactions and basic electrochemistry.
More on theory and practice of simple volumetric and qualitative analysis. Simple organic preparations, reaction of functional groups and physical determinations.
Mechanics and properties of Matter
Scalars and vectors: Addition and resolution of vectors. Rectilinear motion and Newton's law of motion. Inertial mass and gravitational mass: free fall; projectile motion: deflecting forces and circular motion. Newton's law of gravitation; satellites, escape velocity. Gravitational potential ; potential well; special case of circular motion. Momentum and the conservation of a momentum. Work, power energy for a gravitational field and elastic bodies.
Thermal Physics And Properties of Matters:
Temperature, heat, work, heat capacities; second law, Carnot cycle, thermodynamic ideal gas temperature scale. Thermal conductivity, radiation, black body and energy spectrum, Stelan's law.
Kinetic model of gas: Equation of state, concept of diffusion mean free path, molecular speeds. Avogadro's number, behaviour of real gases.
A model for a solid; Crystalline structure; Model for matter Inter-particle forces in solids, liquids and gases.
This laboratory bases course emphasize qualitative measurement, the treatment of measurement and graphical analysis. A variety of experimental techniques will be employed. The experiments include studies of maters, the oscilloscope, mechanical systems, electrical and mechanical resonant systems, light, heat, viscosity, etc. covered in PHY 111 and PHY122.
ELECTROMAGNETISM AND MODERN PHYSICS
This course covers electrostatics induction, Coulomb law, Gauss law, electric field; electrostatic potential, capacitance, dielectric, electric current, circuits, analysis, alternating current, electromagnetic waves, particle duality, the Bohr theory of the hydrogen atom, nuclear properties, radioactive decay, nuclear fission and fusion; elementary particles theory.
This course covers DC circuits; Kirchoff's Laws, Sources of EMF and current; network Analysis and circuits theorems. AC circuits, Inductnace, capacitance, the transformer, sinusoidal wave-forms, RMS and peak values, power, impedance and admittance, series RLC circuit, Q-factor, Resonance, Circuit filters. Semiconductors, bipolar transistors, Characteristics and equivalent circuits; amplifiers, feedback and oscilloscope.
Pre-requisite:PHY122
Real number system: simple definitions of integrals, rational and irrational numbers. The principle of mathematical induction. Real sequences and series: elementary notion of convergence of geometry, arithmetic and other simple series. Theory of quadratic equations.
Simple inequalities: absolutes values and the triangle inequality.
Identities, partial fraction.
Sets and subsets: union, intersection, compliments. Properties of some binary operations of sets: distributive, closure, associative, commutative laws with examples. Relations in a set: equivalence relation. Properties of set functions and inverse set functions.
Permutations and combinations. Binomial theorems of any index.
Circular measures, trigonometric function of angles of any magnitudes. Addition and factor formulae.
Complex numbers: algebra of complex numbers, the Argand diagram, De Moivre's theorem, n-th root of unity.
This course is a continuation of the course MTH111. The main areas to be covered include; Axioms of real numbers, Absolute values, Real values functions, Properties, Domain of function, Limit of functions, Continuity, Differentiability, Integreability. The abstract definitions of these concepts should be stated; prove of limit existence theorems, finding limits of functions, proving continuity of functions, differentiating and integrating functions. Techniques of limit, differentiation and integration.
This course consist of geometric representation of vectors in 1, 2 and 3 dimensions, components direction cosines; addition of scalar, multiplication of vectors; linear independents, scalar and vector products of two vectors, Vector equation of a line, plane and sphere; Vector valued functions, Domain, Limit, Continuity, Differentiation and Integration of vectors with respect to scalar variables,; straight lines, circles, parabolas, ellipse, hyperbolas. Tangent and normals, kinematics of particles. Component velocity and acceleration of moving particles on a plane, force and momentum, newton's laws of motion; motion of simple pendulum, impulse and change of momentum, impact of two smooth elastic spheres. Direct and oblique impacts, Arc length, Moment of Initial and Center of mass
Notion of differential equations, Classification, Origin of differential equations, Primitives, Existence and uniqueness of solution of differential equation: (No prove is required of theorems). Solving first order differential equations, Solving second order differential equations with constant coefficients. Solving systems of first order differential equations.
Complex Numbers; Geometric representation of vectors in 3-dimensions, Components direction cosines; Lines and Planes; Linear Subspace Space; Vector Space; linear independents vectors; Linear transformation and matrices of linear transformation; Systems of linear equations;
Pre-requisite:MTH122 and MTH124
MTH222:MATHEMATICAL ANALYSIS
Real value functions of real variable, review of differentiation and integration; applications of differentiation and integration, mean value theorem, taylor series, real-valued functions of two or three variables, partial derivatives, chain rule, extrama, langrange multipliers, increments, differentials and linear approximations. Evaluation of line integrals, multiple integrals.
This consist of combinatorial analysis. Probability models for the study of random phenomena in finite sample spaces. Probability distributions of discrete and continous random variables. Expectations and moments generating functions. Cebyshev's inequality. Bivariate marginal conditional distribution and moments. Convolution of two distributions, the central limit theorem and its uses.
Elements of probability and probability distribution; Normal binomial, poison. Geometric, negative binomial distribution. Estimation and tests of hypotheses concerning the parameters of distributions. Regression, Correlation, and Analysis of variance. Contingency tables. Non-parametric inference.
Overview of Information and Communication technology and their application in contemporary society; Computer Types (Main frame, Mini, Macro computers) Hardware and software; Input devices, Output devices, Computer system; Computer Internal Components; Computer performance; Computer Software; Operating Systems, Software drivers
Application software (word processing) Graphical software; Database management system (Access), Pharmacy Accounting Management systems, Point of sale systems, Airline reservation systems.
Application software (word processing) Graphical software; Database management system (Access), Medical laboratory systems (Hardware and software and their manufacturers). Medical
Application software (word processing) Graphical software; Database management system (Access), Nursing information systems (Hardware and software).
CSC401:COMPUTER APPLICATION TO PHARMACY II
Banking and financial management systems, Networking and Internet, Analysis of data using statistical packages, Online and offline drug information systems,
CSC303: COMPUTER APPLICATION TO MEDICAL LABORATORY SCIENCES
Introduction to software and Management information systems, clinical information systems, laboratory diagnostics systems, information transmission in a distributed system.
Lectures are combined with a novel pedagogic technique that involves formal and informal cooperative learning in which students play major roles. Encouraged emphasis are made in concept and reasoning. Questions and discussion are stressed during the lecture time.
The instructor is responsible for all materials in the lectures and is committed to providing students with an excellent and challenging course. Students who have problems in understanding the lectures or getting difficulties in preparing for exams/test should contact the lecturer right away and not at the end of the semester. The lecturers will encourage students but not force them to remain in class even if he is failing. They will use different pedagogic approaches to make sure majority of the students have understood the lecture. No lecturer will give a make up test for students without justifiable reasons for not being in class.
Attendance at lectures is imperative for students to understand the material covered in each course. Lecturers expect that students attending their lectures should focus their entire attention upon the lecture. As usual, disruptive students will be asked to leave class. Regular attendance in class is an important factor that will increase the probability that students will [a] develop a better understanding of the material, [b] be able to demonstrate that understanding on exams and [c] earn a higher grade in class. Students should note that examinations may include materials, covered in lectures that are not in the textbook or class notes. Students who failed to attend classes are not allowed to disturb lecturers with questions in concepts that were explained during the missed lectures. Attendance in class, motivation and good preparation for exams are the key factors toward succeeding in the Department of Biochemistry. Students are advised to make serious effort to attend to class particularly those getting low grades. However, students who do not study or attend classes should not complain to anybody for low scores. No student should ever go to a lecturer's office at the end of the courses asking for higher scores. Such act will tantamount to examination malpractice. Both the lecturer and student shall face the consequence for such act. If a student intends to graduate with his batch, he should always read the course syllabus carefully prepare well and plan accordingly.
The Faculty of Science lecture timetable provides time and venue for different lecturers in the various departments. A class always starts and finish on time. Students are advised to make every effort to enter the class before the lecturer in order not to distract other student's attention.
Please do not leave the lecture hall without the consent of the lecturer. Lecturers shall only permit students who fall ill or have some other unavoidable circumstances to leave the hall. Students, who have appointments with any school authority such that they need to leave early, should kindly inform the lecturer of such matters before the commencement of the class. Such students should sit in a seat at the back of the classroom. When leaving the class, such students should minimize distracting others.
Students should be considerate of their fellow students and the lecturer by making every effort not to cause unnecessary noise. Students are expected to make comments and ask reasonable questions in class. Lecturers will always endeavor to address them as they are raised. Food and beverages are not allowed to be consumed in class. However, students who have difficulty or disability that requires recording of lectures must get approval from the lecturer. All cellular phones and beepers should be switched off during classes. Social conversations are not allowed in class.
With time, concentration, and some effort it is easy to get good grades.
Don't fall behind! Talk to your professor, go for
For best performance of laboratory exercises and best understanding of the materials, students should approach the exercises in an organized fashion. This includes reading each exercise and writing laboratory preparation report on what they are going to do during class before going to the laboratory. Such reports should include background materials as well as a statement of the objective or purpose of the exercise.
Laboratory Notebook
Students are expected to maintain an up to date notebook of all laboratory exercises. Such note books should use the same format as the laboratory report, but are not expected to be vigorous. However, for convenience and in order to maintain good records, the laboratory note book has been incorporated into the manual. Laboratory exercises should be integrated into the note book, and should be supplemented to maintain a full record of your activities in the laboratory, as well as the results you obtain, the interpretations and conclusions made from them.
Laboratory Reports
Students shall be required to generate five formal laboratory reports during the semester. Exercises to be based on shall be listed in each laboratory outline. Each report should have a name, be well integrated and follow the format specify by the subject master. Generally laboratory reports in biological sciences are organized as follows:
1. Introduction
a) Background: What are the scientific bases of the approach or techniques used- how does it work.
b) Purpose: What will / did the experiment accomplished.
2. Materials and methods
a) Materials: What were the essential supplies used.
b) Methods: Step wise explanations of how the experiment was performed.
3. Results
a) Tables or graphs that presents the data in the most appropriate format for later interpretation
b) Text that explains the trend of the results contain in the table.
4. Discussion
It involve stating inferences from the practical work. Students are expected to state clearly how their findings relate to current trends in microbiological discoveries. When possible some citations
LABORATORIES
The department of computer science has four (04) main laboratories for the training of students: