Survey of computers and information processing and their roles in society. This course introduces a historical perspective of computing, hardware, software, information systems, and human resources and explores their integration and application in business and other segments of society. Students will be required to complete lab assignments using the PC’s operating system, and several commonly used applications, such as word processors, spreadsheets, presentations, graphics and other applications. Internet and on-line resources, browsers and search engines.

Role of Algorithms in problem solving process, concepts and properties of Algorithms. Implementation strategies, Development of Flow Charts, Pseudo Codes. Program objects. Implementation of Algorithms in a programming Language - Visual BASIC/JAVA/C/C++

Introduction to problem solving methods and algorithm development, designing, coding, debugging and documenting programs using techniques of a good programming language style, programming language and programming algorithm development. C programming language should be used in teaching the above.

Overview of O/S: Role & Purpose, Functionality Mechanisms to Support Client-server models, hand-held devices, Design Issues influences of Security, networking, multimedia, Windows. O/S Principles: Structuring methods Abstraction, processes and of recourses, Concept of APIS Device organization interrupts.

The relationships between H/L languages and the Computer Architecture that underlies their implementation: basic machine architecture, assembles specification and translation of P/L Block Structured Languages, parameter passing mechanisms.

Primitive types, Arrays, Records Strings and String processing, Data representation in memory, Stack and Heap allocation, Queues, TREES. Implementation Strategies for stack, queues, trees. Run time Storage management; Pointers and References, linked structures.

Concurrency: States & State diagrams Structures, Dispatching and Context Switching; interrupts; Concurrent execution; Mutual exclusion problem and some solutions Deadlock; Models and mechanisms (Semaphones, monitors etc.) Producer – Consumer Problems & Synchronization. Multiprocessor issues. Scheduling & Despatching Memory Management: Overlays, Swapping and Partitions, Paging & Segmentations Placement & replacement policies, working sets and Trashing, Caching.

Principles of good programming, structured programming concepts, Debugging and testing, string processing, internal searching and sorting, recursion. C++ programming language should be used in teaching the above.

Computer circuits; diode arrays, PIAs etc, Integrated circuits fabrication process. Use of MSI, LSI and VLSI IC’ hardware Design. Primary and Secondary memories; core memory, etc. Magnetic devices; disks, tapes, video disks etc. Peripheral devices; printers, CRT’s, keyboards, character recognition. Operational amplifiers; Analog-todigital and Digital-to-analog converter. Analog computers

Basic Set Theory: Basic definitions, Relations, Equivalence Relations Partition, Ordered Sets. Boolean Algebra & Lattices, Logic, Graph theory: Directed and Undirected graphs, Graph Isomorphism, Basic Graph Theorems, Matrices; Integer and Real matrices, Boolean Matrices, Matrices med m, Path matrices. Adjacency Vectors/Matrices: Path adjacency matrix, Numerical & Boolean Adjacency matrices. Applications to counting, Discrete Probability Generating Functions

Structured Programming elements, structured design principles, abstraction modularity, stepwise refinement, structured design techniques. Teaching of a structured programming language etc.

Basic OOP Concepts: Classes, Objects, inheritance, polymorphism, Data Abstraction, Tools for developing, Compiling, interpreting and debugging, Java Programs, Java Syntax and data objects, operators. Central flow constructs, objects and classes programming, Arrays, methods. Exceptions, Applets and the Abstract, OLE, Persistence, Window Toolkit, Laboratory exercises in an OOP Language. Java programming language should be used in teaching the above.

: (3 Units) Fundamental building blocks, logic expressive immunization, sum of product forms. Register transfer notation, Physical considerations. Data representation, and number bases, Fixed and Floating point systems, representation memory systems organization and architecture. Memory system, general; characteristics of memory operation. (Technology magnetic recording semi-conductor memory, coupled devices, magnetic bubble). Memory addressing, memory hierarchy, virtual memory control systems. Hardware control, micro programmed control, Asynchronous control, i/c control. Introduction to the methodology of faulty tolerant computing.

System Concept; System Development Life Cycle Analysis: Fact gathering Techniques, data flow diagrams, Process description data modeling. System Design: Structure Charts, form designs, security, automated Tools for design

Numerical Computation, Graphical computation, Modeling and simulation, High performance computation

Automata theory: Roles of models in computation Finite state Automata, Push-down Automata, Formal Grammars, Parsing, Relative powers of formal models. Basic computability: Turing machines, Universal Turing Machines, Church’s thesis, solvability and Decidability.

Phases of operation Research Study. Classification of operation Research models, linear; Dynamic and integer programming. Decision Theory. Inventory Models, Critical Path Analysis and project Controls.

Student’s Industrial work experience of 6 months duration. Students reports will be presented in a seminar.

Basic algorithmic analysis: Asymptotic analysis of Upper and average complexity bounds; standard Complexity Classes Time and space tradeoffs in algorithms analysis recursive algorithms. Algorithmic Strategies: Fundamental computing algorithms: Numerical algorithms, sequential and binary search algorithms; sorting algorithms, Binary Search tress, Hash tables, graphs & its representation.

