Documente Academic
Documente Profesional
Documente Cultură
Plan Study:
The BCS Program is divided into six semesters, each of seven weeks duration. Since each calendar year
comprises of two semesters, it can be considered a 3 years program. A tentative plan of study is given
below:
First Year:
Code Semester-I Cr. Hrs. Code Semester-II Cr. Hrs.
Humanities & Social
0101 English 3 0103 3
Sciences
0102 Pak. & Islamic Studies 3 1102 Calculus II 4
1101 Calculus I 4 1104 Physics II 4
1103 Physics I 4 1105 Probability & Stats. 4
Introduction to Comp.
2101 3 2102 Int. to Comp. Science 3
Programming
Total Credit Hours 17 Total Credit Hours 18
Second Year:
Code Semester-III Cr. Hrs. Code Semester-IV Cr. Hrs.
Statistical Method &
1201 Basic Electronics 4 1203 4
Inference
Linear Algebra & Diff.
1202 4 2203 Computing Method I 3
Equation
Data Structure &
2201 Digital Comp. Logic 3 2204 3
Application
Int. to Operating
2202 Discrete Structure 3 2205 3
System
Assembly Lang. & Theory of Automation
2206 3 2207 3
Programming Formal Languages
Total Credit Hours 17 Total Credit Hours 16
Third Year:
Code Semester-V Cr. Hrs. Code Semester-VI Cr. Hrs.
Information System
2301 3 2306 Software Engineering 3
Analysis
2302 Files & Data Base 3 2307 Data Communication 3
2308 Artificial Intelligence 3
2303 Computing Methods – II 3
2329 Algorithm 3
Topics in Computer
2304 Compiler Construction 3 2335 3
Science (java)
2315 Computer Graphics 3 2342 Computer Networks 3
Total Credit Hours 15 Total Credit Hours 18
Credit Hours:
One hour for formal lecture per week means one credit hour. For example a 3 hours
course means three hours of class work in a week.
0102-PAKISTAN STUDIES (SEMESTER
I)
OBJECTIVE
To enhance the student’s understanding and appreciation of the struggle of our forefathers
for the creation of Pakistan and the efforts to make Pakistan a progressive, dynamic Islamic
state:
COURSE OUTLINE
Pakistan studies course covers the following topics: historical view of South Asia before 1857.
War of independence 1857. Muslim League and Pakistan Movement, 1940 Resolution.
Negotiations with British Government, Declaration of June3, 1947. Inception of Pakistan
August 14, 1947, Political history beginning from October 1958. Economic progress during the
1960’s. East Pakistan crises and separation of East Pakistan. 1970’s short social and economic
decline. 1980’s short period; democratic governments, People of Pakistan, Smaller Provinces
and their Problems, Present social and economic position.
COURSE DETAIL
1. Historical Review of South Asia
Advent of Islam, Hindu reaction, Bhagti Movement, Din-e-Ilahi, Mujaddid-Alif-Sani, Saha
Waliullah, other Reformist Movements. War of independence 1857. Sir Syed Ahmed Khan and
Alighar Movement.
4. Political History
The objective Resolution, Islamic provisions of 1956, 1962 and 1973 Constitutions, Zia’s
measures for Islamisation. East Pakistan crises and separation of east Pakistan, Social and
Economic Decline During 1970’s, 1980’s short period of democratic Government.
5. People of Pakistan
Smaller Provinces and their Problems, Present Social and Economic position.
Recomende Books
I. I. H. Qureshi, Short history of Pakistan, Vol. IV, University of Karachi.
II. J. Hussain, History of the People of Pakistan, Oxford University Press, Karachi, 1998.
III. Gul Shahzad Sarwar, Pakistan Studies, Qamar Kitab Ghar, Karahi 1998.
Farooq Bajwa, Pakistan: A Historical and Contemporary Look, Oxford University Press,
Karachi, 2001.
1101-CALCULUS I (SEMESTER
I)
Books Recommended
1. Main text book: Calculus by Howard Anton, 6th Edition.
2. Supplementary: Advance Eng. Maths by Mater by E. Kreyzing, 7th Edition.
1103-PHYSICS (SEMESTER
I)
1. Vector Vector and Scalars, Vector Algebra, Scalar and Vector products,
del operator, Gradient, Divergence and Curl of Vector.
5. Electrostatics and Electric charges and Coulomb’s Law, Electric Field, Electric filed
Field concept due to various charge distribution, Electric dipole, flux of electric
filed, Gauss’s law and application, Electric potential.
6. Electromagnetic Induction Magnetic filed, Magnetic force on a current carrying loop and its
applications, Magnetic field due to current, parallel wires current,
Biot-Savart Law for a current element, Ampere’s Law, Solenoid
and Toroid, magnetic flux, Faraday’s Law and Lenz’s law,
inductance RL circuits, Energy and magnetic field, RC circuits.
8. Electrical condction in Electric current, current density, resistance and resistivity, Ohm’s
Conductors and law and its microscopic view, conduction in semiconductors.
Semiconductors
9. Network Analysis Sources of Electic current and emf, solving single and multi-loop
circuits, Norton’s, Thevenin’s and Superposition theorems.
Books Recommended
1. David Halliday, Robert Resnick and Jearl Walker, Fundamentals of Physics, (5 th ed.), John
Wiley and Sons.
2. Willimas P. Crummett and Arthar B. Westam, University Physics.
3. Douglas C. Giancoli, Physics-Principals and application, Prentience Hall, New Jersey.
4. Alanso and Finn, University Physics.
5. Joseph A. Edminister, Electric Circuits, Schaum’s Outline Series, McGraw-Hill International
Book.
2101-INTRODEUCTION TO COMPUTER PROGRAMMING (SEMESTER I)
Reference Books:
Deitel and Deitel (2000). C How to program. Prentice-Hall Inc.
Behrouz (2000). Computer Science: A structured programming approach using C.
Eric C Roberts (1994). The Art and Science of C (An introduction to Computer Science)
Herbert Schildt; Teach yourself C; McGraw Hill, USA.
John Gray, Brian Wondel (1995; Programming in C; Chapman & Hall, London, UK.
0103-HUMANITIES AND SOCIAL SCIENCES SEMESTER II
Books Recommended:
1. Burnes and Ralph, World Civilization.
2. Oxford University Press, Aspects of Muslim Civilization.
3. Cox, Greenblatt Seaberg, Human Heritage.
4. Louise Dudley, Austin Faricy and James G. Rice, The Humanities
5. Walter Wallbank, Arnold Schrier, History and Life (The World and Its People)II.
6. Geoffery Parker (ED.) World History.
7. Arnold J. Toynbee, A Study of History, Vol. 1 and 2.
Reference Books:
1. Abul Hasan Ali Nadvi, Islam in the World.
2. Henry S. Lucas, A Short History of Civilization.
3. Spears and S.M. Ikram, Cultural Heritage of Pakistan, Oxford University Press, 1955.
1102-CALCULUS II
SEMESTER II
1. Chapter 9 Complete Thoroughly. (Techniques of Integration except 9.6)
2. Chapter 7 Complete. Important emphasis given to Riemann sum and
n
methods of evaluating lim f ( x i )x i . First Fundamental
*
n
i 0
Books Recommended:
Calculus by Howard Anton, 6th Edition.
1104-PHYSICS II
SEMESTER II
1. Photoemission: photoelectric effect, Einstein photoelectric principle photoelectric effect
in types of photocells.
2. Photoconduction: Definition, Types of Photoconduction, Mechanism of Photoconduction,
Principles of Photoconduction.
3. Luminescence: Definition of Luminescence, Frank Condon Principles. Thermo-
Luminescence, Electro Luminescence.
4. Laser: Simulated Emissin, Maser and Laser, Different types of Laser, Laser application in
industry.
5. Opto-Electronics: Light Emitting diode, Laser diode, Photo multiplier tube (concept), PIN
diode, Solar Cell (Efficiency and different types), PN junction in solar cell.
6. Optical Fiber: Total internal reflection, construction of optical fiber, types of optical
fiber, Application losses of optical fiber (Material loss, Light scattering).
7. Superconductivity: What is Superconductivity? BCS theory types I and II (definition)
Superconductor, Meissner effect. Application and uses of super conductors (High field
magnets, switch and memory element) Introduction to HTC.
8. Semiconductor Diode Application: Half waves rectifier, Full wave rectifier, Power supply
filters, and Diode limiting and clamping circuits. Voltage Multiplier, Optical Diodes
(Chapter 2 up to 2.5, Chapter 3 up to 3.4, Electronics devices by Floyd).
9. BJT and FET Characteristics and Biasing:
a) BJT: Transistor construction, Basic transistor operation, Transistor characteristics and
parameters, transistor as an amplifier, transistor as a switch.
b) Transistor Bias Circuit: The DC operating point, Base Bias, Emitter Bias, Voltage divider
Bias, Collector feed back Bias. Small signal amplifier operation. Transistor AC
equivalent circuit, Common-Emitter amplifier, Common-collector amplifier, Common-
base amplifiers, Multistage amplifier. (Chapter 4 up to 4.5, Chapter 5 up to 5.5,
Chapter 6 up to 6.6, Electronic devices by Floyd)
c) FET: Junction Field Effect Transistor, JFET Characteristics and Parameters, JFET
Biasing, MOSGET, MOSFET Characteristics and Parameters, MOSFET Biasing (Chapter 8
up to 8.8, Electronics Devices by Floyd)
Reference:
1. Kittle, Charles, Introduction to Solid State Physics, John Wiley and Sons, New York,
1971.
2. Theraja, B.L., Basic Electronics, S. Chand and Company Ltd., New Delhi, 1993.
3. Floyd, Thomas L., Electronic Devices, Prentice-Hall International, Inc. 1999.
4. Halliday, David, Resnick, Robert and Krane, Kenneth S., Physcis, 4 th Edition, 2 Vols., John
Willey and Sons, Inc., New York, 1994.
During the meeting it has also been decided to have 50% multiple choice questions
and 50% subjective questions in the final examination of Physics II.
For Physics I course, network analysis will contain LCR circuits as given in Physics by
Halliday and Resnick and Thevinin’s and Norton’s theorems are not included in the
network analysis.
2102-INTRODUCTION TO COMPUTER SCIENCE SEMESTER
II
1. History and Evolution of Computer Science, Current definition (Preface & Ch. # 1- Ref. # 1)
2. C Language: Union, Interrupt calling, Graphics Programming, Advanced pointers, dynamic
memory allocation, function pointers.
3. Digital electronics and computer Architecture: Review of general concepts of number
systems. 1’s and 2’s complements, Addition and subtraction of numbers in different
system, Logic gates, truth tables, designing circuits using sum of the product method (Ch.
# 4-Ref. # 1, Et.)
4. Operating System: Definition, Components, Evolution, basics of process management
(FCFS, Shortest job first) and basic memory management techniques (including
introduction to virtual memory), file system (Ch. # 6-Ref # 1: Ch. # 3, Ch. # 8-Ref # 2)
5. Data Communication: Basics, transmission media, introduction to protocols, error
detection (Parity), error correction (Hamming codes/algorithm), OSI model (Ch. # 8-Ref #
1).
6. Software Engineering: Characteristics of a good software system, Software development
mythology, Fundamental design concepts and principles, structure design, Case study with
water Fall and model (Ch. # 10-Ref # 1; Ch. # 6-Ref # 2).
7. Abstract data type: Static and dynamic lists (insertion and deletion of operation), Stacks
(push and pop), Queues (Enqueue and Den queue), Maintained a link list of structures with
an arbitrary field as key field for this linked list. Examples of infix to postfix conversion of
expressions involving , , /, and all variables of one character each and all values
(numbers) of one digit each (Ch. # 11 & Ch. #13-Ref # 1).
8. Databases: Evolution and definition of DBMS, DB, DB system, Overview of top-down and
bottom-up approaches to DB design along with some simple case studies (Ch.# 12-Ref# 1:
Ch.# 9-Ref # 2).
9. Introduction to finite state machine (Mealy and Moore) State transition table, state
diagram. introduction to turning machine with examples of converting Mealy and Moore
machines and corresponding Turning machine (Ch.# 18-Ref# 1)
10. Overview of C++: Introduction to object-oriented programming, Principles of
encapsulation and information-hiding; classes and objects in C++ (Ref.# 3)
Reference:
5. John Impagliazzo and Ponf Naqin, Computer Science: A breadth-First Approach with C,
John Wiley and Sons, 1995.
6. J. Glenn Brookshear, Computer Science: An overview, The Benjamin/Cummings Publishing
Company Inc. USA, 1993.
7. Deitel, H.M. and Deiteal, P.J. C, How to program, Prentice Hall, New Jersey, 2001.
8. Kanetkar Yashvant, Understanding Pointes in C, BPB Publications, New Delhi, 1997.
9. Eric C. Robberts, The Art and Science of C (An Introduction to Computer Science),
Addison Wesley, 1994.
10. Alexender E. Quilici, The Joy of C, John-Wiley and Sons.
1201-BASIC ELECTRONICS (Semester III)
2. Logic Families
Book: Digital Electronics by R. Tokhiem, 3rd Edition
Chapter 3
4. Digital Communication
Book: Electronic Communication, Modulators and Transmission by ______ Edition,
Chapter: 15
(Note: This book may also be consulted for section 3 as well)
Note:
50% multiple-choice question and 50% subjective questions.
1202-LINEAR ALGEBRA AND DIFFERENTIAL EQUATION (Sem. III)
LINEAR ALGEBRA
1) Vector spaces: Linear combination and Linear dependence of vector, sub-spaces, spanning
sets, basis, dimention of a vector space.
2) Matrices: Algebra of matrices, special type of matrices, Rank and Nullity. Ad joint and
inverse of matrices, Elementry raw operations, Enchelon and reduced Echelon form, Rank
of a matrix.
3) Linear transformation. Mtrix of linear transformation.
4) System homogeneous and non homogeneous equation, Gauss elimination and Gauss Jordan
methods.
5) Determinants, Crammer’s rule.
6) Eigen Values and Eigen Vectors.
DIFFERENTIAL EQUATION
7) Formation of differential equation by elimination of arbitrary constant, General and
particular solutions. Intial and boundary value problems.
8) Equations of first order and first degree. Separation of variables, homogenous, exact
equations, Integrating factors, Linear and Bernoulli’s equations. Applications to
oscillations and electrical circuits. Orthoginal trajectors.
9) Second and higher order linear differential equation with constant coefficients.
Complimentry functions and particular integrals. Applications to oscillations and electrical
circuits.
10) Methods of undetermined coefficient and variation of parameter.
11) Cauchy Euler equations.
(Chapter 1, 2, and 3 of Kreyszing to be covered completely supplimented by Ross and
Yousuf)
12) Solution of system linear simultaneous differential equation by reduction to higher order
differential equation in one variable.
(Ex. 4.3 and 4.6 of Kreyszing)
Text Books:
Advanced Engineering Mathemetics, 7th Edition, Erwin Kreyszing, John Wiley and Sons.
Reference Books:
Linear Algebra, 6th Edition, Barnard Kolman, Prentice Hall.
Differential Equation, 3rd Edition, Shipley L. Ross, John Wiley and Sons.
Mathematical Methods, S. M. Yousuf.
2201-DIGITAL COMPUTER LOGIC (Semester III)
1. Boolean Algebra
a) Boolean Expression
b) Rules and Laws of Boolean Algebra and DeMorgan’s Theorem.
c) Boolean Expression for Gate Networks
d) Simplification using Boolean Algebra and Karnaugh Map.
2. Combinational Logic
a) Analysis and Design of Combinational Logic
b) Combinational Logic using universal Gates
3. Logic Functions
a) Address, Half Adder, Full Adder, Parallel Adder
b) Comparators, Decoders, Encoders, Multiplexers, Demultiplexers.
4. Counters
a) Design of Sequential Circuits (Asynchronous and Synchronous circuit)
Recommended Books
1) Floyed, Thomas L., Digital Fundamentals (5th Edition)
2) Tocci, Ronald J. and Neal S. Widmer, Digital System: Principals and Applications (7 th
Edition)
3) Malvino, Albert Paul and Jeral A. Brown, Digital Computer Electronics, Macmillan /
McGraw Hill Company.
1) Experimentally verify the operations and AND gates, OR gates and INVERTER.
2) Experimentally verify the operations of NOR gates and NAND gates.
3) Utilizations of the fundamental operations of BOOLEAN ALGEBRA in Logic circuit.
4) Experimentally verify the laws and theorem of BOOLEAN ALGEBRA and simplify the
Boolean expressions with the help of logic gates.
5) Study the operations of a BCS decoder.
6) Construct the a seven-segment display decoder circuit.
7) Use of seven-segment decoder with seven-segment LED’s.
8) Conversion of binary numbers through digital circuits.
9) Arithmetic operation by a proper combination of AND gates, OR gates and INVERTERS.
10) Construct Half-adder and Full-adder circuits.
Recommended Books:
Duoald P. Leach, Experiments in Digital Principals.
2202-Discrete Structures Semester III
1. Set Theory: Basic set operations, Cardinality, Product set, Relations, Partitioning of a set,
Equivalence relation, Partial ordering, Functions. (Chapter 3: Truss)
4. Propositional logic: Truth tables, Tautology and contradiction, Equivalent and contradictory
propositions, Representation of logical expressions as trees. (2.1: Truss)
5. Graph Theory: Undirected, directed and weighted graphs, Paths, cycles and loops.
Hamiltonian and Eulerian cycles, complete and bipartite graphs, Subgraphs, Graph
homomorphism,
6. Adjacency and incidence matrices, Trees, Reachability, Representation of algebraic
expressions as trees, Polish and reversed Polish forms. (Chapter 8: Truss, Chapter 2, 6.1:
Prather)
8. Finite state machines with output, Representation by transition diagram (3.8: Prather)
Text Books:
1. Discrete Mathematics for Computer Scientists, 2nd Edition, John K. Truss, Addison Wesley,
2000.
Reference Books:
1. Discrete Mathematics for Computer Scientists, R.E. Prather, Houghton Mifflin Company,
1976.
2. Discrete Mathematics and its Applications, K.H. Rosen, McGraw Hill, 2000.
2206-ASSEMBLY LAGNUAGE PROGRAMMING (Semester III)
1. Digital Compouyer Organizations
a) CPU
b) Memory
c) I/O Devices
d) Languages
e) Assembly Language Applications
2. Data Representation
a) Number system and conversion between number system
b) Signed and unsigned numbers
c) Bunary number’s arithmetic and Boolean system
3. Intel 16/32-bit Microprocessor architechture
a) Registers
b) Flags
c) Bus archtechtures
d) Machine instruction, Instruction Execution Cycle
e) Memory Mapping and Addressing techniques
4. Assembly Language Programming Fundamentals
a) Assembly language sytex
b) Basic instruction
c) Memory models
d) Data, stack, and code segments
e) Assembling, Linking and Debugging procedures
5. Variation and constant
6. The processor status and Flag register
7. Instructions
a) Data transfer instruction
b) Arithmetic instructions
c) Flow control instructions
d) Logic (Boolean) and comparison instructions
8. Floating point numbers
a) Representation
b) Arithmetic
c) Instructions
9. Stack and procedures
10. High Level Logic structures implemention assembly language
a) Simple and compound IF structure
b) While structure
c) Repeat-Unitl structure
d) Case structure
11. Interrupts
a) BIOS (0-1Dh) interrupts
b) DOS (20h-27h) interrupts
c) User interrupts procedures and TSR
12. Array and addressing modes
13. String operation and instructions
14. Macros
15. Disk storage
a) Characterstics (Directory structure, FAT, Sector)
b) System-Level function
c) Drive and Directory manipulation
16. File processing
a) File manipulation
b) File I/O services
c) Random file access
17. I/O ports instruction
Recommeded Books:
Assembly Language and programming By Kip R-Irvin
Assembly Language Programming By Utha Yu.
2203-COMPUTING METHODS I SEMESTER IV
Computer Architecture and Errors: Transaction Error, Round of Error, Error in original Data.
Propagated Error. Floating point architect, Actual Computer Number System. Architect
Accuracy in Computers. Absolute Error. Relative Errors. Significant Errors.
Solution of Non-Linear Equations: Bisection Method, Secant Method, Regula Falsi Method,
Fixed Point Iteration Method. Newton’s Method, Muller’s Method, QD Algorithm for
Polynomials.
Numerical Differences and Integration: Derivatives using differences table, Higher order
derivatives, Newton cotes Integration Formula, The Trapezoidal Rule, Simpson 1/3 and 3/8
rules.
Linear System of Equations: The Elimination Method, Gauss and Gauss-Jordan methods.
Books Recommended:
1. Applied Numerical Analysis (5th Edition) Curtis F. Gerald and Patrick O. Wheatley.
2204-DATA STRUCTURE AND APPLICATIONS SEMESTER
IV
Abstract Data Type: Introduction to ADT, Introduction to basic data structure, static and
dynamic lists. Stacks, queues, linked-lists, double linked-list, circular linked lists.
Searching: Linear searching, binary search, searching trade-offs, order of growth of binary
searching.
Sorting: Study and implementation of sorting algorithm, selection sort, insertion sort, merge
sort, quick sort, heap sort, external sorting.
Trees: Tree ADT, Beadth-first and depth-first traversal, Binary trees, Binary Search trees,
Inorder, Post-Order, Pre-order traversal, Height-balanced binary search trees.
Graphs: Graph ADT, Representation of graph, strongly connected graphs, spanning trees,
Minimal spanning trees, Shortest Path Algorithm, Traveling Salesman Problem (TSM).
Books Recommended:
Books Recommended:
Finites Automata: Finite State Automata, Kleene’s Theorem. Converting regular expression
into FA. Nondeterministic Finite Automata (NFA). Moore and Mealy Machines. Regular
languages. Pumping Lemma.
Turning Machines: TMs. Post Machines. Nondeterministic TM. Read-Only TM. Theory of
Recursive Function. Recursively enumerable languages. Universal Turning Machine.
Church’s Thesis, Chomsky Hierarchy, Complexity Classes.
Books Recommended:
Books:
1) System Analysis and Design Methods. Second Edition. Whitten. Bentley & Sons.
Books:
Hector Molina. Jaffery Ullman Et. (2001). Database System: The Complete Book.
Prentice Hall.
Catherine Ricardo (1996). Database System.
C.J. Date (1994). An Introduction to Database System. Narosa Publication House.
2303-COMPUTING METHODS II (SEMESTER-
V)
Error Analysis for Linear System: 1-, 2- and x-Norms of Vectors. Maximum columns row
sums, 2- and e-Norms of matrices. Effects of Round-off errors on solutions of system of linear
equation. Maximum column poviting. (Article, 2.8)
III. Conditioned System. Linear System Solver Machine. Condition Number and their use in
estimating relative error. iterative method of reducing Round-off errors in solution of linear
system. (Article, 2.9)
Iterative Method of Solving Linear System: The Gauss-Jacobi method and the Gauss-
Seidel method.
(Article, 2.10)
System of Non-Linear Equation: Using Bisection Newton Method for solving two non-
linear equations in two unknown. Using Taylors Series and partial derivative to solve the system
f ( x. y ) 0 and g ( x. y ) 0 (Article, 2.12)
Note: All article references given above are from the book no. 1 mentioned below.
Books:
“Applied Numerical Analysis”. C. F. Gerald & P. O. Wheatley. 5th Edition. Addison-Wesley.
“Numerical Analysis”. R. L. Burden & J. D. Faires 5th Edition. PWS publishing Co. Boston.
2304-COMPILER CONSTRUCTION (Semester V)
Review of concept of language and grammars. Direct graphs. Classifications of grammars. Uses
of regular expressions in designing lexical analyze. Use of finite state automata and push down
automata with regards to their connections to language definition.
Parsing: Top down Parsing. Concrete and abstract syntax. Recursive-descent parsing.
Management of symbol table.
Types system: Data types in language. Product types. Algebraic types. Arrow (function) types.
Parameterized type. Type checking algorithms. Static and dynamic typing.
Syntax detected translation: construction of syntax trees. S-attributed grammar. L-attributed
grammar. LL (I) grammar.
Code generation: Instruction selection. Single multiple pass code generation. Register allocation.
Books:
Alfred V. Aho Ravi Sethi. Jaffery D. Ullman. Compilers: Principals. Design and tools. Addison
Wesley Co.
P.M. Lewis H.D.J. Rosencrantz. R.E. Stearns (1978). Compiler design theory. Addison Wesley
publishing company.
Note:
THE ABOVE MENTIONED CATEGORIES CAN BE IMPLEMENTED USING ANY PROGRAMMING
LANGUAGE. SHORT PROGRAMMING ROUTINES CAN BE USED SEVERAL TIMES IN DIFFERENT
PROGRAMS. THESE ROUTINES WILL BE USED PROJECT IMPLEMENTATION (INTERNALLY).
2315-COMPUTER GRAPHICS
(SEMESTER-V)
Introduction to Computer Graphics: Applications, Line drawing and raster scan displays,
Drawing curves, n-gongs, roses, parametric representations of line, rays, circle, ellipses.
Raster Graphics: Features of raster graphics, World coordinate system, windows and
viewports. Mapping from a window t o a viewport.clipping a line Cohen Sutherland algorithm.
Clipping circles and ellipses. Clipping polygons.Bressenham line algorithm filling
reetengles.filling ellipses.filling polygons.reeursive flood-fill algorithm.introduction to Anti-
Aliasing techniques.
Mathematical Review: vector spaces and affined spaces. Vectors. Operations with vectors.
Dot product. Linear combination of vectors. Linear transformation.angle between two
vectors.point Normal form for a line and a plane.cross product.scalar Triple product.
Convex sets and convex Hults Algorithm.Line clippingto convex windows,finding normal to a
plane.Testing plsnarity of a polygon.finding normal to a polygon .testing convexity of
polygon.area of polygon.
Ray tracing intersection of a ray and a line. Intersection of a ray with circle. Parametric form
for surfaces.plane.cylinders.cones.guadric surfaces.
Books:
1. Francis S Hill jr (2000). Computer graphics using Open GL.prentics Hall inc.
2. James Foley and Andries van Dam ET (1996).computer graphics principles and practice 2nd
Edition. Appison Wesley Co. (USA).
3. Masom Woo. Jackie.Neider.Tom Davis and Dave shreiner (1999). Open GL programming
Guide. Addison Wesley Co.(USA)
2306 – SOFTWARE ENGINEERING:
Introduction
o A Communication Model
o Data Communication
o Data Communications and Networking
o Protocols ad Protocol Architecture
Data Communication
o Terminology
o Analogue and Digital Data Transmission
o Transmission Impairments
Transmission Media
o Guided Transmission
o Wireless Transmission
Data Encoding
o Digital Data – Digital Signals
o Digital Data – Analog Signals
o Analog Data – Digital Signals
o Analog Data – Analog Signals
Data Communication Interfacing
o Asynchronous and Synchronous Transmission
o Line Configuration
o Interfacing
Data Link Control
o Flow control
o Error Detection
o Error Control
o HDLC
o Data Link Control Protocol
Multiplexing
o FDM
o TDM (Synchronous)
o TDM (Statistical)
Protocols and Architecture
o Protocol
o OSI
o TCP / IP
Transport Protocol
o Transport Services
o Protocol Mechanism
o TCP
o UDP
Introduction to JAVA
Programs, Data, Variables, and Calculation
Loops and Logic
Arrays and Strings
Defining Classes
Extending Classes and Inheritance
Exception
Streams, Files and Stream Output
Stream Input, and Object Stream
Utility Classes
Threads
Creating Windows
Handling Events
Drawing In a Window
Extending the GUI
LABS: