National Institute of Technology Srinagar


Back

COURSES OFFERED BY THE DEPARTMENT

 

   

Core Courses:

  1. Data Structures in C
  2. Advanced Data Structures and Algorithms
  3. Object Oriented Programming
  4. Database Systems
  5. Operating Systems
  6. Data Communication
  7. Computer Networks
  8. Software Engineering
  9. Computer and Internet Security
  10. Computer Architecture and Design
  11. Theory of Computation
  12. Programming Languages and Compiler Construction
  13. Advanced Compilation Techniques

 

3rd Semester Courses

- Object Oriented Programming

- Internet & Web Design

- Electronics

- Discrete Structures

- Electric Circuits

- Colloquium
 

 

 Electives:

 

  1.  Systems Programming
  2.  Telecommunication Switching Networks and Networks
  3.  Parallel  and Distributed Computing
  4.  Real Time Systems
  5. Combinatorial Mathematics
  6. Computer Graphics
  7. Expert Systems
  8. Queuing Systems theory
  9. Fault Tolerant Computing
  10. Pervasive Computing
  11. Advanced Architecture & Performance Evaluation
  12. Distributed Processing Systems
  13. Fault Tolerant System Design
  14. Local Area Network: Design and Implementation
  15. Devices, Data Communication and Control
  16. Application Driven Systems Design
  17. Recent Advances in Computing
  18. Digital Communication and Message Switching
  19. Software Architecture
  20. Artificial Intelligence
  21. Performance Analysis
  22. Machine Learning
  23. Symbolic Logic
  24. Multimedia Systems and Tools
  25. Image Processing
  26. Embedded Systems

 

1. Data Structures in C:

Outline:  Basic concepts of data, linear lists, strings, arrays and orthogonal lists; representation of trees and graphs; storage systems and structures; symbol table and searching techniques, sorting techniques; data structures in programming languages; data management systems; Storage Management

 

  • Introduction to Data Structures
  • Arrays
  • Recursion
  • Stacks
  • Queues
  • Linked List
  • Storage Management
  • Binary Trees
  • Tree traversals
  • Sorting and Searching

 

2. Advanced Data Structures & Algorithms:

Outline:

 

  • Sorting

            - Quick Sort –

                   Design & Elementary Analysis; Comparison of sorting techniques:        

                   Random Access / Sequential Access, Stability, Analysis; Randomization;

             Performance Improvements

-          Lower bounds on Comparison Sorting;  

-          Sorting by Distribution ( Bucket and Radix )

  • Searching
  • Abstract Data Types – Review. Implementation of ADTs – Example.
  • Hash Tables: Approaches;  Implementation Issues; Complexity & Efficiency;
  • Search Trees (BST); Trees; Balancing of Search Trees – AVL Trees;
  • Heaps:  Binary Heap - Priority Queues; Heap Sort
  • Trees:   Binary Trees & General Trees, Traversals & Visitor Pattern
  • Binary Tree Applications:

                - Heap - Multi-way Merge;

          - Huffman Coding (Greedy Algorithm)

§  Tree Traversals: Strategies - BFT vs. DFT,     Implementation: Stack vs. Queue. Applications (e.g. File System Commands; State Space Exploration (Games))

  • Recursive Data – Parse Trees; Recursive Descent Parsing; Backtracking.
  • Limitations of  Divide-and-Conquer (or top-down approach); Dynamic  Programming;  Memoization(Top-down vs. bottom-up)
  • Greedy Algorithms –     e.g. Fractional Knapsack 
  • Dynamic Programming –   e.g.  - (0,1) Knapsack
  • Graph ADT – Representation Issues;  DFT – Bi-connected Components and  Equivalence Classes.
  • Directed Graphs - Reachability; Strongly Connected Components; Closures; Dynamic Programming Algorithm (Floyd-Warshall)
  • DFT; Garbage Collection (Mark-and-Sweep)
  • Path Computations

      - Single Source Shortest Paths: Dijkstra’s Greedy algorithm

      - All-pairs shortest Paths: Floyd-Warshall’s DP Algorithm

  • Minimal Spanning Trees

      - Greedy Algorithms ( Kruskal’s & Prim’s & Baruvka’s)

  • Steiner Trees
  • Complexity - Decidability; - Tractability;  -  Polynomial Time Algorithms

    - Exponential

  • Complexity Classes – P, EXP; Non-determinism / Verification; Complexity Class – NP.  Example Problems in NP.
  • Is P=NP? Reductions; NP-hard & NP-Complete sets;  Coping with Intractable problems.
  • Approximation Algorithms; Exponential Decision Problems: Backtracking Design Technique;  Exponential Optimization Problems:
  • Branch-n-Bound Design Technique
  • Networking Algorithms: Computational & Complexity Model; Examples –   Leader Election;    Routing: Unicast, Broadcast; Multicast
  • Number Theoretic Algorithms:  - Euler’s GCD Algorithm    - Modular Exponentiation
  • Number Theoretic Algorithms:  - Primality Testing              - Cryptographic Algorithms  - RSA Encryption

 

 

3. Object Oriented Programming:

 

  • Principles of Object Technology
  • Fundamentals of Visual Modeling with UML: Business Modeling
  • Fundamentals of Rational Base
  • Object Oriented Analysis with UML
  • Object Oriented Design with UML
  • Object orientation concepts, theories and principles; fundamental concepts of the object model.
  • Classes, objects, methods and message passing
  • Abstraction
  • Encapsulation and inheritance, interface and implementation
  • Reuse and extension of classes
  • Inheritance and polymorphism

Ř  Process of object-oriented requirements specification

  • Analysis and design
  • Notations for object-oriented analysis and design
  • Case study and applications using some object oriented programming languages.

 

4. Database Systems:

Outline: Introduction  to  data bases and management; data files and structures; hierarchical, relational, network models; distributed data bases; query processing and query optimization, query languages; concepts of security and protection; case study of  a  data base system

  • Database Management Systems
  • Purpose of database systems
  • Data abstraction
  • Data models

-          Object Based Logical Models

§  The E-R Model

§  The Object-Oriented Model

-          Record Based Logical Models

§  The Relational Model

§  The Network Model

§  The Hierarchical Model

             -    Physical Data Model

  • Entity Relationship Model
  • Relational Model
  • MYSQL / Oracle
  • Other relational languages
  • Integrity Constraints
  • Relational Database Design
  • Object Oriented Databases
  • Object Relational Databases
  • Storage and File Structures
  • Indexing and Hashing
  • Query Processing
  • Distributed data bases;
  • Concepts of security and protection;
  • Case study of  a  data base system
  • Data Warehousing
  • Data Mining

 

 

5. Operating Systems:

Outline: Introduction to operating systems; Various approaches to design of operating systems; Overview of hardware support for operating systems; Process management: process synchronization and mutual exclusion, inter-process communication, process scheduling; CPU scheduling approaches; Memory management: paging, segmentation, virtual memory, page replacement algorithms; File systems: design and implementation of file systems; Input/Output systems; device controllers and device drivers; Security and protection; Case studies on design and implementation of operating system modules.

 

  • Computer Systems (Processor, Registers, Memory, I/O Techniques )
  • OS Overview ( Evolution, Achievements and Characteristics )
  • Processes, Description and Control, Process Management
  • Thread, SMTP, Micro-kernels, Multiprocessors.
  • Concurrency, mutual exclusion & Synchronization( software and hardware) – Semaphores
  • Deadlock and Starvation. Deadlock prevention, detection and avoidance. Dining Philosophers problem.
  • Memory management ( Requirements, partitioning , paging and segmentation)
  • Virtual Memory
  • Uniprocessor scheduling ( types of scheduling, scheduling algorithms)
  • Multiprocessor and real time scheduling
  • I/O Management & Disk scheduling
  • File Management
  • Distributed processing, client, servers and clusters.
  • Distributing process management
  • Computer Security.

 

 

6. Data Communication:

 

  • Data Communication Networks: Topology design issues, OSI-reference model, open system standards, service primitives, other architectures, Connection oriented and connection less services.  
  • Error Detection and Error correcting techniques, nature of transmission errors, error detecting codes, error correcting codes, retransmission techniques.
  • Multiplexing and de-multiplexing techniques viz, TDM and FDM
  • Circuit switching, Packet switching, Message switching  
  • Hybrid switching and ATM switching. Interface and standards- EIA  RS232C, 442, 449 and others, Modem specifications.             
  • Data link layer, LLC & MAC level protocols and design, issues IEEE 802 LAN Standards, framing, Error control, Flow control, HDLC, ALOHA and performance issues
  • Frame relay networks and performance parameters. LLC protocols.
  • Network layer design issues, Routing algorithms, Congestion control algorithm, Subnet concept, Virtual circuit and Datagram Subnet, Flow control, Internetworking, Bridges, Routers, Gateways and different level switches.  
  • Transport level Fundamentals of TCP/IP, addressing schemes  
  • ISDN systems, B-ISDN and ATM network fundamentals, Introduction of wireless network architectures, WATM, Network design issues, Fast Ethernet architecture and protocols.

 

7. Computer Networks:

Outline: Evolution of communication and computer networks, protocol layering, network reference models, multiple access protocols, local area networks, packet and circuit switching, switching fabrics, network performance analysis and simulation techniques; addressing, routing, flow and congestion control, IP protocol; Broadband Integrated Services Digital Network (B-ISDN); Asynchronous Transfer Mode (ATM) reference models; network interoperability, traffic management and quality of service in integrated network protocol design and implementation strategies.

 

§  Introductory Concepts & Overview

§  Fundamental Networking Concepts

§  OSI Reference Model & TCP/IP Protocol Stack

§  Basics of Data Communication at the Physical Layer.

§  Basic Internetworking Devices: Hubs, Repeaters, Switches, Bridges, Routers and Gateways

§  Application Layer Protocols: HTTP, DNS, SMTP, SNMP

§  Transport Layer Services & Principles

§  Multiplexing & De-multiplexing Applications

§  Connection Oriented & Connectionless Transport ( TCP & UDP)

§  Reliable Data Transfer

§  Congestion Control, Flow control

§  Network Layer Design Issues

-          Routing Algorithms

-          Internet Protocol (IP)

-          Subnets, CIDR

§  Data Link layer design Issues, Protocols

§  The MAC Sublayer & Allocation Issues

§  Ethernet

§  Wireless LANs

§  ARP and RARP

§  ATM

§  Multimedia Networking

§  Multicast and Unicast protocols ( ICMP, IGMP etc )

§  Ipv4 vs ipv6

§  Overview of IPSEC

                                                     

8. Software Engineering:

Outline: Software life cycle; requirements and tools; informal and formal specifications; design methodologies; structural and functional testing; models for reliability and cost.

 

  • What is Software Engineering?
  • Professional and Ethical responsibility
  • Emergent Systems Properties
  • Systems Engineering
  • Organisations, people and computer systems
  • Legacy systems
  • Critical systems
  • Software processes
  • Project management
  • Software Requirements
  • Requirements Engineering Processes
  • System  models
  • Critical System Specification
  • Formal Specification
  • Architectural Design
  • Distributed Systems Architecture
  • Application Architectures
  • Object Oriented Design
  • Real-time Software Design
  • User Interface Design
  • Rapid software development
  • Software reuse
  • Component based software engineering
  • Critical systems development
  • Software Evolution
  • Verification and validation
  • Software Testing
  • Critical Systems Validation
  • Managing People
  • Software Cost Estimation
  • Quality Management
  • Process Improvement
  • Configuration Management
  • Security Engineering
  • Service Oriented Software Engineering
  • Aspect Oriented Software Engineering.

 

9. Network and Internet Security:

Outline: This course examines issues related to network and
information security. Topics include security concepts, security attacks and risks, security architectures, security policy management, security mechanisms, cryptography algorithms, security standards, security system interoperation and case studies of the current major security systems.

  • Introduction
  • TCP/IP Protocols, Vulnerabilities, Attacks, and Countermeasures.  
    • ARP protocol and ARP cache poisoning
    • IP protocols, packet sniffering, IP Spoofing, IP fragmentation attacks.
    • ICMP protocol and ICMP misbehaviors.
    • TCP protocol, TCP session hijacking, SYN flooding attack, and TCP DoS attacks.
    • IP Routing protocols and Attacks.
    • DNS and attacks.
    • BGP protocols and Attacks
    • Port scanning and signature identification.
  • Basic Cryptography   

                  - Secret-Key Encryption

                  - Public-Key Encryption and PKI (Public-Key Infrastructure)

                  - One-way Hash Functions

                  - MAC (Message Authentication Code)

                  -  Digital Signatures

                  -  Diffie-Hellman Key Exchange

                  - Kerberos Protocol

  • Network Security Mechanisms
    • IPsec and SSL (Secure Socket Layer)
    • Virtual Private Networks
    • Intrusion Detection
    • Firewalls
  • Web Security
    • - SQL Injection Attacks
    • - Cross-Site Scripting Attacks
    • - Phishing and Pharming Attacks
    • Cookies

10. Computer Architecture and Design:

Outline: Memories  and  memory  module  design;  sample CPU design - instruction set, addressing modes, instruction formats, instruction fetching and execution; instruction and execution cycles, timing, realization  and  documentation;  floating  point  arithmetic operations, FPAU design; I/O devices and interrupt processing; special topics such as microprogramming & bus structures, simple design examples

  • Computer Abstractions and Technology

                  - Integrated circuits, chips

  • The Role of Performance

-          Measuring performance

-          Metrics

  • Instructions: Language of the Machine

-          Operations and Operands of the Computer Hardware

-          Representing Instructions in the Computer

-          Supporting procedures in hardware

  • Arithmetic for Computers

-          Signed and Unsigned numbers, addition , subtraction, logical operations

-          Constructing the ALU

-          Multiplication

-          Division

-          Floating Point

  • The processor: Data path and Control

-          Multicycle implementation

-          Microprogramming

-          Exceptions

  • Enhancing Performance with Pipelining

-          Pipelining, Data hazards, forwarding, branch hazards

-          Superscalar and Dynamic Pipelining

  • Memory Hierarchy

-          Caches

-          Measuring and improving performance of the Cache

-          Virtual Memory

  • Interfacing Processors and Peripherals

-          I/O Performance Measures

-          Types and Characteristics of I/O Devices

-          Buses

-          Designing and I/O System

  • Multiprocessors

                  -   Programming Multiprocessors

                  -   Multiprocessors connected by a simple bus/network

                  -   Clusters

                  -   Network Topologies

 

11. Theory of Computation:

Outline: Finite automata and regular languages – equivalences, closure properties. context free languages & push-down automata – equivalences, closure properties, concepts in parsing; turing machines; computability & decidability – universal turing machine, recursive functions, church-turing hypothesis; complexity classes – P, NP, reducibility and NP-completeness.

  • The complexity of Computations
  • Automata, Computability, Complexity
  • Mathematical Notions and Terminology
  • Definitions, theorems and proofs
  • Types of Proof
  • Automata and Languages – Finite Automata, Non determinism, Regular Expressions, Non regular languages
  • Context free languages – Context free grammar, push down automata, non-context free languages
  • Computability theory – Turing Machines, Variants of Turing Machines, The definition of Algorithm
  • Decidability
  • Reducibility
  • Advanced Topics in Computability Theory – Recursion theorem etc
  • Complexity theory – Time complexity, space complexity, intractability.
  • Advanced topics in Complexity theory – Algorithms ( Approximate, Probabilistic)
  • Alternation
  • Interactive Proof System
  • Parallel Computation
  • Cryptography

 

12. Programming Languages and  Compiler Construction:

Outline: Overview of programming languages concepts and constructs, programming paradigms; Introduction to compiler process, phases and passes, bootstrapping of compilers; Formal languages, grammars and abstract machines; Lexical analysis, regular expressions and finite automata; Context-free grammar and push-down automata; Recursive-descent, LL and LR parsers;
Semantic analysis, attribute grammar, type checking, intermediate representation; Run-time environments; Code optimization and code generation.

 

§  Computability & Programming. Machine models & Programming Language(s).

§   Execution models. Translation, Compilation, and Interpretation. Target architectures. Intermediate languages. Virtual Machines.

§  Structure and Components of a compiler. Phases vs Passes.

§  Compile-time versus Run-time. Bootstrapping

§  (Programming) Language Models; Partial Recursive Functions and Lambda Calculus

§  Programming Styles and Programming Language Paradigms.

§  Declarative (Functional & Logical) and Operational (Imperative and Object Oriented Paradigms)

§  Execution environments and Programming Language Paradigms

§  Lexical Analysis

§  Parsing – Predictive (top-down) parsing

§  Parsing – LR (bottom-up) parsing

§  Parse Tree; Abstract Syntax; Static Analyses

§  Types – Primitive and Structured Types; Function Types;

§  ADTs; Polymorphism; Recursive Types

§  Objects and Subtyping

§  Type Checking and Type Inferencing

§  Functions: Parameter Passing Techniques, Scope Rules, Binding Times, Higher Order Functions.

§  Runtime Memory Models - Call Stacks and Frames, Static and Dynamic Links

§  Runtime Memory Models – Data / Object Representation

§  Intermediate Representation; Intermediate Language

§  Code Generation – Instruction Selection

§  Code Generation  - Instruction Set Architecture

§  Data Flow Equations. Liveness analysis; Register Allocation

§  Garbage Collection

§  Architectural Issues and Compilers – Pipeling, Caching and Instruction Scheduling

 

13. Advanced Compilation Techniques:

 

  • Introduction and Motivation. Course Modalities.
  • Review of Compilation and Execution Models. Virtual Machines.
  • Overview of Optimizing Compilers & Optimization Techniques
  • Review of Runtime Support
  • Control Flow Analysis
  • Data Flow Analysis
  • Dependence Analysis
  • Alias Analysis
  • Global vs. Local Optimizations; Significance of Optimizations; Order of optimizations.
  • Common Sub expression Elimination
  • Loop Invariant Code Motion
  • Redundancy Elimination; Resuscitation; Code Hoisting
  • Loop Optimizations
  • Procedure Optimizations
  • Register Allocation
  • Code Scheduling
  • Low Level Optimizations
  • Optimization for the Memory Hierarchy
  • Virtual Machines; Interpretation vs. Compilation
  •  Just-in-Time Compilation – Issues & Techniques
  •  Optimization in JIT Compilers
  • Garbage Collection Techniques
  •  Case Studies

 

14.              Systems Programming 

Outline: Batch processing Systems programs; operating characteristics and limitations; parallel processing of I/O and interrupt handling, multiprogramming; multiprocessing systems; design of system modules and interfaces; other selected topics.

15.              Telecommunication Switching Systems and Networks

Outline:  Intoduction, electromechanical switching, pulse dialling and DTMF dialling, stored program control, space division switching, speech digitization and transmission, time division switching, fundamentals of traffic engineering, telephone networks, signalling, data networks, layered architecture and protocols, LANs, packet switching networks, TCP/IP, ISDN, ATM networks

 

16.              Parallel Computing 

Outline: Introduction to parallel computing; Models of parallel computers; Interconnection networks, basic communication operations; Introduction to parallel algorithms; Parallel programming paradigms; issues in implementing algorithms on parallel computers; Parallel programming with message passing interface; Performance analysis; Scalability analysis; Basic design techniques for parallel algorithms; Parallel algorithms for selected topics like sorting, searching and merging, matrix algebra, graphs, discrete optimization problems and computational geometry.

 

17.              Real – Time Systems

Outline: Introduction to real-time systems, clock synchronization, task assignment and scheduling, programming language with real-time support, ADA, real-time communication protocols, real-time databases, fault tolerant techniques, reliability evaluation methods; case studies in real-time operating systems, simulation of real-time systems, embedded system programming.

 

18.              Combinatorial Mathematics

Outline: Advanced theory of permutations and combinations; elementary counting functions; theory of partitions; theorems on choice including Ramsey's theorem; the mobius function; permutation groups; Polya's theorem  and Debrauijn's  generalisation;  graphical enumeration problems.

 

19.              Computer Graphics

Outline: Overview of computer graphics and graphic devices; two dimensional & three dimensional curve representations, rotations and transformations; surfaces, generation, representation, rotation and transformations; modelling techniques; concepts in geometric design. Generation of dots, lines, arcs and polygons; color graphics, shades and levels; image transformation, windowing and clipping; 2-D and 3-D graphics; data structures, algorithms and optimization methods; case studies using GKS, CORE, etc; graphic languages and compilers. Concept of an User Interface; User Interface Management Systems; Interaction Styles; Event-driven programming; graphical user interface components and examples; emphasis will be on programming in GUI environments like MS Windows.

 

20.              Expert Systems

Outline: Characteristics  and principles of expert systems; construction and transfer of expertise; meta-knowledge; tools and formalisms for expert systems; application through programs in prolog; state of art characteristics and principles of  authoring  systems; implementation techniques.

 

21.              Queueing Systems Theory 

Outline: Resource sharing issues and theory of queueing systems; Review of Markov chains and baby queueing theory; Method of stages. M/Er/1. Er/M/1. Bulk arrival and bulk service systems. Series-parallel stages. Fundamentals of open and closed queueing networks. Intermediate queueing theory: M/G/1; G/M/m. Collective marks. Advanced queueing theory: G/G/1; Lindley integral equation; spectral solution. Inequalities, bounds, approximations.

 

22.              Fault Tolerant Computing

