PTU/BOS/CS/101/08-05-2004/BATCH 2003

Punjab Technical University Jalandhar

Computer Science

Scheme of Syllabi ( 3rd to 8th Semester ) 2003 - 04


PTU/BOS/CS/101/08-05-2004/BATCH 2003

Sr. No. 1. 2. COURSE COURSE TITLE CODE CS-201 CS-203 Computer Architecture L 3 3 HOURS/WEEK MARKS INT 40 40 60 100 40 EXT 60 60 TOTAL 100 100

1 1 1

P -

Discrete Structures
Digital Circuits & Logic


CS-205 Design Data Structures &



CS-207 Programming Methodology Written & Oral Technical







1 2

40 60 100


CS-209 Communication

6. 7.

CS-211 CS-213

Programming Languages Software Lab- I (DSPM) Institutional Practical

3 -

1 -

3 -

40 30

60 20

100 50


CS-215 Training





9. 10.

CS-217 CS-219

Hardware Lab -I (DCLD) Software Lab - II (PL) Total (31 Hours)

17 -


2 3

30 30

20 20

50 50 850




PTU/BOS/CS/101/08-05-2004/BATCH 2003

4th semester
Sr. No. 1 2 3 4 5 6 7 8 9 Course Course Title Code CS-202 Operating System CS-204 Mathematics – III CS-206 Data Communication Microprocessor & CS-208 Assembly Language Programming CS-210 Systems Programming CS-212 Software Lab - III (OS) CS-214 H/W Lab. II (DC) H/W Lab. III (Microprocessor & CS-216 Assembly Language Programming) CS-218 Software Lab-IV(SP) General Fitness TOTAL (30 Hours) L 3 3 3 3 3 15 T 1 1 1 1 1 5 10 P 2 2 2 4 20 30 50 100 800 60 20 20 20 40 30 30 30 100 50 50 50 Ext. 60 60 60 60 Int.. 40 40 40 40 Total 100 100 100 100

There should be institutional/industrial training of 6 week in summer vacation after 4th semester


CS-303 CS-305 Computer Networks DBMS Design and Analysis of 3 3 40 40 60 60 100 100 4. CS-315 netwoks) - 30 20 50 9. CS-309 Computer Graphics Computer Peripherals and 3 1 3 1 - 40 60 100 6. CS-313 Software Lab. CS-317 Software Lab VI(Algorithms) S/W Lab VII(Computer - - 2 2 30 20 50 10.PTU/BOS/CS/101/08-05-2004/BATCH 2003 FIFTH SEMESTER Sr. CS-319 Graphics) Industrial Training - 30 20 50 60 40 100 18 6 10 420 480 900 4 . CS-307 Algorithms 3 1 - 40 60 100 5. COURSE COURSE TITLE CODE L System Analysis and Design 3 T 1 1 1 P INT 40 EXT 60 TOTAL 100 HOURS/WEEK MARKS 1. No.(DBMS Lab ) H/W lab-IV(Computer - - 4 2 30 20 50 8. CS-301 2. CS-311 Interfaces 40 60 100 7. 3.

COURSE COURSE TITLE CODE Relational 1. 5. No. 7. 9. 8. 6. CS-302 Management System-II Introduction to Business 2. CS-320 System) General Fitness Total (36 Hours) 18 6 12 360 540 100 900 Lab-X(Business 3 3 3 1 1 1 4 4 2 2 40 40 40 30 30 60 60 60 20 20 100 100 100 50 50 Transfer 3 1 40 60 100 3 1 40 60 100 Database 3 1 L HOURS/WEEK MARKS INT EXT TOTAL T P - 40 60 100 30 30 20 20 50 50 Open Elective CS . CS-312 CS-314 CS-316 CS-318 CS-308 Software Engineering Elective –I Open Elective H/W Lab-V(ATM) S/W Lab-VIII(RDBMS-II) S/W Lab-IX(S/W Engg.PTU/BOS/CS/101/08-05-2004/BATCH 2003 SIXTH/SEVENTH SEMESTER Sr.) S/W 10.312 COMPUTERS AND SOCIETY (For other branches only) 5 . CS-306 Mode 4. CS-304 System Asynchronous 3.

Viva 500 TOTAL 1000 Elective: I CS-310 Computer Vision CS-322 System Hardware Design CS-324 Real Time Systems CS-326 Operation Research CS-328 Language Processor CS-330 Natural Language Processing EIGHTH SEMESTER Sr. CS-402 CS-404 CS-406 CS-408 CE-216 Symbolic Logic & Logic Processing Formal Language Automata Theory Project Principles of Engineering .Ecomonics & Management Techniques Environmental Sciences Department elective –II Department Elective-III Department Lab Elective-III – & 3 3 3 3 3 3 - 8 40 100 40 40 40 40 30 30 1 1 1 - 2 2 CS-416 Software Lab XIII(Sl&LP) General fitness Total (35 Hours) 18 5 12 400 500 1000 6 . No. 9. 4. 2. 8. COURSE CODE COURSE TITLE HOURS/WEEK L MARKS INT 40 EXT 60 60 100 60 60 60 60 20 20 TOTAL 100 100 200 100 100 100 100 50 50 100 T 1 1 - P - 1. 3. 6. 5.PTU/BOS/CS/101/08-05-2004/BATCH 2003 6th / 7th Semester Course Title 6-month Industrial Training Internal 500 Ext. 7.

Trends List of Electives-III I. CS-414 Graphical User Interface CS-428 Advanced Microprocessor CS-430 Expert System. IV. III. II. CS-410 Organisational Structure CS-416 Overview of IT Materials CS-418 System Simulation and Modelling CS-420 Emerging Technologies and Current IT. III. CS-432 Image Processing & Pattern recognition 7 . II. CS-426 Image Processing & Pattern recognition Labs of Elective-III I. III. IV. IV. CS-412 Graphical User Interface CS-422 Advanced Microprocessor CS-424 Expert System.PTU/BOS/CS/101/08-05-2004/BATCH 2003 List of Electives -II I. II.

Transaction processing benchmarks. Computer Architectures.add. USA. [15%] Performance evaluation SPEC marks LINPACK Whetstone Dhrystone etc.S. DMA. [10%] TEXT / REFERENCES : Patterson and Hennessy. Prentice Hall of India Pvt. 3rd Edition. Bhujade. multiply . Morgaon Kauffman.algorithms and implementations.. M. San Mateo. Perspectives in Computer Architecture. cost/benefit concept of layers in architecture design 10%] Basic Computer Organization taking 8085 as an example binary arithmetic .Pal Chaudhary.V.1994. Finally the student will be exposed to the recent trends in parallel and distributed computing and multithreaded application. Pipelining in CPU design superscalar / hardware interaction. Channel. 1994. subtract.program interrupt. [15%] I/O performance measures . main memory. [15%] CPU design . P. NEW Delhi.. Ltd.SIMD SPMD and MIMD machines.Parallel & distributed computers . [10%] Multiprocessors . CA. 1996.RISC vs CISC. THIRD SEMESTER COMPUTER ARCHITECTURE L T P 3 1 - PREREQUISTES : None OBJECTIVES : This course offers a good understanding of the various functional units of a computer system and prepares the student to be in a position to design a basic computer system. Digital Computer Design Principles.interaction with operating system Serial/Parallel Interfaces taking 8251 and 8255 as examples. [15%] Memory hierarchy design caches. I/O Processor. Interleave memory virtual memory architectural aids in implementing these.. Rao. 1992. Pitamber Publishing Co.Choice of instruction set control structure hardwired and microprogrammed control .Buses connecting I/O devices to CPU/memory . COURSE CONTENTS : Principles of computer design . Ltd. [10%] I/O Modes. Computer Organization and Design Prentice Hall of India Pvt.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-201 External Marks: 60 Internal Marks: 40 Total Marks: 100 V. carry look ahead add fast adders. P. 8 . New Delhi..

VM Chandrasekaran L T P 3 1 - 9 . [15%] Monoids and groups: Groups Semigroups and monoids Cyclic semigraphs and submonoids. dihedral groups Elementary applications in coding theory. Normal subgroups. Subgroups and Cosets. Generating Function. Congruence relations on semigroups.Directed and undirected Eulerian chains and cycles. [20%] Rings and Boolean algebra : Rings Subrings morphism of rings ideals and quotient rings. [20%] Combinatorial Mathematics: Basic counting principles Permutations and combinations Inclusion and Exclusion Principle Recurrence relations. Euclidean domains Integral domains and fields Boolean Algebra direct product morphisms Boolean sub-algebra Boolean Rings Application of Boolean algebra in logic circuits and switching functions. COURSE CONTENTS: Graph Theory: Graph. REFERENCES: 1. Structure of Cyclic groups permutation groups. [30%] TEXT BOOKS: 1. Hamiltonian chains and cycles Trees. Discrete Mathematics (Schaum series) by Lipschutz (Mc Graw Hill) 2.203 DISCRETE STRUCTURES External Marks: 60 Internal Marks: 40 Total Marks: 100 PREREQUISITES : Mathematics & Data Structures OBJECTIVES The objective of this course is to provide the necessary back ground of discrete structures with particular reference to the relationships between discrete structures and their data structure counterparts including algorithm development. Discrete Mathematics by N Ch S n Lyengar. Applied Discrete Structures for Computer Science by Alan Doerr and Kenneth Levarseur. [15%] Sets and functions: Sets and relations functions operations equivalence relations relation of partial order partitions binary relations. Application. Morphisms. Chromatic number Connectivity and other graphical parameter.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . Application.

RAM. [10%] Combinational design ..1972. G. 1993. use of programs such as expresso in minimization. PAL. To treat logic design and making them familiar with the CAD tools in digital system design. Analog and Digital Circuits and Systems. transmission line effects. Addition Wesley. Ltd. ROM. Perry. Tata McGraw Hill . "Integrated Electronics. RTL/DTL/DCTL/TTL/MOS/CMOS/ECL. Prentice Hall of India Pvt. [15%] Memory system . McGraw Hill Douglas L.Millman and Halkias. L T P 3 1 - 10 . 2nd Edition. sequential circuit design from state diagrams computer aids in synthesis. analysis of basic circuits in these families.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-205 DIGITAL CIRCUITS & LOGIC DESIGN. Custom and semi-custom design. [5%] TEXT /REFERENCES: Morris Mano. ISCII.. logic gates. VHDL.Rajaraman.Prentice Hall of India Pvt. 1979. [5%] Digital Circuit Technologies. counters. Introduction to VLSI Systems. EEPROM. internal architecture of programmable logic devices. PTR Prentice Hall.Designing with FPGAs and CPLDs . line termination. [15%] Introduction to VLSI Design . flip-flops. design with Muxes. R. Inc. Digital Design. state diagrams. [10%] A/D and D/A conversion techniques and selected case studies. Digital Integrated Electronics. [5%] Sequential circuits. COURSE CONTENTS: Data and number representation-binary-complement representation BCD-ASCII. shift registers. Schilling. PLDs. Viswanathan . Mead and L.Taub & D. External Marks: 60 Internal Marks: 40 Total Marks: 100 PREREQUISITES: None OBJECTIVES: To give students basic ideas regarding digital hardware components at the level of gate and sequential circuits. K. minimization. 1978 J.PGAs. [15%] Boolean algebra. [20%] Bus structures. Ltd Jesse H Jenkins. "Electronics for Scientist and Engineers". EPROM. Meat and V. McGraw Hill. Englewood Cliffs H. Conway. multivibrators.

