M.Sc. in Computer Science And Engineering (MCSE)

1. Programs of Study

The M. Sc. in Computer Science & Engineering program under the Department of Computer

Science and Engineering, Faculty of Science and Engineering, IIUC.

2. Objectives of the M. Sc. In CSE Program

The M. Sc. Program in Computer Science and Engineering is designed to produce engineers with ability to apply technical knowledge and skills with creativity. This Program will develop competence necessary for effective computing involving computer hardware and software as well as the research and analytical skills. One of the main goals of the program is to produce skilled professionals to satisfy the growing demands of Computer Engineers at home and abroad. By pursuing a M.Sc. degree in CSE, the students will get the opportunity to obtain a broad knowledge in the vast fields of Computer. Finally the program will provide some freedoms to the students to tailor according to their individual needs.

3. Degree Requirement

Students from academic discipline, other than CS/CSE or equivalent will be required to complete a maximum of 24 credit hours prerequisite courses in addition to the 36 credit hours mentioned above and hence need to complete 60 credit hours at maximum. The duration of the course may vary from three to six semesters depending on how many prerequisite courses a student has to undertake. Generally, students who have completed the prerequisite courses prior to admission should be able to complete the required program within three semesters.

The summary of the total credit hours (C.H.) for the M. Sc. Program are given below:

4. Duration of Studies

The minimum duration of the M.Sc. in CSE course shall normally be three semesters (for 36 credits) and 5 semesters (for 60 credits). A candidate for the Master’s degree must complete all the requirements for the degree within three academic years (for 36 credits) and four academic years (for 60 credits) from the date of the first admission in the program. A semester normally consists of 21 weeks of classes and 3 weeks of examination. Classes will be held in the evening and at weekends.

The summary of the total durations for the M. Sc. Program are given below:

5. Admission Requirements

The requirements for admission to M. Sc. Program in Computer Science & Engineering are:

1.Completion of 4 years B.Sc. in CSE degree from an approved university or an accredited institution of higher education.

2.Completion of 4 years B.Sc. degree with strong background of Mathematics from an approved university or an accredited institution of higher education.

3.The applicant must have the CGPA of 2.5 or above (in a scale of 4.0), or at least second class in the B. Sc. degree.

4.The applicant must have completed the enlisted prerequisite courses or their equivalent.

5.Applicant, who has not completed the enlisted prerequisite course, will be admitted on condition that he/she will complete these.

Evaluation of applicants for admission is based primarily on the student’s academic record in relevant undergraduate coursework. Applicants are expected to have sufficient knowledge in

undergraduate level mathematics and be familiar with common software Packages. Provisional

admission can be given to an applicant awaiting the result of his/her B.Sc. degree.

6. Evaluation System

6.1Course Work: Each course will be evaluated in the following way:

_______________________________________________________________

Total Marks100% Marks

For Final Examination (50 Marks):

a)Two question setters for each subject, Question must be moderated.

b)Two separate examiner for Group A, and Group B

c)Each Group (25 marks): Answer 2 questions out of 3, each question caries 12.5 marks

6.2 Project / Thesis

Marks distribution for projects/thesis and general viva-voce is as follows:

7. Uniform Grading System

The Grading System for evaluating the courses is as follows:

Program Outline

A: CSE Graduates: 36 Credits

Thesis or Project

