DISCRETE STRUCTURE [CT 551] - SYLLABUS

DISCRETE STRUCTURE [CT 551] - SYLLABUS
Lecture : 3 Year : II
Tutorial : 0 Part : II
Practical : 0

Course Objectives:
To gain knowledge in discrete mathematics and finite state automata in an algorithmic approach.
To gain fundamental and conceptual clarity in the area of Logic, Reasoning, Algorithms, Recurrence Relation, Graph Theory, and Theory of Automata.

1. Logic, Induction and Reasoning (12 hours)
1.1. Proposition and Truth function
1.2. Propositional Logic
1.3. Expressing statements in Logic Propositional Logic
1.4. The predicate Logic
1.5. Validity
1.6. Informal Deduction in Predicate Logic
1.7. Rules of Inference and Proofs
1.8. Informal Proofs and Formal Proofs
1.9. Elementary Induction and Complete Induction
1.10. Methods of Tableaux
1.11. Consistency and Completeness of the System

MICROPROCESSORS [EX 551] - SYLLABUS

MICROPROCESSORS [EX 551] - SYLLABUS
Lecture : 3 Year : II
Tutorial : 1 Part : II
Practical : 3

Course Objective:
The objective of the course is to familiarize students with programming, hardware and application of microprocessor.

1. Introduction   (4 hours)
1.1 Introduction and History of Microprocessors
1.2 Basic Block Diagram of a Computer
1.3 Organization of Microprocessor Based System
1.4 Bus Organization
1.5 Stored program Concept and Von Neumann Machine
1.6 Processing Cycle of a Stored Program Computer
1.7 Microinstructions and Hardwired/Microprogrammed Control Unit
1.8 Introduction to Register Transfer Language

DATA STRUCTURE AND ALGORITHMS [CT 552] - SYLLABUS

DATA STRUCTURE AND ALGORITHMS [CT 552] - SYLLABUS
Lecture : 3 Year : II
Tutorial : 0 Part : II
Practical : 3

Course Objectives:
To provide fundamental knowledge of various data structures and their implementation
To provide the fundamental knowledge of various algorithms and their analysis

1. Concept of data structure (2 hours)
1.1 Introduction: data types, data structures and abstract data types
1.2 Introduction to algorithms

2. The Stack and Queue (6 hours)
2.1 Stack  operation
2.2 Stack application: Evaluation of Infix, Postfix and Prefix expressions
2.3 Operations in queue, Enqueue and Dequeue
2.4 Linear and circular queue
2.5 Priority queue