This action might not be possible to undo. Are you sure you want to continue?
COMPUTER SCIENCE & ENGINEERING (CSE) & Information Technology (IT)
Theory Code BSCM1205 BEES2211 BSCP1207 BECS2207 PCEC4201 Subject Contact Hours L-T-P Credit Code BSCM1211 PCCS4203 PCCS4204 PCCS4205 PCEC4202
Theory Subject Contact Hours L-T-P Credit
Mathematics-III Network Theory Physics of Semiconductor Devices Object Oriented Programming Analog Electronics Circuit
3-1-0 3-1-0 3-0-0 3-1-0 3-1-0
4 4 3 4 4
Discrete Mathematics System Programming Design and Analysis of Algorithm Database Engineering Digital Electronics Circuit
3-0-0 3-0-0 3-1-0 3-1-0 3-1-0
3 3 4 4 4
Engineering Economics and Costing Or Organizational Behavior HSSM3205
Organizational Behavior Or HSSM3204 Engineering Economics and Costing
Theory Credits Practical / Sessional HSSM7203 COMMUNICATION AND INTERPERSONAL SKILLS FOR CORPORATE READINESS LAB
Practical / Sessional
Digital Electronics Circuit Lab
Analog Electronics Lab
Design and Analysis of Algorithm Lab Database Engg. Lab
Object Oriented Programming Lab.
TOTAL SEMESTER CREDITS
TOTAL SEMESTER CREDITS
Residue integration method. The vibrating string. Module-II (12 hours) Complex Analysis: Analytic function. potential.13. Laplace equation in polar.III Module-I (18 hours) Partial differential equation of first order. Complex integration: Line integral in the complex plane. Eighth Edition. Text books: 1. Conformal mapping. Taylor’s series. Derivatives of analytic functions Module –III (10 hours) Power Series. Wiley India Reading Chapters: 11. Kreyszig. “ Higher Engineering Mathematics”. Cauchy type. Second order partial differential equation. Pearson Education.B. New Delhi . V. Saff. cylindrical and spherical coordinates. E. Third Edition. E.D. Monge’s method.Snider.14. Ramana. Singularities and zeros. the wave equation and its solution. the heat equation and its solution. Two dimensional wave equation and its solution.V. Cauchy’s integral formula.10).12(except 12. Laplace equation. “ Fundamental of Complex Analysis”. Cauchy-Riemann equations.” Advanced Engineering Mathematics:. New Delhi P. Homogenous and non-homogeneous partial differential equation with constant co-efficient. CENGAGE Learning. “Advanced Engineering Mathematics”. Cauchy’s integral theorem. McGraw Hill Education. 2. Laurent’s series. A. evaluation of real integrals.BSCM1205 Mathematics . 2008 Reading chapter: 18 Reference books: 1.15 2. Non-linear partial differential equation. O’Neil. Linear partial differential equation. B.
Network Theory – P K Satpathy. ABCD and h-parameters. Inverse Laplace transform. Incidence matrix. Fourier transform of some functions. y. Steady state response of network to periodic signals. 8. Smarajit Ghosh. Laplace transform of periodic functions. Millman’s theorem. P Kabisatpathy. Interrelation of two-port parameters. MODULE. Significance of Poles and Zeros. . FOURIER SERIES & ITS APPLICATION: Fourier series. Cauer-II. Kuo – Wiley Student Edition. Band Width and Q-factor for series and parallel resonant circuits. Laplace transform of some basic functions. Reference Book(s): Network Analysis – M E Van Valkenburg – Pearson Education. NETWORK SYNTHESIS: Hurwitz polynomial. Network Functions. 2. 2. 4. Problems & Solutions in Electric Circuit Analysis – Sivananda & Deepa – Jaico Book. Concepts of network synthesis. MODULE. 4. High pass. Compensation theorem. TWO PORT NETWORK FUNCTIONS & RESPONSES: z. Formulation and solution of network equilibrium equations on loop and node basis.II (13 Hrs) 3. Interconnection of two-port networks. LAPLACE TRANSFORM & ITS APPLICATION: Introduction to Laplace Transform. R-C and L-C functions in Cauer-I. Positive real functions and their properties. 6. Foster-I and Foster-II forms.III (13 Hrs) 5. 5. Cut-set matrix. Linear Circuits Analysis and Synthesis – A Ramakalyan – Oxford University Press.BEES2211 Network MODULE. Properties of Hurwitz polynomial. Realization of simple R-L. Fourier transform and convergence. Brief idea about network filters (Low pass. 7. Reciprocity theorem. Network Synthesis – M E Van Valkenburg – Pearson Education. Restriction on location of Poles and Zeros. NETWORK THEOREMS & COUPLED CIRCUITS: Substitution theorem. Network Theory. Reciprocity and Symmetry. Time domain behaviour from Pole-Zero plots. Band pass and Band elimination) and their frequency response. Fourier analysis and evaluation of coefficients. Maximum power transfer theorem. Coupled Circuits. Network Analysis and Synthesis – Franklin F. Tie-set matrix. Tellegen’s theorem. Fundamentals of Electric Circuits – Alexander & Sadiku – Tata McGraw Hill. Concept of tree. NETWORK TOPOLOGY: Graph of a network.I Theory (14 Hrs) 1. 6. Dot Convention for representing coupled circuits. PHI. Text Book: 1. Coefficient of coupling. 3. S P Ghosh and A K Chakraborty – Tata McGraw Hill. Application of Laplace transform: Circuit Analysis (Steady State and Transient). New Delhi.
Thermal generation. The k-space diagram (two and three dimensional representation). Collector current. Base width Modulation by collector current. Excess carriers in forward-biased pn junction. Ohmic contacts: tunneling barrier. Tunneling breakdown and avalanche breakdown. 2. Introduction to the quantum theory of solids: Formation of energy bands. specific contact resistance. Equilibrium distribution of electrons & holes: derivation of n and p from D(E) and f(E). 8. Module II (11 Hours) 4. Depletion layer model: Field and potential in the depletion layer. semiconductors and insulators. current continuity equation. pinch-off voltage. Carrier concentrations at extremely high and low temperatures: complete ionization. The Bipolar Transistor: Introduction. Metal-Semiconductor Junction: Schottky Diodes: Built-in potential. Minority Carrier distribution. General theory of n and p. Energy band diagrams. Fermi-Dirac distribution function for electrons and holes. Qinv in MOSFET. MOS C-V characteristics. electric field. conductors. Total current density. Comparison of the Schottky barrier diode and the pn-junction diode. relation between the energy diagram and potential. Density of states. Modes of operation. Body effect and steep retrograde doping. PN diode I-V characteristic. Donors and acceptors in the band model. Equivalent Circuit Models . Thermal equilibrium.BSCP 1207 Physics of Semiconductor Devices Module-I (10 Hours) 1. MOS Transistor: Introduction to the MOSFET. . 5. Complementary MOS (CMOS) technology. electron effective mass. Drift current and conductivity. surface depletion. Breakdown mechanism. Electrons and Holes in semiconductors: Silicon crystal structure. Energy-band diagram and Fermi-level. Surface mobilities and high-mobility FETs. Motion and Recombination of Electrons and Holes (continued): Carrier diffusion: diffusion current. 9. MOSFET Vt. Module III (12 Hours) 7. Carrier injection under forward bias-Quasi-equilibrium boundary condition. depletion-layer width. Motion and Recombination of Electrons and Holes: Carrier drift: Electron and hole mobilities. Mechanism of carrier scattering. Built-in potential. Fermi energy.Ebers -Moll Model. partial ionization and freeze-out. V-I Characteristics. JFET. Surface accumulation. Junction breakdown: peak electric field. Flat-band condition and flat-band voltage. The np product and the intrinsic carrier concentration. I-V characteristics. PN Junction: Building blocks of the pn junction theory: Energy band diagram and depletion layer of a pn junction. 3. current gain. Base current. Reverse-biased PN junction. Electron-hole recombination. Threshold condition and threshold voltage. Fermi level and carrier concentrations. Energy-band diagram. 6. Einstein relationship between diffusion coefficient and mobility. Capacitance-voltage characteristics. MOS Capacitor: The MOS structure. Charge storage. Variation of EF with doping concentration and temperature.
Dynamic polymorphism: Base class pointer. member functions. pure virtual functions. Pearson Education. operators. role of virtual base class. Getting started with C++ syntax. Ben. constructor and destructor execution. Inheritance: Class hierarchy. unions. multilevel. Stretman and Sanjay Banarjee. Limited. Static polymorphism: Function Overloading. method overriding with virtual functions. and catch. Pearson Education/Prentice Hall. Oxford University Press. applications of this pointer. Bhatt. friend functions. 5. unexpected exceptions. encapsulation. Dynamic binding. 3rd Edition. Tata McGraw Hill Publishing Company Limited. Operator function. structures. single inheritance. M. Polymorphism: Binding.N. Sze and Kwok K. New Delhi. multiple. exceptions and derived classes. resource capture and release. object slicing. 2. Tata McGraw Hill Publishing Company Limited. University Press (India) Pvt. PCCS2207 Object Oriented Programming Module I (08 hrs) Introduction to object oriented programming. Roy. Static binding. G. New Delhi. 3rd Edition. member and non member operator function. and references. 2009. Chenming Calvin Hu. exception when handling exceptions.M. Hyderabad. function exception declaration. Bhattacharya and Rajnish Sharma.. Neamen. static members. Reference Books: 1. Physics of Semiconductor Devices. Modern Semiconductor Devices for Integrated Circuits. Solid State Electronics Devices. 3. Dillip K. constructors. public. Donald A. 2.K. Ng. New Delhi. I/O operators. variables. user defined types. destructors. inline function. Solid State Electronics Devices. New Delhi. namespaces. 6th Edition. S. polymorphism. recursion. Physics of Semiconductor Devices. member data. private. operator overloading.K. flow control. . D. abstract classes. Wiley India Pvt. Ambiguity in function overloading. hybrid inheritance. data-type. New Delhi. Fundamentals of Semiconductor Devices. derived classes. 4. Exception handling: Try. default values in functions. Ltd. strings. late binding. Operator Overloading: This pointer. arrays and pointers. Module II (16 hrs) Abstraction mechanism: Classes. throw. 2nd Edition.Text Books: 1. Semiconductor Physics and Devices. Achuthan and K. functions. base initialization using derived class constructors.
McGraw-Hill Education (India) 1. Small Signal Analysis of BJTs: Small-Signal Equivalent-Circuit Model. MOS Field-Effect Transistor: Principle and Physical Operation of FETs and MOSFETs. Effect of RS and RL on CE Amplifier. V-I Characteristics of E. Kamthane. 4.Schildt. Complimentary MOS. McGraw-Hill Education (India) 2. 5. iostreams and other types. ANSI and Turbo C++ by Ashoke N. Template: template classes. Voltage Divider Bias and Design (4 Hours) MODULE – II (17 Hours) 4. P-Channel and N-Channel MOSFET. Standard Template Library: Fundamental idea about string. 3. McGraw-Hill Education (India) C++ and Object Oriented Programming – Jana. new and delete operators. Emitter Follower. object copying.Module III (16 hrs) Dynamic memory management. Object Oriented Programming with C++ by E. Analysis of . design and programming.Venugopal. PHI Learning. assignment operator. 2. Balagurusamy. iterators. virtual destructor. template functions. Namespaces: user defined namespaces. PCES4201 MODULE – I (12 Hours) 1. Oxford Mastering C++ . MOSFETS as an Amplifier and a Switch (4 Hours) Biasing of BJTs: Load lines (AC and DC).MOSFETS and D-MOSFETS. CB Amplifier with and without RE. Object Oriented Design.Wiley India C++: The Complete Reference. DC Bias with Voltage Feedback. Pearson Education Reference Books: Big C++ . 3. Object Oriented Programming with C++ . CC. Fixed Bias and Self Bias. Graphical Determination of h-parameters Small Signal Analysis of CE. Operating Points. copy constructor. Text Books: 1. role of classes. hashes. Bias Stabilization. Analog Electronics Circuit 2. namespaces provided by library. (4 Hours) Biasing of FETs and MOSFETs: Fixed Bias Configuration and Self Bias Configuration.Rajiv Sahay. Design Operation.
Basic Principle of Sinusoidal Oscillator. 2nd Edition. The Unit gain – frequency (ft). a division of Thomson Learning Inc. Practical Feedback Circuits.. 11. 3rd Edition. (6 Hours) Small Signal Analysis of FETs: Small-Signal Equivalent-Circuit Model. Non-inverting Configurations.4. Op-Amp Parameters. Ltd. Text Books: 1. (5 Hours) MODULE – III (12 hours) 7. Cathey adapted by Ajay Kumar Singh. New Delhi. and 14). Jit. Wein-Bridge.Nashelsky (Selected portions of Chapter 4. 3rd Edition. Frequency Response of CS Amplifier. Multistage Frequency Effects. Feedback and Oscillators: Feedback Concepts. . µA 741-Op-Amp . 4. Miller Effect Capacitance.. C. Effect of RSIG and RL on CS Amplifier. 8. 6. and 14). 12. Small Signal Analysis of CS. Power Dissipation and Conversion Efficiency of Power Amplifiers. 9. 10. 2.H. Milliman. J. Cascade. Tata McGraw Hill Publishing Company Ltd. C. Phase Shift and Crystal Oscillator Circuits. Neamen. CG Amplifier with and without RS. (3 Hours) 8. 8. India Edition. PWS Publishing Company. Darlington Connection and Current Mirror Circuits using BJTs. Feedback Amplifier Stability using Nyquist Plot.. Microelectronic Circuits: Analysis and Design. 6. (5 Hours) Power Amplifier: Classifications. Tata McGraw Hill Publishing Company Ltd.. Class-A and Class-B Amplifier Circuits. New Delhi. International Student Edition Sedra and Smith (Selected portion of Chapter 2. Rashid. (6 Hours) High Frequency Response of FETs and BJTs: Low and High Frequency Response of BJTs and FETs. Milliman. Jimmie J. New Delhi. Tata McGraw Hill Publishing Company Ltd. 7. Differential Amplifier. 9th/10th Edition. 13. Tata McGraw Hill Education Pvt. New Delhi Integrated Electronics: Analog and Digital Circuits and Systems. Reference Books: 1. 9. Electronic Devices and Circuits. Instrumentation amplifier.. Analysis of Source Follower and Cascaded System using FETs. (For Problem Solving) 2. 5. Square Wave Testing. J. 3. Frequency Response of CE Amplifier. Halkias. Microelectronics Circuits. Boylestad and L. Halkias. Transfer Characteristics. 5th Edition. M. New Delhi.5. 6. Electronics Circuits Analysis and Design. S. Slew rate. Four Basic Feedback Topologies. Differentiator and Integrator. CD. Pearson Education. New Delhi. Electronic Devices and Circuits theory. Oxford University Press. (4 Hours) Operational Amplifier: Ideal Op-Amp. Effect of Finite Open-loop and Closed-loop Gain. R. 5. Milliman’s Electronics Devices and Circuits.L. Donald A. 3.
functions of Reserve Bank of India. Sasmita Mishra. PHI 4.D. Demand function. Reference Books : 1. “ Engineering Economics”. General concepts on micro & macro economics. Break-even analysis-Linear approach. Cash flow diagram. Causes of depreciation. Mithani. Annual worth method. internal rate of return method. Future worth method. (Simple numerical problems to be solved) Banking: Meaning and functions of commercial banks. Elements of costs. Sullivan and Wicks. “ Engineering Economy”. TMH 5. Text Books: 1. Gupta. Costbenefit analysis in public projects. Module-III: (12 hours) Cost concepts. Theory of production. Module-II: (12 hours) Time value of money – Simple and compound interest. M. Law of supply and elasticity of supply. Law of demand and its exceptions. Law of returns to scale. R. Riggs. Principle of economic equivalence.HSSM3204 Engineering Module-I: Economics & Costing (12 hours) Engineering Economics – Nature and scope. Preparation of cost sheet. TMH . 2. Evaluation of engineering projects – Present worth method. PHI 2. “ Cost Accounting”. Law of variable proportion. Depreciation policy. Overview of Indian Financial system. Segregation of costs into fixed and variable costs. “Engineering Economics”. Determination of equilibrium price under perfect competition (Simple numerical problems to be solved). Lal and Srivastav. The Theory of demand. Principles of Economics. “ Managerial Economics”.Paneer Seelvan. Depreciation of capital assets. Elasticity of demand. “Engineering Economics & Costing “. McGraw Hill Education India. Straight line method and declining balance method. Pearson 3. Bedworth and Randhwa.
5. Pradip N. New Delhi. Performance Appraisal. Robbins. International Organisational Behaviour – Trends in International Business.K. Module-III : Organization : Organizational Culture – Meaning and Definition.Samantaray. Leadership-Leadership & Management. Steven L McShane. Foundations of Individual Behaviour : Personality – Meaning and Defination. Uma Sekaran. Importance of Perception in OB. Oxford University Press 6. Effective Team Building. Groups in Organizations – Nature. 4. Culture and Organizational Effectiveness.Aswathappa. Determinants of Personality. Individual and Interpersonal Behaviour in Global Perspective. 2. Motivation – Nature and Importance. How Learning occurs. Organizational Behaviour. Confict-Nature of Conflict and Conflict Resolution.Srivastava & A. An Introduction to Transactional Analysis (TA). Gateways and Barriers to Communication. Keith Davis. TATA McGraw-Hill. Organisational Behaviour. Leader Behaviour theory. Herzberg’s Two Factor Theory. “Organizational Behaviour”. Communication as a tool for improving Interpersonal Effectiveness. Group Cohesiveness and Group Decision-making Managerial Implications. “Organizational Behaviour”. McGraw-Hill. Reference Books : 1. Organisational Behaviour. Alderfer’s ERG Theory. TATA McGraw. “Organizational Behaviour” India Tech . Perception – Meaning and Definition.B. Personality and OB. Module II : Organizational Behaviour Process : Communication – Importance. Maslow’s Need Hierarchy Theory. Organisational Behaviour. Planned Change and OB techniques. Leadership and Followership. K. Prentice Hall of India 2.HSSM 3205 Organizational Behaviour Module I : The study of Organizational Behaviour : Defination and Meaning. New Delhi. Why do people join groups. 3.L. Introduction to Human Resource Management-Selection. Himalaya Publishing House. Contingency Theory.K. Bhattachayya. Training and Development. Perceptual Process. Types. Radha R Sharma” Organizational Behaviour” . McGraw-Hill. How to be an effective Leader. Orientation. Khandelwal. Cultural Differences and Similarities. Evaluations.Hill. Stephen P. D. Theories of Leadership-Trait theory. K. Types. Incentives Organizational Change – Importance of Change. Personality Traits. Why Study OB Learning – Nature of Learning. Text Books : 1. Learning and OB. Mary Ann Von Glinow.
Reporting problems / difficulties / deficiencies iii. Practice activities for all four skills can be designed around these or similar situations. Participating in group discussion (as part of the recruitment process) In-house communication Superior/ Senior Î subordinate / junior (individual Î individual / group) Welcoming new entrants to the organization. 30 hours Lab This course will focus on communication in professional (work-related) situations of the kind that BPUT graduates may expect to encounter on entering the professional domain. Responding to the above ii. Some typical forms of work-related communication. ii. Gaining entry into an organization i. are listed below. Instructing/ directing subordinates/ juniors iv. Briefing subordinates / juniors : explaining duties and responsibilities etc. Motivating subordinates / juniors (‘pep talk’) iii. oral or written. praising / rewarding a subordinate or junior v. . asking for an explanation etc. i. Expressing / recording appreciation. introducing the workplace culture etc ii. Preparing job-applications and CVs ii. b. Facing an interview iii. Reprimanding / correcting / disciplining a subordinate/junior (for a lapse) .Offering suggestions 2 a. 1.HSSM7203 Communication & Interpersonal skills for Corporate Readiness Lab. Subordinate / Junior Î Superior / Senior i.
PCES7201 List of Experiments Analog Electronics Lab (At least 10 out of 13 experiments should be done) 1. assemble and test of BJT common-emitter circuit – D. OP-Amp Frequency Response and Compensation. 9. 6. assemble and test of BJT emitter-follower – D. 5. Frequency response of a common-emitter amplifier: low frequency. 4. Differential amplifiers circuits: D. 3. R.C. Application of Op-Amp as differentiator. Design. square wave generator. integrator. Design.C performance: Voltage gain.C and A.C phase shift oscillator/Wien-Bridge Oscillator using OP-Amp/Crystal Oscillator. JEET/MOSFET bias circuits – Design. Square wave testing of an amplifier. input impedance and output impedance. Study of Darlington connection and current mirror circuits. voltage gain. input impedance and output impedance.C and A.C and A. input impedance and output impedance with bypassed and un-bypassed emitter resistor. assemble and test. 11. assemble and test. .C operation without and with current source. 10. 12. high frequency and mid frequency response. BJT bias circuit – Design.C performance: A.C bias and A. 13. assemble and Test of JFET/MOSFET common-source and common-drain amplifiers – D.C performance: Voltage gain. Class A and Class B Power Amplifier. 8. Design. 7. 2.
Programs on dynamic polymorphism. Oriented Programming Lab Programs on concept of classes and objects.(1 class) 2. Programs on dynamic memory management using new.(1 class) Programs on copy constructor and usage of assignment operator.PCCS7209 Object 1.(1 class) (i) Operator overloading using member operator functions. Programs using static polymorphism. 9. 6.(1 class) Programs on exception handling .(1 class) (i) Function overloading (ii) Ambiguities while dealing with function overloading 4. 7. delete operators.(1 class) (i) Single inheritance (ii) Multiple inheritance (iii) Multi level inheritance (iv) Use of virtual base classes 3. (ii) Operator overloading using non member operator functions. (iii) Advantages of using non member operator functions.(1 class) Programs on file handling. Programs on operator overloading. Programs using inheritance.(1 class) .(1 class) (i) Use of virtual functions (ii) Use of abstract base classes 5.(1 class) Programs on generic programming using template function and template class. 8.
Second Edition. Rosen. Elsevier Publication (India). Generating functions.L. Inclusion and exclusion. Third Edition. Boolean Functions and Boolean Expressions. Busby. Tree Traversal. J. 2(2. Shortest path problems. Module-II (13 hours) Introduction to graph theory. Graph coloring. Connectivity. Group codes. 4. Module-III (13 hours) Semi groups. Groups. Predicates and Quantifiers. 2008. Boolean Lattices and Boolean Algrebra. Grimaldi. Introduction to trees. 6. J. Kenneth H. . 6(6. Relation and their properties. Planar graph. Reference Books: 1. 11(11. Second Edition.1. Normal subgroups. 6. Bekar.2.4-6. W. Closure of relations. Eric Gossett.10). Tata McGraw Hill Education . 4. Program Correction Recurrence relation.1.7) 2. Integral Domain and Fields. Euler and Hamiltonian paths. Mohaptra. H. Proof methods and Strategies. Equivalence relations. Text Books: 1. Application of Inclusion and Exclusion Principle. Subgrorups. PHI Publication. L. New Delhi. New Delhi. Sequences and Summations. 6.L. Permuation groups. Mathematical Induction. Cosets.4). Thomas Koshy. Rules of Inference. “Discrete Mathematics”. Tata McGraw Hill Education. “ Discrete Mathematics and Applications:. Graph terminology. 8. Solution to recurrence relation. Wiley India Pvt Ltd 5. Distributive and Complemented Lattices. Fifth Edition. 3. Gersting. “Elements of Discrete Mathematics”. Propositional Equivalence. Lagrange theorem. Discrete Mathematics for Computer Scientists and Mathematicians. 2005. Minimum Spanning tree.4th Semester BSCM1211 Discrete Mathematics Module. Application of trees. Rings. Ross. Recursive definition and structural induction. Chapters: 1. A. 2008. Pearon Education. ”Discrete and Combinatorial Mathematics”. New Delhi. Nested Quantifiers. Sixth Edition. Representation of graphs. ‘ Discrete Mathematics with Proof. isomorphism. Lattices.1 – 11. Freeman and Macmillan (India). Monoids. Partial orderings. Liu and D. Ralph P. Homomorphisms. Isomorphism. Kolman. Algebraic systems. 7.6). 9 C. Fifth Edition.Candell & I. Mott. “Discrete Mathematics and its Applications”.I (14 Hours) Propositional logic. PHI. 2. New Delhi Chapters: 10 (10.10. “ Mathematical Structure for Computer Science: A modern treatment to Discrete Mathematics’ Sixth Edition.
Syntax Phase. Accessing Flexibility. Compiler. Bootstrap Loader. Canonic Systems. Storage Allocation and Scope Name. Design of an Absolute Loader. Formal Systems: Uses of Formal Systems. Interpretation Phase. Formal Systems). Macros Language and Macro Processor: Macro Instructions. Machine Structure: General Machine Structure. Code Generation. Direct Linking loader.PCCS4202 System Programming Module I (10 Hrs) Introduction: System Software. Formal Specification. Evolution of Operating Systems. Functions of Operating System. Phases of a compiler(Lexical Phase.( McGraw-Hill Education) Operating System and System Programming – Dhamdhere ( McGraw-Hill Education) System Programming with C and Unix. Data Types and Data Structures. Memory Registers. Storage Allocation. Application Software. Assembly. passes of a compiler). Module III (12 Hrs) Programming Languages: Importance of High Level Languages. Data. Macros. Features of a Macro Facility.Hoover (Pearson Education) Leland Beck . Loaders: Loader Schemes. Evolution of components of a programming system (Assembler. Intermediate Form. Instructions. Machine Structure. Features. Extensibility and Compile time Macros. Data Structure Text Book: Systems Programming by John J Donovan (McGraw-Hill Education) Reference Book: (1) System Software: An Introduction to systems programming by (Pearson) (2) (3) (4) System Software : Nityashri. Address Modification. BackusNaur Form. Looping Introduction to Assembly Language Program Module II (10 Hrs) Assemblers: Design Procedure. Implementation. Table Processing. Canonic Systems vs Formal Systems Compilers: Introduction to Compilers. Optimization. Machine Language: Long Way.. special features. Loader. Design of Assembler. Code Generation. Formal Grammars. Approach to a new machine. No looping. Asynchronous Operations. Functional Modularity.
3). Huffman codes).24. standard notations and common functions).3).selection Problem.source shortest paths (Bellman-ford and Dijkstra's algorithms). 3rd edition-by Sara Baase. Elements of Greedy strategy. 16 (16.(Assembly-line scheduling.1. Linked list representation.2002.I (12 Hours) Introduction to design and analysis of algorithms. solution of recurrences by substitution.1). 23. Module – III (12 Hours) Graph Algorithms: Breadth first and depth-first search.1) 15 (15.L.32 (32. Disjoint set forests. The heapsort algorithm.Disjoint set operations.Completeness and reducibility.3). Allen Van Gelder.2. R. Leiserson. Branch and Bound. worst case analysis of Merge sort. Longest common subsequence) multiplication.4). Back tracking. Algorithm Design – Goodrich. Universities Press. 35(35. 22(22. Umesh Vazirani – McGraw-Hill Education 5. Heapsort : Heaps.4. 35.1.2. (7. Text Book: T. Rivest. NP . Chapters: 1. Building a heap. 21 (21.1.21. Achivity. Design & Analysis of Divide and conquer algorithms.4).1.2) 34. 32. Fractional knapsac problem. PHI. Quick sort and Binary search. Growth of Functions (Asymptotic notations. Module – II Dynamic programming algorithms (Matrix-chain programming. Priority Queue. 4. Tamassia.2. 16. Fast Fourier Transform. 24(24.1. Cormen.H. NPComplete problems (without Proofs).1 to 15. Approximation algorithms (Vertex-Cover Problem. . string matching (Rabin-Karp algorithm).2). Allpairs shortest paths (Floyd – Warshall Algorithm).2. 25 (25. Lower bounds for sorting. Minimum Spanning Trees. Fundamentals of Algorithm-by Horowitz & Sahani. Recurrences. Algorithms – Berman. 7. Data structure for disjoint sets:.3). 8 (8.4 (excluding 4. C. 30.3. 16. single.21.2) Reference Books: 1. (16 Hours) Elements of dynamic Greedy Algorithms .24. C. Pearson Education 3. Algorithms By Sanjay Dasgupta. Kruskal and Prim's algorithms. Computer Algorithms: Introduction to Design & Analysis. Cengage Learning 2. Wiley India.22. 2nd Edition.PCCS4203 Design and Analysis of Algorithm Module. 6. Traveling Salesman Problem). recursion tree and Master methods.E. NP .2. Polynomial time verification.Completeness (Polynomial time.Stein : Introduction to algorithms -2nd edition.
Database Design :-Database development life cycle(DDLC). B+ Tree Index Files. Storage Strategies: Detailed Storage Architecture.and BCNF.K. File & Record Organization. Tuple & Domain Relational Calculus. locking and Timestamp methods for concurrency control. Structure. Database System. New Delhi (5) Fundamentals of Database Management System – Gillenson. Galgotia Publications (2) Database System: concept. Sub Schemas & Instances. Data models. Components & functions of DBMS. 2005. Fundamentals of Database System By Elmasari &Navathe.Pearson Education References Books: (1) An introduction to Database System – Bipin Desai. 2NF. Magnetic Tape. Dependency Preservation & lossless Design. Data Abstraction. Teorey. Elsevier India Publications. File Organizations & Indexes. Data Independence. Mappings. 4th Edition. 4NF & 5NF.Singh (Pearson Education) (3) Database management system by leon &leon (Vikas publishing House). and Tom Nadeau. Query optimization. Parallel & Distributed Database. types of Database systems. Normalization. Database System Concepts by Sudarshan. Functional dependency and Decomposition. Lightstone. RAID. Network and Object Oriented Data models. Query processing and optimization: Evaluation of Relational Algebra Expressions. Multi-valued Dependencies. Other Disks. Relational Query Languages: SQL and QBE. Basic concepts &Definitions. Database Language. Storage Access. Mapping E-R model to Relational. Introduction to Data warehousing & Data Mining Text Books: 1. Sam S.PCCS4204 Database Engineering Module1: (12 Hrs) Introduction to database Systems. Storing Data. Magnetic Disk. Order Indices.3NF. Database Recovery System: Types of Data Base failure & Types of Database Recovery. “”. Design & Application by S. Database System Architecture-Schemas. (4) Database Modeling and Design: Logical Design by Toby J. Module3: (12 Hrs) Transaction processing and concurrency control: Transaction concepts.Automated design tools. Recovery techniques Advanced topics: Object-Oriented & Object – Relational Database. Normal forms:1NF. Wiley India . 3-level database architecture. Fileoriented system vs. Data Dictionary. Korth (McGraw-Hill Education) 2. concurrency control. DBA. Hashing Module2: (16 Hrs) Relational Algebra.
Principles and Integrated Circuit. Lithography and Patterning. Concepts in VHDL: Basic Concepts. Registers. Pearson Education.PCEC4202 MODULE – I Digital Electronics Circuit (11 Hours) (2 Hours) 1. Moris M. 3rd Edition. Master-Slave 9.L. MODULE – III (5 Hours) (16 hours) 7.. A First Course in Digital System Design: An Integrated Approach. (4 Hours) 3. Basic Circuit Layout. C-MOS Logic Connection. MOSFET Design Rules. Structural and Combinational Modelling. T. Useful Boolean Identities. Subtraction and Multiplication. Binary Counters. 3. Libraries. 4. Wiley India Edition. and Hierarchical Design. C-MOS Electronics. Binary. Pearson Education. C-MOS Memories. 6th Edition. Logic Components: Concept of Digital Components. Algebraic Reduction. Latches. Floor Plans and Interconnect Wiring. NAND and NOR Logic Implementations. MODULE – II (5 Hours) (15 Hours) 4. (5 Hours) Text Books: 1. Three and Four variable K-maps. MOSFET Arrays and AOI Gates. Multiplexers and De-multiplexers. Dueck. . Jain. New Delhi. New Delhi. MOSFETS. A general 4-input Logic Gate. The NOT Function in C-MOS: Complimentary Pairs and the C-MOS Invertors. Digital Design. Algebraic Laws. CMOS Logic Circuits: Voltages as Logic Variables. Hexadecimal and Decimal Number System and their Conversion. NOR and NAND Gates. Importance of state machine. Ronald J. Binary Words. Floyd and R. 2. 3. Line Decoder. Robert K. Anil K. (6 Hours) (5 Hours) 8. Jain. (4 Hours) 5. Analysis of Sequential Networks: Single State and Multivariable Networks. India Edition. Binary Adders. Clock and Synchronization. Using a Hardware Description Language. (6 Hours) 6. Logic Formation Using MOSFETS: the NAND and NOR Gate.P. Digital Electronics. Memory Elements and Arrays: General Properties. RAM and ROMs. Logic Cascades. Learning VHDL. Sequential Network: Concepts of Sequential Networks. Defining Module in VHDL. Reference Books: 1. Extension to other Logic Gate. Moss. Fan-In and Fan-out. Propagation Delay. and Edge-triggered Flip-flops. Complex Logic Gates in C-MOS: 3-input Logic Gates. 2. Octal. Boolean Algebra and Logic Gates: Basic Logic Operation and Identities. a division of Thomson Learning Inc. Mano. Widemer and Gregory L. Data Representation. Number System: Introduction to Binary Numbers. EX-OR Equivalence Operations. Complete Logic Sets. Pearson Education. Signed Binary and Floating Point Number Representation. Sequential Network Design. K-Maps: Two. Libraries. 5th Edition. 10th Edition. Leach. Uyemura. Neal S. Arithmetic Operation using 1’s and 2`s Compliments. Digital Design. CENGAGE Learning. Extracting Canonical Forms. Introduction to VLSI: Introduction. Donald P. John P. Cells. Digital Systems – Principles and Applications. Tata McGraw Hill Publishing Company Ltd. Digital Principles and Applications. 2. Combinational Logic Design: Specifying the Problem. An Equality Detector. Albert Paul Malvino and Goutam Saha. Tocci. Logic Array. PWS Publishing Company. Canonical Logic Forms. Digital Fundamentals. Logic Delay Times: Output Switching Times.
8. Verilog/VHDL simulation and implementation of Experiments listed at Sl. Experiment No. 9. 4. 3. Memory Unit: Investigate the behaviour of RAM unit and its storage capacity – 16 X 4 RAM: testing. 5. code converters. NOR. gray code to binary and 7 segment display. D & J-K flip-flops.) 1. 3 to 12. 6. Shift Registers: Design and investigate the operation of all types of shift registers with parallel load. simulating and memory expansion. EX-NOR. assemble and test: adders and subtractors. Clock-pulse generator: design. Digital Logic Gates: Investigate logic behavior of AND. NAND. Binary Multiplier: design and implement a circuit that multiplies 4-bit unsigned numbers to produce a 8-bit product. Combinational Circuits: design.decimal counter. Invert and Buffer gates. 1 and 2 are compulsory and out of the balance 8 experiments atleast 3 experiments has to be implemented through both Verilog/VHDL and hardware implementation as per choice of the student totaling to 6 and the rest 2 can be either through Verilog/VHDL or hardware implementation. 2.PCEC7202 List of Experiments: Digital Electronics Circuit Lab (Atleast 10 experiments should be done. . OR. 10. 13. Gate-level minimization: Two level and multi level implementation of Boolean functions. 11. 12. assemble and test various ripple and synchronous counters . Parallel adder and accumulator: design. Design with multiplexers and de-multiplexers. 7. use of Universal NAND Gate. implement and test a given design example with (i) NAND Gates only (ii) NOR Gates only and (iii) using minimum number of Gates. Binary counter with parallel load. EX-OR. test and investigate operation of SR. Counters: Design. No. implement and test. implement and test. Flip-Flop: assemble. Design.
deletion. 2. (1 class) 10. deletion. 9. 4. 5. 10. 4. (1 class) Concurrency control problem using lock operations. (1 class) Programs on JDBC. Using dynamic programming implement LCS.(1 class) Implement insertion. 2. Implement Strassen’s matrix multiplication algorithm. convert an infix string to postfix string. (1 class) (a) Implement binary search and linear search in a program (b) Implement a heap sort using a max heap. updation using SQL. and Analysis of Algorithms Lab Using a stack of characters. Programs on embedded SQL using C / C++ as host language. Database Engg. 8. 3. (1 class) Programs on ODBC using either VB or VC++. (a) Implement DFS/ BFS for a connected graph. join. Write down a program to find out a solution for 0 / 1 Knapsack problem. (b) Write a program on merge sort algorithm. 9. searching of a BST. 7. (1 class) . (a) Find out the solution to the N-Queen problem. 5. (a) Write a program on Quick sort algorithm. (1 class) Programs on packages. (b) Implement Dijkstra’s shortest path algorithm using BFS. Lab Use of SQL syntax: insertion. (b) Implement back tracking using game trees. 7. 6. (1 class) Programs on data recovery using check point technique. 3. 8. (1 class) Programs on procedures and functions. (1 class) Programs on database triggers. PCCS7204 1. (a) Write a program to implement Huffman’s algorithm. (1 class) Programs on join statements and SQL queries including where clause. Take different input instances for both the algorithm and show the running time.PCCS7203 Design 1. (b) Implement MST using Kruskal/Prim algorithm. 6.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.