OBJECTIVES: The course should provide one with a fairly good concept of the fundamentals of data structures and also of the commonly occurring algorithms.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-207 DATA STRUCTURES & PROGRAMMING METHODOLOGY External Marks: 60 Internal Marks: 40 Total Marks: 100 L T P 3 1 - PREREQUISITES: The algorithms presented should be written in a pseudocode similar to the programming language Pascal / C and therefore. [10%] Sets [12%] 11 . The experience in structured programming and knowledge of combinatorial mathematics would be helpful. the readers should preferable be familiar with Pascal / C. its analysis should also be included as and when required. COURSE CONTENTS: Introduction [8%] Linear Data Structures I: Arrays & Records [5%] Linear Data Structures II: linked lists [10%] Linear Data Structures III: Stacks and Queues [5%] Linear Data Structures IV: Strings [5%] Recursion [10%] Non Linear Data Structures I: Trees [8%] Non Linear Data Structures II [10%] Hashing. quite frequently . Given a data structure. list or graph. To make it useful for problem solving the abstraction is made concrete by going into the data structure of the model. Naturally. several alternative algorithms exist for the same operation. The course should present the general approach towards analyzing and evaluating algorithms and while presenting an algorithm. The mathematical model of data is an abstract concept of data such as set. the question analyzing an algorithm to determine its performance in relation to the other alternatives becomes important.its implementation and associated algorithms.

S. Data Structures and Algorithms.T. 1987. J.: Algorithms + Data Structures = Programs.. 1976. V. E. P. S. Addition-Wesley. McGraw . Tremblay. Berztiss. Addition . 1992. Kruse. Computer Science Press. J. Theory and Practice : 2nd ed.E.: Data structures.G. Computer Science Press. Sahni : Algorithms: Design and Analysis. McGrow.Hedetniemi: Introduction to the Design and Analysis of Algorithms.A. 12 . 1977 . An Object-Oriented Approach. Addition-Wesley. 1973. A. Horowitz E. D. Academic Press. Data Structures. 1984. Wirth.D. 1975.Hill. 1977. S. Hopcroft. W. H. 1980. 1977 Horowitz.: Data Structure Techniques. Goodman..T. Vols 1-3.Wesley .PTU/BOS/CS/101/08-05-2004/BATCH 2003 Graphs [12%] Files [ 5%] TEXTS / REFERENCES : Aho A. 1976. 2nd Ed. Sorenson: An Introduction to Data Structures with Applications. J. J. 1983 Baase.. Data Structures and Program Design . S. 1978. S Computer Algorithms: Introduction to Design and Analysis. AddisonWesley. R.E. T... Addition-Wesley. Collins. Knuth. L. Standish. E.P.: The Art of Computer Programming . Prentice-Hall. Prentice Hall. Addition-Wesley. Lorin. Ullman. Sahni: Fundamentals of Data Structures in PASCAL. N..: Sorting and sort Systems.Hill ..

B. McMillan. 13th Edition. TEXTS/REFERENCES The Chicago Manual of Style..M. McGraw Hill. "Writing a Technical Paper". 1973.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-209 WRITTEN & ORAL TECHNICAL COMMUNICATION (Communication skills for Scientists and Engineers) External Marks: 60 Internal Marks: 40 Total Marks: 100 L T P 2 1 - PREREQUISITES : NONE OBJECTIVES: The course is intended to develop a student's ability to communicate both in speech and writing in the Situation that he/she is likely to come across in his/her academic and working life. LG. "The Complete Plan in Words" Penguin. "A Manual for Writers of Term Papers. 3rd Edition . 1961. 1979.L. Thesis and dissertations" Univ of Chicago Press. & White E. W.H. COURSE CONTENTS: Note taking from lectures and reference material [10%] Essay and précis writing [30%] Slide preparation and oral presentation principles [10%] Written presentation of technical material [20%] Preparation of Bibliography [10%] Basics of Official Correspondence [15%] Preparation of bio-data [5%] Students should be asked to prepare and present Seminars during the practice session. Prentice Hall of India 1989. Turbian K. IEEE Transactions on "Written and Oral Communication" has many papers. Menzel D. Boyd.. Strunk. "The Elements of Style". 13 . 1973.. Jones H.. Gowers Ernest..

concept of CLR. INTRODUCTION : C and C++ programming. introduction to OLE. System simulate and modelling etc.Net framework. dynamic memory allocation . Windows Applications with MFC. Pappas & William H. Structure unions. standard C and C++ data types .Net Framework:Introduction to . C++ classes I/O M C++. Object oriented stack and linked list in C++ WINDOWS PROGRAMMING FOUNDATIONS : Windows concepts windows programming concept . storage classes. BOOKS:The complete Reference Visual C++5 Chris H. C. adding an user interface to C and C++ program. macro's Advanced preprocessor statements. OBJECT ORIENTED PROGRAMMING: Object oriented terminology. I/O in C. operators Standard C and C++ libraries. III The Visual C++ handbook Chris H. WIZARDS: Application and class Wizards. writing & using functions. Moreover it will be used as a tool for doing minor and major Projects. active X controls with the MFC library. . System project . arrays pointer . differences between C and C++ .N.. Managed and un-managed code in VC++.211 PROGRAMMING LANGUAGES External Marks: 60 Internal Marks: 40 Total Marks: 100 L T P 3 1 - OBJECTIVES: At the end of this course students will be able to simulate the problems in the subjects like O.S. the cost team class list combining C & C++ code. Murray. Pappas & William Murray Osborne 14 . visual C++ Windows tools.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . designing Unique manipulators . procedure -oriented windows Application Microsoft foundation Class library concepts.. Concept of Assemblies.

Development of recursive as well as non recursive a algorithms involving linked list trees and graphs. Use of pointers for dynamic allocations of storage. Emphasis should be given on the following matters.213 Software Lab-I (DSPM ) DATA STRUCTURES & PROGRAMMING METHODOLOGY LAB External Marks: 20 Internal Marks: 30 Total Marks: 50 L T P 3 Algorithm development in all areas of data structures covered in the course. 15 . Development of classes for some of the data structures using the concept of abstract data types.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS.

7404.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS. Design and verification of the truth tables of half adder and full adder circuits using gates 7483. 7432. 16 . Verification of the truth table of the De-Multiplexer 74154. fabrication and testing of low frequency TTL clocks using NAND gates.217 External Marks: 20 Internal Marks: 30 Total Marks: 50 Lab-I (Digital Circuit and Logic Design) L T P 2 1. 7. To study the operation of 2 bit and 4 bit Johnson counters. e. 2. 6. 8. (b)Verify the truth table of a J-K flip flop. 5. Design. Verification of the truth tables of TTL gates. Verification of the truth table of the Multiplexer 74150. (b) To study the operation of 2 bit and 4 bit synchronous counters. 7408. (a)Design and test of an SR flip flop using Nor/Nand gates. 7400. 7402. 3. (a) To study the operation of 2 bit and 4 bit asynchronous counters.g.(7476) (c)Verify the truth table of a D-flip flop (7474) and study its operation in the toggle and asynchronous modes. 7486.. 4.

17 .PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS. Libraries and Functions .219 Lab-II (Programming Languages) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T P 3 PROGRAMMING LANGUAGES LAB Students should be asked to write programs in C & C++ using different statements . Designing Unique Manipulators etc.

Functions of Kernel. Calvin.PTU/BOS/CS/101/08-05-2004/BATCH 2003 FOURTH SEMESTER CS – 202 OPERATING SYSTEM External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES: Computer Systems programming and Data Structures./O system and secondary storage structure [10%] Protection and security [10%] Introduction to multiprocessor and distributed operating systems. process management. file system architecture and implementation. COURSE CONTENTS: Introduction to Operating system. CPU scheduling . A Silberschatz and Peter B. [20%] Case Studies: LINUX . UNIX Operating System with SOLARIS and SCO-UNIX [15%] TEXT BOOKS 1. deadlocks[35%] Memory management paging and segmentation virtual memories[20%] I. computer system structure . Operating System by Madnick Donovan 2. operating system structure. concurrent programming and concurrency . process synchronization. OBJECTIVES: Understand the overall architecture of the operating system and its main components. " Systems Programming & Operating Systems Tata McGraw Hill REFERENCES 1. " Operating System Concepts" Addison Wesley Publishing Company 2. Operating System by Stallings 18 . Dhamdhere.

