KALPI INSTITUTE OF TECHNOLOGY KALPI (AMBALA) Syllabus Scheme Subject: Thermodyanamics Semester: 3th(Mech.) Syllabus to be covered Code No.

ME-201E Apprx. No. of Hours (lect.) Cumulative hours Sessiona l

Sr. No. I

(unit 1) 1. Basic concepts,macroscopic and microscopic approach,Thermodyanamic properties,intensive and extensive,equilibrium. 2. State,path,process and cycle,Quasistatic, reversible and irreversible processes. 3. Concept of Thermodynamic, Work and Heat, Equality of Temperature, Zeroth Law of Thermodynamic and its utility. 4. Ideal and Real Gases: Concept of an Ideal Gas, Basic Gas Laws, Characteristic Gas Equation, Avagadros law and Universal Gas Constant, P-V-T surface of an Ideal Gas. 5. Vander Waals Equation of state, Reduced Co-ordinates, Compressibility factor and law of corresponding states. Mixture of Gases, Bass, Mole and Volume Fraction, Gibson Daltons law, Gas Constant and Specific Heats, Entropy for a mixture of Gases (unit 2) 1. First Law of Thermodynamics: Energy and its Forms, Energy and 1st law of Thermodynamics, Internal Energy and Enthalpy. 2. 1st Law Applied to Non-Flow Process, Steady Flow Process and Transient Flow Process, Throttling Process and Free Expansion. 2 2 2 3 1-2 3-4 5-6 7-8-9 1st Sessiona l

10-11-12

2 2

13-14 15-16

Write II

(unit 2) 3. Second Law Of Thermodynamics: Limitations of First Law, Thermal Reservoir Heat Source and Heat Sink, Heat Engine, Refrigerator and Heat Pump. 4. Kelvin- Planck and Clausius Statements and Their Equivalence, Perpetual Motion Machine of Second Kind. 5. Carnot Cycle, Carnot Heat Engine and Carnot Heat Pump, Carnots Theorem and its Corollaries, Thermodynamic Temperature Scale. (unit 3) 1. Entropy:Clausius Inequality and Entropy, Principle of Entropy Increase, Temperature Entropy Plot, Entropy Change in Different Processes, Introduction to Third Law of thermodynamics. 2. Availability, Irreversibility and Equilibrium: High and Low Grade Energy, Availability and Unavailable Energy, Loss of Available Energy Due to Heat Transfer . 3. Availability of a Non-Flow or Closed System, Availability of a Steady Flow System, Helmholtz and Gibbs Functions, Effectiveness and Irreversibility.

3 2

17-18-19 20-21 2nd Sessiona l

22-23-24

25-26-27

28-29-30

31-32-33

III (unit 4) 1. Pure Substance: Pure Substance and its Properties, Phase and Phase Transformation. 2. Vaporization, Evaporation and Boiling , Saturated and Superheat Steam, Solid Liquid Vapour Equilibrium, T-V, P-V and P-T Plots During Steam Formation. 3. Properties of Dry,Wet and Superheated Steam, Property Changes During Steam Processes, Temperature. 3 3 3 34-35-36 37-38-39 40-41-42 3nd Sessiona l

COURSE FILE FOR

UNIX & LINUX PROGRAMMING CSE-471

(SESSION-2011-2012)

Manmeet Singh

KALPI INSTITUTE OF TECHNOLOGY KALPI (AMBALA)

COURSE FILE FOR

ARTIFICIAL INTELLIGENCE CSE-445 (SESSION-2011-2012)

Manmeet Singh

KALPI INSTITUTE OF TECHNOLOGY KALPI (AMBALA)

KALPI INSTITUTE OF TECHNOLOGY KALPI (AMBALA) Syllabus Scheme Subject: Artificial Intelligence Semester: 7th Syllabus to be covered Code No. CSE-445 Apprx. No. of Hours (lect.) Cumulative hours Sessiona l

Unit No.

