COURSE OF STUDY AND SCHEME OF EXAMINATION OF B.

TECH

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)

S.No.

Sub. Code

Subject Name

Periods/week

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

P -

TA 20 20 20 20

FE 15 15 15 15

SE 15 15 15 15

T.C.A 50 50 50 50

5

CS20721(CS)

-

-

3

30

-

-

30

20

50

2

6

7 8 9

Comp. Sc. & Engg. Comp. Sc. & Engg. Comp. Sc. & Engg. Comp. Sc. & Engg.

CS20722(CS)

-

-

3

30

-

-

30

20

50

2

CS20723(CS) CS20724(CS) CS20725(CS)

13

4

12 2 20

50 100 50 340

60

60

50 100 50 460

50 370

50 150 20 830

2 6 1 30

H.O.D
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.Elective-I (Table-1) S. Science & Engg Comp. Science & Engg Comp. Science & Engg Comp. Science & Engg Comp. Science & Engg Comp.No. 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) Elective-II S. Science & Engg Comp. Science & Engg Comp. Science & Engg Comp. Science & Engg Comp. Science & Engg Comp. Science & Engg 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) .No. Science & Engg Comp. Science & Engg Comp. 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. 1 2 3 4 5 6 7 8 9 10 Board of Studies Comp.

Problem Solving. & Engg. Evaluation function. Parsing. Non production system. Game tree. Learning using Neural Networks. Games of chance.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS Name of Subject Semester Maximum Marks Lecture Periods/Week 3 Artificial Intelligence & Expert System B. 2. S. knowledge acquisition. Planning example : partial-order planner. Learning: Concept of learning. Paradigms of machine learning. Rule Based Systems. Elaine Rich and Kevin Knight: Artificial Intelligence. Conceptual Dependency formalism. backward reasoning: Use of backtracking. Lisp programming. Blind search: Depth first earch. et. WFF.cognitive problems. Melish.Narosa Publishing house. Overview of Fuzzy Logic. Alpha-beta pruning.Overview & Search Techniques:Introduction to AI. 28 Credits 4 UNIT I . State space search. State-Goal & Action Representation. Supervised & Unsupervised learning. Lisp syntax. Forward reasoning: Conflict resolution. Backward chaining. Inheritance. Informed search : Heuristic function.Narosa Publishing house. Knowledge agent. Structured KR: Semantic Net . Dempster-Shafer Theory.Tata MeGraw Hill. Propositional knowledge. A* & AO* Search.Knowledge Representation (KR):Introduction to KR. M. Sasikumar. Limitation of naïve Bayesian system. Sc. Bayesian Belief Network (BBN). UNIT II . Programming with prolog. Block world. Clocksin & C.slots. Learning by induction. Best first search.Nilsson: Principles of Artificial Intelligence.S. Hill climbing search. Constraint satisfaction. Frames exceptions and defaults attached predicates. UNIT IV . Non monotonic reasoning: Dependency directed backtracking. backward chaining. Probabilistic inference. Rule based systems. Example of learning. learning decision tree. Reference Books :1.Prentice Hal of India. Breadth first search. Bayes’ theorem. UNIT III . Programming in PROLOG. AI language: Prolog syntax. Machine translation. UNIT V . Truth maintenance systems. Other knowledge representations.Expert System & AI languages:Need & Justification for expert systems. Text Books :1. Forward planning. Components of Planning System. 2. Expert System Architectures. . Inference rule & theorem proving: forward chaining. Dan W.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20711(CS) Comp. 3.Patterson Introduction to Artificial Intelligence and Expert Systems. Learning model. Back tracking in prolog. Boolean circuit agents. Planning agent. Mini-Max search. resolution. Inference with BBN. Nils J.Handling uncertainty & Learning: Source of uncertainty. al.Natural Language Processing (NLP) & Planning :Overview of NLP tasks. Case studies of expert system.: Rule based Expert Systems (A practical Introduction ) Narosa Publishing House.Ramani. Predicate logic.

IPX/SPX for LANs.V ADVANCE JAVA WEB PROGRAMMING: Parsing data using string Tokenizer..Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20712(CS) Comp.IPv4 & v6 address structures. Programming Applications: Time & date routines. Different Winsock APIs & their programming technique. Email. blocking sockets.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS Name of Subject Semester Maximum Marks Lecture Periods/Week 3 Network Programming B. byte manipulation & address conversion functions. connect. window socket & blocking I/O model.R: UNIX Network Programming. XNS. RMI. listen. UNIT. 28 Credits 4 UNIT. Steven. Implementing generic network client. Datalink layer protocols. elementary socket system calls – socket.Berkeley Sockets: I/O asynchronous &multiplexing models.: Windows Network Programming. UNIT. TCP & IP headers. Retrieving file from an HTTP server. signal & fcntl functions. & Engg. Network architecture. fork. Introduction to Java Beans. Name of Text Books:1. API overview. UNIX domain protocols. Davis. PH NewJersey. socket implementation (client &server programs). Accepting connection from browsers. Server side programming: Steps for creating server. packages. close. Network layer. Web server working method & programming. select & poll functions. Internet protocols: Application layer. . Thread programming. TCP ports (ephemeral.P. Assigning address to a socket. NETWORK PROGRAMMING With Windows Socket By Baner . Chat.I NETWORKING & TCP/IP: Communication protocols. Client side programming: Creating sockets. PHI (VOL I& II) 2.R. Adding multithreading to a server. Socket addresses.IV JAVA SOCKET PROGRAMMING: Java network programming. Berkeley Sockets: Overview. UUCP. UNIT. accept. bind. timeouts for blocking I/O. Java socket programming. Posix data type. blocking functions. Window Socket Programming by Bobb Quinn and Dave Schutes 3. Introduction to CGI programming. Transport layer.W. exec. Addison Wesley 4. UNIT-II UNIX SOCKET PROGRAMMING IN C: Creating sockets.III WINSOCK PROGRAMMING: Windows socket API. Sc. socket address structures. Overview of Javascript. Retrieving web documents byusing the URL class. reserved).

JPEG. Opening & Closing. Correlation based and feature based stereo correspondence. Applications to Boundary extraction. TSP ltd. Lossy compression.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20731(CS) Comp. Digital Image Processing. Sonka and Brooks. Histogram equalization. Unit III: Morphological Image Processing: Logic operations involving binary image. Laplacian filter. region filling. Edge linking & boundary detection. optical flow. John Wiley and sons. .Huffman coding. Jain and Rangachar. Digital Image Processing. Dialation & Erosion. Line detection. Histogram specification. LZW coding. Spatial & Gray level resolution. spatial filterssmoothing and sharpening. High pass filtering. MPEG. & Engg. FFT.DCT. Image Processing. Ganzalez and Woods. Region based segmentation. shape from motion. 2. Image enhancement in special domain: Piecewise transformation functions. Ideal & Gaussian low pass filters. 28 Credits 4 Unit I: Introduction: Image formation model. Texture. MGH. Sc. Projective geometry. connected component extraction. Name of Text Books:1.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS Name of Subject Semester Maximum Marks Lecture Periods/Week 3 Digital Image Processing B. Edge detection. filtering in frequency domain. video compression. Unit IV: Image Compression: Coding redundancy. Canny edge detector. image averaging. Shape numbers. Unit II: Image enhancement in frequency domain & Image Segmentation: 2D discrete fourier transform & its inverse. Thresholding. Pearson education. run length coding. Name of Reference Books :1. Machine Vision. Schalkoff. Unit V: Image Representation & 3D: Boundary descriptors. 2.

Hussain & D. Thomson 4. PHI. Name of Text Books: 1. M. overview of the supporting databases. human resource. purchase. MRP. MONAK & BRADY : Concepts in ERP. material management. Forecasting. information needs of organization. V. technologies required for ERP. administrative process. accounting & finance. decision making involved at the above level. & Engg. motivation for ERP. education & training. Information systems. V. marketing. Venkatkrishnan . Analysis. Need for integrated process view. PHI. 3. Sadagopan : MIS. UNIT – V IMPLEMENTATION ISSUES Pre Implementation issues. scheduling. information as a resource. finance support processes. forecasting. management information systems (MIS). PHI 2. concepts & practices. strategic planning. productivity management. 28 Credits 4 UNIT – I OVERVIEW OF BUSINESS FUNCTIONS : Business function in an organization. shop floor control.II TYPICAL BUSINESSS PROCESSES Core processes. sales order processing.K. J. . features of each of the models description of data flows across module. performance measurement. Design & Implementation. ERP as an integrator of information needs at various levels. scheduling.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20732(CS) Comp.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS Name of Subject Semester Maximum Marks Lecture Periods/Week 3 Enterprise Resource Planning B. 2. Rajaraman : Analysis & Design of Information Systems. distribution. product control. S. executive information systems. human resources. financial justification of ERP. research & development problems in traditional functional view. PHI Name of Reference Books :1. Kanter : Managing with information. maintenance. ERP. hussain . UNIT. reengineering of various business process. project management.K. UNIT – III EVOLUTION OF INFORMATION SYSTEM EDP (electronic data processing) system. Sc. K. finance. UNIT – IV ERP MODELS /FUNCTIONALITY Sales-order-processing. evaluation of commercial software during implementation issues. Garg & N. vikas pub.TMH. post implementation issues.