Cauchy's integral theorem(Proof by using Greens theorem). centers of Mass and Gravity.Popov. A.E. 5th Edition.Danko. Advanced Engineering Mathematics. Continuity. Laplace equations . 19 . mean value theorems and Taylor's theorem. Rolls theorem. 1983. surface area of revolution. heat equation. Taylor series and Laurent series.III External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES: Calculus of two variables and exposure to mathematics-I and Mathematics . [33% Residues and applications to evaluating real improper integrals and inverse Laplace transforms. T. volume. Laplace equation. moments of inertia etc. COURSE CONTENTS: Review of the prerequisites such as limits of sequences and functions.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-204 MATHEMATICS . Part 2. Repeated and multiple integrals with applications to volume. P. Wiley Enstern 1985.Y. elementary functions. [17%] Boundary value problems involving partial differential equations such as wave equation. Mir Publishers.II.G. Conformal mapping. linear fractional transformations. Analytic functions. Moments.A Kaznevnikova. Solutions by the method of separation of variables and by Fourier and Laplace transforms. uniform continuity and differentiability. OBJECTIVES: To teach Engineering Mathematics to the students. Newton method for approximate solution Riemann integral and the fundamental theorem of integral calculus. Cauchy-Riemann equations. Applications to length area. [17%] TEXTS /REFERENCE : E. Higher Mathematics in Problems and Exercises. surface area. Cauchy's integral formula. [33%] Numerical Methods for ODEs and PDEs. Approximate integration.Kreyszig.

trunks . Network Hardware.[20%] Medium Access Sub layer: The channel allocation . Tanenbaum.Computer Networks by Andrew S.[10%] Application Layer: Network security . Elements of Transport protocols. Network Topologies . Data Communication by Stallings 2. multiplexing and switching). TCP service Model . IEEE standards 802 for LAN & MAN. world wide web. Network Software. seven-layer OSI architecture of ISO.[10%] TEXT BOOKS 1. protocols . telephone system (structure. elementary data link protocols . Prentice Hall of India REFERENCES 1. TCP/IP reference model. Data Communication by Miller 20 . Sub nets. comparison of OSI &TCP/IP reference models[20%] Physical Layer: Transmission media . concepts of layer protocols and layer interfaces. IP protocol . DNS .[15%] Transport Layer: Treansport Services. COURSE CONTENTS: Introduction: Uses of Computer Networks. Network Layer: Design issues . [15%] Data Link Layer: Design Issues. sliding window protocols.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-206 DATA COMMUNICATION External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISTES: None OBJECTIVES: This course provides knowledge about various types of Network. Header. Congestion control Algorithims. Error detection and correction . multimedia. E-mail . IP addresses. protocol. wireless transmission . routing algorithms.

2.Microprocessor Architecture(20%) Basic Computer Architecture using 8085 MP I/O. all 8085 instructions. Microprocessors and Interfacing: Programming and Hardware. COURSE CONTENTS: 1. Douglas V. interrupted initiated . Logical group.Gilmore. Charles M. motorola 68000 TEXT BOOKS: 1.segment led display Study of trafic light system stepper motor interface 6.Bus..PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-208 MICROPROCESSORS AND ASSEMBLY LANGUAGE PROGRAMMING External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES : Digital Circuits and Logic Design OBJECTIVES: The course is intended to give students good understanding of internal architectural details and functioning of microprocessors . Csingle chip microcomputer. ROM Simulation introduction to up kits. Instruction set & Assembly Languages Programming (30%) Introduction. instruction & data formats. status flags. Memory & System buses . 4. Microprocessor Development System(MDS)(10%) PROM Programming .DMA transfer serial & Parallel interface. 8085 Microprocessor by Ramesh Gaonkar. Study of 8051. Microprocessor by B. Basic arcitect (5%) Introduction to 8086. Daniel Tabak.Hill. McGraw Hill 21 . Tata McGraw Hill Edition.Case structure & Microprocessor application(15%) Up application interfacing a matrix keyboard 7. Branch Group. I/O memory interface(20%) Programmable .Ram REFERENCES: 1. 2. McGraw. 1986. 3. Microprocessors: principles and Applications. 3. Data Bus Data & Control Bus Synchronous & Asynchronous buses. Inc. Hall. addressing modes.Emilator.Detail study of 8251 I/O Processor. 5. Second Edition 1995. Advanced Microprocessors.Instruction execution sequence & Data Flow. 2. Arthimetic group. Instruction cycle Concept of address. Data transfer groups.

Intermediate Code Generation. 2. COURSE CONTENTS: Editors [5%] 1. Full screen editor and multi window editor. 2. 22 . 8. OBJECTIVES: This course provides knowledge to design various system programs. 4. Introduction to various debugging techniques. Lexical Analysis and syntax analysis.210 SYSTEM PROGRAMMING External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES: One high level procedural language. Bootstrapping for compilers. 5. Case study :. knowledge to assembly language and knowledge of data structures and computer organization. Code generation 9. Assemblers for CISC Machines: case study x85 & x86 machines. 2. 3. 2. Various phases of compiler. 6. 2. First pass and second pass of assembler and their algorithms. Design of a compiler in C++ as Prototype. Concept of linking. Introduction to Grammars and finite automata. Case study :LEXX and YACC. DOS Editor and vi editor. 7. Compilers [30%] 1. Assemblers [20%] 1. Linkers and Loaders [10%] 1. 10. Line editor. Code optimization techniques.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . Introduction to various translators. Debuggers[5%] 1.Debugging in Turbo C++ IDE. Case study MS-Word. Case study of Linker in x86 machines.

23 .D.V. Tata Mc-Graw Hill 1996. New York. Introduction to Systems Software.Aho A. Ullman Principles of compiler Design Addison Wesley/ Narosa 1985. Operating System[30%] 1. and J. Systems Programming .J. Design of Shell and other utilities. REFERENCES: 1. 2.. Dhamdhere. 1972. Donovan J. Booting techniques and sub-routines. TEXT BOOKS: 1. 2.M.. 3.PTU/BOS/CS/101/08-05-2004/BATCH 2003 3. Mc-Graw Hill. Loading of various loading schemes. Design of kernel and various management for OS. D.

cp. 5. mkdir. mv. 2. file. Implementation of shell programming with various control statements and loops. coaxial cable.. twisted pairs. rmdir. cd. wild cards. Study and Implementation of various commands : Ls.212 SOFTWARE LAB – III (Operating System ) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T P 2 1. pwd. Study of LAN (Its installation)its Components and its Topologies.214 HARDWARE LAB – II ( Data Communication ) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T . wc. 8. man. cmp. 24 . cat. cal. 6. Sharing of resources with two connected nodes. Familiarization with Computer Hardware 2. Implementation of Protocols and their configuration.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . optical fibre networking.P 2 1. Familiarization with transmission media viz. Configuring Network Neighborhood. CS . Introduction with Network Computing 3. wireless networking. rm. chmod. Client Server Architecture Peer to Peer Networking Hybrid Networking Direct Cable Connection 4. who. connectors etc. 7.

b) Find 2s complement of 16 bit number. sum 16. a) Find 2s complement of 8 bit number. 2. Subtraction of 2-8 bit number. 8.216 HARDWARE LAB . L T . 10.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . by one bit.bit 3. Addition of 2-8 bit number. b) Find 1s complement of 16 bit number. by one bit. a) Shift an 8 -bit no.III (Microprocessor and Assembly Language Programming) External Marks: 20 Internal Marks: 30 Total Marks: 50 1. Find Largest ot two 8 bit numbers. b) Shift an 16 -bit no.bit 4. 6. Find Largest among an array of ten numbers(8-bit). Sum of series of 8 bit numbers. 9.P 2 25 . 5 a) Find 1s complement of 8 bit number.Introduction to 8085 kit. sum 8. 7. Addition of 2-8 bit number.

Software lab for development of some features of editors Software lab for lexical analyzing using LEX/YACC. 26 . e.P 4 Development of an integrated assembler macro processor direct linking loader module for a subject of assembly language and macro instructions of typical machine. if available .PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS .218 SOFTWARE LAB . Software lab on I/O Programming. interfacing some device to a Intel 8085 microprocessor based systems through serial and parallel ports. Study of direct linking loader module for a subset of assembly language and macro instructions of a typical machine.g.IV (SP) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T .

Material. COURSE CONTENTS: 1. System Planning [L-5] L 3 T 1 P - 27 . 3. Manual and automated systems Real-life Business sub-systems: Production. while heightening students to the issues analysts face daily.Enforcing documentation discipline in an organization . Design. Realtime and distributed systems. Basic principles of successful systems 2. Marketing. Finance Systems models types of models: Systems environment and boundaries.Qualifications and responsibilities . Personal. 4. Development. Implementation.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . System Development cycle [L-3] Introduction to systems development life cycle (SDLC) : Various phases of development :Analysis.301 SYSTEM ANALYSIS AND DESIGN External Marks: 60 Internal Marks: 40 Total Marks: 100 PREREQUISTES: None OBJECTIVES: The course has been designed to provide a solid foundation of systems principles and an understanding of how business function.Introduction [L-2] System definition and concepts: Characteristics and types of system. Types of documentation and their importance. Systems analyst [L-1] Role and need of systems analyst . Maintenance Systems documentation considerations: Principles of systems documentation .Systems Analyst as and agent of change.

Designing the internals: Program and Process design .PTU/BOS/CS/101/08-05-2004/BATCH 2003 Data and fact gathering techniques: Interviews. Data Modeling and systems analysis . Conversion methods. System Audit and Security [L-2] Computer system as an expensive resource: Data and Strong media Procedures and norms for utilization of computer equipment. Systems qualify Control and assurance. Data flow diagrams . Input and Output [L-2] Classification of forms: Input/output forms design. producers and controls. Audit trails. Audit of computer system usage. 6. System acceptance Criteria. Top-down and bottom-up design . 8. System Implementation and Maintenance [L-2] Planning considerations. 28 . Logical and physical design. Presentations. Group communication. Modular and structured design [L-5] Module specifications . User-interface design. Design representation.Designing Distributed Systems . Feasibility study and its importance Types of feasibility reports System Selection plan and proposal Prototyping Cost-Benefit and analysis: Tools and techniques 5. Systems flowcharts and structured charts . Site visits. System evaluation and performance. 9. Common diagramming conventions and guidelines using DFD and ERD diagrams.Module coupling and cohesion . Graphical interfaces 7. Testing and validation. Systems Design and modeling [L-8] Process modeling. Maintenance activities and issues.

PTU/BOS/CS/101/08-05-2004/BATCH 2003 Types of threats to computer system and control measures: Threat to computer system and control measures. Object Oriented Analysis and design [L-6] Introduction to Object Oriented Analysis and design life cycle.Awad. 11.Elias M. Case study of the following systems [L-5] (I) Inventory Control (II) Railway Reservation System (III) University Management System (IV) Hospital management System TEXTS BOOKS 1. REFERENCES 1. object modeling: Class Diagrams. Analysis and design of information systems – James A. Dynamic modeling: state diagram.Senn 29 . System analysis and design . Dynamic modeling: sequence diagramming. System analysis and design –Perry Edwards 2. Disaster recovery and contingency planning 10.

Analog and digital data transmission. standards. EIA-449. data transmission concepts. DTE – DCE Interface.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-303 COMPUTER NETWORKS External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - I) INTRODUCTION: Basic concepts of analog and digital signals. WDM. (L-4) VIII) PROTOCOL ARCHITECTURE: Protocols. “Computer Networks” – Andrew S. Analog and digital conversion. Performance. (L-6) II) TRANSMISSION MEDIA: Guided and Un-guided media. Frequency hoping spread spectrum. Shannon Capacity. PHI 30 . Analog to Analog conversion. VRC. Media Computerisation. Error Correction. “Data Communications and Networking” – Behrouz A Ferouzan – 2nd Edition. Digital to Analog conversion. (L-5) III) ENCODING AND MODULATING : Digital-to-Digital conversion. direct sequence spread spectrum. code-division Multiple Access. “Data Communication and Distributed Networks” – Ulylers D Black – 3rd Edition PHI.21. LRC. Pearson Education. Multiplexing application – telephone systems. 2. Tanenbaum. CRC. (L-5) Text Books : 1. (L-6) IV) DIGITAL DATA COMMUNICATION: Digital data transmission. (L-6) VI) SPREAD SPECTRUM: Concept. transmission impairments. TATA McGraw Hill. Par Circuit switching Packet Switching & Message switching virtual circuits. 2. X. (L-6) V) MULTIPLEXING AND SWITCHING: FDM. “Data and Computer Communication” – William Stallings – 7th Edition. Modems. ……… OSI. TCP/IP Protocol Architecture. TDM. Checksum. References: 1. Cable Modems. Detection. (L-4) VII) ERROR DETECTION AND CORRECTION: Types of Errors. EIA-530. DSL.