Core Course for all (3 Courses, 3X3 = 9 Credits

List of Elective Courses:

a.Thesis based: Any 3 Courses, 3X3 = 9 Credits

b.Project based: Any 7 Courses, 3X7 = 21 Credits

B: Other Than CSE Graduates: 60 Credits

Prerequisite Courses (Graduates from Academic Discipline other than CSE or equivalent: Maximum 8X3 = 24 Credits)

design techniques; Digital logic circuit testing and testable design: testing of combinational and sequential logic circuits, design for testability and built-in self test; Digital logic simulation.

CSE6202: Advanced Microprocessor

Review of different microprocessors: 80486, 68040, V70, Gmicro processors; Comparing the

architectures: RISC and CISC; Instruction set of machines: SPARC, INTEL, and MIPS; Study of

microprocessors: Pentium II, Alpha 21064, MIS 6400, PA-RISC; Math coprocessors and microprocessors.

CSE6203: VLSI Layout Algorithms

VLSI design cycle, physical design cycle, design styles; Basic graph algorithms and computational geometry algorithms related to VLSI layout; Partitioning algorithms: group migration algorithms, simulated annealing and evaluation, performance driven partitioning; Floor planning and placement algorithms: constraint based floor planning, rectangular dualization and rectangular drawings, integer programming based floor planning, simulation based placement algorithms, partitioning based placement algorithms; Pin assignment algorithms; Routing algorithms: maze routing algorithms, line prob algorithms, shortest-path based and steiner tree based algorithms, river routing algorithms, orthogonal drawing based algorithms; Compaction algorithms: constraint-graph based compaction, virtual grid based compaction, hierarchical compaction; Algorithms for Multi-Chip Module (MCM) physical design automation.

CSE6211: Advanced Algorithms

Randomized Algorithms: Las Vegas and Monte Carlo Algorithms; Randomized Data Structures:

Skip Lists; Amortized Analysis: Different methods, Applications in Fibonacci Heaps; Lower

Bounds: Decision Trees, Information Theoretic Lower Bounds, Adversary Arguments;

Approximation Algorithms: Approximation Schemes, Hardness of Approximation; Fixed

Parameter Tractability: Parameterized Complexity, Techniques of designing Fixed Parameter

Algorithms, Examples; Online Algorithms: Competitive Analysis, Online Paging Problem, k-

comparison; Association analysis; Classification and prediction; Cluster analysis; Mining complex types of data; Applications and trends in data mining.

CSE6232: High Dimensional Data Management

Spatial database systems; spatial data types; indexing and querying spatial data; spatial networks; temporal database systems; moving object data management systems; moving object indexing techniques; query processing on moving object data; multidimensional indexing methods; similarity search; dimension reduction methods; time series data; indexing techniques for massive time series data; state-of-the-art systems for managing high dimensional data; emerging issues in high-dimensional data management systems.

CSE6233: Distributed Search Techniques

Large-scale distributed systems: properties and examples; search requirements in service discovery, peer-to-peer content sharing and distributed XML databases; unstructured techniques: intelligent flooding, hint-based routing, etc.; basic structured techniques: Chord, CAN, Tapestry, Kademlia, etc.; advanced structured techniques: pSearch, Squid, SkipNet, etc.; Signature search techniques using Bloom filters; Distributed Pattern Matching (DPM) problem and its applications; distributed crawling and indexing techniques.

CSE6234: Distributed Computing Systems

Distributed object systems, Retrieving and caching of distributed information, Distributed data replication and sharing, Performance issues, Algorithms for deadlock detection, Concurrency control and synchronization in distributed system, Models for distributed computation, Networking facilities and resource control and management methods in network and distributed operating systems, Collaborative applications, Wide area network computing, Web based commerce, Agent systems and Market based computing.

CSE6241: Information System Management

Information systems management: importance of information systems (IS) management, IS management's leadership role, strategic uses of IT, IS planning; managing essential technologies: distributed systems, managing telecommunications, managing information resources, and managing operations; managing system development: technologies for developing systems and management issues in system development; systems for supporting knowledge work: supporting decision making, collaboration, and knowledge works; acquisition of hardware, software, networks, and services: request for proposal, acquisition methods (buy, rent, or lease), software acquisition, and analysis of alternatives; people and technology: the challenges ahead.

CSE6242: Software Project Management

Foundations of software project management; organization structure and staffing; motivation, authority and influence; conflict management; proposal preparation; a large engineering software system management; client management; managing software project teams; project planning and scheduling; risk management; configuration management; pricing estimation and cost control; quality assurance and accreditation; factors affecting software quality; software quality assurance plans; business context and legal issues for software projects; software measurement: testing, upgrading and maintenance; network systems; and international project management.

CSE6243: Software Quality Assurance

Definition and concept of software quality assurance (SQA); quality models; specification of quality requirements; product development & delivery issues; software development processes & maturity; software quality management process: total quality management, improvement cycle, SQA planning & management, organizing the SQA effort; software verification & validation; typical software development errors; Fagan inspections; software audit; software testing: testing objectives & testing fundamentals, testing theory, coverage criteria, equivalence class testing, value-based testing, decision table, syntax & state transition testing, statement & path testing, branch & condition testing, data flow testing, thread-based testing, integration & integration

testing, system testing; testing in object-oriented systems; test tools & test automation; test management; problem reporting & corrective action.

CSE6244: E-commerce and E-Governance

Introduction to E-Commerce and E-Governance: Meaning & Concept, E-Commerce vs. Traditional Commerce, Media Convergence Business applications & Need for E-Commerce, E- Business. Basics of E-Commerce: Network and electronic transactions today structure of E- Commerce & E-Governance: Structure, Product and services of e-commerce, Advantages and disadvantages of e-commerce. The Internet & Extranet for E-Commerce: B2B, B2C transactions, providers and vendors, Identification & Tracking tools for E-Commerce, Overview of Internet Bandwidth & Technology issues. Security Framework: Security Concerns, Security Solutions – Symmetric & Asymmetric Cryptosystems, Digital Signatures for secure messaging, key management, E-Cash over the Internet. Historical background of e-government development, Current issues and trends in e-government, ways the Internet can improve government's responsiveness to its constituents. Legal Issues: Paper Document vs. Electronic Document, technology for authenticating electronic document, Laws for E-Commerce & E-banking, EDI interchange agreement, Legal issues for internet Commerce, Cyber Security, Cyber crimes, Issues: Ethics and social issues in the information age.

CSE6251: Network Security

Network security policies, strategies and guidelines; Network security assessments and matrices; Different attacks: Denial of Service attack (DoS), Distributed Denial of Service (DDoS) attack, Eavesdropping, IP spoofing, Sybil attack, Blackhole attack, Grayhole attack, Man-in-the-middle attack, Passwords-based offline attacks; Network security threats and attackers: Intruders, Malicious software, Viruses and Spy-ware; Security standards: DES, RSA, DHA, Digital Signature Algorithm (DSA), SHA, AES; Security at Transport layer: Secure Socket Layer (SSL) and Transport Layer Security (TLS); Security on Network layer: IPSec; Network security applications: AAA standards, e-mail securities, PGP, S/MIME; PKI smart cards; Sandboxing;

Firewalls and Proxy server; Security for wireless network protocols: WEP, WPA, TKIP, EAP, LEAP; Security protocols for Ad-hoc network; Security protocols for Sensor network; Security for communication protocols; Security for operating system and mobile agents; Security for e- commerce; Security for LAN and WAN; Switching and routing security; Other state-of-the-art related topics.

CSE6252: Wireless and Mobile Communication Networks

Characteristics of cellular communications; QOS in cellular communications; Wireless LAN; Wireless ATM and media access protocols for WATM; Wireless application protocols; Wireless personal communications; Mobile IP; Spread spectrum techniques: DSSS, FHSS, CDMA, GSM, CPDP; satellite communications – internetworking via satellites; Mobile satellite communications.

CSE6253: Wireless Ad Hoc Networks

Introduction: applications and motivations; broadcasting protocols: algorithmic aspect,

optimization techniques, power-efficient broadcasting;, routing protocols: DSDV, AODV, DSR, position based routing protocols, load balancing techniques, multi-path routing; medium access control protocols: reservation-based MAC protocols, Bluetooth technology, IEEE 802.11 based MAC protocols; channel propagation models; topology control protocols; power aware protocol design; cross layer design principles; mobility awareness; fairness and security issues: attacks and preventions; stimulating cooperation: self policing schemes, economic incentive based schemes; other state-of-the-art relevant topics.

CSE6254: Wireless Sensor Networks

Introduction: applications; Localization and tracking: tracking multiple objects; Medium Access

Control: S-MAC, IEEE 802.15.4 and ZigBee; Geographic and energy-aware routing; Attribute-

Based Routing: directed diffusion, rumor routing, geographic hash tables; Infrastructure

establishment: topology control, clustering, time synchronization; Sensor tasking and control: task-driven sensing, information-based sensor tasking, joint routing and information aggregation; Sensor network databases: challenges, querying the physical environment, in-network

propositional equivalences, Predicate and quantifier, Translating sentence into logical expressions. Function & Relation: Introduction to function, Some important functions, Properties of function, Rate of Growth: Big O Notation, Sequence and summation. Introduction to Relation, Representation of Relation, Properties of Relation, Composition of Relation, Equivalence Relations, Partition, Closures of Relation. Number Theory: Theorem of Arithmetic, Modular Arithmetic, GCD, LCM, Prime Number, Congruence, Application of Congruence, Application of Number Theory, Chinese Remainder Theory. Mathematical reasoning: Methods of Proof, Mathematical Induction, Recursion. Counting: Basic Counting principle, Inclusion-Exclusion principle, Application of Sum rule and Product rule, Pigeon hole principle, Permutation and Combination, Binomial coefficients, Recurrence relations. Graph: Graph terminology, Representation of graph, Graph Isomorphism, Graph connectivity, Euler and Hamilton paths, Shortest Path Problems, Planner Graphs, Graph coloring. Tree: Definition of Trees, Application of trees, Tree Traversal, Trees and sorting, Spanning trees, Minimum spanning trees.

Course code : CSE-5102

Course Title : Object Oriented Programming with Lab

Introduction: Fundamentals of OOP: Class: Default constructor, abstract class, final class and

static class. Object: Definition of an object, object model, relation between an object and a class. History of JAVA, Java Class Libraries, Introduction to Java Programming, Characteristics of OOP in context of JAVA(Encapsulation, Inheritance, Polymorphism), Local variable, global variable, Introduction to Java Control Structures. Thread: Use of a thread, different ways to get a thread, how to start a thread, special character of start method of the Thread class, Runnable interface. Packages & Interface: Creating Package, Definition of an interface, use of interface, contents of an interface, an abstract class can be used as an interface, Introduction to Java Common Packages. Applet: Life cycle of an applet, major events in the life of an applet, looping problem of init method, embedding an applet to a web page, paint method, repaint method. Event Handling: Event source, different kind of listeners, registering the listener. Layout Management: Container, component, flow layout, border layout, grid layout, Introducing AWT. Exception & Network Programming: Exception: Definition of exception, how to generate, throw and handle an exception, exception ducking, Networking: Socket, server socket, Client Socket, connection and communication between client and server. Input Output: Stream, input stream, output stream, character stream, byte stream, Reader & Writer classes to handle input and output, String handling. Advanced Features of JAVA: Java Beans, Servlets, Swing.

In Lab, experiments related to Theory will be performed.

Course code : CSE-5103

Course Title : Data Structures and Algorithms with Lab

Introduction: Elementary Data organization, Information; Data types; Data Structure, Data Structure operations; Algorithm; Time-Space tradeoff of Algorithms. Mathematical notation & Functions; Algorithmic Notation; Control structures; Sub-algorithms. String; String operations; Pattern matching algorithms Linear Array: Linear Array & its representation in memory;

Introduction: Database, data, database management system, Database system versus file system, Data model, Database language, Database user administration, Database system structure, Storage manager, Overview of Physical storage medium. Entity-Relationship Model: Entity sets, Relationship sets, Mapping Cardinalities, Keys, Attributes, Entity relationship diagram, Weak entity sets, Specialization, Generalization, Structure of Relational databases, Database Schema. The Relational Algebra and SQL: Selection, projection, Union, Set difference, Cartesian-product, Rename, Set-intersection, Natural-join, Division, Assignment, projection, Aggregate functions, Deletion, Insertion, Updating, Views, Nested sub-queries, Set membership, Set comparison. Integrity, Security and Relational Database Design: Domain constraint, Integrity, Assertions, Triggers, Authorization, Authentication, Security, Privileges, Roles, Audit trails, Encryption-Decryption Algorithm, Decomposition etc. Functional Dependency and Normalization: Functional Dependencies, Closure of a set of Functional dependencies. Un-normal Form (UNF), First Normal Form (1NF), Second Normal Form (2NF), Third Normal Form (3NF), Boyce and Code Normal Form (BCNF). Indexing and Hashing: Ordered indices, Hash indices, Hash function, Primary index, Secondary index, Dense, sparse, Multilevel indices, B+ tree index files, Handling Bucket Overflows, Overflow Chaining, Closed Hashing, Open Hashing, Linear probing, Hash indices, Dynamic Hashing. Transaction: ACID Properties, Transaction state diagram, Implementation of Atomicity and Durability, Shadow copy technique, Concurrent Execution, Serializability, Recoverability, Recoverable schedule, Cascade-less Schedules, Implementation in Isolation, Testing of Serializability.

Concurrency control, Recovery System and Distribute databases: Lock-Based Protocols, Granting of locks, Two-phase locking protocol, Graph based protocol, Tree protocol, Timestamp based protocols, Deadlock detection and recovery. Failure classification, Storage types, Checkpoints. Distributed data, Replication and Fragmentation.

In Lab, experiments related to Theory will be performed.

Course code : CSE-5105

Course Title : Digital Logic Design with Lab

Credit Hours: 3Contact Hours: 3 per Week

Bynary Systems, Bollean Algebra and Logic Gates: Number system, binary codes, binary logics, logic gates, boolean algebra, cannonical and standard forms.

Simplification of Boolean Functions: The Map Method. Two-, Three-, Four-, Five And Six- variable Maps, Product of Sum Simplification, NAND And NOR Implementation, Don’t Care Conditions, Multilevel NAND Circuits, Multilevel NOR Circuits, Exclusive-or and Equivalence Functions.

Combinational Logic: Design Procedure, Adders, Subtractors, Code Conversion, Analysis Procedure, designing various types of combinational circuit using logic gates.

Combinational logic with MSI and LSI: MSI and LSI, Binary Parallel Adder, look ahead carry, decimal Adder, Magnitude Comparator, decoder, encoder, multiplexer & demultiplexer. Sequential Logic: Flip-flops, triggering of flip-flops, analysis of clocked Sequential circuits, state reduction and Assignment, design procedure, design with state equations, designing various types of sequential circuits.

Digital Integrated Circuits: Bipolar transistor characteristics, RTL, DTL, Integrated-Injection logic, emitter couple logic, metal-oxide semiconductor, complementary MOS.

Registrars, Counters, and the Memory: Registers, shift registers, ripple counters, asynchronous counter, synchronous counter, memory, read only memory, programmable logic array, random access memory, memory unit.

Register Transfer and Processor Logic Design: Interregister transfer, arithmetic-logic and shift-operations, design a simple computer, processor organization, arithmetic logic unit, design of arithmetic logic unit, design of accumulator.

In Lab, experiments related to Theory will be performed.

Course code : CSE-5201

Course Title : Computer Architecture and Operating System with Lab

Information representation, Performance measurement. Instruction and data access methods. Arithmetic Logic Unit (ALU): arithmetic and logical operations floating point operations, ALU design. The control unit (Single cycle Data path) : hardwired and micro programmed. The control unit (Multiple cycle Data path) : hardwired and micro programmed. Hazard; Exceptions; Pipelining. Memory organization. I/O systems, channels, interrupts, DMA

Principle of operating systems and Operating system structure: Definition of operating system, Different kinds of operating systems (Desktop, Multiprocessor, Distributed, Clustered, Real time, Handheld systems), Operating-System Services, User Operating-System Interface, System Calls, Types of System Calls, System Programs, Operating-System Design and Implementation, Operating-System Structure, Virtual Machines

Process: process management, inter- process communication, Process scheduling, Process Concept, Operations on Processes, Inter process Communication, Communication in Client- Server Systems, Basic Concepts of Process Scheduling, Scheduling Criteria and Scheduling Algorithms. Multiprocessing and time sharing, Process coordination: Multiple-Processor Scheduling, Thread Scheduling, Algorithm Evaluation, Control and scheduling of large information processing systems, Resource allocation; Dispatching; Processor access methods; Job control languages. Deadlocks: Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery From Deadlock. Memory management: Background, Swapping, Contiguous Memory Allocation, Paging, Structure of the Page Table, Segmentation, Virtual memory: The idea and advantage of virtual memory, Demand Paging, Page Replacement, Page Replacement Algorithms (FIFO, Optimal

Protection, Domain of Protection, Access Matrix, Access Control, Revocation of Access Rights, The Security Problem, Program Threats, System and Network Threats, Cryptography as a Security Tool, User Authentication, Implementing Security Defenses, Fire walling to Protect Systems and Networks

In Lab, experiments related to Theory will be performed.

Course code : CSE-5202

Course Title : Computer Networks with Lab

Introduction: Definition, Uses of Computer Networks, Network Topology, Network Media,

Network Devices, Different Types of Network: LAN, MAN, WAN etc.

IP addressing: Classful IP Addressing, Subnetmask, CIDR, Private IP Address, Public IP Address, Subnetting, VLSM etc.

Network Model: OSI Reference Model, TCP/IT Reference Model, ATM Reference Model, Functions of the Layers of different models, Network Protocols working at different layers.

Data Link Layer Design Issues, Framing: Character Count, Byte Stuffing, Bit Stuffing, Error

Detection: Cyclic Redundancy Check, Parity Bit Checking, and Correction: Hamming Code. Windowing

Protocols: Go back N ARQ, Selective repeat ARQ, Elementary Data Link Protocols, High-level Data Link Control, Point to Point Protocol, The Medium Access Control Sub-layer.

Multiple Access: Random Access; ALOHA, CSMA, CSMA/CD, CSMA/CA,

Channelized Access; CDMA, TDMA, FDMA, Controlled Access; Rservation, Poling, Token Passing. Ethernet, Wireless LANs, and Bluetooth.

Switching: Circuit Switching, Packet Switching, Message Switching, Routing Algorithms, Virtual Circuit and Datagram, Congestion Control Algorithms, Quality of Service, Internetworking, Internetworking Devices etc.

Network Layer Protocols: Address Resolution Protocol, Internet Protocol, Internet Control Message Protocol, IPV6, Routing Information Protocol, Open Shortest Path First, Border Gateway Protocol, User Datagram Protocol, Transmission Control Protocol.

Network Security: Cryptography, Substitution Cipher, Transposition Cipher, One time Pads, Public Key Cryptography:RSA Encryption and Decryption, Authentication Protocol 1.0 to 5.0, Digital Signature, Key Distribution Center, Different symmetric Key Algorithm, Certificate Authority, DNS, Electronic Mail, World Wide Web.

Course code : CSE-5203

Course Title : System Analysis and Design with Lab

Concepts of system and its environment: Information, Types of information, Quality of information, System, Types of systems, Components of system, Source of information. Information gathering: strategy, Information searching methods, Interviewing technique, System development methodologies and life cycle. Feasibility study & Cost/Benefit analysis: Feasibility considerations, steps in feasibility analysis, feasibility report, Cost and Benefit categories, procedure for cost and benefit determination, classification of cost and benefit, cost and benefit evaluation methods. Tools of analysis and design: Data Flow Diagram(DFD), DFD symbols, Constructing DFD; Data Dictionary; Decision Tree, Structured English, Decision Tables. System Design and Construction: The process of design, System design phases, Design

methodologies; Structured design; Form-Driven methodology; Input design, Output design, File and database design, Testing and Quality Assurance: Testing, Types of system tests; White- Box testing; Black-box testing; Quality factors specifications. Implementation and Maintenance: Types of implementation, Documenting the system, Training and supporting users, Factor models of implementation success; The process of maintaining information system, Types of maintenance, Cost of maintenance, Reducing maintenance cost. Hardware/ Software selection, control and security: Phases in selection, Criteria for software selection, Hardware selection, Financial considerations in selection; Security definitions, Threats to system security, Control measures, system failures and recovery.

In Lab experiments related to Theory will be performed.

Course code : CSE-5204

Course Title : Artificial Intelligence with Lab

Concepts of Artificial Intelligence: Introduction, The Foundations of AI, The History of AI, AI

technique, The State of the Art; Problems and Problem Solving: Problems, Example of Problems, Problem Formulation, Problem-solving methods.

Various Searching Techniques: Search Strategies, Uninformed (blind) search strategies like Breadth- First search, Uniform cost search, Depth-First Search etc. and Informed or Heuristic Search Strategies like Generate-and-test, Hill Climbing, Best-First Search, Problem Reduction, Constraint Satisfaction, Means-End Analysis etc.

Propositional and First-Order logic: Knowledge Representation, Reasoning and Logic; Propositional

Logic: Syntax, Semantics, Validity and Inference, Rules of Inference for Propositional logic; First-Order

Logic: Syntax and Semantics, Using first-order logic.

Inference in first order logic: Inference Rules Involving Quantifiers, Example Proof, Generalized Modus Ponens, Forward and Backward Chaining, Completeness, Resolution.

Game playing: Introduction, Perfect Decisions, Imperfect Decisions, Alpha-Beta Pruning; Natural

language processing: Introduction, Syntactic Processing, Semantic Analysis, Discourse and Pragmatic Processing.

Planning: Basic Plan-Generating Systems, Forward Production System, Representation for Plans, Backward Production System, STRIPS, Examples with problem domain;

Learning: Introduction to Learning, Inductive Learning, Learning Decision Trees, Neural Net Learning;

Probabilistic Reasoning: Probability and Bayes’ Theorem, Certainty Factors and Rule-Based

Systems, Bayesian Networks, Fuzzy Logic; Some Expert Systems: Representation and Using Domain Knowledge, Expert System Shells, Explanation, Knowledge Acquisition.

In Lab experiments related to Theory will be performed.