B.A. / B. Sc.

 

B.A. / B.Sc. (Computer Science) Course Outlines

 

Paper – I
FUNDAMENTALS OF DIGITAL COMPUTERS

Introduction to Computers. Early history of Computers. Types and Generations of Computers. History of Data Processing. The need for Information processing. History of recording Techniques. Concepts’ of Hardware, software, and Firmware systems. The date processing Cycle. Organization of typical, microcomputer. Devices (Input / Output) and Peripherals of Computers. The central processing unit and Memories.

Number systems, Binary, Octal, Decimal and Hexadecimal number systems, and their Conversions from one to another number system, addition, Subtraction, Multiplication and Division of Binary, Octal, and Hexa decimal number systems, One’s Complement, Two’s Complement.

Concepts of Binary Logic Gates, AND gate, OR gate, NOT (Inverter) gate, NAND gate, NOR gate, Exclusive OR gate, gate, Exclusive NOR gate, Concepts of Boolean Algebra, Constructing circuits from Boolean expressions, MAX term Boolean expression, MIN term Boolean expression, Simplifying Boolean Expression using KARNAUGH Map with three variables. 
Code, Encoding, decoding, The 8421 BCD Code, The Excess-3 Code, The Gray Code. Flip- flop, The J-K Flip Flop.

Arithmetic Circuits, Binary Adders, Adders, Half Adder, Full adder, Three Bit adder, Buttery Subtractions, Parallel Subtraction,

BOOKS FOR REFERENCE:
1. Roger L. Tokheim : Digital Electronics (II Edition). McGRAW HILL Book Company, 1984.

2. N. Subramnian : Introduction to Computers. TATA McGRAW HILL Book Company, 1988.

3. T. C. Bartee : Digital Computer Fundamentals (Fourth Edition). McGRAW HILL Book Company 1984.

4. A. P. Malvino : Digital Computer Electronics (Second Edition). An Introduction to Microcomputers. McGRAW HILL Book Company, 1984.

5. Tremblay, Bluntum : Introduction to Computer Science. McGRAW HILL Book Company, 1984.

Paper-II 
ALGORITHMS AND PASCAL PROGRAMMING

Introduction to Computer Applications, Introduction to Computer Programming, Problem Analysis and Algorithm Development, Introduction to Flow Charting, Flow Chart symbols, Algorithm Logic design using Flow Charts, Three Algorithm Components, Sequential Flow, Conditional Flow, Repetitive Flow.

Data Typology, Types of Data, Declaration of Unstructured variables, Constants and Variables, Boolean data type, Character data type, User defined Scalar Data type, Integer data type, Real data type, BEGIN – END statements, Arithmetic operators, Logical operators, Arithmetic and Logical Expressions Input/Output statements, Flow Control Statements, FOR – DO statements, IF – THEN – ELSE Statements, Nested IF – Statements, Looping and branching, FOR – Do statements, WHILE – DO statement, and REPEAT – UNTIL Structures, Nested WHILE – DO statement, CASE – END statement, GOTO statement.

Concepts of ARRAYS, Single and Multiple Dimensional arrays, Concepts of Subroutines, Functions and Procedures, Recursive Procedures, File Processing.

Concepts of Top Down Structured Programming, Top Down program Logic, structured program Logic, Concepts of Modular programming.

BOOKS FOR REFERENCE:
1. Byron S. Gottfried : Programming with PASCAL 
McGRAW HILL Book Company, 1986.

2. Johan Konvalina, : Programming with PASCAL 
Stanley Wileman McGRAW HILL Book Company, 1987.

3. George W. Cherry : PASCAL Programming Structures Reston
Publishing Company, Inc.


PRACTICAL – I

Thirteen practicals covering all features of PASCAL language with program algorithms. (20 marks)
Viva – Voce (10 marks)

Paper – III
INTROUCTION TO COMPUTER SCIENCE

Introduction to Computer Science, Overview of different programming languages, Principles and techniques in high level language programming, Data Storage, Main Memory, Bulk Storage, Data Manipulation, Arithmetic/Logic instructions.

Concept of Operating System and Utility Software’s, Functions of Operating systems, Virtual characteristics, The Evolution of Operating systems, Operating system Architecture, Program Execution, Batch Processing Interactive Processing, multi-user System, Time sharing, Multi tasking and Multi Processing.

Concepts of Software engineering, Concepts of Data Structures, Use of Arrays, Link Lists, Trees, Data Flow Diagrams, Concepts of File Structure, Sequential Files, Indexed Files, Hashed Files, Concepts of Database, Types of Databases, Relations Design and Operations, Network Design and Operations, Hierarchical Design and Operations.

BOOKS FOR REFERENCE:
1. Gorden I. Devis : Computer Data Processing. McGraw HILL Book Company, 1987.

2. A. B. Tucker : Programming Languages, McGraw HILL Book, Company, 1986.

3. Madnick : Operating System. McGraw HILL Book Company, 1988.

4. J. G. Brookshear : Computer Science An Overview Second Edition. The Penjamin/Comings Publishing Company.

5. J. Glenn Brookshear : Computer Science, An Overview, Second Ed. The Benjamin/Cummings Publishing Co. Inc.

Paper – IV
COMPUTING METHODS, SYSTEMS ANALYSIS AND DESIGN

SECTION A: (2 questions to be attempted)
Introduction to Numerical Computing, Concepts of estimation to errors, Relative and Absolute errors, Truncation errors, Roundoff errors, error propagation.

Finite differences, Differences Operators, Interpolation, Newton. Forward and Backward Formula for interpolation, Calculation of errors in Newton Forward and Backward formula, Polynomial approximation, Lagrange’s formula of interpolation, Calculation of error in Lagrange’s formula, Divided differences, Newton’s interpolation formula for divided differences.

Numerical solution of non-linear algebraic equations, Half interval method, Regula falsi (False position) method, Newton Raphson method, Secant method.

SECTION B: (3 questions to be attempted)

Introduction to systems analysis, Definition of systems and procedures, Definition of systems analysis, Characteristics of a system, Feasibility study, Types of feasibility study, Problem definition, The problem reporting machinery, Definition of Subject, Scope and Objectives, Outline of the systems study, Study techniques and planning, structure of the organization, Interactions between outputs, inputs and resources, Understanding the existing requirements.

Define the new systems requirements, Long-range plans, Evaluation criteria for the new systems, Designing the new systems, Computerized systems design, General concepts of cost analysis, The tools of systems analysis, Flow charts, Gantt charts, Decision table, Organization chart, Work distribution chart, Data flow charts, PERT/CPM.

BOOKS FOR REFERENCE: 
1. Carl Erik Froberg : Introduction to Numerical Analysis. Second Edition Addison Wesley Publishing Co.

2. Shan S. Kuo : Computer Application of Numerical Methods National Book Foundation, Islamabad.

3. William S. Dorn & Daniel D. McCracken
: Numerical Methods with Fortran IV Case Studies.

4. Don Yates : Basic Systems Analysis ELBS, USA, 1988.

5. J. Race : A Professional Guide to Systems Analysis McGraw Hill Book Company, 1988.

PRACTICAL – II

SECTION A : (10 marks)
Six practicals covering all the methods of Approximation and Error estimation with program algorithms using PASCAL Programming Language.

SECTION B : (10 marks)
Seven practicals covering all the features of databases with program algorithms.
Viva Voce : (10 marks)