Language And Systems The Relational Data Model. Relational Constraints And Relational Database Schema. (L-6) SQL Relational Database Standard:Basic queries in SQL. COURSE CONTENTS: Part – 1 Basic Concepts Databases And Database Users: Introduction. ER Diagrams. Attributes And Keys. Database Language And Interfaces. Classification of Database Management Systems. (L-4) Part – 2 Relational Model. And Structural Constrains. Entity Sets.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS– 305 DATABASE MANAGEMENT SYSTEMS External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES: Data Structure OBJECTIVES : To learn how to use a DBMS and how to build a DBMS. Naming Conventions And Design Issues. (L-3) Data Modeling Using The Entity Relationship Model:Entity Types. Characteristics of Database Approach. Relational Constrains. (L-2) Database System Concepts And Architecture:Data Models. Views in SQL. Advantages And Disadvantages of Using DBMS. Update Operations And Dealing With Constraint Violations. The Relational Algebra and Relational Calculus:Relational Model Concepts. DBMS Architecture And Data Independence. Relationship Types. Additional Features of SQL. Roles. Schemas And Instances. The Domain Relational Calculus. Relationships. Insert. Basic Relational Algebra Operations. (L-6) 31 . Example of Queries in Relational Algebra. The Tupple Relational Calculus. More Complex SQL Queries. Weak Entity Types. Delete and Update Statements in SQL.

(L-4) Database Security and Authorization:Introduction to Database Security Issues. 2. An introduction to Database Systems by C. 32 . References : 1. General Definitions of Second and Third Normal Forms. Validation Concurrency Control Techniques.The programming language of oracle.PL/SQL .PTU/BOS/CS/101/08-05-2004/BATCH 2003 Part – 3 Database Design Theory and Methodology Functional Dependencies and Normalization for Relational Databases:Informal Design Guidelines for Relation Schemas. Database Concepts. Recovery Techniques Based on Deferred Update.Date.1991 3. Introduction to Statistical Database Security. Korth and Silberschatz Abraham. Shadow Paging. Normal Forms Based on Primary Keys. Recovery Techniques Based on Immediate Update. SQL. by Elmasri/Navathe 2. Transaction and System Concepts. Schedules and Recoverability. Fundamentals of Database Systems. (L-4) Part – 4 System Implementation Techniques Transaction Processing Concepts:Introduction to Transaction Processing.J. Desai. Granularity of Data Items and Multiple Granularity Locking. An introduction to Database Systems by Bipin C. McGraw Hall. (L-3) Database Recovery Techniques:Recovery Concepts. Concurrency Control Based on Timestamp Ordering. (L3) Text Books : 1. Discretionary Access Control Based on Granting/Revoking of Privileges. Functional Dependencies. (L-3) Concurrency Control Techniques:Locking Techniques for Concurrency Control. Serializability of Schedules. Third Edition. Desirable Properties of Transactions. Ivan Bayross BPB Publication.

Hopcroft. Algorithm analysis. Dynamic programming. [L12] Problem classes P. Springer Verlag. The Analyses of Algorithms. COURSE CONTENTS: Models of computation. Galgotia Publishers.E. Purdom. Data Structures and Algorithms. J. set algorithms. A.Mehlhorn. [L-8] Algorithm design techniques: divide and conquer. combinatorial algorithms. 1 and 2. Backtracking. search and traversals.Horowitz. [L-6] TEXT BOOKS 1. Holt Rinechart and Winston. J. 1984. 1968. Brown. 2.307 DESIGN AND ANALYSIS OF ALGORITHMS External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES: Discrete Structures and Data Structures. Addison Wesley. Branch and bound. 2. deterministic and non deterministic polynomial time algorithms. 33 . Vols. Algebraic algorithms.D. 3. 1976. Fundamentals of Computer Algorithms.1975.and C. 1984. NP. Approximation algorithms for some NP-complete problems. 1 and 3. string processing algorithms. REFERENCES: 1. Addison Wesley. Jr. Vols. lower bounds. 1985. D. NP-hard and NP-complete. Aho.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . OBJECTIVES: Date Structures are an integral part of algorithm design and Discrete Structures covers topics like graph theory. order arithmetic.Knuth. Sahni.V. [L-16] Sorting and searching algorithms.. K. S. time and space complexities and average and worst case analysis. design and Analysis of Algorithms.E. Hard problems and approximation algorithms. Ullman. The Art of Computer Programming.

34 . [L-6] Advanced Issues: [L-4] A. Homogeneous Co-ordinates. Display devices [L-4] Basic Raster Graphics: Scan conversion [L-4] Filling [L-2] Clipping. raytracing. B. Gourard and Phong shading. Specification of a 3D view. Vanishing points.buffer algorithms. antialiasing. [L-6] Visibility: Image and object precision. [L-6] Elementary 3D Graphics: Plane projections. area based algorithms. OBJECTIVES: Understanding the fundamental graphical operations and the implementation on computer. Graphics hardware. COURSE CONTENTS: Introduction: What is Computer Graphics. [L-2] Geometric Manipulation: Transformations [L-4] Matrices. Curves and surfaces: Parametric Representation. Rendering. Workstation. Bezier and B-Spline curves. floating horizon.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . fractals. Get a glimpse of recent advances in computer graphics. z. Elements of a Graphics. I/o devices. Understanding user interface issues that make the computer easy for the novice to use.309 COMPUTER GRAPHICS External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES: Data Structures and Algorithms.

4. McGraw Hill Book Company. Computer Graphics. Advanced Animation and Rendering Techniques. Alan Watt and Mark Watt. C. Procedural Elements for Computer Graphics. David F. Adams. Mathematical Elements for Computer Graphics. 2. D. Computer Graphics (Schaum Series ) by Lipschutz (MC Graw Hill) 2. Prentice Hall. Addison-Wesley. X Window. Hearn and P. OSF/Motif Edition. Rogers. 3. McGraw -Hill International Edition. REFERENCES: 1. System Programming. Baker. 3. Young.Graphics by Yashwant Kanetkar.PTU/BOS/CS/101/08-05-2004/BATCH 2003 TEXT BOOKS: 1.Rogers and J. Prentice Hall. 35 .

(L-8) I/O Interfaces: I/O Interfaces from USB and IEEE1394. Pal Chandhari . Local bus. EISA. Del Corso. Testing of serial and parallel port. LCD Panels.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-311 COMPUTER PERIPHERALS AND INTERFACES External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES: Microprocessor and Assembly Language Programming. I/O Port Addresses and resolving and resolving the conflict of resources. Advanced 3D Technologies. Parallel to SCSI converter. (L-10) Input/ Output Driver software aspects: Role of device driver DOS and UNIX/ LINUX device drivers. Video adapter types. PCI bus. TV Tuner and Video Capture upgrades troubleshooting Video Cards and Drivers. Scott Muller. ATA feature. I/O Interface from serial and Parallel to IEEE1394 and USB 961. P. 2. 1994. “Upgrading and repairing PC” 36 . Video driver and multiple Monitor. Accelerated graphics port bus. JD Nicond “Microcomputer buses & links” Academic Press 1986. USB Mouse/ Keyboard Interfaces. PCI Express. Video RAM. DMA Channel. Graphic accelerators. DVI Digital signals for CRT Monitor. IDE Interface ATA standards ATA1 to ATA7. H. I/O buses. Ltd. ATA RAID and SCSI RAID. “Computer Organization and design” Prentice Hall of India Pvt. VESA Local bus. (L-4) Design & Integration of Peripheral devices to a computer system as a Case Study (L-2) Future Trends: Detailed Analysis of recent Progress in the Peripheral and Bus systems. 3. Some aspects of cost Performance analysis while designing the system (L-2) Text/ Reference: 1. COURSE CONTENTS: SYSTEM RESOURCES: Interrupt.Kirrman. (L-10) IDE & SCSI Interfaces: IDE origin. Douglas V Hall “Microprocessor & Interfacing Programming & H/W” McGraw Hill International 2nd Edition 1992. Integrated Video/ Motherboard chipset. OBJECTIVES: To learn the functional details of various peripheral devices.ISA. 4. SCSI Cable and pin Connector pin outs SCSI V/s IDE Advantages and limitation. (L-4) Video Hardware : Video display technologies.

3.- P 4 Introduction to DBMS. 2. 6. To explore ‘select’ clause using where. To use constraints on the created database. To implement different types of DDL. 4. L T . like. having etc.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS– 313 Software Lab – V (DATABASE MANAGEMENT SYSTEMS) External Marks: 20 Internal Marks: 30 Total Marks: 50 1. To implement different in-built functions on the created database. DML and DCL statements in SQL. group by. To implement nested and correlated queries. between. 37 . 5. order by.

4. 6. To study FDM modulation techniques.315 HARDWARE LAB – IV Computer Networks External Marks: 20 Internal Marks: 30 Total Marks: 50 L T .P 2 1. 7. Implementation of multiplexers. 5. Conversion of digital to digital signals. 9. Conversion of Analog to digital signals. Conversion of Analog to Analog signals. Conversion of digital to analog signals. 38 .optical fibers etc. 8. 3. 2. co-axial cables. To study TDM modulation techniques To study WDM modulation techniques To study various transmission media like twisted pairs.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS .

P 2 Experiments to plot growth of functions. 39 . Experiments with software packages like LEDA.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS .317 SOFTWARE LAB – VI (Algorithms) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T . Implementing heuristics and comparison with algorithms designed with asymptotic complexity in Comparison of various data structures for the same algorithm.

Use Phigs to show objects in various views.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS .319 SOFTWARE LAB – VII (Computer Graphics) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T .P 2 Do two line segments intersect. Demonstrate the properties of the Bezier curves Run a sample session on Microsoft Windows including the use of Paintbrush. 40 . Compute the convex hull of a set of planar points. Implement the de Casteljau algorithm for curves. Show a unit cube in perspective. Sean convert line segments. The truncated cube of Module 3 employed here. Display the view volume. Clip line segments against windows. Fill polygon with stipple patterns.