Outline: Fault: types, modelling and simulation; testing methodologies, coverage, economics and quality; test vector generation: design for testability, built-in self tests; fault tolerant computing; fault tolerant software.

 

23.              Pervasive Computing

Outline: Select application architectures; hardware aspects; human-machine interfacing; device technology: hardware, operating system issues; software aspects, java; device connectivity issues and protocols; security issues; device management issues and mechanisms; role of web; wap devices and architectures; voice-enabling techniques; PDAs and their operating systems; web application architectures; architectural issues and choices; smart card-based authentication mechanisms; applications; issues and mechanisms in WAP-enabling; access architectures; wearable computing architectures

 

24.              Advanced Architecture and Performance Evaluation 

Outline: Introduction to advanced architectures; parallel processing; pipelining and vector processing; array processing; SIMD computers and processor enhancement; performance evaluation methods, statistics and discrete math applications; modelling for evaluation of virtual memory; time sharing environments.

 

25.              Distributed Processing Systems 

Outline: Concepts of distributed processing, network architectures, inter process and processor communication algorithms, process migration and porting techniques etc.

 

26.              Fault Tolerant System Design 

Outline: Principles of fault tolerant systems, redundancy, parallel and shared resources, spatial systems, configurations, design aspects etc.

 

27.              Local Area Networks: Design and Implementation

Outline: Introduction to Local Networks; carrier sense networks; shared memory and device systems; protocol and token passing techniques & algorithms; security and integrity problems; algorithms and implementation; and selected current topics.

 

28.              Devices, Data Communications and Control

Outline: Principles of operations of I/O devices; device handlers; master- slave control & controllers; intelligent mode of operation; device handlers; most popular data communication methods; synchronisation and handshaking; design of controllers for selected devices.

 

29.              Application Driven System Design 

Outline: General principles of application driven systems, examples from space and high speed digital imaging systems, Bandwidth considerations, design aspects etc.

 

30.              Recent Advances in Computing 

Outline: Introduction to transputing and transputers, minimization algorithms, design aspects. Neural networks modelling, simulation and design. Optical computing and recent advances.

 

31.              Digital Communications and Message Switching  

Outline: Signals & transmission types; noise; coding & decoding; modulation techniques; filters; time and frequency multiplexing; message switching; protocols; packet switching systems; remote networks; satellite linking communications.

 

32.              Software Architectures

Outline: Systems engineering and software architectures;  Hatley-Pirbhai architectural template; architecture flow diagrams; requirements engineering and software architecture; architectural design processes; design post-processing; real-time architectures; architectural design patterns; software architecture and maintenance management; object oriented architectures;  client-server architectures; forward engineering for object oriented and client-server architectures; emerging software architectures.

 

 

33.              Artificial Intelligence

Outline:  Introduction; Problem Solving; Knowledge and Reasoning; Acting Logically; Uncertain Knowledge and Reasoning; Learning; Communicating, perceiving and acting; practical natural language processing.

 

34.              Performance Analysis

Outline: Overview of Performance Analysis; Systematic Approach to Performance Analysis; Selection of Techniques and Metrics; Measurement Techniques and Tools; Types of Workloads; The Art of Workload Selection; Workload Characterization Techniques; Monitors; Program Execution Monitors and Accounting Logs; Capacity Planning and Benchmarking; The art of Data Presentation; Ratio Games;  Probability Theory and Statistics; Comparing Systems using Sample Data; Simple Linear regression models;  experimental design and analysis; Simulation; Queuing models.

 

35.              Machine Learning

Outline: Well poised learning problems; Designing a learning system; Perspectives and Issues in Machine  Learning; Concept learning and General to Specific  Ordering; Decision Tree Learning; Artificial Neural Networks; Evaluating Hypotheses; Bayesian Learning; Computational Learning Theory; Instance Based Learning; Genetic Algorithms; Learning Set of Rules; Analytic Learning; Combining Intuitive and Analytical Learning; Reinforcement Learning.

 

36.              Symbolic Logic

Outline: Default Reasoning; Formal Logic as a Knowledge Representation Scheme; First Order Logic; Non- monotonic Extensionsfor First order logic; Presentation of Default Logic; Formal Development of Default Logic; Normal Defaults; Fragments of Default Logic; Circumscription.

 

37.              Multimedia Systems and Tools

Outline: Essentials of networks, digital media, and software and systems architecture of the global information infrastructures. National trends and impact on society.

 

38.              Image Processing

 

39.              Embedded Systems