Benson Idahosa University Computer Science (MSc.) - Benson Idahosa University

Computer Science (MSc.)

OBJECTIVES OF THE PROGRAMME

The objectives of the course are as follows:

  1. To equip candidates with sound theoretical and practical knowledge in all branches of Computer Science and Mathematics related fields.
  2. To produce graduates who are capable of exercising original thought and judgments in the application of Computer Science knowledge
  3. To produce graduates with deeper productive research in computer science and increased professional skill and competence.

 

DEGREE OFFERED

M.Sc. (Computer Science)

Candidates for the M.Sc. degree in Computer Science can graduate in the following research areas:

  1. Operating System and system programming
  2. Theoretical computation and computational techniques
  3. Computer Methodology
  •  Database Computer Information System
  •  Advanced Software Development
  • Artificial Intelligence and Expert System.
  •  Interactive multimedia
  •  Distributed and Communication Systems

 

 

ADMISSION REQUIREMENTS

 Master of Science

Candidates with any of the following qualifications may be offered admission into the M.Sc degree programme.

  1. A holder of first degree in Computer Science with at least Second Class Lower Division in Computer Science, Computer Engineering and Information and Computer System from Benson Idahosa University or any other university of recognized standing.
  2. A first degree in any Science, or Engineering, with at least Second Class Lower Division of any recognized University together with a Credit Pass in Postgraduate Diploma in Computer Science of the University or any recognized university.
  3. A third class honours degree in Computer Science together with a Credit pass in the Postgraduate Diploma in Computer Science of the University may be offered admission.
  4. Candidates with  Second Class Lower Division or Third Class degree options above if admitted may be required to make up for deficiencies in their preparation by taking and passing some approved listed courses by the department.
  5. Candidates with a merit grade in PDGCS of Benson Idahosa University or any other recognized university with two years experience may be considered for admission.

DURATION OF PROGRAMMES

Master of Computer Science (M.Sc.)

The minimum period for the M. Sc Programme is three semesters (12 months) for Full-Time students and a maximum of six semesters (24 months) The M.Sc. degree programme will cover course work and research work. The course work runs for two Semesters and the students are examined at the end of each Semester. The research work runs alongside with the course work and students shall be required to submit a written project under staff supervision at the end of a successful completion of the Course Work.

EQUIPMENT

The Department of Computer Science has an equipped computer laboratory with micro computer facilities suitable for teaching, learning and research.

CONDITIONS FOR AWARD OF M.Sc. DEGREE IN COMPUTER SCIENCE

(a)   The following conditions must be satisfied for the award of Masters of Computer

  1. A successful completion of the prescribed course work.
  2. Successful completion of research project work. An oral seminar presentation on the project and a departmental defense of the project shall be required.
  3. A candidate must accumulate a minimum of 30 credits.
  4. All other conditions that must be satisfied by the Postgraduate School of Benson Idahosa University shall apply.

 

CSC 811- Current Trends in ICT (3Credits)

Current state of the art in computing systems: areas covered can include complication models, time sharing systems. Multilevel memory 3 allocation, Paging algorithms and a review of any current work and theories.

Research Methodology – Introduction to Research Methodology : Meaning, Objectives, Motivation in Research, Types, Approaches ,Importance, Research Methodology, Scientific Research, Process, Criteria for Good Research, Problems Encountered , Defining Research Problem,  Developing Research Proposal,  Primary Data: Observation Method, Personal Interview, Telephonic Interview, Mail Survey, Questionnaire Design. Sampling Design: Implications, Steps Criteria for Sampling Procedure, Characteristics of Good Sample Design, Different Types of Sample Design, Different Types of Sample Design, Report Writing and Interpretation – Writing Considerations. Meaning and Technique of Interpretation, Different Types of Report Writing, formats of Report Writing, Thesis Writing, formats of Publication in Research Journals.

Null Hypothesis and Alternative, The Level of Significance, Type I and Type II Errors, Two Tailed and One Tailed, Power of Test, Testing of Mean, Testing of Differences Between Two Means, Testing of Proportion of Difference Between Two Proportion Limitations of Hypothesis Testing.