embedded SQL. attributes. data representation. Managing Database and Queries: Creating. recovery. relational data structure. Transact-SQL PLUS and substitution of variables.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-302 RELATIONAL DATA BASE MANAGEMENT SYSTEMS – II (RDBMS-II) External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUITIES: RDBMS-I OBJECTIVES: To learn how to use a RDBMS and how to build a RDBMS. relational calculus.. 2nd Edition.C. keys. integrity. storage structures. An Introduction to Database Systems. 1991.Date (Addison Wesley) References: 1. defining and modifying Table structure. 2 . over view of security. Query by example. COURSE CONTENTS: Data base system architecture. etc. backup. Vol. indexing. [35%] Introduction to SQL Server and Oracle Server [5%] Indexes [5%] Views [5%] Packages [5%] Triggers And Stored Procedures [10%] Cursors [5%] Control structure [5%] Text Books: 1. [25 % ] SQL. Database System Concepts. data independence.Korth and Silberschatz Abraham.-1.PL/SQL The Programming Language of ORACLE. 1994. The Benjamin / Cummings Publishing Co. PL SQL. 2. normalization & normal forms. McGraw Hall.J. Ivan Bayross (BPB Publication) 41 . Ramez Elmasri and Shamkant B. Navathe Fundamentals of Database System. Relational Algebra. Transact-SQL. relations. functional dependence. SQL *PLUS.

1992. Data management packages such as DBASE and FOXPRO.. It also introduces students to basics of Software Engineering. MARCAN. Pitmbar Publishing Co. [20%] Principles of Data Processing: Data representation and file management in COBOL Sequential indexed and relative files. K.[ 25 %] Special topics Introduction to Management Information Systems and Decision Support Systems. Resource Planning (MRP-2) Software like SAP. User interfaces. Sarda. [10 %] TEXT BOOKS 1) N. 42 . ER Model design concepts software architecture file (table) and process design issues in system implementation. DFD. [30] % Data Management Software: Packaged software: Word processors spread sheets. Enterprise Resource Planning (ERP) management. [15 %] Principles of Software Engineering: Software development methodology: System analysis.K. COURSE CONTENTS: Introduction to Business System: Data capture.S.304 External Marks: 60 Internal Marks: 40 Total Marks: 100 INTRODUCTION TO BUSINESS SYSTEMS L 3 T 1 P - PREREQUISITIES : None OBJECTIVES:To familiarize students with basics of data processing.. report writer screen management. Processing dissemination storage/retrieval I/O and storage devices terminals printers and disks. Third Edition. 3) Foxpro by R. First edition 1990. COBOL and data management packages. Ghosh Dastidar. Tata McGraw Hill 1985.Taxali REFERENCES 1)Computers today by Suresh 2) R. Software Engineering. Pressman. Structured COBOL Programming with Business application. McGraw Hill Inc. Roy and D. 2) M. L.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS. COBOL Programming.

Conjunction control [25%] User Control and Management Planes [5%] ATM and System. ATM Cable & Transmission. ATM layer Performance Measurement[15%] Technological comparison of ATM with others structures [10%] TEXT BOOKS 1) ATM . ATM Hardware. Switch Models and their comparison [20%] ATM traffic Management. Mc Graw Hill 1994 REFERENCES 1) IEEE Networks Magazine Sep '92 onwards 43 .Theory and Application by David E.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS 306 ASYNCHRONOUS TRANSFER MODE External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISTES: Data Communications or CN-I OBJECTIVES: The course provides sufficient knowledge of theoretical and practical aspects of networks and their applications. Design Consideration [5%] ATM based Protocol interworking. Theory of Operation. Choice of Payload size [20%] ATM N/W Basics. McDysan & Darren L. Spohn. COURSE CONTENTS: Introduction to ATM.

software phases and deliverables. after all. quality assurance. [15 %] Software Project Management: principles of software project management organizational and team structure. some of the popular methodologies such as Yourdon's SAD. CASE tools. Business Information system and Database Management System. COURSE CONTENTS Software Engineering Principles: How is software engineering an engineering discipline. semi-formal and informal methods. quality plans. Elementary data structures. dynamic modeling for real-time systems.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-308 SOFTWARE ENGINEERING External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITIES : Computer fundamentals. cost benefit analysis. [15 %] Technical Development: Structured systems analysis and design requirements collection and specification. cost estimation methods-function points and COCOMO. [15 %] Software Quality Management: quality control. software metrics. control and user interface designs. tools Configuration Management [15 %] Software Development Method & CASE: formal. an exercise in making compromises. Programming in atleast on high level language. project controls. life cycle concepts. The present course should seek to equip the student with a repertoire of principles. software development strategies. data. Elementary probability theory. feasibility study. data flow and logical data modeling. project initiation and project termination. tools. SSADM etc. tools and techniques and make him/her appreciate that software engineering is. testing. data function. quality and management plans. software development process models. OBJECTIVES : The course should provide an introduction to the fundamentals principles of software engineering. network. physical data design. technical.[20 %] 44 . Information system characteristics. quality standards. CASE standards. Concepts of structures programming. and event-based modeling. process. architectural and detailed design. project planning. verification and validation.

: Fundamentals of Software Engineering. S.. Software Engineering: A practitioner's Approach.. in 4GL environment. Software Maintenance [5 %] TEXT BOOKS: 1) Pressman R.pp 61-72. May 1988. 3) Oehm B.. Addison . Prentice Hall.. W. REFERENCES: 1) Ghezzi C. 1992. L. A Spiral Model of Software Development and Enhancement.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Implementation: in 3GL environment. coding styles.. McGraw Hill. Third Edition McGraw Hill. 1991 2) Pfleedger S. Co. 1991. in client-server environments. 1985. 45 . 1987.Wesley Pub.. 2) Jalota.Software Engineering. 4) Fairley R. Jazayeri M. [20 %] Documentation. And Mandrioli D. IEEE Computer. 3) Sommerville I. Second Edition. Software Engineering: The Production of Quality software. Fourth Edition. N. Software Engineering Concepts. Software Engineering. New York. 21. Macmillan Publishing Company. New York.. J.

Distance and surface orientation computation from Disparity.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS – 310 COMPUTER VISION (ELECTIVE-I) External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES: Maths. [30%] Peripheral hardware for computer vision: Imaging devices. Review of basic image processing techniques. [20%] 46 . [20%] Architectural issues of intermediate processing. algorithms and systems in Computer Vision with a view to make them aware of principal applications. Correspondence between Image and Catalogued model. display devices. Fuzzy logic procedures in computer vision algorithm. apparent motion and correspondence Problem. Basic Image Processing Techniques OBJECTIVES: To familiarise students with principles. Pyramidal architecture for vision. frame grabbers. their derivatives and use. Fuzzy logic procedures in computer vision algorithm. Fuzzy logic membership function. Relation between viewer centred and object centred representation. Visual motion computation. the 3D model representation. COURSE CONTENTS : Applications of Computer vision : a)Machine vision for industrial inspection b)Machine vision for Robotics and control c)Image analysis of industrial and medical images Early visual processing. [20%] Shape Representation & Recognition: Critical Issues. Parallel algorithms. application in decision making . [10%] Intermediate Processing: Computational approach to stereopsis. Parallel solutions to conventional Image algorithms.

Davies. 1978 47 . 1986 4)E. Acadmic Press.M. Academic Press 6)Pratt. Intermediate level Image processing. 1990 5)David Vernon. Prentice Hall. Academic Press. Digital Image Processing John Wiley & Sons. Computer Vision .R. Machine vision. Robot Vision. Machine vision Theory. Algorithms & Practicalities. MIT Press. Combridge. Englewood Cliffs. 1986 3)MJB Duff.PTU/BOS/CS/101/08-05-2004/BATCH 2003 TEXTS/REFERENCES: 1)Ballard and C.Brown. 1982 2)Horn.

s MOSFETs. " Digital System Design and Microprocessors" Mc Graw Hill International Edition 1985.Burchnana. PTR Englewood Cliffs. circuit analysis). [10%] TEXTS/REFERENCES: 1)James E. Basic Electronic Devices and Circuits ( B. delays. 4)Darryl Lindsay.I.J. [10%] Interconnect analysis Power/Ground droop/ bounce coupling analysis Transmission line effects/cross talk [40%] power/ground distribution signal distribution Logic Design \ Random logic \ Programmable logic Microcontrollers Memory subsystem design Noise tolerant design worst case timing thermal issues in design.Buchanan. " BICMOS-CMOS System Design" McGraw Hill International Edition 1991. Prentice Hall.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS – 322 SYSTEM HARDWARE DESIGN ( ELECTIVE I ) External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES: Basic Electrical Circuits ( R. basic logic gates) OBJECTIVES: To provide students an exposure to analysis and design techniques used in digital system hardware design.L. 2)Jame E. supply currents speed. 1993 48 . 5)Howard W. Hayes. [40%] Real life system design examples.Johnson & Martin Graham. " Digital PCB design and drafting" Bishop Graphics 1986.C. COURSE CONTENTS: CMOS Technology : Logic levels noise margin power dissipation. High Speed Digital Design-A Handbook of Black Magic. " CMOS-TTL System Design" Mc Graw Hill International Edition 1990 3)John P.

"Real ?Time Systems"-C. Performability. Hierarchical round robin protocol.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS – 324 REAL TIME SYSTEMS ( ELECTIVE I ) External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - Introduction: Definition. concurrency control issues. The polled bus protocol.Token based protocols. Deadlines based protocols. "Real Time Systems"-Liu Pearson Education 2. Main Memory databases. Performance measures for real time systems: Traditional performance measures. Cost functions and hard Deadlines Task Assignment and Scheduling: Introduction . Issues in Real Time Computing. Fault tolerant Scheduling Real Time Databases: Basic definitions. Task assignment. Real time Vs General Purpose databases. Shin 49 . Stop and Go Multihop protocol. Task Classes Characterizing Real Time Systems and Tasks: Introduction. databases for hard real time systems Real Time Communication: Introduction. Krishna and Kang G. EDF algorithm. Protocols: Contention based protocols. Structure of a Real Time System. M. Archtectural Issues. Classical Uniprocessor scheduling algorithms: Rate Monotonic. References: 1.