Review of compilers assemblers and interpreters, structure and functional aspects of a typical compiler, syntax semantics and pragatics, functional relationship between lexical analysis, expression analysis and code generation. Internal form of course programme. Use of a standard compiler (FORTRAN/COBOL/PL) as a working vehicles. Error detection and recovery. Grammars and Languages: the parsing problem. The scanner. Grammars and languages, recognizers, Top-down and bottom-up language Run-time storage Organization, The use of display in run-time storage Organization. The use of display in run time storage allocation. LR grammars and analysers. Construction of LR table. Organisation of symbol tablets. Allocation of storage to run-time variables. Code generation. Optimisation/Translator with systems

Overview of programming languages: History of programming languages, Brief survey of programming paradigms (Procedural languages, Object-oriented languages, Functional languages, Declarative – non-algorithmic languages, Scripting languages), the effects of scale on programming methodology; Language Description: Syntactic 75 Structure (Expression notations, abstract Syntax Tree, Lexical Syntax, Grammars for Expressions, Variants of Grammars), Language Semantics (Informal semantics, Overview of formal semantics, Denotation semantics, Axiomatic semantics, Operational semantics); Declarations and types: The concept of types, Declaration models (binding, visibility, scope, and lifetime), Overview of type-checking, Garbage collection; Abstraction mechanisms: Procedures, function, and iterations as abstraction mechanisms, Parameterization mechanisms (reference vs. value), Activation records and storage management, Type parameters and parameterized types, Modules in programming languages; Object oriented language paradigm; Functional and logic language paradigms. Language definition structure

Information storage & retrieval, Information management applications, Information capture and representation, analysis & indexing, search, retrieval, information privacy; integrity, security; scalability, efficiency and effectiveness. Introduction to database systems: Components of database systems DBMS functions, Database architecture and data independence use of database query language. Rational Databases: Mapping conceptual schema to relational Schema; Database Query Languages (SQL) Concept of Functional dependencies & MultiValued dependencies. Transaction processing; Distributed databases

Introduction to artificial intelligence, understanding natural languages, knowledge representation, expert systems, pattern recognition, the language LISP.

This course will prepare students for advanced research by examining how to plan, conduct and report on empirical investigations. The course will cover techniques applicable to each of the steps of a research project, including formulating research questions, theory building, data analysis (using both qualitative and quantitative methods), building evidence, assessing validity, and publishing. It will particularly focus on research involving software, developing statistical tools to measure software performance and the ways in which people interact with software tools.

Introduction, wares, Fourier analysis, measure of communication, channel characteristics, transmission media, noise and distortion, modulation and demodulation, multiplexing, TDM FDM and FCM Parallel and serial transmission (synchronous Vs analynchronous). Bus structures and loop systems, computer network Examples and design consideration, data switching principles broadcast techniques, network structure for packet switching, protocols, description of network e.g. ARPANET, etc.

Software Design: Software architecture, Design Patterns, O. O. analysis & Design, Design for re-use.
Using APIS: API programming Class browsers and Related tools, Component based computing. Software tools and Environment: Requirements analysis and design modeling Tools, Testing tools, Tool integration mech

Distributed Computing, Mobile & Wireless computing, Network Security; Client/Server Computing (using the web), Building Web Applications.

Hardware aspect, plotters microfilm, plotters display, graphic tablets, light pens, other graphical input aids Facsimile and its problems Refresh display refresh huggers, changing images, light pen interaction. Two and three dimensional transformation, perspective Clipping algorithms. Hidden line removal bolded surface removal. Warmock’s method, shading, data reduction for graphical input. Introduction to hand writing and character recognition. Curve synthesis and fitting. Contouring. Ring structures versus doubly linked lists. Elerarchical structures. Data structure: Organization for intersotive graphics.

Fundamentals of information technology law; Regulatory framework for e-governance; Electronic case management systems (for lawyers and courts); Cyber rights (expression, privacy and property), infringement and enforcement of laws on the internet; Offences under the cybercrimes (prohibition, prevention, etc) act, 2015 and compliance requirements for financial institutions; Practical guides in drafting and negotiating software licensing and software development agreements; Intellectual property rights in the online environment and digital rights protection/management; ICT litigation, digital evidence and computer forensics; Addressing jurisdictional and regulatory issues in internet transactions.

Foundations of HCI, Principles of GUI, GUI toolkits; Human-centred software evaluation and development; GUI design and programming.

Introduction: Definitions, Motivation; Communication Mechanisms: Communication Protocols, RPC, RMI, Stream Oriented Communication; Synchronization: Global State, Election, Distributed Mutual Exclusion, Distributed Transactions; Naming: Generic Schemes, DNS, Naming and Localization; Replication and Coherence: Consistency Models And Protocols; Fault Tolerance: Group Communication, Two And Three-Phase Commit, Check pointing; Security: Access Control, Key Management, Cryptography; Distributed File Systems: NFS, Coda etc.

Introduction to Cryptography and Block Ciphers, Confidentiality and Modular Arithmetic, Public key cryptography and Authentication requirements, Integrity checks and Authentication algorithms, IP Security and Key Management, Web and System Security

Students should embark on work that will lead to substantial software development under the supervision of a member of staff.