SYLLABUS FOR LECTURER, COMPUTER ENGINEERING/ A.I.
/
AUTOMATION/COMPUTER SCIENCE / APPLICATION/ INFORMATION
TECHNOLOGY GOVERNMENT POLYTECHNICS
1. Algorithm and Problem-Solving Using C/C++
Introduction to Programs and Algorithms, Problem Solving Aspect (Algorithm Devising),
Algorithm Design Aspect (Top-Down Design). Algorithm Implementation Essential and Desirable
Features of An Algorithm. Basic Algorithms — Exchanging the Values of Two Variables.
Counting. Summation of a Set of Numbers, Factorial. Computation. Sine Function Computation.
Generation of the Fibonacci Sequence. Reversing the Digits of An Integer. Base Conversion, etc.
Flowchart: Generating Prime Numbers, Computing Prime Factors of An Integer, Generation of
Pseudo Random Numbers, Raising a Number to a Large Power, Computing the Nth Fibonacci
Number. Problems on Arrays Handling: Array Order Reversal, Array Counting, Finding the
Maximum Number in a Set. Removing Duplicate Elements from an Ordered Array, Partitioning
an Array. Merging. Sorting and Searching.
Program Design Using C/C++: Input-Output Processing, Data Types and Structure Data Types,
Control Structure, Conditional Statements and Loops. Implementations of Arrays and
Pointers/Linked List, Structure, Union, Enumeration and Files.
2. Digital Computer Design
Number System and Data Representation Binary, Octal, Decimal and Hexa-Decimal Number
Systems, Base Conversions, Binary Arithmetic, Complements: (R-1)'S and R’S Complement,
Subtraction Using Complements, Floating and Fixed-Point Representation, Binary Codes for
Decimal Digits: BCD Code, Error Detection Code, ASCII, EBCDIC Codes, Boolean Algebra and
Logic Gates: Boolean Algebra-Basic Definitions. Huntington’S Postulate, Switching Algebra,
Basic Theorems and Properties, Boolean Functions: Digital Logic Gates: Basic Gates - AND, OR,
NOT, Universal Gates, Simplification of Boolean Functions: Karnaugh Maps Method: Two
Variables K-Map. Three, Four and Five Variables K-maps, Product of Sum Simplification,
Combinational Logic: Design Procedure, Design of Half and Full Adder, Half and Full Subtractor,
Code Conversion, Decoders, Encoder, Multiplexers, De-Multiplexer, ROM and PLA, Sequential
Logic: Flip-Flops: RS Flip Flop, Clocked RS, JK Flip Flop, Master Slave JK FF, D Type FF, T
Type FF, Flip Flop Input Functions, FF, Characteristic Tables, Registers: Register With Parallel
Load, Shift Registers, Bidirectional Shift Register With Parallel Load, Serial, Addition Using Shift
Registers.
3. Discrete Mathematical Structure
Basic Structures: Set, Multi-Set and Sequences, Type of Sets, Set Operations, Relation, Functions,
Types of Functions, Inverse of a Functions, Compositions of Functions, Function Representation,
Sequences, Special Integer Sequences, Summations, Algebraic Structures: Groups, Rings, Vector
Space and their Applications, Equivalence Relation and Partial Order Relation, Equivalence
Classes and Partitions, Lattices and Topological Sorting, Logic, Reasoning and Inferences:
Foundations of Logic, Propositions. Conditional Statements, Bi-Conditionals, Truth Table,
Precedence of Logical Operators, De Morgan’s Laws, Quantifiers- Predicates, Quantifiers,
Universal Quantifiers, Variables, Logical Equivalences, Rules of Inferences, Valid Arguments,
Proof Techniques, Counting: Simple and Complex Counting Problems, Inclusion-Exclusion
Principle, Tree Diagrams, The Pigeonhole Principle, Permutations, Combinations, Binomial
Coefficients, Examples and Applications, Binomial Coefficients, Binomial, Generating
Permutations and Combinations, Graphs: Graph Models and Terminologies, types of Graphs,
55