Small Sample Test: Idea of Degree of Freedom, Test Significance Based Upon T and F

Statistic Testing of Mean, Testing of Difference Between Two Means, Testing of Equality of Variances, Chi – Square Test. Square Test for Large Samples:

Square Test As a Test of Goodness of Fit and As a Test of Independence, Application,

Analysis of Variance (ANOVA): Concept, One Way ANOVA, and ANOVA in Test in Latin Square Design

CSC812- Advanced Data Base System (3Credits)

Data base design and implementation: Schema, relations Graph models.

CSC813 – Computer System Architecture (3Credits)

Fundamentals of computer system; instruction set principles; instruction-level parallelism and its dynamic exploitation; exploiting instruction-level parallelism with software; memory hierarchy design; multiprocessor and thread-level parallelism; storage systems; interconnection networks and clusters; basic and intermediate concepts of pipelining; a survey of RISC architectures for desktop, server and embedded systems.

CSC814 – Automata Theory (3 Credits)

Mathematic and automata theory, decision problems, formal language, decomposition theory, Machines covering and reduction of semi- automata covering by permutation and reset semi automation.

CSC815 – Advanced Data Structures and Algorithms (3Credits)

Design and analysis of algorithms, data structure, algorithms design and performance evaluation techniques, optimization techniques, 99erializ and simulation, and prototyping.

CSC816- Advanced Complier Construction (3Credits)

Advanced topics in complier construction, including incremental and interactive computing error correction, code optimization, model of code, generators etc.

CSC817 – Electronic Commerce Technologies (3 Credits)

Introduction; the sociology and psychology of electronic commerce: building, recognizing, managing and making use of online communities in web-based environments, theories of online presence and cooperation; a guide to ecommerce in general: how to differentiate e-commerce today from e-commerce yesterday, current problems of ecommerce and interesting solutions and approaches to those problems; a guide to knowledge commerce: understanding knowledge as a commodity and as a process, and representing it in web-based environments; web architecture: structural design of e-commerce systems, client-server architecture, 2-, 3-, n-tier design, server farms, scalability, integration of legacy systems, Java beans, Enterprise Java beans and java server pages, particular problems posed by 24/7 operation and an open user community; data interchange: exchanging data over the internet, XML, style sheets, document type definition, metadata and document discovery, interchange of processes using WSDL and SOAP as examples; usability: user-interfaces design for websites, use of human computer interaction methodologies in evaluating user interfaces; electronic payments: technologies that support the processing of electronic payments, characteristics and properties of electronic payment systems; mass personalization and the virtual customer: automation of the customer relationship, use of data to customize the web experience, cookies and their risks, rule-based filtering, implicit profiling, collaborative filtering.

CSC 818 Operation Research    (3 Credits)

A review of techniques in operation research. Emphasis on underlying theories and assumptions of the most current ones

CSC 820 Advanced Numerical Computation I     ( 3 Credits)

Algorithm for non linear equation. Derivation and rigorous analysis of one step, multi-step and extrapolation methods, variable stepwise estimation, stiff equations and boundary value problems.

CSC821 – Communications and Networks (3 Credits)

Channels and channel capacity; introduction to information theory; sharing network resources: telecommunication history; circuit switching and packet switching; multiplexing; FDM, TDM, statistical multiplexing; virtual circuits and datagram; advantages and disadvantages; sharing the medium: Aloha, CSMA (persistent and non-persistent), CSMA-CD, token passing, CDMA, wireless LANs and simple performance analysis; dealing with errors: errors, coding and redundancy; hamming theory and codes; CRCs, ARQ protocols; CR selective retransmission and flow control; internetworking and the internet: ISPs, datagram for encapsulation and address resolution; TCP and UDP; ports and congestion controls; example applications; 100erializ data networks: services and protocols; layered architectures; the OSI 7-layer model; introduction to queue theory; physical media; LANs and bridging; WANs and point-topoint links; routing; addressing and routing in the internet; end-to-end communication in the internet; and application protocols.

CSC822- Advanced Operating Systems (3Credits)

Interacting processes and memory management; the deadlock problem files system: recent advances.

CSC823 – Artificial Intelligence (3 Credits)

Knowledge representation, reasoning and problem solving, model of proof theory,  problems domain in A1: planning Learning,  natural language, AI programming Lisp/ Prolog revisited.

CSC824 – Fault-Tolerant Computing (3 Credits)

Introduction and overview of fault-tolerant schemes; fault and error 100erializ; test generation and fault simulation; concepts in fault-tolerance; reliability/availability 100erializ; system level diagnosis; low level fault-tolerance: error correcting coding, byte-error detecting; high-level fault tolerant techniques in systems: rollback, check pointing, reconfiguration; software fault-tolerance; fault-tolerant routing; integrated hardware/software fault-tolerance.

CSC825- Advanced Software Engineering (3 Credits)

Requirement analysis, data abstraction software specification designs, complexity and testing strategies, reliability, project arrangement and documentation.

CSC826 –  Advanced Distributed Systems (3Credits)

Process and thread management: basic process model, scheduling, critical sections and 101erialization101n; mutual exclusion; concurrency: 101erializ concurrent activity starting with Java threads; forms of communications, architectures, means of communications – shared memory, direct communication between process; security threats, case study – Unix (fork processes, communication using signals, pipes, sockets, shared memory; distributed systems: client-server model, naming and binding, remote procedure call general principles, protection and security; Java remote method invocation.

CSC827 – Mobile and Adaptive Systems (3 Credits)

Introduction and overview; properties of wireless; PANs, LANs and WANs: Ad-hoc and infrastructure networks; physical constraints and limitations (transmission and reception), network structures and architectures, including

hand-off and mobility support at the physical/link level; example technologies at the physical/link layers: PANS – 101erializa, LANs – IEEE802.11, HiperLAN, basic GSM and GPRS network structures and protocol architectures, next generation wireless overview including UMTS, IMT- 2000 and W-CDMA; mobile IP: mobile Ipv4 and mobile Ipv6, problems with routing, quality of service and security; overview of use of intelligence in mobile systems and power management issues; file systems: CODA and the like and mobile infrastructure support. Adaptive and reconfigurable systems, mobile multimedia and its relationship to proxying, context sensitive applications, ubiquitous computing, pervasive computing and ambient networking, overlay networks and vertical hand-offs, programmable networking and applications for mobile systems, code mobility and control/signaling.

CSC 828 –Microprocessor in Automating System (3 Credits)

Microprocessor architecture;basic concepts of microprocessor, timing and sequencing, memory and I/O synchronization, data transfer, arithmetic and logic operations. Software development, assembler source programmes and pseudo instructions. Interrupts and DMA; interrupt structure, priority, FIFO buffers, DMA, microprocessors interface, parallel and serial interfaces; digital/analog conversion. I/O programming. Case studies of microprocessor based system in automation.

CSC829 – Computer System Performance Evaluation (3 Credits)

Performance evaluation methodologies; methods for evaluating computer/communications systems; analytical 101erializ using queuing theoretical approaches; simulation for performance evaluation; applying theoretical methods by 101erializ computer system components; case studies using analytic and simulation techniques.

CSC 831 Operation Research II      (3 Credits)

Decision trees with probabilities, inventory problems, sequencing models, computational complexity of sequencing, goal programming, utility concepts.

CSC 832 Advanced Numerical Computation II   (3 Credits)

The difference calculus. Application of difference calculus. Approximation of difference, equations and partial difference equations. Techniques of solving difference equations.

CSC 833  SURVEY OF PROGRAMMING LANGUAGES

Comparative study of organization and implementation of a variety of programming languages and language features. Design principles are explored and applied in a historical review of major languages. Procedural, functional, logic-based, object-oriented and parallel languages. Research issues such as polymorphism, formal semantics and verification explored in depth.