Lieberman. COURSE CONTENTS: Introduction to OR modeling approach and various real life situations. Operation Research by D.J. [30%] Network Analysis including PERT-CPM Concepts of network the shortest path minimum spanning tree problem maximum flow problem minimum cost flow problems The network simplex method Project planning & control with PERT & CPM [20%] Integer programming concepts.S Hillier & G. Series 1995 2) A Ravindran. 1993 3) R. [5%] Linear programming problems & Applications. Computer Assisted Decision Models. formulation solution and applications [10%] Game Theory [10%] Queuing Theory & Applications [10%] Linear Goal Programming methods and applications [5%] Simulation [10%] TEXT BOOKS: 1. 2. Solving Linear Programming problem using simultaneous equations and Graphical Method Simplex method & extensions : Sensitivity analysis Duality theory Revised Simplex Dual Simplex Transportation and Assignment Problems. Using OR major focus should be on how to model various situations in industries and solve them.Kapoor.S Hira.S Sharma. Tata Mcgraw Hill 1991 50 .PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS – 326 OPERATION RESEARCH (ELECTIVE-I) External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES: Mathematics OBJECTIVES: Importance of need to take intelligent decisions is to be emphasized. Various components of LP problem formulation. Mcgraw hill Int. John Wiley & Sons. Introduction to OR. Operation Research by D. Introduction to OR. REFERENCES: 1) F.

Ad-hoc and systematic methods. Syntax directed translation mechanisms and attributed definition [7%] Run time memory management: Static memory allocation and stack based memory allocation schemes. Complilers tools and Techniques. [8%] Parsing theory: Top down and bottom up parsing algorithms. register allocation and code selection. and Sorenson. 51 . COURSE CONTENTS: Overview of the translation process. strength reduction etc. Systems Programming OBJECTIVES: Understand the influence of programming languages and architectures on the efficiency of language translation. order of evaluation. Lexical analysis: Hand coding and automatic generation of lexical analysers. Ullman.Principles and Practice Macmillan. the Theory and practice of Compiler writing ' Mcgraw Hill. Ravi Sethi.G.P. [8%] Code generation: machine model. 1984 4)Waite W. [17%] TEXTS/REFERENCES: 1)Aho. Compiler Construction. J. Addison-Wesley.D. India 1981 3)Tremblay J. A few selected optimizations like command sub expression removal. Automatic generation of parsers [8%] Error recovery: Error detection & recovery.N. and Goos G. loop invariant code motion. [17%] Code Optimization: Global data flow analysis.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS – 328 LANGUAGE PROCESSORS ( ELECTIVE I ) External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES: Formal Language & Automata Theory. [18%] Intermediate code generation: Different intermediate forms. P.Compiler Construction Springer Verlag. 1987 2)Dhamdhere. 1983. [17%] Symbol table management.

PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-330 NATURAL LANGUAGE PROCESSING ( ELECTIVE I ) External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES: Basic course on artificial intelligence. Graph Models and Optimization. Pragmatics. pragmatics. Addison Wesley. [20%] TEXTS BOOKS 1) J. Natural Language understanding. pragmatics: word level representation of natural languages prosoty & natural languages. COURSE CONTENTS: Components of natural language processing: lexicography. [20%] Computation Linguistics: Recognition and parsing of natural language structures: ATN & RTN. Left Associative Grammars. [20%] Application of NLP: Intelligent Work Processors: Machine Translation. Natual Language processing in Prolog . General techniques of parsing: CKY. [20%] Semantics knowledge Representation: Semantic Network Logic and inference. 52 . OBJECTIVES: Introduction to the methods and techniques of Natural Processing.semantics. Applications of Natural Language Processing. 1989. REFERENCES:1) Mdlj Arbib & Kfaury. Data Structure & Algorithms. 2) G. Earley & Tomita's Algorithm. 1987. [20 %] Formal languages and grammars: Shomsky Hierarchy. Prolog for natural semantic. User Interfaces. Resolution of Ambiguities. Man-Machine Interfaces: Natural language Querying Tutoring and Authoring Systems. syntax. Ambiguous Grammars.Gazder. Introduction to formal language Theory.Allen. Speech Recognition Commercial use of NLP. semantics. Benjamin/Cunnings. Springer Verlag 1988.

through put with mixed load conditions. · Memory Management Techniques in N/W · Data compression & its Effects on N/W · Security Aspects of N/W System efficiency · Creation & maintenance user Accounts · Permit Spooling 53 . Window 95.) · Under different networking loads. · Familiarization with NDS in Novell.) · Comparison of utilization of various resources (Processor. memory. UNIX.V (ATM) External Marks: 20 Internal Marks: 30 Total Marks: 50 L 0 T 0 P 4 Simulation of ATM Switch performance.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS 314 HARDWARE LAB . Mac OS Novell Netware) · Installation of windows NT & Novell Netware · Comparison of Network traffic · Handling problems related to congestion using various tools (Net watcher etc. Implementing Ethernet on various plateform (Windows NT. hard disk etc.

To write programs using control structures of PL/SQL like If-else statements.P 4 To run the various queries using commands of SQL.P 2 Assignments should be provided for the following: · Use of CASE tools for development of DFD. · Familiarity with JSP and JSD · Documentation · Beta Testing 54 . · Analysis and design of simple object-oriented as well as real time systems. E-R diagram.IX (S/W ENGINEERING) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T . data dictionary. Triggers CS.316 SOFTWARE LAB . Procedures Packages. To write programs using loops of PL/SQL like For Do-while while Implementation of Cursors.318 SOFTWARE LAB .PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS.VIII (RDBMS-II) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T . Structured Chart.

Usage of Word processor.COBOL screen management report management and report writing facilities. . · Lab Experiments on data management packaged like DBASE. .X (BUSINESS SYSTEM) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T .PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS 320 SOFTWARE LAB .P 2 · Laboratory exercises covering usage of COBOL for handling indexed sequential and relative files. 55 . FoxPro.

[15%] Data banks and their impact on society.. Dunlop. To discuss ethical and moral issues of concern to computer scientists and engineers. (Editors) Computerization and Controversy: Value Conflicts and Social Choices. H. Freeman. 1991 56 . Boston Academic Press. C. Computer Power and Human Reason: from judgement to Calculation.312 COMPUTERS AND SOCIETY (Open Elective) External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES : RDBMS-I & Computer Networks-I. Kling . [15%] Impact of introduction of computers and its impact on privacy and security [15%] Networking of computers and its impact on privacy and security [15%] Information integrity [10%] Ethical issues arising out of creation of computer viruses trojan horses etc. R. W. 1976. [10%] TEXTS / REFERENCES: Weizenbaum. [10%] The role of computer in education. COURSE CONTENTS: A survey of a variety of computer application. [10%] Intellectual property rights in relation to computer v hardware and software.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . OBJECTIVES: To study the impact of the large scale introduction of computers on the cultural social and political environment of a country. San Francisco. J..

57 .PTU/BOS/CS/101/08-05-2004/BATCH 2003 SIXTH/SEVENTH SEMESTER Industrial / Institutional Training.

J. Deductive strategies employed in symbolic logic and Programming in Prolog. R. the computation and search rules.. and Mellish. Structured data representation. New York. Programming in Prolog 2nd edition. Execution model Introduction to Programming in Prolog. COURSE CONTENTS: Prepositional logic: syntax and semantics: Validity and consequence. Unification and first order resolution SLD resolution. OBJECTIVES: Representation of world knowledge using symbolic logic.[ 20 %] Advanced prolog features: programming techniques: Structural Induction and Recursion. Illustrative examples. The MIT Press. Foundation of Logic Programming.PTU/BOS/CS/101/08-05-2004/BATCH 2003 EIGHTH SEMESTER CS 402 SYMBOLIC LOGIC & LOGIC PROCESSING External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITIES: Discrete Structures. [15 %] First order logic: World knowledge representation and the need for quantifiers. Representing world knowledge using prepositional logic.F. Springer Verlag. 1991. Springer. 58 . W.S. C. semantics validity consequence clause normal from. 2) Clocksin. 3) Lloyd. set Theory and logic. Normal forms. [20 %] Introduction to prolog: Syntax of prolog.[ 20 %] Introduction to Fuzzy logic neural networks [15 %] TEXT BOOKS 1) Stoll. Narosa Publishers. SLD trees and interpretation of non-declarative features of Prolog.. W.. The Craft of Prolog. 1985 2) O' Keefe. Dover publishers. Syntax. The Science of Programming. 1984. Extra Logical features: Cut and Negation Case studies. 1984 REFERENCES 1) Gries. 1963. [20 %] The connection between logic and logic programming interpreting logic programs in terms of Horn clauses Deduction from clause form formulas resolution for prepositional logic Ground resolution.

H. Reevsz. Singapore. The Dyck Language. Rewriting Systems. COURSE CONTENTS: Basic Definitions Operations on Languages: Closure properties of Language Classes. [35 %] Unrestricted Languages: Normal form and Derivation Graph. Harrison. Automata and their Languages: Finite Pushdown 2-push down Automata and Turing Machines. Linear Grammars and regular Languages. Context Free languages: The Chomsky Griebach Normal Forms.[ 15 %] Cellular Automata : Formal Language aspects. REFERENCES 1) Wolfman Theory and Applications of Cellular Automata. McGraw Hill 1983 2) M. Algebraic properties. [15 %] Derivation Languages. Formal Properties of LL(k) and LR(k) Grammars. Algebraic Properties Universality & Complexity Variants. E. One sided Context Sensitive Grammars. Introduction to Formal Languages.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS 404 FORMAL LANGUAGE & AUTOMATA THEORY External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITIES: Data Structure and Programming Methodology OBJECTIVES: To give the students a knowledge of number of areas in theoretical computer science and their hierarchical interconnections. 59 . World Scientists. Formal Language Theory Addison Wesley 1978. [10 %] TEXT BOOKS 1) G. Regular Expressions Context Sensitive Language. [25 %] Syntax Analysis : Ambiguity and the formal power Series. The Equivalence of the Automata and the appropriate grammars. The Kuroda Normal Form. 1986. Context Sensitivity. Canonical Derivations.

