COURSE OF STUDY AND SCHEME OF EXAMINATION OF B.
NATIONAL INSTITUTE OF TECHNOLOGY, RAIPUR
Branch- Computer science & Engineering Semester- VII
Board of Studies Examination Scheme Total Marks ESE 70 70 70 70 120 120 120 120 4 4 4 5 Credits L+(T+P)/2
Course- B.Tech.(NIT Scheme)
L 1 2 3 4 Comp. Sc. & Engg. Comp. Sc. & Engg. Comp. Sc. & Engg. Comp. Sc. & Engg. Comp. Sc. & Engg. CS20711(CS) CS20712(CS) (Refer Table-1) (Refer Table-2) Artificial Intelligence & Expert System Network Programming Elective-I Elective-II (Professional) Artificial Intelligence & Expert System(Lab) Networking Programming Lab Pract. Training Minor Project Seminar & Report writing Total 3 3 3 4
T 1 1 1 1
TA 20 20 20 20
FE 15 15 15 15
SE 15 15 15 15
T.C.A 50 50 50 50
7 8 9
Comp. Sc. & Engg. Comp. Sc. & Engg. Comp. Sc. & Engg. Comp. Sc. & Engg.
CS20723(CS) CS20724(CS) CS20725(CS)
12 2 20
50 100 50 340
50 100 50 460
50 150 20 830
2 6 1 30
Comp.Sc. & Engg.
MEMBER Board of Studies Deptt. Of CS&E
MEMBER Board of Studies Deptt. Of CS&E
MEMBER Board of Studies Deptt. Of CS&E
Science & Engg Comp. Science & Engg Comp. Science & Engg Comp. Science & Engg Subject Code CS20731(CS) CS20732(CS) CS20733(CS) CS20734(CS) CS20735(CS) CS20736(CS) CS20737(CS) CS20738(CS) CS20739(CS) CS207310(CS) Subject Name Digital Image Processing Enterprise Resource Planning Natural Language Processing Real time Systems Logical & Functional Processing
Flexible Elective(Subject will be decided by the department as per the latest requirement of Academic/Industries) Flexible Elective(Subject will be decided by the department as per the latest requirement of Academic/Industries) Flexible Elective(Subject will be decided by the department as per the latest requirement of Academic/Industries) Flexible Elective(Subject will be decided by the department as per the latest requirement of Academic/Industries) Flexible Elective(Subject will be decided by the department as per the latest requirement of Academic/Industries)
S. Science & Engg Comp. Science & Engg Comp. Science & Engg Comp. Science & Engg Comp. Science & Engg Comp. Science & Engg Comp. Science & Engg Comp.No. Science & Engg Comp. 1 2 3 4 5 6 7 8 9 10 Board of Studies Comp. Science & Engg (Table-2) Subject Code CS20741(CS) CS20742(CS) CS20743(CS) CS20744(CS) CS20745(CS) CS20746(CS) CS20747(CS) CS20748(CS) CS20749(CS) CS207410(CS) Subject Name Advanced Computer Architecture Advanced Operating System Advanced Data Base Systems Internet Working with TCP/IP
Flexible Elective(Subject will be decided by the department as per the latest requirement of Academic/Industries) Flexible Elective(Subject will be decided by the department as per the latest requirement of Academic/Industries) Flexible Elective(Subject will be decided by the department as per the latest requirement of Academic/Industries) Flexible Elective(Subject will be decided by the department as per the latest requirement of Academic/Industries) Flexible Elective(Subject will be decided by the department as per the latest requirement of Academic/Industries) Flexible Elective(Subject will be decided by the department as per the latest requirement of Academic/Industries)
(Table-1) S. Science & Engg Comp. Science & Engg Comp. Science & Engg Comp. 1 2 3 4 5 6 7 8 9 10 Board of Studies Comp. Science & Engg Comp. Science & Engg Comp. Science & Engg Comp.No. Science & Engg Comp.
Inference rule & theorem proving: forward chaining. Hill climbing search. Limitation of naïve Bayesian system. A* & AO* Search. Frames exceptions and defaults attached predicates. Problem Solving. Programming with prolog. Conceptual Dependency formalism. learning decision tree. Inheritance. 2. WFF.Knowledge Representation (KR):Introduction to KR.Handling uncertainty & Learning: Source of uncertainty. Probabilistic inference.Narosa Publishing house.Tata MeGraw Hill. Machine translation.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS
Name of Subject Semester Maximum Marks Lecture Periods/Week 3 Artificial Intelligence & Expert System B. Informed search : Heuristic function.Patterson Introduction to Artificial Intelligence and Expert Systems. Learning by induction. Truth maintenance systems.Narosa Publishing house. Overview of Fuzzy Logic. Dempster-Shafer Theory. Nils J.: Rule based Expert Systems (A practical Introduction ) Narosa Publishing House. Lisp programming. Inference with BBN. Paradigms of machine learning.cognitive problems.S. 2. et.Overview & Search Techniques:Introduction to AI. Sasikumar. Lisp syntax. Block world. Elaine Rich and Kevin Knight: Artificial Intelligence. Alpha-beta pruning. Rule Based Systems. backward reasoning: Use of backtracking. Boolean circuit agents. Melish. resolution. Back tracking in prolog. backward chaining. Best first search. Games of chance. Programming in PROLOG.
. Learning: Concept of learning. Example of learning. State-Goal & Action Representation. Blind search: Depth first earch.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20711(CS)
Comp. Case studies of expert system. Learning using Neural Networks. M. Non monotonic reasoning: Dependency directed backtracking. Other knowledge representations. Breadth first search. Supervised & Unsupervised learning.Nilsson: Principles of Artificial Intelligence. Constraint satisfaction. Parsing.slots. Backward chaining. UNIT V . Propositional knowledge. Bayes’ theorem. Mini-Max search.Natural Language Processing (NLP) & Planning :Overview of NLP tasks.Prentice Hal of India. Bayesian Belief Network (BBN). S. Predicate logic. Structured KR: Semantic Net .Expert System & AI languages:Need & Justification for expert systems. Text Books :1.
28 Credits 4
UNIT I . knowledge acquisition. Learning model. Forward reasoning: Conflict resolution.Ramani. Planning agent. Dan W. Game tree. Reference Books :1. Sc. Rule based systems. & Engg. State space search. 3. Components of Planning System. UNIT II . Clocksin & C. Expert System Architectures. Knowledge agent. UNIT IV . Planning example : partial-order planner. Forward planning. UNIT III . al. Evaluation function. Non production system. AI language: Prolog syntax.
& Engg. Posix data type.. blocking sockets. packages.: Windows Network Programming. Programming Applications: Time & date routines. Introduction to CGI programming. bind. window socket & blocking I/O model. UNIT. UUCP. Assigning address to a socket. Steven. Client side programming: Creating sockets. UNIT.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS
. XNS. PH NewJersey.I NETWORKING & TCP/IP: Communication protocols. UNIT-II UNIX SOCKET PROGRAMMING IN C: Creating sockets. socket address structures. PHI (VOL I& II) 2.R: UNIX Network Programming.
28 Credits 4
UNIT. Datalink layer protocols. Retrieving file from an HTTP server. accept. connect. TCP & IP headers.P. blocking functions. Implementing generic network client. Addison Wesley 4. Adding multithreading to a server.W. UNIT. Introduction to Java Beans. TCP ports (ephemeral. Berkeley Sockets: Overview. Web server working method & programming. socket implementation (client &server programs). Transport layer. Server side programming: Steps for creating server.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20712(CS)
Comp. fork.V ADVANCE JAVA WEB PROGRAMMING: Parsing data using string Tokenizer. Chat. Different Winsock APIs & their programming technique. listen. close. UNIX domain protocols.IPv4 & v6 address structures.
Ganzalez and Woods.DCT. Thresholding. region filling.Huffman coding. Unit III: Morphological Image Processing: Logic operations involving binary image. Region based segmentation. Sc. John Wiley and sons. High pass filtering. JPEG.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS
Name of Subject Semester Maximum Marks Lecture Periods/Week 3 Digital Image Processing B. Digital Image Processing. Canny edge detector. Histogram equalization. Line detection. MGH. image averaging. Digital Image Processing. Shape numbers. Laplacian filter. connected component extraction. Histogram specification. 2. Lossy compression. Unit V: Image Representation & 3D: Boundary descriptors. Unit II: Image enhancement in frequency domain & Image Segmentation: 2D discrete fourier transform & its inverse. Applications to Boundary extraction. Edge linking & boundary detection. Spatial & Gray level resolution. spatial filterssmoothing and sharpening. Name of Reference Books :1. & Engg. Machine Vision. Texture. MPEG. Jain and Rangachar. video compression. Sonka and Brooks. Dialation & Erosion. Edge detection.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20731(CS)
Comp. Correlation based and feature based stereo correspondence. Projective geometry.
28 Credits 4
Unit I: Introduction: Image formation model.
. Pearson education. LZW coding. filtering in frequency domain. 2. Image enhancement in special domain: Piecewise transformation functions. optical flow. shape from motion. Name of Text Books:1. TSP ltd. Opening & Closing. Unit IV: Image Compression: Coding redundancy. Ideal & Gaussian low pass filters. Schalkoff. FFT. Image Processing. run length coding.
Sadagopan : MIS. motivation for ERP. Venkatkrishnan . 3. PHI. performance measurement. project management. UNIT. overview of the supporting databases. MRP. V. scheduling.II TYPICAL BUSINESSS PROCESSES Core processes. ERP as an integrator of information needs at various levels. information as a resource. hussain .K. UNIT – IV ERP MODELS /FUNCTIONALITY Sales-order-processing. UNIT – V IMPLEMENTATION ISSUES Pre Implementation issues. MONAK & BRADY : Concepts in ERP. PHI. distribution. purchase. productivity management. administrative process. evaluation of commercial software during implementation issues. & Engg. J. Need for integrated process view. Name of Text Books: 1.TMH. UNIT – III EVOLUTION OF INFORMATION SYSTEM EDP (electronic data processing) system. forecasting. Rajaraman : Analysis & Design of Information Systems. material management. Design & Implementation. Hussain & D.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20732(CS)
. PHI Name of Reference Books :1. scheduling.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS
Name of Subject Semester Maximum Marks Lecture Periods/Week 3 Enterprise Resource Planning B. features of each of the models description of data flows across module. education & training. Information systems. product control. finance support processes. maintenance. decision making involved at the above level. PHI 2. finance. marketing. shop floor control. vikas pub. strategic planning. V. Forecasting. K. human resources. reengineering of various business process. Thomson 4. Garg & N. information needs of organization. ERP. technologies required for ERP.
28 Credits 4
UNIT – I OVERVIEW OF BUSINESS FUNCTIONS : Business function in an organization. financial justification of ERP. M. research & development problems in traditional functional view. management information systems (MIS). post implementation issues. concepts & practices. Kanter : Managing with information. human resource. 2. executive information systems. accounting & finance. sales order processing. S. Sc.K. Analysis.
lexical transfer. R 3. M. Scoping and the Interpretation of Noun Phrases. & Martin. Foundations of General Linguistics (2nd ed. syntactic transformations. Natural language processing in Prolog: an introduction to computational linguistics. An Inference based resolution algorithm. & Engg. Ambiguity Resolution. Towards Efficient Parsing. by Jurafsky. discourse planning. J Name of Reference Books: 1. Natural Language Understanding (2nd ed. Unit -II Semantic Interpretation Semantics and Logical Form. an architecture for generation. Fromkin. Syntactic and Semantic Coherence. Linking Syntax and Semantics. Features and Augmented Grammars. Speech and Language Processing. Allen. Ambiguity Resolution.). M A 4. systemic grammar. Unit –IV Natural language Generation Introduction to language generation. Kilby. G & Mellish. By Gazdar. Text Coherence. D A & Roca. functional unification grammar. using statistical Techniques Name of Text Books: 1. Unit -III Pragmatics Discourse: Reference Resolution. Unit –V Machine Translation Language Similarities and Differences.). transfer metaphor. D. J. idea of interlingua.
28 Credits 4
Unit –I Introduction & Syntactic processing The study of Language. by Covington. Linguistic background. surface realization. Grammars and Parsing. V & Rodman. Sc. C
. An Introduction to Language (5th ed.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS
Name of Subject Semester Maximum Marks Lecture Periods/Week 3 Natural Language Processing B. Grammars for Natural Language.) by Atkinson.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20733(CS)
Comp. 2. Strategies for Semantic Interpretation. I 2. Dialogue and Conversational Agents: What makes dialogue different? Dialogue structure and coherence. direct translation. Natural Language Processing for Prolog Programmers.H.
Text Books : 1. phase/State Driven Code. Process Stack Management. The Software Hesisenberg Uncertainity Principle. Real Time Systems As Complex System. Analysis and Verification by Albert M. Hard Real Time Computing Systems Predictablle Scheduling Algorithms and applications By Giorgio C. Survey of Commonly Used Programming Languages.
28 Credits 4
Unit-I Basic Real. CPU. building Real Time Applicaions with Real Time Programming Languages. Little’s Law. Finite state Automata. Static Schemes.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS
Name of Subject Semester Maximum Marks Lecture Periods/Week 3 Real Time System B. & Engg. Classification of Architectures.Time Concepts. Laplante. Flow Charts.S. Memories.Liu 2.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20734(CS)
Comp. Unit-IV Queuing Models. System Performance Analysis and Optimization: Buffering Data. Computer Hardware. Real Time Kernels: Phases of software life cycle. Time Loading and its Measurement. Code Generation Unit. Non-temporal Transition in the software life cycle. Real Time Applications: Goals of Real Time System Integration. Scheduling NP Complete. Interuupt Latency.Output. Unit-V Hardware/ Software Integration. Language Issues: Basic component Architecture. Real Time Systems Design and Analysis by Phillip A. Non Von Neumann Architectures. Jane W. Multiprocessing Systems: Basic Buffer size Calculation. terminology. Structure Charts. Sc. Foreground/Background Systems Full Featured Real Time OS Unit-III Inter task Communication and Synchronization. Classical Queuing Theory. I/O Performance. Polled Loop Systems. Response Time Calculation.\. Data Flow Diagrams. And Fault Tolerance. Other Devices Language Features. Relocating Response Times And time Loading. Real Time System: Scheduling. Reliability.Deadlock. Spiral model. Buttazzo 2. Real Time Design Issues.II Software life cycle. Natural languages. Cheng
. Reducing Memory Loading. Input. Event Flags and Signals . Real Time memory Management. Coroutines. Interrupt Driven System. Failures . Pseudo code and programmable Design Languages. Mathematical Specification. Statecharts. Analysis of Memory Requirements. Tools. Petrinets. Real time Image Processing Real Time UNIX. Semaphores. Faults. Testing. Distributed Systems. Testing. Real Time System. Real Time Design Patterns: Robust Scalable Architecture for Real Time System by Bruce Powel Douglass 3. First Real Time Application Real Time Databases. Real Time Specification and Design Techniques.bugs AND effects. Fault Tolerence. Reliability.PHI Reference Books: 1. K. Mail boxes Critical Region. Methodology. Dynamic Allocation.
Reade Chris. John. Pearson Education. Prenex normal forms & skolemization. Context free grammar vs logical grammar. Functional – Logic program (FLP).IV ADVANCED FEATURE OF LOGIC PROGRAMMING :Object & Meta language. Grammar Rules. Sc. second order program in prolog. Higher order Predicates UNIT. Horizon transformation. The essence of logic.
. cut & fail. The relational functional markup language.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20735(CS)
Comp. Compilation of DCGs into prolog. Rules. Recursive data structure. semantic tableaux & resolution. Lazy evaluation & delay of unnecessary computation. UNIT -III PROLOG PROGRAMMING :Execution of query in prolog program. UNIT. Lists & data. New Age International. Computations. programming in PROLOG (overview): predicates. Unification. & Engg. AWL. Introduction to SML a functional language. Saroj Kaushik. SLD – Resolution. Bratko. Prolog programming. Reference Books :1. logic grammars. K. Higher order functions. The least Herbrand Model. 3.I INTRODUCTION OF LOGIC PARADIGM :Prepositional calculus & logic. Narosa Publishing House. Text Books :1. Searching in state space. Clocksin & Mellish. Arithmetic operations.
28 Credits 4
UNIT. Element of functional Programming. Logic & Prolog programming. meta level & non deterministic programming. Herbrand universe & H-interpretation UNIT. PHI. 2. Cut & Arithmetic.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS
Name of Subject Semester Maximum Marks Lecture Periods/Week 3 Logical & Functional Processing B. natural deduction & axiomatic system.V FUNCTIONAL PROGRAMMING :Introduction to functional programming (FP). Constraint logic Programming. Programming in Prolog. FOPL : predicate calculus. Concurrent logic programming. 2.II LOGIC PROGRAMMING : Logic formulas. Recursive list. Negation in logic programming. Logical Inference. Recursion. Explicit data values.
Hwang.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS
Name of Subject Semester Maximum Marks Lecture Periods/Week 4 Advanced Computer Architecture B. Bus specifications and standards. Sc. "Advanced Computer Architecture with ParallelProgramming". 2.. Condition of parallelism. JB. 3. Cache coherence. Unit V: System Interconnection: Network properties and routing. R. Super-scalar processors.
28 Credits 5
Unit I: Pipeline: Linear pipeline processor: Nonlinear pipeline processor.& Algo. Adam Hilger. Name of Reference Books :1. computer Architecture: Pipelined and parallel processor design.". data flow architecture. SIMD parallel algorithms. dynamic interconnection networks. High bandwidth I/O. SIMD architecture. vector and symbolic processors. Multistage & combining networks.Kai Hwang 7 Briggs. control flow versus data control. Boston.(MGH).Michael J Quinn.Computer Architecture & Parallel processing . static interconnection networks.Mc Graw Hill
. Unit III: Parallel Computer Models & Program parallelism: Classification of Machines. High bandwidth memories. Disk I/O.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20741(CS)
Comp.Theory and practice . Unit IV: Synchronous Parallel Processing: Vector instruction types. SIMD & MIMD.R.Parallel computing. Dynamic instruction scheduling. 2. Flynn. K. Instruction pipeline design. grain size latency. SISD. vector access memory schemes. Program partitioning & scheduling. C. Hockney.W. & Engg. Jesshope. data and resource dependencies. "Parallel Computer 2 –Arch. Name of Text Books:1. Mechanisms. Arithmetic pipeline design. MGH. Multiprocessor system interconnection. SIMD computers and performance enhancements. Unit II: Memory Hierarchy & I/O organization: Cache memories. VLIW architecture.
the Andrew File System. UNIT – III STRUCTURE OF UNIX OPERATING SYSTEM :Overview of UNIX.S Tanenbaum. Administration of UNIX system. Srirengan. Directory and discovery services.
. File Management. The Operating System Layer. Communication and invocation. Distributed OS architectures. X . K. interaction models. and failures. Distributed Algorithms: Distributed algorithm design principles and issues such as coordination. Administration of WINDOWS OS system. File – Memory – I/O – Process management in WINDOWS OS. Architectural Model. K. Milan. LINUX etc. IEEE Press 3. UNIX. IEEE press. Handling files. Distributed File System : File Service Architecture. Handling directories. Cryptographic algorithms. UNIT – IV STRUCTURE OF WINDOWS OPERATING SYSTEM :Overview of WINDOWS OS. 3.500 directory service. Distributed OS. Resource sharing. I/O Management. Operating System Architecture. 2. Classification of WINDOWSOS command. Singha . UNIT – V CASE STUDY OF OPERATING SYSTEMS :Case Study of Process Management. Operating System . Handbook of WINDOWS OS. PHI. System calls for WINDOWS. Understanding UNIX. WINDOWS programming environment. Distributed Operating System By P. software layers. Protection. digital signatures. Sc. UNIT-II SECURITY AND DISTRIBUTED ALGORITHM :Overview of security techniques. LINUX OS. Cryptographic pragmatics. Name Services : Name services and domain name systems. Classification of UNIX command Handling files. Reference Books:1. agreement. Handling directories. File – Memory – I/O – Process management in UNIX.
28 Credits 5
UNIT-I INTRODUCTION TO DISTRIBUTED OPERATING SYSTEM:What are distributed OS? Examples of distributed OS. Processes and Threads. The Global name service . TMH. & Engg. Shell Programming environment. Internal architecture of UNIX. 2. Recent Advances. Text Books:1.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20742(CS)
Comp. A. Examine source of difficulties such as timing. Memory Management. Sun Network File System.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS
Name of Subject Semester Maximum Marks Lecture Periods/Week 4 Advanced Operating System B. challenges in designing distributed OS. PHI. Internal architecture of WINDOWS OS. BPB publication.
Distributed deadlock management. PL/SQL syntax & programming. UNIT. Recovery in multi-database systems. Distributed processing in Oracle. Real time databases. Fundamentals of database systems 3rd edition. directory systems. Consistency & Request ordering. Basic model of database access control. JDBC.I DISTRIBUTED DATABASE DESIGN :Design strategies.J. Database system concepts . distributed transactions.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS
Name of Subject Semester Maximum Marks Lecture Periods/Week 4 Advanced Database System B. 4th edition.II DATA REPLICATION & QUERY PROCESSING IN DDBS :Classification of replica control strategies.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20743(CS)
Comp. Theory of OO databases. Distributed database system architecture. server systems architectures. UNIT-V DIFFERENT DATABASES :Parallel databases: Introduction. Objective of query processing. Oracle DDB design.
28 Credits 5
UNIT. Reliability concept & measure. Rajesh Narang. distributed data storage. Sc. Pearson education References:1. recovery techniques based on deferred update & on immediate update shadow paging. Transaction property. Query decomposition.IV SECURITY MANAGEMENT & PL/SQL :Various aspect of database security. Database concepts & systems . parallel & distributed systems. UNIT-III TRANSACTION PROCESSING & RECOVERY :Centralized & client server architecture. availability . An Introduction to database systems. commit protocols. structure & type. Site failure & network portioning. 3. Interquery-intraquery intra operation interoperation parallelism design of parallel systems. Database recovery in Oracle. PL/SQL block. 7th edition. Pearson education
. Text book: 1. Identification-Authentication. & Engg. Multimedia databases. Distributed query optimization algorithms. recovery concepts. Allocation. The ARIES Recovery Algorithm. SPD 2. Data encryption.2nd edition . The Gossip Architecture. MH 2. Fragmentation. Silberschatz-Korth-Sudarshan. UNIT. Security in Oracle.Authorization. Oracle network protocols. Distribution design issues. Client/Server DBS. Date’s rule for DDBS. Replication in Oracle. Purpose of PL/SQL. Ivan Bayross. Process groups & ISIS. Query optimization in Oracle. Security models. database backup and recovery from catastrophic failures. Oracle DBMS.heterogeneous distributed databases. PHI. I/O parallelism. Query optimization in Centralized system. concurrency control in distributed database. C. Date . Statistical databases. Database Management System. Network administration in Oracle. TCSEC Policy identification. Elmasri & Navathe.
events and messages. ATM Switch. UNIT – II INTERNET PROTOCOL Purpose of Internet Protocol. DVMRP. IP Addresses: Introduction. Address Classification.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS
Name of Subject Semester Maximum Marks Lecture Periods/Week 4 Inter Networking with TCP/IP B. James L. Options.) Name of the Reference Book: 1.
28 Credits 5
UNIT –I INTRODUCTION Introduction to internetworking. CBT. Keith W. timer process. TCP/IP Illustrated By Wright and Stevens (Vol. Kurose. Internet datagram. Name of The Text Book: 1. Forouzan. Timers. Overview of OSI Model TCP/IP protocol suite. UNIT-V TCP/IP OVER ATM NETWORKS ISDN and B-ISDN.MBONE. UNIT –IV TCP IMPLEMENTATION TCP operation. ATM cell transport and adaptation layers. Gateways. deleting and inserting timer event. flow control and adaptive retransmission.PIM. OSPF. Checksum. Supernetting. & Engg.Antonakes (PHI)
. MOSPF. Security at the IP Layer. ATM reference model. Internetworking with TCP/IP by Comer (Vol. Paths.(TMH Pub. Multicasting: Introduction. packet type and multiplexing. A sample internet with classful addressing. Multicast Trees. Multicast Routing. Multicast Routing Protocols. congestion avoidance and control. IPv4 and IPv6 packet formats. Ross (Pearson Education) 2.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20744(CS)
Comp. Classless addressing. Comparisons of different models. Logical Subnet Concept and Connection Management. IPSec. BGP. Basics of switching technologies and switches. urgent data processing and push function. Routing Methods: Routing Table and Routing module. Virtual circuit in ATM. IP Address binding in an ATM Network. Interconnection Network. ARP and RARP. Mansfield Jr. Computer Networking by James F.) 2. Sc. RIP. IGMP.2) (Pearson Education) 3. Subnetting. TCP state machine. 1)(PHI Pub. TCP/IP Protocol suite by Behrouz A. UNIT –III ROUTING PROTOCOLS: UNICAST ROUTING PROTOCOLS Interior and Exterior routing. Circuits and identifiers. An Introduction to Computer Networks by Kenneth C. ICMP.
Convert the following into wff’s. Publication). Town D is connected to Town B by Road 5.Tech VII Sem Tutorial Periods/Week Subject Code Board of Studies Minimum Marks Practical Periods/Week 2 CS20721(CS)
Comp.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS
Name of Subject Semester Maximum Marks Lecture Periods/Week Artificial Intelligence & Expert System Lab B. A cup is above a book. you can get to y from x by bike. (xiv) Solve the classical Blocks World Problem of AI. clausal form and deduce that `One can get to town B from town D’. Convert the following into wffs. (viii) Write a program given the knowledge base. ancestor given the facts about father and wife only.F. (vi) Write a program to read a list at a time and write a list at a time using the well defined read & write functions. sister. son. child. & Engg. Bikes are allowed on roads 3. (x) Solve the classical Monkey Banana problem of AI. you can get to town r from town p. (ii) Carl Townsend : Introduction to Turbo Prolog. (iii) W. (ii) Write a program to find the length of a given list (iii) Write a program to find the last element of a given list (iv) Write a program to delete the first occurrence and also all occurrences of a particular element in a given list. (xiii) Solve the classical Travelling Salesman Problem of AI.Town A is connected to Town C by Road 3. brother. The cup is touching that book. x is on top of y. aunt. List of Equipments/Machine required : (i) PC with Wndows XP (ii) Visual prolog compiler Recommended Books : (i) Ivan Bratko : Logic & prolog programming. daughter. Sc. uncle. 5. If x is on the top of y. Town A is connected to Town B by Road 1. clausal form. If Town x is connected to y by z then y is also connected to x by z. If Town x is connected to Town y by highway z and bikes are allowed on z. (xv) Write a program to search any goal given an input graph using AO* algorithm. Is it possible to deduce that `The book supports the cup’. female. Clocksin & Mellish : Programming in PRLOG ( Narosa Publication House)
. Bikes are only either allowed on Road 1 or on Road 2 every day. Town D is connected to Town E by Road 4. If you can get to town q from p and also to town r from town q. 4. (ix) Solve the classical Water Jug problem of AI. ( BPB. If x is above y and they are touching each other. male. (v) Write a program to find union and intersection of two given sets represented as lists. (vii) Write a program given the knowledge base.
Experiments to be performed: (i) Write a prolog program to find the rules for parent. Town B is connected to Town C by Road 2. (xii) Solve the classical Missionary Cannibals problem of AI. (xi) Solve the classical Crypt arithmetic problems such as DONALD + GERALD = ROBERT of AI. y supports x.
Write a client and server routines showing I/O multiplexing. 10. Write a client and server routines showing Blocking I/O. 5. 7. 8. Sc. 4. Write a client and server program to implement file transfer. Write an echo program with client and concurrent server using UDP. Write an echo program with client and iterative server using TCP. Write an echo client and server program using Unix domain stream socket. 2. Write a client program that gets a number from the user and sends the number to server for conversion into hexadecimal and gets the result from the server. 11. 6. 9.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS
Name of Subject Semester Maximum Marks Lecture Periods/Week Networking Programming Lab B. Write a program to retrieve date and time using TCP. Write an echo client and server program using Unix domain Datagram socket. & Engg. Write a client and server program to implement the remote command execution 12.
(JAVA NETWORK PROGRAMMING) 1. Write an echo program with client and concurrent server using TCP.
. Write a program to retrieve date and time using UDP.Tech VII Sem Tutorial Periods/Week Subject Code Board of Studies Minimum Marks Practical Periods/Week 3 CS20722(CS)
W.Process& Product". types of letters. Case Studies.
Unit -I Introduction to Technical Writing: how differs from other types of written communication Purpose of technical writing. Effective style of technical report writing: Structures: content. Its differentiation. references. Oral Presentation/ Seminar: Text Books: 1. report lay-out. Writing effective e-mail. project report. Case Studies. Unit -IV Report Writing: Criteria for report writing. Electronic Communication: Internet. "Effective Technical Communication".
. etc. Table of Content. Unit . Progress report. Unit . Pearson Education.III Summary: Report Strategies. etc.II Correspondence: Memos. list of illustrations.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS
Name of Subject Semester Maximum Marks Lecture Periods/Week Report Writing and Seminar B. Eisenberg. Letters. graphs. discussion. Types of Report: Trip report. conclusions. Graw Hill. Davies J. revising first draft. incident report. "Communication for engineering students". Correspondence: prewriting. Audience Recognition: High-tech audience. writing and rewriting Objectives of Technical Writing. Feasibility report. Writing first draft. etc. Sharon J. Multiple Audience. conclusion. references. its importance. lab report. Lay audience. Mc.Tech VII Sem Tutorial Periods/Week Subject Code Board of Studies Minimum Marks Practical Periods/Week 2 CS20725(CS)
Comp. Document Design. appendix. diagrams. Intranet. Reference Books: 1. Cover letter. Low tech audience. "Communication Skills for Engineers" Pearson Education 2. Presentation. Sc. Gerson & Steven M. E-mails. Gerson "Technical Writing .. Unit -V Proposals & Presentation: Title page. glossary. introduction. tables. & Engg. extranet. Longman 3. summary. Sunita Mishra.