Introduction : (unit 1)
1. Definition of (A.I), Evolution of computing, history of AI, classical Romantic and modern period, subject area, architecture of A.I machines, logic family, classification of logic. Production system: 2. Production rules, the working memory, recognize-act cycle, conflict resolution strategies. 3. Refractoriness, specify alternative approach for conflict resolution by Meta rules, Architecture of production system. Propositional logic: (unit 2) 1. Proposition, tautologies, theorem proving, semantic method of theorem proving, forward chaining, backward chaining standard theorems, methods of substitution. Theorem proving using Wangs algorithm Predicate logic: 2. Alphabet of first order logic(FOL), predicate, well formed formula, clause form, algorithm for writing sentence into clause form, unification of predicates unification algorithm, 3. Resolution Robinsons interface rule, scene interpretation using predicate logic. Default and Non monotonic Logic: (unit 3) 1. Axiomatic theory, Monotonicity, nonatomic reasoning using McDermotts NML-I, 2. Problems with NML-I, reasoning with NML-II, case study of truth Maintenance system (TMS), neural 3. Network fundamentals.

2 3

1-2 3-4-5 1st Sessiona l

3 4

6-5-8 9-10-11-12

II

13-14-15 2nd Sessiona l

16-17-18

3 4

19-20-21 22-23-24-25

III

Imprecision and Uncertainty : 4. Definition, probabilistic techniques, Certainty factor based reasoning, conditional probability. 5. Medical diagnosis problem, Bayes Theorem and its limitations, Bayesian belief network, propagation of belief, Dumpster-Shafer theory of uncertainty management, 6. Belief interval, fuzzy relation, inverse Fuzzy relations, Fuzzy post inverse, Fuzzy inversion. Intelligent Search Techniques: (unit 4) 1. Heuristic Function, And/or graph, OR Graph, 2. Heuristic search, A*algorithm and examples. Logic Programming with prolog: 3. Logic program, Horn clause, program for scene interpretation, unification of goals, SLD resolution 4. SLD tree, flow of satisfaction, controlling back tracking using CUT, command use of CUT , 5. implementation of backtracking using stack, risk of using cuts, fail predicate, 6. Application of cut-fail combination, replacing cut fail by not.

3 4

26-27-28 29-30-31-32

3nd Sessiona l

33-34-35-36

3 2 3 3 3 2

37-38-39 40-41 42-43-44 45-46-47 48-49-50 51-52

COURSE FILE FOR

Linux for Information Technology Application I.T-451 (SESSION-2011-2012)

Manmeet Singh

KALPI INSTITUTE OF TECHNOLOGY KALPI (AMBALA)

KALPI INSTITUTE OF TECHNOLOGY KALPI (AMBALA) Syllabus Scheme Subject: Linux for Information Technology Application Code No. I.T-451 Semester: 7th Syllabus to be covered Apprx. Cumulative Sessiona No. of hours l Hours (lect.) Introduction: (unit 1)
1. Basic concepts of the operating system. Commands, shells and processes, users and groups, file system and directories. System installation, configuration and upgrade. 2. Installation stages, network installation, disk partitioning, post-install system customization and upgrade, 3. dpkg and APT package installation, remove, upgrade and query, semi automatic system installation. 4. Kernel tasks, managing kernel modules at runtime, kernel configuration and compilation, boot loaders gr

Unit No. I

1-2 1st Sessiona l

3 2 3

3-4-5 6-7 7-8-9

Linux Networking(unit 2)
1. Linux networking : basic concepts of networking: network packets, Tcp/IP protocol suit, address resolution protocol (ARP), 2. IP addresses and network mask subnet and routing, IPV4 and network classes, ports. Configuring Linux machine on the network,

10-11-12

3 2 2

13-14-15 16-17 18-19

3. arp ifconfig and net stat commands. Network services and tools, telnet, rsh, 4. ftp, rcp, Ssh, rsync, inetd. Conf, opening and closing ports.

II

Network file system(NSF)

5. File system sharing over the network, remote procedure call(RPC) service, NFS server and client sides, 6. NFS installation and configuration, static mount and auto mount configurations, troubleshooting NFS, security and performance optimization

3 2

20-21-22 23-24 2nd Sessiona l

Network Information Service (NIS)

7. Centralized authentication systems, sharing user and host information over the network, 8. NIS server and client sides, NIS installation and configuration, compatibility mode, net groups, security issues.

2 3

25-26 27-28-29

3 Integrating Linux and Windows: (unit 3)

1. Elements of windows networking: NetBIOS, SMB/CIFS Protocols, domain controller, 2. Samba server on Linux for centralized Windows logon, File sharing and printing. 3. Samba client, Samba installation and configuration, UNIX and windows passwords. 4. Dual boot running windows and Linux on