Estimate of material cost and labour cost. Effect of risk and uncertainty on lot size. rate of return method. Employee Development. modines material & Money. Estimation of cost in various manufacturing operations. Minimum cost analysis. graphical solution. COURSE CONTENTS Cost analysis: Break-even analysis. effect of taxation on economic studies. Principles of Training. Importance of Human Resource in Industry. [10 %] Depreciation : Types of depreciation and their Methods. challenger and defender [10 %] Economic Analysis Of Investment Alternatives : Basic economy study patterns and their comparison.[ 10 %] Replacement Studies: Reasons for replacement. Breakeven charts. Method of Recruitment. Functions of Human Resource Management & its relation to other managerial. qualifications of an estimator. economic analysis of new projects. decision making in selection of alternative by present worth methods. Investment alternative . [15 %] Training & Development : Difference between Training and Development. factors to be considered in replacement Studies. payout period method and uniform annual cost method. Promotion merit V/S seniority performance appraisal [10 %] L 3 T 1 P - 60 .PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS 408 PRINCIPLES OF ENGINEERING ECONOMICS & MANAGEMENT TECHNIQUES External Marks: 60 Internal Marks: 40 Total Marks: 100 PREREQUISTES: None OBJECTIVES : The students should understand cost estimate of projects . economics order quality. economic life of a project.[ 10 % ] Procurement And Placement : Need for Human Resource Planning process of Human Resource Planning.Human Resource Management Technical for optional utilization of men. discounted cash flow analysis. Psychological tests and interviewing. Estimating procedure. effects of changes in fixed and variable costs. [5 %] Human Resource Management :Introduction to Human Resource Management and its definition.[ 10 %] Cost Estimation : Difference between cost estimation and cost accounting.Depreciation Methods. two and three alternatives. Meaning and Importance of placement and Induction.

[5 % ] TEXT BOOKS 1. Saiyada (Tata Mc Graw Hill) 2. Inwin. Mamoria Personnel Management (Himalaya publishing house Bombay) 3. Quality of working like.S. Homewood) 3. Math & Co. Bhagooiwal Economics of Labour and Industrial Relations (Sahitya Bhawan Agra) 5.B. A. C. Drawin B. Introduction to Econometrics : Kliwen Prentice Hall 61 . Minappa and Personnel Managements M. Engg. workers participation. [10 %] Integration & Maintenance: Introduction to Integration and Maintenance. R.C. Motivation Factor affecting motivation.Saxena Labour Problems and Social Welfare (K.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Job Satisfaction :Job satisfaction and its importance. Jucius Personnel Management (Richard D. Introduction of motivation Theory. T.N. Michael J. Economics Analysis Bullinger 4. Flippo Principles of personnel Management (MC Graw Hill) 2. Meerut) 4. Engineering Economy : Thuesen Pnentice Hall REFERENCES 1.

62 . case studies. renewable and non renewable energy sources. environmental effects of extracting and using mineral resources. land degradation. Equitable use of resources for sustainable lifestyles. dams and their effects on forests and tribal people. effects of modern agriculture.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CE-216 ENVIRONMENTAL SCIENCE L T 3 P - External Marks: 60 Internal Marks: 40 Total Marks: 100 Unit 1 : The Multidisciplinary nature of environmental studies Definition. Case studies. drought. floods. d) Food resources : World food problems. conflicts and water. c) Mineral resources : Use and exploitation. e) Energy resources : Growing energy needs. a) Forest resources : Use and over-exploitation. Role of an individual in conservation of natural resources. water logging. f) Land resources : Land as a resource. mining. Unit 2 : Natural Resources : Renewable and non-renewable resources : Natural resources and associated problems. dams-benefits and problems. changes caused by agriculture and overgrazing. salinity. case studies. soil erosion and desertification. scope and importance (2 Lectures) Need for public awareness. Timber extraction. man induced landslides. deforestation. case studies. fertilizer-pesticide problems. use of alternate energy sources. b) Water resources : Use and over-Utilization of surface and ground water.

Energy flow in the ecosystem. consumers and decomposers. c. types. oceans. rivers. Introduction. Unit 4 : Biodiversity and its conservation Introduction – Definition : genetic. National and local levels. species and ecosystem diversity. Producers. Structure and function of an ecosystem. streams. Threats to biodiversity : habitat loass. lakes. Food chains. Ecological succession. Biogeographical classification of India Value of biodiversity : consumptive use. Endangered and endemic species of India Conservation of biodiversity : In-situ conservation of biodiversity. productive use. d. man-wildlife conflicts. poaching of wildlife. ethical. social.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Unit 3 : Ecosystems Concept of an ecosystem. India as a mega-diversity nation Hot-spots of biodiversity. food webs and ecological pyramids. estuaries) (6 lectures) Forest ecosystem Grassland ecosystem Desert ecosystem Aquatic ecosystems (ponds. structure and function of the following ecosystem :a. Unit 5 : Environmental Pollution 63 . aesthetic and option values Biodiversity at global. b. characteristic features.

Consumerism and waste products. Nuclear hazards Solid waste Management : Causes. Role of an individual in prevention of pollution. rain water harvesting. Wasteland reclamation. Air (Preventation and Control of Pollution) Act. 64 . effects and control measures of urban and industrial wastes. Air pollution b. Environmental ethics : Issues and possible solutions. Water pollution c. Case studies. Case studies. effects and control measures of :a. (8 lectures) Unit 6 : Social Issues and the Environment From Unsustainable to Sustainable development Urban problems related to energy Water conservation. acid rain. global warming. Noise pollution f. Environment Protection Act. Disaster management : floods. Marine pollution e. its problems and concerns. Thermal pollution g. earthquake. cyclone and landslides. ozone layer depletion. Soil pollution d. watershed management Resettlement and rahabilitation of people .PTU/BOS/CS/101/08-05-2004/BATCH 2003 Definition Causes. Pollution case studies. Climate change. nuclear accidents and holocaust.

PTU/BOS/CS/101/08-05-2004/BATCH 2003

Water (Prevention and control of Pollution) Act Wildlife Protection Act Forest Conservation Act Issues involved in enforcement of environmental legislation. Public awareness. (7 lectures)

Unit 7 : Human Population and the Environment
Population growth, variation among nations. Population explosion – Family Welfare Programme. Environment and human health. Human Rights. Value Education. HIV / AIDS Women and Child Welfare. Role of Information Technology in Environment and human health. Case Studies.

Unit 8 : Field work
Visit to a local area to document environmental and river forest grassland hill mountain. Visit to a local polluted site – Urban / Rural / Industrial / Agricultural Study of common plants, insects, birds. Study of simple ecosystems-pond, river, hill slopes, etc. (Field work Equal to 5 lecture hours)


PTU/BOS/CS/101/08-05-2004/BATCH 2003

CS-410 ORGANISATIONAL STRUCTURES (ELECTIVE - II) External Marks: 60 Internal Marks: 40 Total Marks: 100 PREREQUISITIES : None OBJECTIVES : The major objectives of the course is to help students acquire an understanding of organization and the ways in which they are structured. It will also examine the influence of structure on the behavior of individuals and groups. COURSE CONTENTS : Understanding the nature of organizations [5 %] A systems approach to organizations [10 %] Explaining predicting Behaviors in Organizations. [5 % ] The individual in the organizations Organizational structure its dimensions, its influence [25%] Taxonomy of organizations. Types of structure [15 %] Forms of Organizational structure Product process, functional, territorial and matrix, SBUs. [25 %] Organizational Theory and Designs [15 %] L 3 T 1 P -


PTU/BOS/CS/101/08-05-2004/BATCH 2003

Departmental Elective - II CS –416 OVERVIEW OF IT MATERIALS. External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P -

PREREQUITIES: Physics and Chemistry OBJECTIVES : To familiarize with the structures, properties and their inter-relationship for different materials having electronic and magnetic applications. COURSE CONTENTS : Electrical and Thermal Properties of Metals: The electron gas model of an electron in an electric field., mobility and conductivity, factors affecting the conductivity of electrical materials, effect of temperature on electrical conductivity of metals, superconductivity[20 %] Dielectric Properties of Materials : Polarization of dielectric constant of monatomic gases, other polarization methods, the internal fields in solids and liquids, the polarisability catastrophe Frequency dependence of polarisability dielectric losses, dipolar relaxation, frequency and temperature dependence of dielectric constant of polar dielectrics, ionic conductivity in insulators, insulating materials, Ferro-electricity, Piezoelectricity[20 %] Magnetic Properties of Materials : Classification of magnetic materials; the origin of permanent magnetic dipoles, diamagnetism, Para magnetism, ferromagnetism, ferromagnetic domains, the magnetization curve, hystersis loop, magnetostriction magnetic materials, antiferromagnetism, Ferro-magnetism, magnetic resonance ferrites, their p0roperties and uses. [20 % ] Optoelectronic Materials: Photoemission, Photomassive materials and Photocathodes, Multialkali photocathodes, Electroluminiscence. Electroluminiscence panels, junction photoemitters, injection losses, gallium arsenide, gallium phosphide and other losing materials.[15 % ] Special Electrical and Electronic Materials: Alloys and compounds, Solid solution and solubility, phase diagram, alloy composition and properties, multi phase materials, ceramics preparation, Silicate Structure and polymorphism, Properties of ceramics, High temperature ceramics, Crystalline and amorphous phases, Amorphous and polycrystalline materials[15 %]


2. 1987 3. Materials Science and Engg. N. William D. Callister Jr. Wiley Eastern Ltd. Dekker. Y. N. Kenneth M.. Materials. Introduction to Materials Science and Engg. J. 2. Science of Enggg. Srivastava. Prentice Hall of India. 68 . Board. John Wiley and Sons. REFERENCES 1. Srivastava and C.M. D. 1988. V. 1983. Inc. Courtney and John Wulff. A first course. 4. Tata McGraw Hill. 1975. an Introdcuction to Semiconductor Microtechnology John Wiley and Sons Inc. Wiley Eastern Ltd.An Introduction.Y. . Ralls and Thomas H.. . Application of polymers in electronics and optoelectronic device technology[10 % ] TEXT BOOKS 1. 1981.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Engineering plastics : Polymer Structures : Preparation and characterization of plastics. clastomers and fibres. Materials.. John Allison Electronic Engineering Materials and Devices. 1994. C. Prentice Hall of India. Morgan and K. Rahhavan Material Science and Engg. Electrical Engg.V.

[15%] TEXTS BOOKS: 1. is Engluood cliff. OBJECTIVES: The course provides an understanding of the various techniques of simulation. Narsingh. 1993. system simulation. 2nd ed. [10%] Techniques of simulation.R. 1993. New Delhi. K. discrete probability function. 1989. Deo. real time simulation stochastic variables. L 3 T 1 P - 69 . Wiely Eastern Ltd. Subranranian. generation of arrival pattern. System simulation: Introduction to GPSS.[25%] Discrete simulation languages an overview of use of GPSS as a simulation. measures of queues. PHI. Feller. COURSE CONTENTS: Concept of a system. New Delhi. and Sundaresan R. Ltd. generation of random number. Kadayam.H. Gordon. normal distribution. Monte Carlo method.418 SYSTEM SIMULATION & MODELLING External Marks: 60 Internal Marks: 40 Total Marks: 100 PREREQUISITIES : Programming Languages. service time.V. type of system simulations. "An Introduction to probability theory and its applications.II CS.. system simulation with digital computers. W.[30%] Representation of time. ND. continuous and discrete system.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective .S. stochastic activities. REFERENCES: 1. K. Prentice Hall of India Pvt." Vol 183. " Probability and statistics with reliability. G.[20%] Inventory control systems for illustration of applications. principals used in simulation and modeling for various applications. queuing discipline. 2. 2. Trivedi. 3. quening and computer science application. exponential distribution. poisson arrival pattern. CBS. Discrete simulation languages queuing and inventory control. P.

other messaging API's. Intranet concepts & related term development toolbox. [5 %] Introduction to SNA Server fundamentals. Reference Technical Information Network From Microsoft 70 . SNA server network overview. Windows Open Systems Architecture (WOSA). Connection of multiple devices to ISDN lines. Internet & Online services. advantages and disadvantages of cross MAPI's. Why SNA server and its connectivity with PC's [5 %] Introduction to ISDN Services and alternatives to ISDN technology. Integration of IBM mainframes with TCP/IP networks. [10 %] (GDS). [10 %] Introduction to Open Database connectivity (ODBS). Object Linking Embedding [10 %] Introduction to Telephone Application Programming Interface (TAPI) [10 %] TEXTS BOOKS: 1. Distributed to proxy server & SQL server. Cell Directory Services (CDS).II CS –420 EMERGING TECHNOLOGIES AND CUREENT IT-TRENDS External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITIES: Computer Networks And RDBMS OBJECTIVES: To Provide Hands On Experience To The Students On Current It Trends & Emerging Technologies. [10 %] MAPI and its open architecture. COURSE CONTENTS: Introduction to DVD technology and its advantages over CD technology. Operating System software for ISDN.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective . Remote Procedure Call (RPC) & DCE security. [15 %] Distributed computing environment (DCE). Global Directory Services. [10 %] Evaluation of the performance of AS400 & TCP/IP connectivity in an AS400 environment. cross platform API's. DCE services. Internet security framework And its overview.

Windows NT Win32. Menus.The child window. Richard J.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-412 GRAPHICAL USER INTERFACE (DE-III) External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES: None. Printing. Edit controls [10%] Windows within window . [10%] TEXT BOOKS: 1. COURSE CONTENTS: GUI concepts and an introduction to MS Windows. REFERENCES: 1. Accessories. Simson. API Super Bible SAMS. Bitmaps and Clipboard. Mouse messages. OBJECTIVES: The course provides the knowledge about GUI concepts to help the students for developing projects.Window API Bible by Galgotia Publication.Ben Ezzell with Jim Blaney. Key Board Messages [10%] Windows. 2. Programming Windows '95. NT4/ Windows 95 Developer's Handbook. 1997.1997 71 .[10%] Understanding the components of a window [10%] Hungarian naming and basic data types [15%] An attempt to code the shortest windows program. [15%] GDI-an introduction. Charies Patzold. 1996 2. BPB Publications. Dialog boxes [10%] Memory Management [10%] Customized resources. Microsoft Press.

IEEE Computer Society Press. Rafiquzzaman. Case Studies [25 % ] 403 GA Development Systems and support [25 %] Selected Applications [15 % ] TEXT BOOKS 1) J. Communicating Process Architecture. Pentium super space. Transputer Architectures and Case Studies : High Performance Embedded Micro controllers. 1984 2) M. Rafiquzzaman. this course provides the student to the Advanced Architectural features of the State of the art Microprocessors. Prentice Hall. Microprocessors & Micro Computers Development systems. Transputer Development System. COURSE CONTENTS: Review of 8 bit microprocessors and support components [5 %] Selected Case Studies of 16/32/64 bit microprocessors and support Contents [20 %] RISC Architectures and Case Studies: RISC vs CISC [10 %] Power PC 601 Alpha 21064.III CS-422 ADVANCED MOCROPROCESSOR (ELECTIVE III) External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITIES: Computer Architecture and Microprocessors and Interfaces OBJECTIVES: Having undergone a first course on Microprocessors and Interfaces. New Delhi. Universal Book Stall. 72 .Based system design.T. 1988 5) INMOS Ltd. Selected reprints on microprocessors and microcomputers. Microprocessors & Micro Computers . Prentice Hall 1988. Harper tow 1984 3) M.. Cain. 1990 4) INMOS Ltd.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective .

