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