30-31-32 33-34 35-36 37 38-39

2 2 1 2

the same PC, 5. GRUB and NT boot loaders, accessing Windows file system from Linux and vice versa.

III

Lightweight directory Access Protocol(LDAP):

1. Overview of Unix Authentication and Naming services, introduction to LDAP, domain component(DC), organizational unit(ou), 2. common names (cn), schemas, Idif format, services, ports and commands,

3 2 2 1 2

40-41-42 43-44 45-46 47 48-49

3nd Sessiona l

3. Server and client sides, open LDAP installation and configuration, LDAP application. Shell scripting, Syntax of bash, looping, 4. Case statement, function, command substitution, awk, grep, sed. Startup and

Run levels. 5. Scheduled jobs. Boot up and login process sequence, run levels, startup scripts, scheduling jobs with at and cron.

Linux Security: (unit -4)

1. System vulnerabilities, port scanning, encryption, encrypted services and connections, PGP/GPG. 2. Intrusion protection: tcp wrappers, IPfirewalls (iptables), NAT and DMZ, Intrusion detection systems: tripwire, secure system management Practices.

2 2

50-51 52-53

Email Server:
3. Steps of Email transaction, Email envelope and headers, SMTP servers, IMAP and POP3 servers, Email relay, Postfix configuration, spam and viruses.

54-55

Linux Computational Clusters:

56-57

4. Overview of Linux clusters and clustering tools, High Performance Computational Clusters, Message Passing Interface (MPI) for parallel programming, 5. MPI compilation and installation, Scheduling and queue system, Sun Grid Engine (SGE), cluster management tools.

58-59

Doman Name Server (DNS):

60-61

6. Host name resolution, domain name hierarchy, DNS zones, configuration of master , slave and caching DNS servers with BIND 9.

COURSE FILE FOR Design & Analysis of Algorithms

CSE-301 (SESSION-2011-2012)

Manmeet Singh

KALPI INSTITUTE OF TECHNOLOGY KALPI (AMBALA)

KALPI INSTITUTE OF TECHNOLOGY KALPI (AMBALA) Syllabus Scheme Subject: Design & Analysis of Algorithms Semester: 7th Syllabus to be covered Code No. CSE-301 Apprx. No. of Hours (lect.) 2 4 Cumulative hours Sessiona l

Unit No. I

Introduction: (unit 1)
1. Review of elementary data structures, analyzing algorithms, 2. Asymptotic notation, recurrence relations, Hash tables, Binary search trees.

1-2 3-4-5-6 1st Sessiona l

Sorting and Order Statistics:

3. Heap sort, priority queues, quick sort, sorting in linear time, 4. Medians and order statistics, dynamic order statistics.

3 2

7-8-9 10-11

Advanced Design and Analysis Techniques: (uint-2)

1. Dynamic programming Elements, Matrix-chain multiplication, longest common subsequence, 2. Optimal polygon triangulation. Greedy algorithms Elements, activity selection problem, 3. Huffman codes, task scheduling problem.

3 3 3

12-13-14 15-16-17 18-19-20

II

Advanced Data Structures:

4. Operations in B-Trees, Binomial heaps, 5. Fibonacci heaps, data structures for disjoint sets, strings.

3 3 2 3 4 2 3 4 2

21-22-23 24-25-26 2nd Sessiona l 27-28-29 30-31-32-33 34-35 36-37-38 39-40-41-42 43-44

Graph Algorithms: (unit 3)

1. Review of graph algorithms, topological sort, strongly connected components, 2. minimum spanning trees- Kruskal and Prims, Single source shortest paths, relaxation, 3. Dijikstras algorithm, Bellman-ford algorithm, 4. single source shortest paths for directed acyclic graphs, 5. difference constraints and shortest paths, all pairs shortest paths- shortest paths and matrix multiplication, 6. Floyd-Warshall algorithms, Johnsons algorithm.

III

Flow and Sorting Networks: (unit 4)

1. Flow networks, Ford-Fulkerson method, 2. Maximum bipartite matching, 3. Sorting Networks, Comparison network , 4. The zero-one principle, 5. Bitonic sorting network, merging network.

2 1 2 1 2

45-46 47 48-49 50 51-52

3nd Sessiona l