Macmillan Publishing Company. Veronis. Survey of Advanced Micro Processors. Hank Warren.Development Tools For Power PC Microprocessor (Nov. 1995. Advanced Microprocessors. 16/32 bit Microprocessors 68000/68010/68020. 2nd Edition. Edited by Cathy May. San Francisco. Hardware & Design Applications.PTU/BOS/CS/101/08-05-2004/BATCH 2003 6) Wunnava V. etc. Johan Wiley & Sons. McGraw Hill Inc. RISC Systems. 1991 REFERENCES: 1) Kenneth Hintz. 2nd Edition (May 1994) 7) Chales M. 1992. 1995 8) Power PC 403GA Embedded Controller User's Manual 9) Power PC Tools . Microcontrollers : Architetcure. Subbarao. 1991 MCGraw Hill Inc. 5) Daniel Tabak. Microprocessors Principles and Applications. Ed Silha. Van Nostrand Reinhold. 4) Andrew M.1993 73 .. 1993) 10) Power PC 601 RISC Microprocessor User's Manual . Software. Rick Simpson. Morgan Kaufmann Publishers. Daniel Tabak. Implementation & Programming McGraw Hill Inc. 3) Daniel Tabak. 2) Data Books by Intel. Motorola. California. 1990 6) The Power PC Architecture : A Specification for a New family of RISC Processors. Gilmore. 1992. Inc. McGraw Hill International Editions.

Expert System Shell Expersys. Fuzzy Expert System. bathering Formlizations Methods of Knowledge Acquisition. 1993 2) Jackson. PHI. Building Expert System. COURSE CONTENTS : Expert Systems. etc. Real Time Expert Systems. As Mycin & AM. Definitions types. Semantic Nets. [15 %] Domain Exploration Knowledge elicitation.III CS-424 EXPERT SYSTEMS External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITIES : Data Structure and Programming. [20 %] TEXT BOOKS 1) Patterson. etc. OBJECTIVES : The major objectives of this course is to provide students with a view of various models of expert systems.TIERES. Expert System Development Process [15 %] Knowledge Representation Techniques-Logic Frames. Design & Analysed Algorithm. its design. Implementation methods for Knowledge extraction and representation. Interviewing Sensor Data Capturing. John-Wiley 1991. Planning and Explanation in Expert System: Neural Expert System. 74 . components. Fuzzy and connectionist systems. Conceptualization. Introduction to AI Expert System. Study of existing expert systems.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective . [30 % ] Implementation Tools : Prolog. Symbolic Logic and Logic Programming. [20 % ] Learning.

N. Academic Press N. A. W. 1982 75 . A and Kak. machine vision. [15 % ] Image processing Techniques : Image enhancement. John Wiley. overview of practical applications. colour system transformations. image feature extraction. [45 %] Hardware architecture for image processing: Colour image signal representation.C. Y. COURSE CONTENTS : Background : Introduction to electronic systems for image transmission and storage. [15 %] Techniques of colour image processing: Colour image signal representation.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective .K. medical image processing. image restoration. 1989 REFERENCES: 1) Rosenfield. human visual system model. [10 % ] TEXTS BOOKS 1) Pratt. extension of processing techniques to colour domain. image signal representation. image date formats. 1978 2) Jain. extension of processing techniques to colour domain. [5 %] Fundamentals : Mathematical and perceptual preliminaries.III CS-426 IMAGE PROCESSING AND PATTERN RECOGNITION (ELECTIVE III) External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITIES : SINGAL PROCESSING. [15 % ] Applications of Image processing: Picture data archival. A. fundamentals of Digital Image Processing. Englewood Cliffs. image data compression and statistical pattern recognition. Digital Image Processing. Y. Picture Processing. imaging system specification building image quality. colour system transformations. K. computer processing and recognition of pictorial data. Prentice Hall. role of computers. LINEAR ALGEBRA OBJECTIVES : This is in an introductory course in Image Processing which will familiarize the students with the basic concepts and algorithms in image Processing and Pattern Recognition areas..

Explosive detector 76 .Electronic Telephone call meter / Billing system . .Stepper motor control .g.Electronic weighing machine .Data acquisition system .Traffic light controller .Weather monitoring system .PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective – III CS-414 GRAPHICAL USER INTERFACE LAB External Marks: 20 Internal Marks: 30 Total Marks: 50 Practical is based on the theory paper CS-412 Departmental Elective – III CS-428 ADVANCED MICROPROCESSORS (LAB) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T P 2 L T P 2 Students are expected to design and implement micro processor based systems for real life problem and evaluate the performance of various H/W plate forms e.Energy meter / billing systems .Temperature controller .

· Electrical Machines · Chemical Processes · Structure Analysis 77 .III CS-430 EXPERT SYSTEMS LAB External Marks: 20 Internal Marks: 30 Total Marks: 50 L T P 2 Students are required to develop expert system for various industries/real life problems. · Medical Diagnosis · Trouble Shooting of Computer Systems and PCs.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective .

Color Cutting .) involving independent program development by each student. .Mixing .Coloring black and white Image 78 .Cloning .Morphing . Experiments should demonstrate effect of IP algorithms and parameter variation on processed images qualitatively and quantitatively.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective .III CS-414 IMAGE PROCESSING AND PATTERN RECOGNITION External Marks: 20 Internal Marks: 30 Total Marks: 50 L T P 2 Atleast 10 experiments using suitable interactive tools' (PCs with imaging interface with atleast 2 exp.

3.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-416 (Software Lab XIII) SL&LP External Marks: 20 Internal Marks: 30 Total Marks: 50 L T P 2 1. 16. 9. Program illustrating the use of recursion that is finding sum of first N integers. 11.Write a program to generate fibonacci series upto the given no. 4. Program to find the factorial of a number using recursion and accumulators and cut.Program for Insertion Sort 79 . 15. 2. 12. Study of Propositional Logic Study of First Order Predicate Logic Introduction to prolog programming by a simple prolog program Program to check whether input is alphabet or not Program to find if given nuber is positive or negative. 5.Write a program which accepts any number and checks whether it is prime or not.To describe some basic predicates that are useful for manipulating lists. Write a program to check whether a given person is a member of Club Program in prolog showing mapping that is constructing new structure similar to old one. Program to play “Tic Tac Toe” 13. 7. 10. 8. 6. Program to find the length of a list using ‘Recursion’ and then using “recursion and Accumulators’.Program to calculate average tax illustrating cut-fail combination usage.Program showing use of cut in Terminating a ‘generate and test’.Program for Bubble Sort 17. 14.

Sign up to vote on this title
UsefulNot useful