systemic grammar. I 2. transfer metaphor.). & Engg. Unit -III Pragmatics Discourse: Reference Resolution. Features and Augmented Grammars. by Covington. Unit –V Machine Translation Language Similarities and Differences. Natural Language Processing for Prolog Programmers. direct translation. Strategies for Semantic Interpretation. Ambiguity Resolution. Ambiguity Resolution. Linking Syntax and Semantics. Natural Language Understanding (2nd ed. using statistical Techniques Name of Text Books: 1. G & Mellish. functional unification grammar. Syntactic and Semantic Coherence. & Martin. An Inference based resolution algorithm. Scoping and the Interpretation of Noun Phrases.). Grammars and Parsing. lexical transfer. Sc.H. Dialogue and Conversational Agents: What makes dialogue different? Dialogue structure and coherence. Fromkin. by Jurafsky. Foundations of General Linguistics (2nd ed. J Name of Reference Books: 1. Towards Efficient Parsing. 28 Credits 4 Unit –I Introduction & Syntactic processing The study of Language. V & Rodman. Grammars for Natural Language. Allen. R 3. C . syntactic transformations.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS Name of Subject Semester Maximum Marks Lecture Periods/Week 3 Natural Language Processing B. Unit –IV Natural language Generation Introduction to language generation. D. Unit -II Semantic Interpretation Semantics and Logical Form. idea of interlingua. An Introduction to Language (5th ed. Text Coherence. M. By Gazdar. an architecture for generation. J. Kilby.) by Atkinson. surface realization. 2. D A & Roca. discourse planning. Speech and Language Processing. Linguistic background.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20733(CS) Comp. M A 4. Natural language processing in Prolog: an introduction to computational linguistics.

Testing. Laplante. Memories. Mail boxes Critical Region. terminology. Real Time Systems As Complex System. Computer Hardware. 28 Credits 4 Unit-I Basic Real. Other Devices Language Features. Faults. System Performance Analysis and Optimization: Buffering Data. Analysis of Memory Requirements. Real Time Design Issues. Pseudo code and programmable Design Languages.\. Little’s Law. Language Issues: Basic component Architecture. Non-temporal Transition in the software life cycle. Time Loading and its Measurement. Code Generation Unit. Real Time System. Classical Queuing Theory. The Software Hesisenberg Uncertainity Principle. Polled Loop Systems. Sc. And Fault Tolerance. Real Time Systems Design and Analysis by Phillip A. Real Time Applications: Goals of Real Time System Integration. Scheduling NP Complete. Input. Failures . Real Time System: Scheduling. Petrinets. building Real Time Applicaions with Real Time Programming Languages. Dynamic Allocation.Output. Hard Real Time Computing Systems Predictablle Scheduling Algorithms and applications By Giorgio C. Reducing Memory Loading. Semaphores. Real Time Kernels: Phases of software life cycle. Foreground/Background Systems Full Featured Real Time OS Unit-III Inter task Communication and Synchronization. Response Time Calculation. Buttazzo 2. Interrupt Driven System. Tools. Static Schemes. Coroutines. K. Relocating Response Times And time Loading.bugs AND effects. Process Stack Management.II Software life cycle.Time Concepts. Finite state Automata. Statecharts. & Engg. Real Time memory Management. Non Von Neumann Architectures. Fault Tolerence. Spiral model. Interuupt Latency. Event Flags and Signals .Deadlock. Real Time Design Patterns: Robust Scalable Architecture for Real Time System by Bruce Powel Douglass 3. Cheng .PHI Reference Books: 1. Text Books : 1. Jane W.Liu 2. Classification of Architectures. Unit-V Hardware/ Software Integration. Reliability.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS Name of Subject Semester Maximum Marks Lecture Periods/Week 3 Real Time System B. Testing. Multiprocessing Systems: Basic Buffer size Calculation. Unit-IV Queuing Models. Natural languages. Reliability. phase/State Driven Code. I/O Performance.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20734(CS) Comp. Flow Charts. Mathematical Specification. Analysis and Verification by Albert M. Real time Image Processing Real Time UNIX. Survey of Commonly Used Programming Languages. Distributed Systems. Data Flow Diagrams. CPU. Structure Charts.S. Real Time Specification and Design Techniques. First Real Time Application Real Time Databases. Methodology.

Concurrent logic programming. Sc. Clocksin & Mellish. Programming in Prolog.V FUNCTIONAL PROGRAMMING :Introduction to functional programming (FP). Grammar Rules. Recursive list. Lazy evaluation & delay of unnecessary computation. Recursive data structure. UNIT -III PROLOG PROGRAMMING :Execution of query in prolog program. Cut & Arithmetic. Saroj Kaushik. programming in PROLOG (overview): predicates. Searching in state space. Lists & data. Narosa Publishing House.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20735(CS) Comp. & Engg. Constraint logic Programming. Negation in logic programming. K. Functional – Logic program (FLP). Higher order Predicates UNIT. SLD – Resolution. Arithmetic operations.I INTRODUCTION OF LOGIC PARADIGM :Prepositional calculus & logic. 3. PHI. Pearson Education.II LOGIC PROGRAMMING : Logic formulas. Prolog programming. Reference Books :1. Context free grammar vs logical grammar.IV ADVANCED FEATURE OF LOGIC PROGRAMMING :Object & Meta language. The relational functional markup language. Logical Inference. Explicit data values. semantic tableaux & resolution. Compilation of DCGs into prolog. Bratko. meta level & non deterministic programming. Element of functional Programming. Herbrand universe & H-interpretation UNIT. Recursion. UNIT. AWL. New Age International. The least Herbrand Model. second order program in prolog. Text Books :1.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS Name of Subject Semester Maximum Marks Lecture Periods/Week 3 Logical & Functional Processing B. logic grammars. Reade Chris. Logic & Prolog programming. The essence of logic. 2. Higher order functions. Unification. natural deduction & axiomatic system. 28 Credits 4 UNIT. 2. cut & fail. Rules. Prenex normal forms & skolemization. Computations. Horizon transformation. Introduction to SML a functional language. . FOPL : predicate calculus. John.

Michael J Quinn. static interconnection networks. control flow versus data control. Name of Reference Books :1. High bandwidth I/O. "Parallel Computer 2 –Arch. Cache coherence. C.& Algo. vector and symbolic processors. Mechanisms. JB. Flynn. Unit IV: Synchronous Parallel Processing: Vector instruction types. Multiprocessor system interconnection. MGH.Theory and practice . Bus specifications and standards.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS Name of Subject Semester Maximum Marks Lecture Periods/Week 4 Advanced Computer Architecture B. Program partitioning & scheduling. Disk I/O. 28 Credits 5 Unit I: Pipeline: Linear pipeline processor: Nonlinear pipeline processor.". Name of Text Books:1.Computer Architecture & Parallel processing . R. SIMD & MIMD. SIMD computers and performance enhancements. SIMD architecture. computer Architecture: Pipelined and parallel processor design. Dynamic instruction scheduling. Hwang. Unit III: Parallel Computer Models & Program parallelism: Classification of Machines. High bandwidth memories. Instruction pipeline design. vector access memory schemes. Hockney. Multistage & combining networks.R. Boston.Parallel computing. Adam Hilger.W. Sc.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20741(CS) Comp. Unit II: Memory Hierarchy & I/O organization: Cache memories. data flow architecture.Kai Hwang 7 Briggs. dynamic interconnection networks. 3. K.. Super-scalar processors. 2. VLIW architecture. Condition of parallelism. Jesshope. "Advanced Computer Architecture with ParallelProgramming".Mc Graw Hill . 2. Arithmetic pipeline design. grain size latency. & Engg. data and resource dependencies. Unit V: System Interconnection: Network properties and routing.(MGH). SIMD parallel algorithms. SISD.

Processes and Threads. Distributed OS architectures. Internal architecture of UNIX. Text Books:1. Classification of UNIX command Handling files. WINDOWS programming environment. PHI. interaction models. Understanding UNIX. Distributed Algorithms: Distributed algorithm design principles and issues such as coordination. TMH. Handbook of WINDOWS OS. K. Singha . Shell Programming environment. UNIT – V CASE STUDY OF OPERATING SYSTEMS :Case Study of Process Management. Examine source of difficulties such as timing. System calls for WINDOWS. Reference Books:1. agreement. and failures. Sc. File – Memory – I/O – Process management in UNIX. UNIT-II SECURITY AND DISTRIBUTED ALGORITHM :Overview of security techniques. Classification of WINDOWSOS command. Operating System Architecture.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20742(CS) Comp. Architectural Model. BPB publication. Operating System . K. & Engg. Internal architecture of WINDOWS OS. Distributed OS. Recent Advances. Protection. Sun Network File System. challenges in designing distributed OS. IEEE press. Milan. PHI. The Global name service . Directory and discovery services. Distributed Operating System By P. digital signatures. 2. I/O Management. LINUX OS. Cryptographic pragmatics. 2. Name Services : Name services and domain name systems. Memory Management. Communication and invocation. the Andrew File System. UNIX. Handling directories. Resource sharing. LINUX etc. . software layers. Srirengan. IEEE Press 3. File Management. Administration of WINDOWS OS system. File – Memory – I/O – Process management in WINDOWS OS.S Tanenbaum.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS Name of Subject Semester Maximum Marks Lecture Periods/Week 4 Advanced Operating System B. Cryptographic algorithms. X . Distributed File System : File Service Architecture.500 directory service. UNIT – III STRUCTURE OF UNIX OPERATING SYSTEM :Overview of UNIX. Handling directories. Handling files. A. Administration of UNIX system. The Operating System Layer. UNIT – IV STRUCTURE OF WINDOWS OPERATING SYSTEM :Overview of WINDOWS OS. 28 Credits 5 UNIT-I INTRODUCTION TO DISTRIBUTED OPERATING SYSTEM:What are distributed OS? Examples of distributed OS. 3.

The Gossip Architecture. UNIT. Oracle network protocols. 7th edition.II DATA REPLICATION & QUERY PROCESSING IN DDBS :Classification of replica control strategies. Statistical databases. C. Elmasri & Navathe. Reliability concept & measure.Authorization. Sc. distributed transactions. Consistency & Request ordering. Oracle DBMS. Data encryption. Security models. 4th edition. Query decomposition. & Engg. Distributed processing in Oracle.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20743(CS) Comp. Site failure & network portioning. Replication in Oracle. Real time databases. Rajesh Narang. JDBC. Purpose of PL/SQL. Pearson education . Client/Server DBS. parallel & distributed systems. Ivan Bayross. Identification-Authentication. PL/SQL block. I/O parallelism. Database system concepts . Fragmentation. Pearson education References:1. recovery techniques based on deferred update & on immediate update shadow paging. Objective of query processing. PHI. structure & type. Distributed query optimization algorithms. Multimedia databases. Network administration in Oracle. UNIT. Process groups & ISIS. Text book: 1.J. Transaction property. Query optimization in Centralized system. Basic model of database access control. directory systems. database backup and recovery from catastrophic failures. Query optimization in Oracle. UNIT-III TRANSACTION PROCESSING & RECOVERY :Centralized & client server architecture.heterogeneous distributed databases.2nd edition . 3. Interquery-intraquery intra operation interoperation parallelism design of parallel systems. The ARIES Recovery Algorithm. Silberschatz-Korth-Sudarshan.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS Name of Subject Semester Maximum Marks Lecture Periods/Week 4 Advanced Database System B. Theory of OO databases.I DISTRIBUTED DATABASE DESIGN :Design strategies. Distribution design issues. Security in Oracle. Distributed deadlock management. Date’s rule for DDBS. availability . TCSEC Policy identification. MH 2. Database concepts & systems . PL/SQL syntax & programming. Date . recovery concepts. 28 Credits 5 UNIT. Oracle DDB design. Recovery in multi-database systems. SPD 2. Distributed database system architecture. server systems architectures. An Introduction to database systems. Database Management System. UNIT-V DIFFERENT DATABASES :Parallel databases: Introduction. Fundamentals of database systems 3rd edition. concurrency control in distributed database.IV SECURITY MANAGEMENT & PL/SQL :Various aspect of database security. commit protocols. distributed data storage. Database recovery in Oracle. Allocation.

Sc. Timers.2) (Pearson Education) 3. A sample internet with classful addressing. Forouzan. TCP/IP Illustrated By Wright and Stevens (Vol. Subnetting.) 2. congestion avoidance and control. Paths. Multicast Routing Protocols.) Name of the Reference Book: 1. Gateways.Tech VII Sem 70 Tutorial Periods/Week 1 Subject Code Board of Studies Minimum Marks Practical Periods/Week CS20744(CS) Comp. Options. IP Addresses: Introduction. Virtual circuit in ATM. Kurose. Routing Methods: Routing Table and Routing module. Interconnection Network. Address Classification. Multicast Trees. TCP/IP Protocol suite by Behrouz A. TCP state machine. James L. ATM cell transport and adaptation layers. IP Address binding in an ATM Network. Checksum. UNIT – II INTERNET PROTOCOL Purpose of Internet Protocol. Name of The Text Book: 1. Mansfield Jr. events and messages.Antonakes (PHI) . Ross (Pearson Education) 2. Basics of switching technologies and switches. UNIT –IV TCP IMPLEMENTATION TCP operation. Circuits and identifiers. urgent data processing and push function. packet type and multiplexing. Internet datagram. timer process. OSPF. UNIT –III ROUTING PROTOCOLS: UNICAST ROUTING PROTOCOLS Interior and Exterior routing. deleting and inserting timer event. Classless addressing. 28 Credits 5 UNIT –I INTRODUCTION Introduction to internetworking. Comparisons of different models. Multicasting: Introduction. CBT. Logical Subnet Concept and Connection Management. Security at the IP Layer. MOSPF. IGMP. Keith W.(TMH Pub. Overview of OSI Model TCP/IP protocol suite. DVMRP. 1)(PHI Pub. flow control and adaptive retransmission. ICMP. Multicast Routing. An Introduction to Computer Networks by Kenneth C.MBONE. ATM Switch. BGP. Computer Networking by James F. IPSec. ARP and RARP. IPv4 and IPv6 packet formats. & Engg. ATM reference model. UNIT-V TCP/IP OVER ATM NETWORKS ISDN and B-ISDN.PIM. Supernetting.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS Name of Subject Semester Maximum Marks Lecture Periods/Week 4 Inter Networking with TCP/IP B. RIP. Internetworking with TCP/IP by Comer (Vol.

son. (viii) Write a program given the knowledge base. Publication). male.F. (xiii) Solve the classical Travelling Salesman Problem of AI. If Town x is connected to y by z then y is also connected to x by z. brother. If x is on the top of y. (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. Convert the following into wffs. ancestor given the facts about father and wife only. child. clausal form. Town D is connected to Town E by Road 4. Bikes are only either allowed on Road 1 or on Road 2 every day. (xiv) Solve the classical Blocks World Problem of AI. Town B is connected to Town C by Road 2. Town A is connected to Town B by Road 1. (xv) Write a program to search any goal given an input graph using AO* algorithm. If x is above y and they are touching each other. daughter. 5. & Engg. you can get to y from x by bike. Bikes are allowed on roads 3. (xii) Solve the classical Missionary Cannibals problem of AI. Town D is connected to Town B by Road 5. Credits 1 Experiments to be performed: (i) Write a prolog program to find the rules for parent. y supports x. clausal form and deduce that `One can get to town B from town D’. If you can get to town q from p and also to town r from town q.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS Name of Subject Semester Maximum Marks Lecture Periods/Week Artificial Intelligence & Expert System Lab B. Convert the following into wff’s. sister. Sc. x is on top of y. (ix) Solve the classical Water Jug problem of AI. (iii) W. (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. aunt. you can get to town r from town p. If Town x is connected to Town y by highway z and bikes are allowed on z. (v) Write a program to find union and intersection of two given sets represented as lists. Clocksin & Mellish : Programming in PRLOG ( Narosa Publication House) . ( BPB. (vii) Write a program given the knowledge base. (x) Solve the classical Monkey Banana problem of AI. A cup is above a book. female. (ii) Carl Townsend : Introduction to Turbo Prolog. Is it possible to deduce that `The book supports the cup’. (xi) Solve the classical Crypt arithmetic problems such as DONALD + GERALD = ROBERT of AI.Tech VII Sem Tutorial Periods/Week Subject Code Board of Studies Minimum Marks Practical Periods/Week 2 CS20721(CS) Comp. The cup is touching that book.Town A is connected to Town C by Road 3. 4. uncle. List of Equipments/Machine required : (i) PC with Wndows XP (ii) Visual prolog compiler Recommended Books : (i) Ivan Bratko : Logic & prolog programming.

Write an echo program with client and concurrent server using UDP. Write a client and server program to implement file transfer. Write a program to retrieve date and time using UDP. Write a client and server routines showing I/O multiplexing. 4. 7. Write an echo program with client and iterative server using TCP. 5. 8. & Engg. Write a program to retrieve date and time using TCP. 2. Write an echo program with client and concurrent server using TCP. Credits 1 (JAVA NETWORK PROGRAMMING) 1. 3. Write a client and server program to implement the remote command execution 12. . Sc. 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. Write an echo client and server program using Unix domain Datagram socket. Write an echo client and server program using Unix domain stream socket. 9. 6. 10.Tech VII Sem Tutorial Periods/Week Subject Code Board of Studies Minimum Marks Practical Periods/Week 3 CS20722(CS) Comp. Write a client and server routines showing Blocking I/O.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS Name of Subject Semester Maximum Marks Lecture Periods/Week Networking Programming Lab B.

Gerson & Steven M. extranet. conclusion. revising first draft.. Davies J. Intranet. discussion. Electronic Communication: Internet. Case Studies. Longman 3. "Effective Technical Communication". types of letters. Multiple Audience. Sharon J.Process& Product". Audience Recognition: High-tech audience. its importance. etc. Effective style of technical report writing: Structures: content. lab report.II Correspondence: Memos. Sc. etc. tables.DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING SYLLABUS Name of Subject Semester Maximum Marks Lecture Periods/Week Report Writing and Seminar B. graphs. Unit -V Proposals & Presentation: Title page.III Summary: Report Strategies. Lay audience. . incident report. Unit . list of illustrations. project report. diagrams. conclusions. Credits 1 Unit -I Introduction to Technical Writing: how differs from other types of written communication Purpose of technical writing. Eisenberg. writing and rewriting Objectives of Technical Writing. "Communication for engineering students". Types of Report: Trip report. Writing first draft. Document Design. references. Writing effective e-mail. Progress report. Presentation. Mc. references. Low tech audience. introduction. appendix. Unit . Graw Hill. glossary. Pearson Education. etc. Letters. Table of Content. E-mails. Feasibility report. Cover letter. Correspondence: prewriting.Tech VII Sem Tutorial Periods/Week Subject Code Board of Studies Minimum Marks Practical Periods/Week 2 CS20725(CS) Comp. Gerson "Technical Writing . & Engg. Case Studies. Oral Presentation/ Seminar: Text Books: 1. Sunita Mishra. "Communication Skills for Engineers" Pearson Education 2. report lay-out. Its differentiation. summary. Reference Books: 1.W. Unit -IV Report Writing: Criteria for report writing.

Sign up to vote on this title
UsefulNot useful