COURSE FILE FOR Statistical Models for Computer Science

CSE-405 (SESSION-2011-2012)

Manmeet Singh

KALPI INSTITUTE OF TECHNOLOGY KALPI (AMBALA)

KALPI INSTITUTE OF TECHNOLOGY KALPI (AMBALA) Syllabus Scheme Subject: Statistical Models for Computer Science Semester: 7th Syllabus to be covered Code No. CSE-405 Apprx. No. of Hours (lect.) 2 2 2 2 Cumulative hours Sessiona l

Unit No. I

(unit 1)
1. Probability Models, Sample Space, Events, 2. Their algebra, graphical methods of representing events, 3. Probability Axioms and their applications, Condition probability, 4. Independence of Events, BayesRule and Bernoulli Trials.

1-2 3-4 5-6 7-8 1st Sessiona l

(uint-2)

9-10-11

2
1. Random variables, and their event spaces, probability mass function, Distribution functions, 2. some discrete distributions (Bernoulli, Binomial, Geometric, Negative Binomial,

12-13 14-15 16-17-18-19

2 4

3. Poisson, Hyper geometric and Uniform), Probability Generating function, 4. Discrete random vectors, continuous random variables: some continuous distributions (Exponential, Hyper exponential, Erlang, Gamma, Normal)

II

5. Functions of random variables, jointly distributed random variables. 6. Expectation, Expectation of function of more than one random variable 7. Brief introduction to conditional PMF: PDF and expectation, 8. Moments and transforms of some distributions (Uniform, Bernoulli, Geometric, Poisson. Exponential, Gamma, Normal), Computation of mean time to failure.

2 3 2 3

20-21 22-23-24 25-26 27-28-29 2nd Sessiona l

2 2 1

30-31 32-33 34

(unit 3)
1. Stochastic Processes, Classification of stochastic processes, 2. The Bernoulli process, The Poisson process, renewal process,

3. Renewal model of program behavior.

III

(unit 4)

1. Markov Chains, Computation of n-step transition probabilities, state classification and limiting distributions, 2. Distribution of times between state changes, Irreducible finite chains with a periodic states, 3. M/G/I queuing system, discrete parameter Birth-Death processes, Analysis of program execution time. 4. Continuous parameter Markov Chains, Birth-Death process with special cases, Non-Birth-Death Processes.

2 2 3 2

35-36 37-38 39-40-41 42-43 3nd Sessiona l

COURSE FILE FOR

ARTIFICIAL INTELLIGENCE I.T-473 (SESSION-2011-2012)

Manmeet Singh

KALPI INSTITUTE OF TECHNOLOGY KALPI (AMBALA)

Unit No.

Syllabus to be covered

Apprx. No. of Hours (lect.)

Cumulative hours

Sessiona l

Introduction : (unit 1)
1. Foundation and history of AI, Ai problems and techniques. 2. AI programming languages, Introduction to LISP and PROLOG. 3. Problem spaces and searches, Blind search strategies, Breadth first Depth first heuristic search techniques 4. Hill climbing-best first- A algorithms AO* algorithm game trees, Min-max algorithms, game playing-Alpha beta pruning.

2 3 3 3

1-2 3-4-5 6-5-8 9-10-11 1st Sessiona l

12-13-14

Unit : 2

1. Knowledge representation issues predicate logic-programming Semantic nets frames and inheritance, 2. Constraint propagation, representing knowledge using rules, Rules based deduction systems.

15-16-17

II

3. Reasoning under uncertainly, review of probability bays probabilistic interferences and Dempaster 4. Shafer theory, Heuristic methods, symbolic reasoning under uncertainty Statistical reasoning 5. fuzzy reasoning, temporal reasoning non monotonic reasoning. Unit: 3 1. Planning, planning in situational calculus, representation for planning partial order planning algorithm, 2. learning form examples discovery a learning, learning by analogy,

3 3 2 3 3 2

18-19-20 21-22-23 24-25 26-27-28 29-30-31 32-33 2nd Sessiona l

3. Explanation based learning neural nets genetic algorithms.

III

Unit: 4 1. Principles of natural languages processing rule based systems architecture, 2. Expert systems, Knowledge acquisition concepts AI application to robotics, 3. Current trends in intelligent systems

3 3 2

34-35-36 37-38-39 40-41 3nd Sessiona l