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