This action might not be possible to undo. Are you sure you want to continue?
Punjab Technical University Jalandhar
Scheme of Syllabi ( 3rd to 8th Semester ) 2003 - 04
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
Digital Circuits & Logic
CS-205 Design Data Structures &
CS-207 Programming Methodology Written & Oral Technical
40 60 100
Programming Languages Software Lab- I (DSPM) Institutional Practical
Hardware Lab -I (DCLD) Software Lab - II (PL) Total (31 Hours)
50 50 850
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-311 Interfaces 40 60 100 7. CS-317 Software Lab VI(Algorithms) S/W Lab VII(Computer - - 2 2 30 20 50 10. 3. No. CS-313 Software Lab. CS-319 Graphics) Industrial Training - 30 20 50 60 40 100 18 6 10 420 480 900 5 .PTU/BOS/CS/101/08-05-2004/BATCH 2003 FIFTH SEMESTER Sr. CS-301 2.(DBMS Lab ) H/W lab-IV(Computer - - 4 2 30 20 50 8. CS-315 netwoks) - 30 20 50 9. CS-303 CS-305 Computer Networks DBMS Design and Analysis of 3 3 40 40 60 60 100 100 4. CS-309 Computer Graphics Computer Peripherals and 3 1 3 1 - 40 60 100 6. 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.
7. 8.312 COMPUTERS AND SOCIETY (For other branches only) 6 . 9. 5. 6.PTU/BOS/CS/101/08-05-2004/BATCH 2003 SIXTH/SEVENTH SEMESTER Sr. 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. CS-306 Mode 4. COURSE COURSE TITLE CODE Relational 1.) S/W 10. CS-302 Management System-II Introduction to Business 2. No. CS-304 System Asynchronous 3. 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 .
7. COURSE CODE HOURS/WEEK COURSE TITLE 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.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. 8. 5. No. 6. 9.PTU/BOS/CS/101/08-05-2004/BATCH 2003 6th / 7th Semester Course Title 6-month Industrial Training Internal 500 Ext. 4. 2.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 900 7 . CS-402 CS-404 CS-406 CS-408 CE-216 Symbolic Logic & Logic Processing Formal Language Automata Theory Project Principles of Engineering . 3.
CS-414 Graphical User Interface CS-428 Advanced Microprocessor CS-430 Expert System. III. II. IV. CS-432 Image Processing & Pattern recognition 8 . III. IV.Trends List of Electives-III I. CS-410 Organisational Structure CS-416 Overview of IT Materials CS-418 System Simulation and Modelling CS-420 Emerging Technologies and Current IT.PTU/BOS/CS/101/08-05-2004/BATCH 2003 List of Electives -II I. III. CS-412 Graphical User Interface CS-422 Advanced Microprocessor CS-424 Expert System. IV. II. II. CS-426 Image Processing & Pattern recognition Labs of Elective-III I.
carry look ahead add fast adders. 9 . Bhujade.Buses connecting I/O devices to CPU/memory . Channel.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-201 External Marks: 60 Internal Marks: 40 Total Marks: 100 V.S.Pal Chaudhary.. CA. NEW Delhi. Computer Architectures. 1996. [15%] I/O performance measures .V.SIMD SPMD and MIMD machines. P. Finally the student will be exposed to the recent trends in parallel and distributed computing and multithreaded application.RISC vs CISC. [15%] Performance evaluation SPEC marks LINPACK Whetstone Dhrystone etc. [10%] Multiprocessors . Prentice Hall of India Pvt. New Delhi. I/O Processor. P. 1992.Choice of instruction set control structure hardwired and microprogrammed control . Interleave memory virtual memory architectural aids in implementing these. Ltd. Morgaon Kauffman. Transaction processing benchmarks. San Mateo. Digital Computer Design Principles. USA. Ltd. subtract. [15%] CPU design . Pitamber Publishing Co. 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. main memory. 3rd Edition. M. DMA. Rao..1994. multiply . Perspectives in Computer Architecture.interaction with operating system Serial/Parallel Interfaces taking 8251 and 8255 as examples. Computer Organization and Design Prentice Hall of India Pvt.add.algorithms and implementations.. cost/benefit concept of layers in architecture design 10%] Basic Computer Organization taking 8085 as an example binary arithmetic . [10%] I/O Modes. [10%] TEXT / REFERENCES : Patterson and Hennessy.Parallel & distributed computers . Pipelining in CPU design superscalar machines.R.. COURSE CONTENTS : Principles of computer design .program interrupt. 1994.software / hardware interaction. [15%] Memory hierarchy design caches.
REFERENCES: 1. 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. Chromatic number Connectivity and other graphical parameter. COURSE CONTENTS: Graph Theory: Graph. Morphisms. [15%] Sets and functions: Sets and relations functions operations equivalence relations relation of partial order partitions binary relations. [20%] Combinatorial Mathematics: Basic counting principles Permutations and combinations Inclusion and Exclusion Principle Recurrence relations. Structure of Cyclic groups permutation groups. Application. VM Chandrasekaran L T P 3 1 - 10 . Hamiltonian chains and cycles Trees. [15%] Monoids and groups: Groups Semigroups and monoids Cyclic semigraphs and submonoids. Congruence relations on semigroups.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. dihedral groups Elementary applications in coding theory. [30%] TEXT BOOKS: 1. Applied Discrete Structures for Computer Science by Alan Doerr and Kenneth Levarseur.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS .Directed and undirected Eulerian chains and cycles. Application. Generating Function. Subgroups and Cosets. Discrete Mathematics (Schaum series) by Lipschutz (Mc Graw Hill) 2. Normal subgroups. Discrete Mathematics by N Ch S n Lyengar. [20%] Rings and Boolean algebra : Rings Subrings morphism of rings ideals and quotient rings.
To treat logic design and making them familiar with the CAD tools in digital system design. VHDL.. L T P 3 1 - 11 .1972. [5%] Digital Circuit Technologies. 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.Millman and Halkias. RTL/DTL/DCTL/TTL/MOS/CMOS/ECL.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-205 DIGITAL CIRCUITS & LOGIC DESIGN. Digital Integrated Electronics. Perry. use of programs such as expresso in minimization. [15%] Boolean algebra. R.Rajaraman. Ltd. McGraw Hill.Prentice Hall of India Pvt. Mead and L. McGraw Hill Douglas L. [5%] TEXT /REFERENCES: Morris Mano. K.Taub & D. Custom and semi-custom design. Introduction to VLSI Systems. counters. minimization. Inc. Meat and V. shift registers. analysis of basic circuits in these families. [10%] Combinational design . internal architecture of programmable logic devices. state diagrams. Ltd Jesse H Jenkins. [10%] A/D and D/A conversion techniques and selected case studies. [5%] Sequential circuits. PLDs. ISCII. flip-flops. PTR Prentice Hall.RAM. PAL. 1978 J. multivibrators. Analog and Digital Circuits and Systems. 2nd Edition. transmission line effects. design with Muxes.. ROM.PGAs. Viswanathan . line termination. EPROM. [15%] Introduction to VLSI Design . "Integrated Electronics. "Electronics for Scientist and Engineers". 1993. Englewood Cliffs H. COURSE CONTENTS: Data and number representation-binary-complement representation BCD-ASCII. 1979. Schilling. EEPROM. Conway.Designing with FPGAs and CPLDs . logic gates. G. Addition Wesley. sequential circuit design from state diagrams computer aids in synthesis. Digital Design. Prentice Hall of India Pvt. [15%] Memory system . Tata McGraw Hill . [20%] Bus structures.
OBJECTIVES: The course should provide one with a fairly good concept of the fundamentals of data structures and also of the commonly occurring algorithms. quite frequently .its implementation and associated algorithms. The course should present the general approach towards analyzing and evaluating algorithms and while presenting an algorithm. The experience in structured programming and knowledge of combinatorial mathematics would be helpful. the readers should preferable be familiar with Pascal / C. To make it useful for problem solving the abstraction is made concrete by going into the data structure of the model.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. 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. The mathematical model of data is an abstract concept of data such as set. its analysis should also be included as and when required. the question analyzing an algorithm to determine its performance in relation to the other alternatives becomes important. Given a data structure. Naturally. [10%] Sets [12%] 12 . several alternative algorithms exist for the same operation. list or graph.
McGrow. 1983 Baase. Lorin. Addition-Wesley. Sorenson: An Introduction to Data Structures with Applications. J. 1976... S.. Hopcroft. 1973. V. S. J.: Sorting and sort Systems.Hill. S Computer Algorithms: Introduction to Design and Analysis. Collins. 1976. Addition-Wesley. 1984. 2nd Ed. AddisonWesley.G.. Computer Science Press. Sahni: Fundamentals of Data Structures in PASCAL. H. S.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Graphs [12%] Files [ 5%] TEXTS / REFERENCES : Aho A. W. Prentice Hall.P. Data Structures and Algorithms.E. Goodman. D.. 1977. 1978. R.Hill . McGraw . Data Structures. Knuth. T. Kruse. E. J. Addition . Tremblay. Standish. S. P. Berztiss. 1975. Prentice-Hall. Computer Science Press.: Algorithms + Data Structures = Programs. 1987. 1977 . Ullman. Addition-Wesley. Theory and Practice : 2nd ed.D. 1977 Horowitz.: Data structures.Hedetniemi: Introduction to the Design and Analysis of Algorithms. Wirth.T. An Object-Oriented Approach. Horowitz E..: The Art of Computer Programming .: Data Structure Techniques.E. Addition-Wesley. L. 1992. Vols 1-3.A. Academic Press.T.Wesley . N. E. Sahni : Algorithms: Design and Analysis. Data Structures and Program Design . 1980. J.. A. 13 .
1973.. 1979. 1973. "The Complete Plan in Words" Penguin. Menzel D. Thesis and dissertations" Univ of Chicago Press.L. Strunk. "A Manual for Writers of Term Papers.. TEXTS/REFERENCES The Chicago Manual of Style. McMillan. & White E. Jones H. "Writing a Technical Paper". W. McGraw Hill. Boyd. 14 .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. IEEE Transactions on "Written and Oral Communication" has many papers.. LG. 1961. Gowers Ernest.H.B. 13th Edition.. 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. "The Elements of Style".M. Prentice Hall of India 1989. Turbian K.. 3rd Edition .
INTRODUCTION : C and C++ programming.N. I/O in C. designing Unique manipulators . active X controls with the MFC library. Windows Applications with MFC. Moreover it will be used as a tool for doing minor and major Projects. dynamic memory allocation . Concept of Assemblies. writing & using functions. Murray. concept of CLR. Object oriented stack and linked list in C++ WINDOWS PROGRAMMING FOUNDATIONS : Windows concepts windows programming concept . visual C++ Windows tools. differences between C and C++ . macro's Advanced preprocessor statements.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . storage classes. operators Standard C and C++ libraries. System simulate and modelling etc. introduction to OLE. arrays pointer . OBJECT ORIENTED PROGRAMMING: Object oriented terminology. adding an user interface to C and C++ program. procedure -oriented windows Application Microsoft foundation Class library concepts. Pappas & William H. BOOKS:The complete Reference Visual C++5 Chris H. .. Pappas & William Murray Osborne 15 .Net framework. System project . WIZARDS: Application and class Wizards.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. III The Visual C++ handbook Chris H. standard C and C++ data types . C.S. Managed and un-managed code in VC++. C++ classes I/O M C++. the cost team class list combining C & C++ code.Net Framework:Introduction to .. Structure unions.
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. Use of pointers for dynamic allocations of storage.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS. 16 . Emphasis should be given on the following matters. Development of recursive as well as non recursive a algorithms involving linked list trees and graphs. Development of classes for some of the data structures using the concept of abstract data types.
7. 7486. Verification of the truth table of the Multiplexer 74150.217 External Marks: 20 Internal Marks: 30 Total Marks: 50 Lab-I (Digital Circuit and Logic Design) L T P 2 1. To study the operation of 2 bit and 4 bit Johnson counters. 7402. 7400.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS. Verification of the truth tables of TTL gates. 6. 8..g. 4.(7476) (c)Verify the truth table of a D-flip flop (7474) and study its operation in the toggle and asynchronous modes. 3. (a) To study the operation of 2 bit and 4 bit asynchronous counters. Design. Design and verification of the truth tables of half adder and full adder circuits using gates 7483. 7432. (b)Verify the truth table of a J-K flip flop.7404. 2. 17 . fabrication and testing of low frequency TTL clocks using NAND gates. (b) To study the operation of 2 bit and 4 bit synchronous counters. Verification of the truth table of the De-Multiplexer 74154. 5. 7408. e. (a)Design and test of an SR flip flop using Nor/Nand gates.
18 . 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 .PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS. Designing Unique Manipulators etc.
deadlocks[35%] Memory management paging and segmentation virtual memories[20%] I. Operating System by Stallings 19 . concurrent programming and concurrency . Operating System by Madnick Donovan 2. Dhamdhere. " Operating System Concepts" Addison Wesley Publishing Company 2. OBJECTIVES: Understand the overall architecture of the operating system and its main components. [20%] Case Studies: LINUX . UNIX Operating System with SOLARIS and SCO-UNIX [15%] TEXT BOOKS 1. computer system structure . COURSE CONTENTS: Introduction to Operating system. " Systems Programming & Operating Systems Tata McGraw Hill REFERENCES 1.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. file system architecture and implementation. process synchronization. operating system structure. CPU scheduling . Functions of Kernel. Calvin. process management. A Silberschatz and Peter B./O system and secondary storage structure [10%] Protection and security [10%] Introduction to multiprocessor and distributed operating systems.
Part 2. moments of inertia etc. linear fractional transformations. Continuity. Solutions by the method of separation of variables and by Fourier and Laplace transforms. Applications to length area. Mir Publishers. Laplace equations .Y.Popov.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-204 MATHEMATICS . [17%] Boundary value problems involving partial differential equations such as wave equation. T. Rolls theorem. Laplace equation.E. elementary functions. Repeated and multiple integrals with applications to volume. uniform continuity and differentiability. Analytic functions. mean value theorems and Taylor's theorem.II.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 . centers of Mass and Gravity. Moments. [33%] Numerical Methods for ODEs and PDEs. Taylor series and Laurent series. surface area.A Kaznevnikova.Danko. Cauchy's integral formula. OBJECTIVES: To teach Engineering Mathematics to the students. Advanced Engineering Mathematics. Cauchy's integral theorem(Proof by using Greens theorem). Higher Mathematics in Problems and Exercises. surface area of revolution.Kreyszig. 1983. 20 . Wiley Enstern 1985. 5th Edition. heat equation. Approximate integration. Newton method for approximate solution Riemann integral and the fundamental theorem of integral calculus. volume. [33% Residues and applications to evaluating real improper integrals and inverse Laplace transforms. P. Cauchy-Riemann equations. [17%] TEXTS /REFERENCE : E.G. Conformal mapping. COURSE CONTENTS: Review of the prerequisites such as limits of sequences and functions. A.
trunks . DNS . TCP/IP reference model. IEEE standards 802 for LAN & MAN. elementary data link protocols . telephone system (structure. routing algorithms. Sub nets. sliding window protocols. IP addresses.[15%] Transport Layer: Treansport Services. world wide web. IP protocol . [15%] Data Link Layer: Design Issues. protocols .[10%] Application Layer: Network security . Network Layer: Design issues . COURSE CONTENTS: Introduction: Uses of Computer Networks.[20%] Medium Access Sub layer: The channel allocation . Network Hardware.Computer Networks by Andrew S. Prentice Hall of India REFERENCES 1. Data Communication by Stallings 2. Congestion control Algorithims. TCP service Model . Elements of Transport protocols. comparison of OSI &TCP/IP reference models[20%] Physical Layer: Transmission media . Tanenbaum. protocol. multiplexing and switching). Header. Network Topologies . wireless transmission . seven-layer OSI architecture of ISO. multimedia. concepts of layer protocols and layer interfaces. Error detection and correction .[10%] TEXT BOOKS 1. E-mail .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. Data Communication by Miller 21 . Network Software.
Memory & System buses . Microprocessor Development System(MDS)(10%) PROM Programming . Arthimetic group.Detail study of 8251 I/O Processor. I/O memory interface(20%) Programmable .Instruction execution sequence & Data Flow. Data transfer groups. Data Bus Data & Control Bus Synchronous & Asynchronous buses. Advanced Microprocessors. Douglas V.Microprocessor Architecture(20%) Basic Computer Architecture using 8085 MP I/O. Branch Group. 8085 Microprocessor by Ramesh Gaonkar. all 8085 instructions. COURSE CONTENTS: 1.Case structure & Microprocessor application(15%) Up application interfacing a matrix keyboard 7.Bus. 1986. Hall. Instruction set & Assembly Languages Programming (30%) Introduction. Charles M.Emilator. interrupted initiated . Tata McGraw Hill Edition. Microprocessors and Interfacing: Programming and Hardware. status flags. Csingle chip microcomputer. addressing modes. Study of 8051.. 3.segment led display Study of trafic light system stepper motor interface 6. Microprocessors: principles and Applications.Ram REFERENCES: 1. 2. instruction & data formats. 3. McGraw. 4. 2.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 . Instruction cycle Concept of address. motorola 68000 TEXT BOOKS: 1. Microprocessor by B. 2.Gilmore. Daniel Tabak. 5.DMA transfer serial & Parallel interface. Second Edition 1995. Basic arcitect (5%) Introduction to 8086. McGraw Hill 22 . Logical group. Inc. ROM Simulation introduction to up kits.Hill.
Various phases of compiler. 2. Case study of Linker in x86 machines. 5. Lexical Analysis and syntax analysis.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . 23 . 6. knowledge to assembly language and knowledge of data structures and computer organization. 2.210 SYSTEM PROGRAMMING External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES: One high level procedural language. 2. Introduction to Grammars and finite automata. Code generation 9. 2. Case study :LEXX and YACC. Code optimization techniques. Debuggers[5%] 1. Case study MS-Word. Introduction to various debugging techniques. Compilers [30%] 1. DOS Editor and vi editor.Debugging in Turbo C++ IDE. Linkers and Loaders [10%] 1. 3. OBJECTIVES: This course provides knowledge to design various system programs. Introduction to various translators. First pass and second pass of assembler and their algorithms. Full screen editor and multi window editor. 2. Bootstrapping for compilers. Design of a compiler in C++ as Prototype. Line editor. COURSE CONTENTS: Editors [5%] 1. Concept of linking. 10. Assemblers for CISC Machines: case study x85 & x86 machines. 4. 7. Intermediate Code Generation. 8. Assemblers [20%] 1. Case study :.
Design of Shell and other utilities. 1972.. TEXT BOOKS: 1. Design of kernel and various management for OS.J. Booting techniques and sub-routines.V.M. Ullman Principles of compiler Design Addison Wesley/ Narosa 1985. and J.Aho A. Tata Mc-Graw Hill 1996. 3. REFERENCES: 1. 2. Dhamdhere.PTU/BOS/CS/101/08-05-2004/BATCH 2003 3. D. Systems Programming . Introduction to Systems Software.D. 24 . 2. Mc-Graw Hill.. Operating System[30%] 1. Loading of various loading schemes. Donovan J. New York.
rm.214 HARDWARE LAB – II ( Data Communication ) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T . Study and Implementation of various commands : Ls. 8. 5.. Study of LAN (Its installation)its Components and its Topologies. coaxial cable. connectors etc. man. cp. twisted pairs. optical fibre networking. wild cards. rmdir. Configuring Network Neighborhood. cat. CS . Familiarization with transmission media viz.P 2 1. mv. cal. 25 . who. wc. Client Server Architecture Peer to Peer Networking Hybrid Networking Direct Cable Connection 4. Introduction with Network Computing 3. mkdir. cd. Implementation of Protocols and their configuration. wireless networking. 6. Familiarization with Computer Hardware 2. file. cmp.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . pwd. 7.212 SOFTWARE LAB – III (Operating System ) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T P 2 1. Sharing of resources with two connected nodes. Implementation of shell programming with various control statements and loops. 2. chmod.
by one bit. sum 8. a) Find 2s complement of 8 bit number. Sum of series of 8 bit numbers.P 2 26 . Subtraction of 2-8 bit number.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . 7. b) Find 2s complement of 16 bit number.bit 4. L T . 9. 8. a) Shift an 8 -bit no. 6. Find Largest ot two 8 bit numbers. 10.216 HARDWARE LAB . by one bit. b) Shift an 16 -bit no. Addition of 2-8 bit number.bit 3. 5 a) Find 1s complement of 8 bit number. b) Find 1s complement of 16 bit number. 2. Find Largest among an array of ten numbers(8-bit). Addition of 2-8 bit number.III (Microprocessor and Assembly Language Programming) External Marks: 20 Internal Marks: 30 Total Marks: 50 1.Introduction to 8085 kit. sum 16.
27 . Software lab for development of some features of editors Software lab for lexical analyzing using LEX/YACC. if available . Study of direct linking loader module for a subset of assembly language and macro instructions of a typical machine.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS .218 SOFTWARE LAB .IV (SP) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T .g.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. interfacing some device to a Intel 8085 microprocessor based systems through serial and parallel ports. e. Software lab on I/O Programming.
PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS .Qualifications and responsibilities . Marketing. Design. Manual and automated systems Real-life Business sub-systems: Production. Implementation.Introduction [L-2] System definition and concepts: Characteristics and types of system. System Planning [L-5] L 3 T 1 P - 28 . Finance Systems models types of models: Systems environment and boundaries.Enforcing documentation discipline in an organization . Basic principles of successful systems 2. while heightening students to the issues analysts face daily. 4. System Development cycle [L-3] Introduction to systems development life cycle (SDLC) : Various phases of development :Analysis. Systems analyst [L-1] Role and need of systems analyst .Systems Analyst as and agent of change. Maintenance Systems documentation considerations: Principles of systems documentation . Realtime and distributed systems. Development. Material. 3. COURSE CONTENTS: 1. Personal.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. Types of documentation and their importance.
producers and controls. System evaluation and performance. 29 .Designing Distributed Systems . System Implementation and Maintenance [L-2] Planning considerations. Audit trails. Systems flowcharts and structured charts . Maintenance activities and issues. Data flow diagrams . System Audit and Security [L-2] Computer system as an expensive resource: Data and Strong media Procedures and norms for utilization of computer equipment. 6.Module coupling and cohesion . Group communication. User-interface design. Designing the internals: Program and Process design . Input and Output [L-2] Classification of forms: Input/output forms design. Systems Design and modeling [L-8] Process modeling. Top-down and bottom-up design . Design representation. Modular and structured design [L-5] Module specifications . Testing and validation. System acceptance Criteria. Graphical interfaces 7. Conversion methods. Systems qualify Control and assurance. Site visits. Common diagramming conventions and guidelines using DFD and ERD diagrams. 8. Feasibility study and its importance Types of feasibility reports System Selection plan and proposal Prototyping Cost-Benefit and analysis: Tools and techniques 5.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Data and fact gathering techniques: Interviews. Data Modeling and systems analysis . Logical and physical design. Presentations. Audit of computer system usage. 9.
Dynamic modeling: sequence diagramming. System analysis and design .Elias M. System analysis and design –Perry Edwards 2. 11. object modeling: Class Diagrams. REFERENCES 1. Dynamic modeling: state diagram.Awad. Disaster recovery and contingency planning 10.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. 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.Senn 30 . Analysis and design of information systems – James A. Object Oriented Analysis and design [L-6] Introduction to Object Oriented Analysis and design life cycle.
“Data Communications and Networking” – Behrouz A Ferouzan – 2nd Edition. Media Computerisation. code-division Multiple Access. Error Correction. References: 1. Checksum. Analog and digital data transmission. (L-6) VI) SPREAD SPECTRUM: Concept.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. direct sequence spread spectrum. (L-6) II) TRANSMISSION MEDIA: Guided and Un-guided media. Frequency hoping spread spectrum. standards. Analog and digital conversion. EIA-449. Modems. (L-6) IV) DIGITAL DATA COMMUNICATION: Digital data transmission. X. (L-5) Text Books : 1. data transmission concepts.21. transmission impairments. PHI 31 . (L-4) VIII) PROTOCOL ARCHITECTURE: Protocols. Shannon Capacity. Digital to Analog conversion. Cable Modems. 2. (L-5) III) ENCODING AND MODULATING : Digital-to-Digital conversion. “Data Communication and Distributed Networks” – Ulylers D Black – 3rd Edition PHI. Performance. CRC. “Data and Computer Communication” – William Stallings – 7th Edition. TATA McGraw Hill. Par Circuit switching Packet Switching & Message switching virtual circuits. Analog to Analog conversion. DSL. TDM. WDM. Detection. EIA-530. LRC. Multiplexing application – telephone systems. (L-6) V) MULTIPLEXING AND SWITCHING: FDM. TCP/IP Protocol Architecture. 2. (L-4) VII) ERROR DETECTION AND CORRECTION: Types of Errors. Pearson Education. “Computer Networks” – Andrew S. VRC. DTE – DCE Interface. Tanenbaum. ……… OSI.
The Relational Algebra and Relational Calculus:Relational Model Concepts. The Domain Relational Calculus. Naming Conventions And Design Issues. Roles. Database Language And Interfaces. More Complex SQL Queries. Language And Systems The Relational Data Model. Classification of Database Management Systems. Basic Relational Algebra Operations. Relational Constraints And Relational Database Schema. (L-6) 32 . Relationship Types. Update Operations And Dealing With Constraint Violations. Relationships. Example of Queries in Relational Algebra. ER Diagrams. Weak Entity Types. Additional Features of SQL. (L-6) SQL Relational Database Standard:Basic queries in SQL. Views in SQL. Schemas And Instances. Attributes And Keys. (L-4) Part – 2 Relational Model. Relational Constrains. (L-2) Database System Concepts And Architecture:Data Models. The Tupple Relational Calculus. (L-3) Data Modeling Using The Entity Relationship Model:Entity Types. COURSE CONTENTS: Part – 1 Basic Concepts Databases And Database Users: Introduction.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. Insert. DBMS Architecture And Data Independence. Entity Sets. Delete and Update Statements in SQL. And Structural Constrains. Characteristics of Database Approach. Advantages And Disadvantages of Using DBMS.
Date. General Definitions of Second and Third Normal Forms. (L-3) Database Recovery Techniques:Recovery Concepts. Normal Forms Based on Primary Keys. Validation Concurrency Control Techniques. Database Concepts. by Elmasri/Navathe 2. Granularity of Data Items and Multiple Granularity Locking. Transaction and System Concepts. (L-4) Part – 4 System Implementation Techniques Transaction Processing Concepts:Introduction to Transaction Processing. SQL. References : 1. Recovery Techniques Based on Immediate Update. Shadow Paging. (L-3) Concurrency Control Techniques:Locking Techniques for Concurrency Control. 33 . 2. Third Edition. Schedules and Recoverability. Desai.The programming language of oracle.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. Recovery Techniques Based on Deferred Update. Fundamentals of Database Systems. Korth and Silberschatz Abraham. Desirable Properties of Transactions. An introduction to Database Systems by C. Introduction to Statistical Database Security. Ivan Bayross BPB Publication. Concurrency Control Based on Timestamp Ordering. (L3) Text Books : 1.1991 3. McGraw Hall. Functional Dependencies.PL/SQL . Discretionary Access Control Based on Granting/Revoking of Privileges. An introduction to Database Systems by Bipin C. Serializability of Schedules.J. (L-4) Database Security and Authorization:Introduction to Database Security Issues.
1984. Dynamic programming. design and Analysis of Algorithms. Ullman.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . NP-hard and NP-complete. [L-6] TEXT BOOKS 1. 1985. 2. string processing algorithms. 1968. The Art of Computer Programming. order arithmetic.V. Branch and bound. Brown. NP. deterministic and non deterministic polynomial time algorithms. [L12] Problem classes P. Aho. [L-8] Algorithm design techniques: divide and conquer. 3. Algorithm analysis.D. lower bounds. J. Algebraic algorithms. Hard problems and approximation algorithms.. COURSE CONTENTS: Models of computation. OBJECTIVES: Date Structures are an integral part of algorithm design and Discrete Structures covers topics like graph theory. 1 and 3. combinatorial algorithms. Springer Verlag.E. 34 . Fundamentals of Computer Algorithms. set algorithms.Knuth.1975. 1 and 2.and C. Sahni. Vols. [L-16] Sorting and searching algorithms. The Analyses of Algorithms. search and traversals.Horowitz.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. Backtracking. Data Structures and Algorithms.E. K. Vols. 2. S. J. time and space complexities and average and worst case analysis. Addison Wesley.Hopcroft. 1984.Mehlhorn. Jr. Galgotia Publishers. Addison Wesley. A. REFERENCES: 1. D. Approximation algorithms for some NP-complete problems. Holt Rinechart and Winston. 1976. Purdom.
[L-6] Visibility: Image and object precision. Understanding user interface issues that make the computer easy for the novice to use. z. OBJECTIVES: Understanding the fundamental graphical operations and the implementation on computer. Workstation. [L-6] Advanced Issues: [L-4] A. [L-6] Elementary 3D Graphics: Plane projections.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . 35 .309 COMPUTER GRAPHICS External Marks: 60 Internal Marks: 40 Total Marks: 100 L 3 T 1 P - PREREQUISITES: Data Structures and Algorithms. Homogeneous Co-ordinates. Graphics hardware. floating horizon. [L-2] Geometric Manipulation: Transformations [L-4] Matrices. Rendering. Bezier and B-Spline curves. Gourard and Phong shading. fractals. B. I/o devices. Vanishing points. Specification of a 3D view. COURSE CONTENTS: Introduction: What is Computer Graphics. area based algorithms. Curves and surfaces: Parametric Representation. Get a glimpse of recent advances in computer graphics.buffer algorithms. antialiasing. Display devices [L-4] Basic Raster Graphics: Scan conversion [L-4] Filling [L-2] Clipping. raytracing. Elements of a Graphics.
REFERENCES: 1. Computer Graphics. 2.Rogers and J. 3. 36 . OSF/Motif Edition. Rogers. 4. Baker. McGraw Hill Book Company. Mathematical Elements for Computer Graphics. Alan Watt and Mark Watt. X Window.Graphics by Yashwant Kanetkar. D. Young. McGraw -Hill International Edition. Advanced Animation and Rendering Techniques. Adams. Hearn and P. David F. Prentice Hall. Procedural Elements for Computer Graphics.PTU/BOS/CS/101/08-05-2004/BATCH 2003 TEXT BOOKS: 1. Prentice Hall. Computer Graphics (Schaum Series ) by Lipschutz (MC Graw Hill) 2. 3. Addison-Wesley. C. System Programming.
Parallel to SCSI converter. Advanced 3D Technologies. P. DMA Channel. (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. DVI Digital signals for CRT Monitor. TV Tuner and Video Capture upgrades troubleshooting Video Cards and Drivers. 4. Ltd.ISA. Scott Muller.Kirrman. Del Corso. 1994. 2. PCI bus. I/O Port Addresses and resolving and resolving the conflict of resources. USB Mouse/ Keyboard Interfaces. (L-4) Video Hardware : Video display technologies. COURSE CONTENTS: SYSTEM RESOURCES: Interrupt. OBJECTIVES: To learn the functional details of various peripheral devices. Douglas V Hall “Microprocessor & Interfacing Programming & H/W” McGraw Hill International 2nd Edition 1992. H. “Computer Organization and design” Prentice Hall of India Pvt. (L-10) Input/ Output Driver software aspects: Role of device driver DOS and UNIX/ LINUX device drivers. ATA RAID and SCSI RAID. VESA Local bus. JD Nicond “Microcomputer buses & links” Academic Press 1986. Video adapter types. Integrated Video/ Motherboard chipset. PCI Express. Graphic accelerators. I/O buses. Local bus. Video RAM. (L-10) IDE & SCSI Interfaces: IDE origin. IDE Interface ATA standards ATA1 to ATA7. LCD Panels. SCSI Cable and pin Connector pin outs SCSI V/s IDE Advantages and limitation. Testing of serial and parallel port. Some aspects of cost Performance analysis while designing the system (L-2) Text/ Reference: 1. Accelerated graphics port bus. ATA feature.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. 3. “Upgrading and repairing PC” 37 . EISA. Pal Chandhari . Video driver and multiple Monitor. (L-8) I/O Interfaces: I/O Interfaces from USB and IEEE1394. I/O Interface from serial and Parallel to IEEE1394 and USB 961.
3. between. To explore ‘select’ clause using where. To implement nested and correlated queries. To implement different types of DDL. like. 6. DML and DCL statements in SQL. To implement different in-built functions on the created database.- P 4 Introduction to DBMS. having etc. 5. 2. L T .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. order by. group by. 4. 38 . To use constraints on the created database.
To study TDM modulation techniques To study WDM modulation techniques To study various transmission media like twisted pairs. Conversion of digital to analog signals. Conversion of Analog to Analog signals.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . 2. Conversion of Analog to digital signals. 8. 39 .P 2 1. 9. Conversion of digital to digital signals.optical fibers etc. 6. 7. 5. 4. 3. co-axial cables. Implementation of multiplexers. To study FDM modulation techniques.315 HARDWARE LAB – IV Computer Networks External Marks: 20 Internal Marks: 30 Total Marks: 50 L T .
Experiments with software packages like LEDA.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS .P 2 Experiments to plot growth of functions. Implementing heuristics and comparison with algorithms designed with asymptotic complexity in Comparison of various data structures for the same algorithm. 40 .317 SOFTWARE LAB – VI (Algorithms) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T .
Sean convert line segments.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. Clip line segments against windows.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . The truncated cube of Module 3 employed here.319 SOFTWARE LAB – VII (Computer Graphics) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T . Compute the convex hull of a set of planar points. Fill polygon with stipple patterns. 41 . Implement the de Casteljau algorithm for curves. Display the view volume. Use Phigs to show objects in various views. Show a unit cube in perspective.
Managing Database and Queries: Creating. 2nd Edition. defining and modifying Table structure. PL SQL. 1991.. relations. attributes. storage structures. Ramez Elmasri and Shamkant B.Date (Addison Wesley) References: 1. The Benjamin / Cummings Publishing Co. Ivan Bayross (BPB Publication) 42 . 1994. Database System Concepts. indexing. SQL *PLUS. over view of security. 2.C. recovery. integrity. 2 . 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. functional dependence. relational data structure.PL/SQL The Programming Language of ORACLE. Relational Algebra.-1. McGraw Hall. normalization & normal forms. keys. embedded SQL.Korth and Silberschatz Abraham. backup. Navathe Fundamentals of Database System. Transact-SQL. etc. COURSE CONTENTS: Data base system architecture. An Introduction to Database Systems. relational calculus.J. data independence. [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. data representation. [25 % ] SQL. Query by example. Vol.
[ 25 %] Special topics Introduction to Management Information Systems and Decision Support Systems. Software Engineering. K. MARCAN.K. First edition 1990.S. [15 %] Principles of Software Engineering: Software development methodology: System analysis. [20%] Principles of Data Processing: Data representation and file management in COBOL Sequential indexed and relative files. Tata McGraw Hill 1985. Resource Planning (MRP-2) Software like SAP. [10 %] TEXT BOOKS 1) N. COURSE CONTENTS: Introduction to Business System: Data capture. Structured COBOL Programming with Business application.. User interfaces. Processing dissemination storage/retrieval I/O and storage devices terminals printers and disks. L.  % Data Management Software: Packaged software: Word processors spread sheets. McGraw Hill Inc.Taxali REFERENCES 1)Computers today by Suresh 2) R. Pitmbar Publishing Co.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS. COBOL Programming. Roy and D. DFD.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. COBOL and data management packages. ER Model design concepts software architecture file (table) and process design issues in system implementation. Third Edition. Sarda. Ghosh Dastidar. 43 . Data management packages such as DBASE and FOXPRO. It also introduces students to basics of Software Engineering.. 1992. 2) M. report writer screen management. Pressman. 3) Foxpro by R. Enterprise Resource Planning (ERP) management.
Mc Graw Hill 1994 REFERENCES 1) IEEE Networks Magazine Sep '92 onwards 44 . Design Consideration [5%] ATM based Protocol interworking. ATM Hardware. ATM layer Performance Measurement[15%] Technological comparison of ATM with others structures [10%] TEXT BOOKS 1) ATM . Conjunction control [25%] User Control and Management Planes [5%] ATM and System. Spohn. COURSE CONTENTS: Introduction to ATM. Switch Models and their comparison [20%] ATM traffic Management. Choice of Payload size [20%] ATM N/W Basics.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.Theory and Application by David E. McDysan & Darren L. Theory of Operation. ATM Cable & Transmission.
SSADM etc. CASE standards. quality standards. an exercise in making compromises. physical data design. architectural and detailed design. semi-formal and informal methods. Business Information system and Database Management System. dynamic modeling for real-time systems. verification and validation. project initiation and project termination. data. quality assurance. project planning. quality plans. [15 %] Software Project Management: principles of software project management organizational and team structure. control and user interface designs. data function. Information system characteristics. Concepts of structures programming. Elementary data structures. software development strategies. data flow and logical data modeling. process. tools. life cycle concepts. tools and techniques and make him/her appreciate that software engineering is. feasibility study. some of the popular methodologies such as Yourdon's SAD. Elementary probability theory. network. The present course should seek to equip the student with a repertoire of principles. after all. cost estimation methods-function points and COCOMO. testing. [15 %] Software Quality Management: quality control. software phases and deliverables.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. OBJECTIVES : The course should provide an introduction to the fundamentals principles of software engineering. software development process models.[20 %] 45 . COURSE CONTENTS Software Engineering Principles: How is software engineering an engineering discipline. CASE tools. quality and management plans. technical. [15 %] Technical Development: Structured systems analysis and design requirements collection and specification. software metrics. project controls. tools Configuration Management [15 %] Software Development Method & CASE: formal. and event-based modeling. Programming in atleast on high level language.
1991. McGraw Hill. 4) Fairley R. S. W. Prentice Hall. J.. A Spiral Model of Software Development and Enhancement. Fourth Edition... Software Engineering Concepts. in client-server environments. Software Engineering: A practitioner's Approach.Wesley Pub. Macmillan Publishing Company. 3) Oehm B.. REFERENCES: 1) Ghezzi C. 46 .pp 61-72. New York. 2) Jalota. 1987. N. 21.Software Engineering. 1992. Software Engineering: The Production of Quality software. May 1988. in 4GL environment. 1985. Third Edition McGraw Hill. 3) Sommerville I. And Mandrioli D. New York. Jazayeri M. IEEE Computer. Software Engineering..PTU/BOS/CS/101/08-05-2004/BATCH 2003 Implementation: in 3GL environment. Second Edition. Co.. 1991 2) Pfleedger S.. Software Maintenance [5 %] TEXT BOOKS: 1) Pressman R. L. [20 %] Documentation. coding styles. Addison .: Fundamentals of Software Engineering.
Visual motion computation. algorithms and systems in Computer Vision with a view to make them aware of principal applications. the 3D model representation. Basic Image Processing Techniques OBJECTIVES: To familiarise students with principles. Parallel algorithms. [30%] Peripheral hardware for computer vision: Imaging devices. Fuzzy logic procedures in computer vision algorithm. Distance and surface orientation computation from Disparity. frame grabbers. Relation between viewer centred and object centred 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. Pyramidal architecture for vision. Parallel solutions to conventional Image algorithms. Review of basic image processing techniques. their derivatives and use. Fuzzy logic procedures in computer vision algorithm. [20%] 47 . Correspondence between Image and Catalogued model. [10%] Intermediate Processing: Computational approach to stereopsis. [20%] Shape Representation & Recognition: Critical Issues. apparent motion and correspondence Problem.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. display devices. Fuzzy logic membership function. application in decision making . [20%] Architectural issues of intermediate processing.
Davies. 1986 3)MJB Duff. 1990 5)David Vernon. MIT Press. Prentice Hall. Intermediate level Image processing. Machine vision. Robot Vision. Academic Press. Combridge.M. 1978 48 .R. Computer Vision .Brown. Acadmic Press. 1986 4)E. Digital Image Processing John Wiley & Sons. Englewood Cliffs. 1982 2)Horn. Algorithms & Practicalities. Machine vision Theory. Academic Press 6)Pratt.PTU/BOS/CS/101/08-05-2004/BATCH 2003 TEXTS/REFERENCES: 1)Ballard and C.
L. delays. [10%] TEXTS/REFERENCES: 1)James E.s MOSFETs.C. Prentice Hall. High Speed Digital Design-A Handbook of Black Magic. supply currents speed. [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. Basic Electronic Devices and Circuits ( B. 1993 49 . PTR Englewood Cliffs.I.J. [40%] Real life system design examples. COURSE CONTENTS: CMOS Technology : Logic levels noise margin power dissipation. circuit analysis).Buchanan. " Digital System Design and Microprocessors" Mc Graw Hill International Edition 1985. 2)Jame E.Burchnana. " BICMOS-CMOS System Design" McGraw Hill International Edition 1991. basic logic gates) OBJECTIVES: To provide students an exposure to analysis and design techniques used in digital system hardware design.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. 4)Darryl Lindsay. " CMOS-TTL System Design" Mc Graw Hill International Edition 1990 3)John P. 5)Howard W. " Digital PCB design and drafting" Bishop Graphics 1986.Johnson & Martin Graham. Hayes.
Krishna and Kang G. Task assignment. databases for hard real time systems Real Time Communication: Introduction. concurrency control issues.Token based protocols. Cost functions and hard Deadlines Task Assignment and Scheduling: Introduction . EDF algorithm. Performability. Fault tolerant Scheduling Real Time Databases: Basic definitions. "Real ?Time Systems"-C. Structure of a Real Time System. Task Classes Characterizing Real Time Systems and Tasks: Introduction. Main Memory databases. "Real Time Systems"-Liu Pearson Education 2. Hierarchical round robin protocol. The polled bus protocol. M. Classical Uniprocessor scheduling algorithms: Rate Monotonic. Archtectural Issues. Deadlines based protocols. Issues in Real Time Computing. Performance measures for real time systems: Traditional performance measures.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. Real time Vs General Purpose databases. Stop and Go Multihop protocol. Shin 50 . Protocols: Contention based protocols. References: 1.
Introduction to OR. formulation solution and applications [10%] Game Theory [10%] Queuing Theory & Applications [10%] Linear Goal Programming methods and applications [5%] Simulation [10%] TEXT BOOKS: 1. Tata Mcgraw Hill 1991 51 . 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.S Sharma.J.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. Operation Research by D. [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 Hira.S Hillier & G. Mcgraw hill Int. 2. [5%] Linear programming problems & Applications. Operation Research by D.Kapoor. Various components of LP problem formulation. Computer Assisted Decision Models. Introduction to OR. COURSE CONTENTS: Introduction to OR modeling approach and various real life situations. John Wiley & Sons. 1993 3) R. Using OR major focus should be on how to model various situations in industries and solve them. REFERENCES: 1) F. Series 1995 2) A Ravindran. Lieberman.
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, Systems Programming OBJECTIVES: Understand the influence of programming languages and architectures on the efficiency of language translation. COURSE CONTENTS: Overview of the translation process, Lexical analysis: Hand coding and automatic generation of lexical analysers. [8%] Parsing theory: Top down and bottom up parsing algorithms. Automatic generation of parsers [8%] Error recovery: Error detection & recovery. Ad-hoc and systematic methods. [18%] Intermediate code generation: Different intermediate forms. Syntax directed translation mechanisms and attributed definition [7%] Run time memory management: Static memory allocation and stack based memory allocation schemes. [17%] Symbol table management. [8%] Code generation: machine model, order of evaluation, register allocation and code selection. [17%] Code Optimization: Global data flow analysis. A few selected optimizations like command sub expression removal, loop invariant code motion, strength reduction etc. [17%] TEXTS/REFERENCES: 1)Aho, Ravi Sethi, J.D. Ullman, Complilers tools and Techniques, Addison-Wesley, 1987 2)Dhamdhere, Compiler Construction- Principles and Practice Macmillan, India 1981 3)Tremblay J.P. and Sorenson, P.G. the Theory and practice of Compiler writing ' Mcgraw Hill, 1984 4)Waite W.N. and Goos G.Compiler Construction Springer Verlag, 1983.
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, Data Structure & Algorithms. OBJECTIVES: Introduction to the methods and techniques of Natural Processing- semantics, pragmatics, Applications of Natural Language Processing. COURSE CONTENTS: Components of natural language processing: lexicography, syntax, semantics, pragmatics: word level representation of natural languages prosoty & natural languages. [20 %] Formal languages and grammars: Shomsky Hierarchy; Left Associative Grammars. Ambiguous Grammars. Resolution of Ambiguities. [20%] Semantics knowledge Representation: Semantic Network Logic and inference. Pragmatics, Graph Models and Optimization. Prolog for natural semantic. [20%] Computation Linguistics: Recognition and parsing of natural language structures: ATN & RTN; General techniques of parsing: CKY, Earley & Tomita's Algorithm. [20%] Application of NLP: Intelligent Work Processors: Machine Translation; User Interfaces; Man-Machine Interfaces: Natural language Querying Tutoring and Authoring Systems. Speech Recognition Commercial use of NLP. [20%] TEXTS BOOKS 1) J.Allen, Natural Language understanding, Benjamin/Cunnings, 1987. 2) G.Gazder, Natual Language processing in Prolog , Addison Wesley, 1989. REFERENCES:1) Mdlj Arbib & Kfaury, Introduction to formal language Theory, Springer Verlag 1988.
CS 314 HARDWARE LAB - V (ATM) External Marks: 20 Internal Marks: 30 Total Marks: 50 L 0 T 0 P 4
Simulation of ATM Switch performance, through put with mixed load conditions. Implementing Ethernet on various plateform (Windows NT, Window 95, UNIX, 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.) · Comparison of utilization of various resources (Processor, memory, hard disk etc.) · Under different networking loads. · Familiarization with NDS in Novell. · 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
CS- 316 SOFTWARE LAB - VIII (RDBMS-II) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T - P 4
To run the various queries using commands of SQL. To write programs using control structures of PL/SQL like If-else statements. To write programs using loops of PL/SQL like For Do-while while Implementation of Cursors. Procedures Packages. Triggers
CS- 318 SOFTWARE LAB - IX (S/W ENGINEERING) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T - P 2
Assignments should be provided for the following: · Use of CASE tools for development of DFD, data dictionary, E-R diagram, Structured Chart. · Analysis and design of simple object-oriented as well as real time systems. · Familiarity with JSP and JSD · Documentation · Beta Testing
FoxPro.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.COBOL screen management report management and report writing facilities. 56 . · Lab Experiments on data management packaged like DBASE.Usage of Word processor. .X (BUSINESS SYSTEM) External Marks: 20 Internal Marks: 30 Total Marks: 50 L T . .
[15%] Data banks and their impact on society. H. Freeman. [10%] TEXTS / REFERENCES: Weizenbaum. OBJECTIVES: To study the impact of the large scale introduction of computers on the cultural social and political environment of a country. Computer Power and Human Reason: from judgement to Calculation. Kling . R. To discuss ethical and moral issues of concern to computer scientists and engineers.312 COMPUTERS AND SOCIETY (Open Elective) External Marks: 60 Internal Marks: 40 Total Marks: 100 L T 3 1 P - PREREQUISITES : RDBMS-I & Computer Networks-I. [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. (Editors) Computerization and Controversy: Value Conflicts and Social Choices. 1991 57 . [10%] The role of computer in education... C. Boston Academic Press.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS . Dunlop. J. [10%] Intellectual property rights in relation to computer v hardware and software. 1976. San Francisco. COURSE CONTENTS: A survey of a variety of computer application. W.
PTU/BOS/CS/101/08-05-2004/BATCH 2003 SIXTH/SEVENTH SEMESTER Industrial / Institutional Training. 58 .
[ 20 %] Advanced prolog features: programming techniques: Structural Induction and Recursion. COURSE CONTENTS: Prepositional logic: syntax and semantics: Validity and consequence. 1984. W. 3) Lloyd. New York. R. Representing world knowledge using prepositional logic.. Deductive strategies employed in symbolic logic and Programming in Prolog. 1984 REFERENCES 1) Gries.. The MIT Press. OBJECTIVES: Representation of world knowledge using symbolic logic. 1963. Unification and first order resolution SLD resolution. semantics validity consequence clause normal from. 1991. Springer Verlag. Programming in Prolog 2nd edition. Springer.. J.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 T 3 1 P - PREREQUISITIES: Discrete Structures. and Mellish. Foundation of Logic Programming.F. W.[ 20 %] Introduction to Fuzzy logic neural networks [15 %] TEXT BOOKS 1) Stoll. Dover publishers. the computation and search rules. The Craft of Prolog. set Theory and logic. The Science of Programming. Normal forms. 2) Clocksin. 1985 2) O' Keefe.S. [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. 59 . Extra Logical features: Cut and Negation Case studies. Execution model Introduction to Programming in Prolog. C. Narosa Publishers. [20 %] Introduction to prolog: Syntax of prolog. [15 %] First order logic: World knowledge representation and the need for quantifiers. SLD trees and interpretation of non-declarative features of Prolog. Illustrative examples. Structured data representation. Syntax.
[10 %] TEXT BOOKS 1) G. COURSE CONTENTS: Basic Definitions Operations on Languages: Closure properties of Language Classes. 60 . The Equivalence of the Automata and the appropriate grammars. H. [25 %] Syntax Analysis : Ambiguity and the formal power Series. Algebraic Properties Universality & Complexity Variants. Harrison. Rewriting Systems. REFERENCES 1) Wolfman Theory and Applications of Cellular Automata. E. [15 %] Derivation Languages. [35 %] Unrestricted Languages: Normal form and Derivation Graph. 1986. Algebraic properties. Regular Expressions Context Sensitive Language. Formal Language Theory Addison Wesley 1978. Introduction to Formal Languages. The Dyck Language. Context Free languages: The Chomsky Griebach Normal Forms. Linear Grammars and regular Languages. The Kuroda Normal Form. McGraw Hill 1983 2) M. Automata and their Languages: Finite Pushdown 2-push down Automata and Turing Machines. Singapore. World Scientists. Canonical Derivations. One sided Context Sensitive Grammars. Context Sensitivity. Reevsz. Formal Properties of LL(k) and LR(k) Grammars.[ 15 %] Cellular Automata : Formal Language aspects.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 T 3 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.
effects of changes in fixed and variable costs. factors to be considered in replacement Studies. Method of Recruitment. Importance of Human Resource in Industry. economics order quality. payout period method and uniform annual cost method. Functions of Human Resource Management & its relation to other managerial. [5 %] Human Resource Management :Introduction to Human Resource Management and its definition. graphical solution. decision making in selection of alternative by present worth methods. Minimum cost analysis. [15 %] Training & Development : Difference between Training and Development. Employee Development.[ 10 %] Replacement Studies: Reasons for replacement. Principles of Training. economic analysis of new projects.Human Resource Management Technical for optional utilization of men. two and three alternatives. Breakeven charts. Estimation of cost in various manufacturing operations.[ 10 % ] Procurement And Placement : Need for Human Resource Planning process of Human Resource Planning. Promotion merit V/S seniority performance appraisal [10 %] L T 3 1 P - 61 .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 . COURSE CONTENTS Cost analysis: Break-even analysis. Psychological tests and interviewing. discounted cash flow analysis. modines material & Money. Estimating procedure.Depreciation Methods. Investment alternative . [10 %] Depreciation : Types of depreciation and their Methods. rate of return method. challenger and defender [10 %] Economic Analysis Of Investment Alternatives : Basic economy study patterns and their comparison. Effect of risk and uncertainty on lot size. qualifications of an estimator. effect of taxation on economic studies.[ 10 %] Cost Estimation : Difference between cost estimation and cost accounting. Meaning and Importance of placement and Induction. economic life of a project. Estimate of material cost and labour cost.
T. Meerut) 4. Engg. Engineering Economy : Thuesen Pnentice Hall REFERENCES 1. Bhagooiwal Economics of Labour and Industrial Relations (Sahitya Bhawan Agra) 5. Homewood) 3.Saxena Labour Problems and Social Welfare (K.C. workers participation. Saiyada (Tata Mc Graw Hill) 2.B. Introduction to Econometrics : Kliwen Prentice Hall 62 . R. Mamoria Personnel Management (Himalaya publishing house Bombay) 3. Introduction of motivation Theory.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Job Satisfaction :Job satisfaction and its importance. Quality of working like. Michael J. C. Economics Analysis Bullinger 4. Motivation Factor affecting motivation. Drawin B. A. Flippo Principles of personnel Management (MC Graw Hill) 2. Inwin.S.N. [10 %] Integration & Maintenance: Introduction to Integration and Maintenance. Math & Co. Jucius Personnel Management (Richard D. [5 % ] TEXT BOOKS 1. Minappa and Personnel Managements M.
63 . Timber extraction. dams and their effects on forests and tribal people. Case studies. man induced landslides. effects of modern agriculture. conflicts and water. drought. salinity. e) Energy resources : Growing energy needs. water logging. mining. dams-benefits and problems. deforestation. a) Forest resources : Use and over-exploitation. c) Mineral resources : Use and exploitation. Role of an individual in conservation of natural resources. soil erosion and desertification. environmental effects of extracting and using mineral resources. Unit 2 : Natural Resources : Renewable and non-renewable resources : Natural resources and associated problems. Equitable use of resources for sustainable lifestyles. floods. changes caused by agriculture and overgrazing. land degradation. case studies. case studies. d) Food resources : World food problems. renewable and non renewable energy sources. scope and importance (2 Lectures) Need for public awareness. case studies. use of alternate energy sources.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. b) Water resources : Use and over-Utilization of surface and ground water. f) Land resources : Land as a resource. fertilizer-pesticide problems.
Endangered and endemic species of India Conservation of biodiversity : In-situ conservation of biodiversity. types. poaching of wildlife. Threats to biodiversity : habitat loass. ethical. India as a mega-diversity nation Hot-spots of biodiversity. characteristic features. Ecological succession.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Unit 3 : Ecosystems Concept of an ecosystem. Structure and function of an ecosystem. d. oceans. b. streams. man-wildlife conflicts. Producers. Unit 4 : Biodiversity and its conservation Introduction – Definition : genetic. estuaries) (6 lectures) Forest ecosystem Grassland ecosystem Desert ecosystem Aquatic ecosystems (ponds. National and local levels. aesthetic and option values Biodiversity at global. Energy flow in the ecosystem. social. Food chains. food webs and ecological pyramids. Introduction. productive use. consumers and decomposers. lakes. Unit 5 : Environmental Pollution 64 . Biogeographical classification of India Value of biodiversity : consumptive use. species and ecosystem diversity. rivers. structure and function of the following ecosystem :a. c.
Thermal pollution g. Environment Protection Act. Air pollution b. watershed management Resettlement and rahabilitation of people . Marine pollution e. Climate change. (8 lectures) Unit 6 : Social Issues and the Environment From Unsustainable to Sustainable development Urban problems related to energy Water conservation. Role of an individual in prevention of pollution. effects and control measures of urban and industrial wastes. its problems and concerns. Environmental ethics : Issues and possible solutions. Air (Preventation and Control of Pollution) Act. Disaster management : floods. earthquake.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Definition Causes. Soil pollution d. rain water harvesting. Noise pollution f. acid rain. Consumerism and waste products. 65 . cyclone and landslides. nuclear accidents and holocaust. Pollution case studies. Case studies. effects and control measures of :a. Water pollution c. Case studies. Wasteland reclamation. Nuclear hazards Solid waste Management : Causes. global warming. ozone layer depletion.
variation among nations. hill slopes. birds.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. Case Studies. Value Education. 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. (Field work Equal to 5 lecture hours) 66 . insects. Environment and human health. Population explosion – Family Welfare Programme. Study of simple ecosystems-pond. etc. river. (7 lectures) Unit 7 : Human Population and the Environment Population growth. Human Rights. Public awareness. HIV / AIDS Women and Child Welfare. Role of Information Technology in Environment and human health.
SBUs. COURSE CONTENTS : Understanding the nature of organizations [5 %] A systems approach to organizations [10 %] Explaining predicting Behaviors in Organizations. territorial and matrix. functional. Types of structure [15 %] Forms of Organizational structure Product process. its influence [25%] Taxonomy of organizations. [25 %] Organizational Theory and Designs [15 %] L T 3 1 P - 67 . [5 % ] The individual in the organizations Organizational structure its dimensions. It will also examine the influence of structure on the behavior of individuals and groups.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.PTU/BOS/CS/101/08-05-2004/BATCH 2003 CS-410 ORGANISATIONAL STRUCTURES (ELECTIVE .
PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective . Silicate Structure and polymorphism. dipolar relaxation. properties and their inter-relationship for different materials having electronic and magnetic applications. External Marks: 60 Internal Marks: 40 Total Marks: 100 L T 3 1 P - PREREQUITIES: Physics and Chemistry OBJECTIVES : To familiarize with the structures. Electroluminiscence panels. injection losses. diamagnetism. antiferromagnetism. Crystalline and amorphous phases. the magnetization curve. [20 % ] Optoelectronic Materials: Photoemission. Solid solution and solubility. mobility and conductivity. Electroluminiscence. frequency and temperature dependence of dielectric constant of polar dielectrics. alloy composition and properties. their p0roperties and uses. superconductivity[20 %] Dielectric Properties of Materials : Polarization of dielectric constant of monatomic gases. effect of temperature on electrical conductivity of metals. the origin of permanent magnetic dipoles. Ferro-electricity. Para magnetism. Multialkali photocathodes.II CS –416 OVERVIEW OF IT MATERIALS. gallium arsenide. gallium phosphide and other losing materials. magnetostriction magnetic materials. High temperature ceramics. junction photoemitters. hystersis loop. phase diagram. factors affecting the conductivity of electrical materials. ceramics preparation. Ferro-magnetism. ionic conductivity in insulators. Amorphous and polycrystalline materials[15 %] 68 . the polarisability catastrophe Frequency dependence of polarisability dielectric losses. multi phase materials. Photomassive materials and Photocathodes. Piezoelectricity[20 %] Magnetic Properties of Materials : Classification of magnetic materials. insulating materials. other polarization methods. COURSE CONTENTS : Electrical and Thermal Properties of Metals: The electron gas model of an electron in an electric field.[15 % ] Special Electrical and Electronic Materials: Alloys and compounds. Properties of ceramics.. ferromagnetism. ferromagnetic domains. the internal fields in solids and liquids. magnetic resonance ferrites.
Board.Y. Tata McGraw Hill.M. Electrical Engg. John Wiley and Sons. Prentice Hall of India. clastomers and fibres. Srivastava. 69 . Dekker. Courtney and John Wulff. V. 4. Introduction to Materials Science and Engg. . Wiley Eastern Ltd. J. Rahhavan Material Science and Engg. Kenneth M. Application of polymers in electronics and optoelectronic device technology[10 % ] TEXT BOOKS 1. REFERENCES 1. 1983. John Allison Electronic Engineering Materials and Devices. William D. N. 1981. 2. Prentice Hall of India. Science of Enggg. 1975. Materials Science and Engg. D.V. Morgan and K.. Inc. 1988. Y. Ralls and Thomas H. N. C. an Introdcuction to Semiconductor Microtechnology John Wiley and Sons Inc. Wiley Eastern Ltd. Materials. Materials. A first course. Callister Jr.. 2. 1987 3.An Introduction.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Engineering plastics : Polymer Structures : Preparation and characterization of plastics.. Srivastava and C. 1994. .
real time simulation stochastic variables. L T 3 1 P - 70 . K. K. " Probability and statistics with reliability. ND. New Delhi. COURSE CONTENTS: Concept of a system. quening and computer science application. Monte Carlo method. REFERENCES: 1. P. Wiely Eastern Ltd.H. G. continuous and discrete system. queuing discipline. CBS. 2nd ed.II CS. 3. Discrete simulation languages queuing and inventory control. 2. is Engluood cliff. Trivedi.[25%] Discrete simulation languages an overview of use of GPSS as a simulation. W. system simulation with digital computers. system simulation. Kadayam. OBJECTIVES: The course provides an understanding of the various techniques of simulation. 2.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective . Deo. 1993. Narsingh. Feller. New Delhi.418 SYSTEM SIMULATION & MODELLING External Marks: 60 Internal Marks: 40 Total Marks: 100 PREREQUISITIES : Programming Languages. PHI. exponential distribution.R." Vol 183. System simulation: Introduction to GPSS. measures of queues. poisson arrival pattern. service time. discrete probability function. "An Introduction to probability theory and its applications. 1993. generation of arrival pattern. generation of random number. Subranranian.[30%] Representation of time.S. and Sundaresan R. 1989. [10%] Techniques of simulation. type of system simulations. Ltd.V.[20%] Inventory control systems for illustration of applications.. Prentice Hall of India Pvt. stochastic activities.[15%] TEXTS BOOKS: 1. Gordon. normal distribution. principals used in simulation and modeling for various applications.
Global Directory Services.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective . Reference Technical Information Network From Microsoft 71 . Intranet concepts & related term development toolbox. SNA server network overview. other messaging API's. advantages and disadvantages of cross MAPI's. cross platform API's. Cell Directory Services (CDS). DCE services. Why SNA server and its connectivity with PC's [5 %] Introduction to ISDN Services and alternatives to ISDN technology. [5 %] Introduction to SNA Server fundamentals. Internet & Online services. Remote Procedure Call (RPC) & DCE security. [10 %] Evaluation of the performance of AS400 & TCP/IP connectivity in an AS400 environment. [15 %] Distributed computing environment (DCE). Operating System software for ISDN.II CS –420 EMERGING TECHNOLOGIES AND CUREENT IT-TRENDS External Marks: 60 Internal Marks: 40 Total Marks: 100 L T 3 1 P - PREREQUISITIES: Computer Networks And RDBMS OBJECTIVES: To Provide Hands On Experience To The Students On Current It Trends & Emerging Technologies. Internet security framework And its overview. Distributed to proxy server & SQL server. Windows Open Systems Architecture (WOSA). Connection of multiple devices to ISDN lines. [10 %] MAPI and its open architecture. [10 %] Introduction to Open Database connectivity (ODBS). Object Linking Embedding [10 %] Introduction to Telephone Application Programming Interface (TAPI) [10 %] TEXTS BOOKS: 1. Integration of IBM mainframes with TCP/IP networks. COURSE CONTENTS: Introduction to DVD technology and its advantages over CD technology. [10 %] (GDS).
Key Board Messages [10%] Windows.1997 72 . 2.Window API Bible by Galgotia Publication.[10%] Understanding the components of a window [10%] Hungarian naming and basic data types [15%] An attempt to code the shortest windows program. API Super Bible SAMS. Richard J. Charies Patzold. BPB Publications.The child window.Ben Ezzell with Jim Blaney.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 T 3 1 P - PREREQUISITES: None. Windows NT Win32. Printing. Microsoft Press. OBJECTIVES: The course provides the knowledge about GUI concepts to help the students for developing projects. NT4/ Windows 95 Developer's Handbook. Accessories. [15%] GDI-an introduction. Mouse messages. COURSE CONTENTS: GUI concepts and an introduction to MS Windows. Bitmaps and Clipboard. Edit controls [10%] Windows within window . Simson. 1996 2. 1997. Menus. Programming Windows '95. [10%] TEXT BOOKS: 1. Dialog boxes [10%] Memory Management [10%] Customized resources. REFERENCES: 1.
PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective . Prentice Hall 1988. 1984 2) M. 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. Prentice Hall. Harper tow 1984 3) M.Based system design. Communicating Process Architecture. Cain.T.. this course provides the student to the Advanced Architectural features of the State of the art Microprocessors. New Delhi. 1990 4) INMOS Ltd. Pentium super space. 73 .III CS-422 ADVANCED MOCROPROCESSOR (ELECTIVE III) External Marks: 60 Internal Marks: 40 Total Marks: 100 L T 3 1 P - PREREQUISITIES: Computer Architecture and Microprocessors and Interfaces OBJECTIVES: Having undergone a first course on Microprocessors and Interfaces. Case Studies [25 % ] 403 GA Development Systems and support [25 %] Selected Applications [15 % ] TEXT BOOKS 1) J. Rafiquzzaman. Microprocessors & Micro Computers . Rafiquzzaman. Selected reprints on microprocessors and microcomputers. 1988 5) INMOS Ltd. Microprocessors & Micro Computers Development systems. IEEE Computer Society Press. Transputer Development System. Universal Book Stall. Transputer Architectures and Case Studies : High Performance Embedded Micro controllers.
Macmillan Publishing Company. Inc. 1990 6) The Power PC Architecture : A Specification for a New family of RISC Processors.Development Tools For Power PC Microprocessor (Nov. Hardware & Design Applications. Survey of Advanced Micro Processors. Advanced Microprocessors. Ed Silha. Veronis. California. 5) Daniel Tabak. Microcontrollers : Architetcure. Software. McGraw Hill Inc. Subbarao. 2) Data Books by Intel. Rick Simpson. San Francisco. 1991 MCGraw Hill Inc. Edited by Cathy May. etc. 1993) 10) Power PC 601 RISC Microprocessor User's Manual . 1992. 3) Daniel Tabak. 1991 REFERENCES: 1) Kenneth Hintz. Implementation & Programming McGraw Hill Inc. Hank Warren. Johan Wiley & Sons. Daniel Tabak. 2nd Edition (May 1994) 7) Chales M. McGraw Hill International Editions. 1995. RISC Systems. 2nd Edition. 16/32 bit Microprocessors 68000/68010/68020.. Motorola. Van Nostrand Reinhold. Morgan Kaufmann Publishers.PTU/BOS/CS/101/08-05-2004/BATCH 2003 6) Wunnava V. 4) Andrew M. Microprocessors Principles and Applications. Gilmore.1993 74 . 1995 8) Power PC 403GA Embedded Controller User's Manual 9) Power PC Tools . 1992.
Symbolic Logic and Logic Programming.III CS-424 EXPERT SYSTEMS External Marks: 60 Internal Marks: 40 Total Marks: 100 L T 3 1 P - PREREQUISITIES : Data Structure and Programming. Planning and Explanation in Expert System: Neural Expert System. Expert System Shell Expersys. Building Expert System. Fuzzy and connectionist systems. [30 % ] Implementation Tools : Prolog. etc. 75 . Fuzzy Expert System. 1993 2) Jackson. Design & Analysed Algorithm. Conceptualization.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective . Semantic Nets. Real Time Expert Systems. [20 % ] Learning. John-Wiley 1991. its design. Implementation methods for Knowledge extraction and representation. etc. COURSE CONTENTS : Expert Systems. components. Study of existing expert systems. Definitions types. Expert System Development Process [15 %] Knowledge Representation Techniques-Logic Frames.TIERES. [15 %] Domain Exploration Knowledge elicitation. [20 %] TEXT BOOKS 1) Patterson. PHI. Introduction to AI Expert System. As Mycin & AM. Interviewing Sensor Data Capturing. OBJECTIVES : The major objectives of this course is to provide students with a view of various models of expert systems. bathering Formlizations Methods of Knowledge Acquisition.
W. human visual system model. 1989 REFERENCES: 1) Rosenfield. Digital Image Processing. A. Academic Press N. image date formats. N. medical image processing. colour system transformations. overview of practical applications. image restoration. Picture Processing. computer processing and recognition of pictorial data.III CS-426 IMAGE PROCESSING AND PATTERN RECOGNITION (ELECTIVE III) External Marks: 60 Internal Marks: 40 Total Marks: 100 L T 3 1 P - PREREQUISITIES : SINGAL PROCESSING. [5 %] Fundamentals : Mathematical and perceptual preliminaries. image data compression and statistical pattern recognition. A. 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. 1982 76 . imaging system specification building image quality. machine vision.C. COURSE CONTENTS : Background : Introduction to electronic systems for image transmission and storage. role of computers. image feature extraction. [15 % ] Image processing Techniques : Image enhancement.. John Wiley.K. [10 % ] TEXTS BOOKS 1) Pratt. fundamentals of Digital Image Processing. [45 %] Hardware architecture for image processing: Colour image signal representation. [15 %] Techniques of colour image processing: Colour image signal representation. colour system transformations. extension of processing techniques to colour domain. [15 % ] Applications of Image processing: Picture data archival. extension of processing techniques to colour domain. Prentice Hall. K.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective . Englewood Cliffs. A and Kak. image signal representation. Y. Y. 1978 2) Jain.
Traffic light controller . .Stepper motor control .Electronic weighing machine .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.Electronic Telephone call meter / Billing system .g.Weather monitoring system .Temperature controller .Data acquisition system .Explosive detector 77 .Energy meter / billing systems .
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. · Electrical Machines · Chemical Processes · Structure Analysis 78 . · Medical Diagnosis · Trouble Shooting of Computer Systems and PCs.PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective .
Morphing .PTU/BOS/CS/101/08-05-2004/BATCH 2003 Departmental Elective . Experiments should demonstrate effect of IP algorithms and parameter variation on processed images qualitatively and quantitatively.) involving independent program development by each student.Coloring black and white Image 79 . .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.Mixing .Cloning .Color Cutting .
11. Program to find the length of a list using ‘Recursion’ and then using “recursion and Accumulators’. 15.Program to calculate average tax illustrating cut-fail combination usage. Program illustrating the use of recursion that is finding sum of first N integers.Write a program to generate fibonacci series upto the given no.Program showing use of cut in Terminating a ‘generate and test’. 10. 2. 8. 12. 6.Write a program which accepts any number and checks whether it is prime or not. 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. 4.To describe some basic predicates that are useful for manipulating lists.Program for Insertion Sort 80 . 7.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. Program to play “Tic Tac Toe” 13. 3. 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. 9. Program to find the factorial of a number using recursion and accumulators and cut. 16.Program for Bubble Sort 17. 14.