You are on page 1of 19

Year I Semester II

For

Bachelor of Information Technology (BIT)
Baisakh 2069

S.N. 1 2 3 4 5 6

Course Code BIT102SH BIT130EC BIT173CO BIT191MS BIT176CO BIT179CO

Course Description Mathematics-II Electronics Circuit Digital Logic Financial Management Accounting & Devices &

Credit s 3 3 3 3 3 2

Lecture (Hrs) 3 3 3 3 3 15

Tutorial (Hrs) 2 1 1 1 1 6

Practical (Hrs) 2 2 1 2 4 11

Total (Hrs) 5 6 6 5 6 4 32

Object Oriented Programming in C++ Project-II

Total

17

6 Properties of inverse transform 6 Hrs . 2. 4.1 Homogeneous equations of second order 2. 7. Differential Equations of the first order 1.3 Vibrations of a particle (SHM) 3.2 Laplace transform of some elementary functions 3. 5. Laplace Transform 3. 3.4 Transforms of derivatives 3.1 Definition 3. Variable separable Exact Differential equations Homogeneous equations Linear Differential Equation Simultaneous differential equations Equations of higher degree Some applications 5 hrs 8 hrs 2.Mathematics II BIT102SH Year: I Teaching Schedule Hour/ Week Theory 3 Tutorial 2 Practica l Internal Assessment Theor y 20 Practical* Final Theory ** 80 Practic al Total 100 Examination Scheme Semester: II Course Contents: 1. Linear Differential Equations 2.5 Definition of inverse laplace transforms 3.3 Properties of laplace transforms 3. 6.2 Methods of determining particular integrals and application 2.

1 Basic definitions 6.2 Laurent’s Series 7. Residues and poles 7.2 Functions of a complex variable 6. Equations 4.D.2 Odd and Even functions 4. trigonometric and hyperbolic function 7.2 Formation of P.3 Zeros.6 Harmonic Functions 6.5 The Fourier Integral and Fourier Transforms 5. .1 Basic concepts 5. Equations (simple cases) 5. continuity & differentiation 6.4 The wave equation.4 Change of scale 4. Singularities and poles 7. Partial Differential Equations 5.4 Residues 3 hrs 6hrs 8 hrs 9 hrs. Equations 5.3 Solution of a P.3 Limits.5 Analytic Functions 6.7 Use of Partial fractions 3. Poisson’s equation.3 Half range series 4.D.3. Fourier Series and integrals 4. Own dimensional heat flow & Laplace equation 6.8 Use of laplace transforms in solving ordinary diff.7 Complex exponential.1 Taylor’s Theorem 7.1 Definitions and derivations 4.4 Cauchy Riemann Equations 6. Complex Series. Functions of a Complex Variable 6.

Fraleigh. Addison Wesley pub. Calculus with Analytic Geometry. Spiegel. 2.J. Mathematical Methods.:.. A. D.S.. I. Goldstain. Engineering Mathematics Vol II. scham publishing co 6. Theory and problems of advanced calculus.S. J.Recommended Books: 1.R. R.L. D. . Potter & Goldberg. Srivastava. Co. Vol I. Engineering Mathematics. (1980) 7. J. Sastry. M.S. Prentice –Hall Inc (91977) 5. Prentice Hall of India.C. Prentice Hall of India. Tata. Vol II. Bajpai. Calculus and its Applications.B. John wiley & sons (1973) 4. Calus.M and fairley.A. Lay. McGraw hill publishing co. Mathematics for Engineering & scientists.C. and schinder. Inc (1980) 3.I. I.

Course Contents: 1.Variable Map Product of Sums. Number Systems hrs Introduction Comparison between analog and Digital System Number conversion Octal and hexadecimal numbers 2.Variable Maps Four. Boolean Algebra and Logic Gates 6 hrs Introduction to Boolean Algebra Basic Theory and Properties of Boolean Algebra Boolean Functions Logical Operations Logic Function and Gates IC Digital Logic Families 3. Combinational Logic 8 hrs 5 .Digital Logic BIT173CO Year: I Teaching Schedule Hour/ Week Theory 3 Tutorial 1 Practica l 2 Internal Assessment Theor y 20 Practical* 50 Final Theory ** 80 Practic al Total 150 Examination Scheme Semester: II Course Objective: To provide the concepts used in the design and analysis of digital systems and introduces the principles of digital computer organization and design. Simplification of Boolean Functions 6 hrs K-Map Two and Three. Sum of Product Simplification NAND and NOR Implementation The Tabulation Method 4.

4. 1990 . Fletcher. “Logic and Computer Design Fundamentals”. L. Combinational Logic with MSI and LSI 8 hrs Binary Parallel Adder Decimal Adder Magnitude Comparator Decoders Multiplexers Read Only Memory Programmable Logic Array (PLA) 6. Floyd T. Mano. William I. Pearson Education. 7. 6. Digital Fundamentals. Prentice Hall of India. Counters 6 hrs Registers Shift Registers Ripple Counters Synchronous Counters Timing Sequences Laboratory: 1. 8.Flops Design Procedure Design with state Equations and State Reduction Table 7. Sequential Logic 6 hrs Flip-Flops Triggering of Flip. Eighth Edition 2.Design Procedure Adders Substractors Code Conversion Analysis Procedure Multilevel NAND Circuits Multilevel NOR Circuits 5. New Delhi. P. 9. 2. “ An Engineering Approach to Digital Design”.. 3. Familiarization with Logic Gates Encodes and Decodes Multiplexer and De-Multiplexer Design of simple combination Circuits Design of Adder/ Subtractor Design of Flip Flop Clock driven sequential circuits Conversion of parallel data into serial format Generation of timing signal for sequential system Reference Books: 1. and Jain R. 5. Registers. 3.

G Jackson. 1995 5. “ Analysis and design of Digital Integrtaed Circuits”.A. Mc Graw.4. Brown. Hodges and H. 1983. .Hill. A.P Malvino. “Digital Computer Electronics”. New York. Jerald A . D.

input and output resistances calculation of two port network.Electronic Devices and Circuits BIT130EC Year: I Teaching Schedule Hour/ Week Theory 3 Tutorial 1 Practica l 2 Internal Assessment Theor y 20 Practical* 50 Final Theory ** 80 Practic al Total 150 Examination Scheme Semester: II Course Objectives: The main objectives of this course are to understand working principles and basics of semiconductor devices.charge or transition region capacitance and its effects Diffusion capacitance Diode switching times Recovery time Storage and transition time . Course Contents: 1. Two port network 5 hrs Two port circuit and circuit parameters Forward and Reverse transfer function Voltage and current controlled sources Gain (current and voltage gains). 2. the method for analysis of semiconductor devices and introduction to IC and operational amplifier. Semiconductor Diode 12 hrs Semiconductor materials P-n junction Theory of p-n junction Band structure of p-n junction The p-n junction as a diode The current components The V-I characteristics Diode resistances The effects of temperature in V-I characteristics Space.

Feedback and oscillator Circuits Feedback concepts.Zener diode Construction and energy band Zener and Avalanche breakdowns The V-I characteristics 3. CE. Bi-polar Junction Transistor (BJT) Construction of a BJT The Ebers-Moll equations Current components Analytical expression for transistor characteristics The cutting voltage BJT switching time The delay time Rise and fall time Storage time Maximum voltage rating Avalanche effect Reach. and CC configurations α’s. Practical feedback circuits Feedback amplifier. The metal Oxide Semiconductors FET Construction and types Load line and biasing V-I characteristics 7. BJT biasing and thermal stabilization Types of biasing Bias stability Bias compensation Thermal runway and stability 5. The Junction Field Effect Transistor (JFET) Construction and types The pinch-off voltage and its importance Biasing and load line V-I characteristics Configuration of JFET 6.Through The transistor as an amplifier CB.phase and frequency consideration Oscillator principle Wein-bridge oscillator Crystal oscillator circuits 2hrs 10 hrs 5 hrs 3 hrs 5 hrs . β’s and their relationships Input and output characteristics 4.

Fourth edition. Operational Amplifier Introduction Properties of OPAMP Applications of OPAMP Laboratory: 3hrs 1. . R. Measurement of Input and Output characteristics of nMOS 6. Milliman & Halkais.8. A. Familiarization with equipment 2. Bogart. Measurement of characteristics of Diode. Measurement of Input and Output characteristics of JFET 5. “Electronics Devices and Circuit Theory”. Theoderre S. Nashelsky. “Electronic Device and Circuits”. and CC configurations 4. S. Zenor diode 3. Oxford University Press 3. Sedra & K C Smith. Measurement of Input and Output characteristics of CMOS Reference Books: 1. Measurement of Input and Output characteristics of CB. MCGraw Hill. “Electronic Device and Circuits” 4. “Microelectronics Circuits” 6 th Edition. Boylested and L. CE. Prentice Hall of India 2.

financing working capital. capital budgeting decision rules-payback period. 4. functions. Working capital 5 LH Concept of working capital. and to develop an understanding of the financial and accounting aspects of information technology. comparison of the NPV and IRR. financial management in new millennium. generating ideas for capital projects. receivables management inventory management. . Capital Budgeting 4 LH Importance. NPV and IRR. 2. Course contents: 1. present values and future values 3. wealth maximization.Financial Management and Accounting BIT91MS Teaching Schedule Hour/ Week Theory 3 Tutorial 1 Practica l 1 Internal Assessment Theor y 20 Practical* 50 Final Theory ** 80 Practic al Total 150 Examination Scheme Course objective: The basic objective of this course is to familiarize the students with the fundamentals of financial management and accounting so as to enable them to understand the financial decision making process and the need and use of accounting information in that process. Nature of Financial Management 3 LH Meaning and importance objectives-profit vs. Time Value of Money 3 LH Concept. projects classifications.globalization of business and information technology. cash management.

New Delhi 3. B/S. ratio analysis. Cash flow statement – Direct Method 4 LH Practicals: Emphasis should be on using accounting package (e. ledger posting. Harcourt Asia Pte. S. Brigham and Joel F. double entry system of accounting. importance. 9. Ltd. Addison Wesley Lingman (Singapore) Pvt. principles and standards. Gitman. Capital structure 4 LH Meaning of capital structure.. Chand & Co. preparation of financial statements. Singapore. stock splits. basic accounting concepts. 2001 4. Lawrence J. etc. Dividends 4 LH Dividends and retained earnings.) to prepare final accounts of any organization. 8. Houston. types. factors affecting capital structure policies. stock repurchases. business and financial risks. Financial Analysis 4 LH Meaning. factors affecting dividend policies. Fundamentals of Financial Management. Financial Statements 5 LH Meaning types. rules of double-entry-equation rule and types of account rule. 10. Introduction to Accounting. optimum capital structure.. T. Facts. Reference Books: 1.g.S. 7. Tally. optimum dividend policy.5. 6. determining optimum structure. 2. Principles of Managerial Finance. Kathmandu . Indian Edition 2001. Nature of Accounting 4 LH Meaning. Indian Reprint. Eugene F. preparation of trial balance. Basics of Financial Management Educational Enterprises. Surendra Pradhan. Accounting Process 5 LH Journalizing and subdivision of journal. 11. types of dividend policy.income statement. uses and limitations of ratio analysis. other forms of dividend-stock dividends-stock dividends. Grewal.

2.5. Polymorphism & Overloading 1.Object Oriented Programming in C++ BIT 176CO Year: I Semester: II Teaching Schedule Hours/Week Theory Tutorial Practica l Internal Assessment Theory 3 1 2 20 Course Objectives: This module aims to introduce students to the programming methodology using the C++ language. Course Contents: Practical * 50 Final Theory* * 80 Practica l Total Examination Scheme 150 1.1.4.3. Procedural Language vs OOPs Characteristics of Object-Oriented Languages 1.3. Reusability 1.2.2.2. This module should be associated with laboratory experiments to augment the concepts taught in the class. Classes 1.1. 1.2. Introduction to Object Oriented Programming LH 2 1.2.2. Objects 1. Applications of OOPS . Inheritance 1.

2. Default arguments Inline functions 4.6.2.1. 3. different kinds of arguments 3. 3.2.1.5. 2.3.9.8. 3. Introduction to programming in C++ Extraction operator (>>) Insertion operator (<<) Type Conversion: Automatic Conversion. 3. 2.4. Basic C++ Programming LH 3 2. 2.2. Cast Arrays and pointers in C++ New and Delete operators Manipulators const Enumeration 3. Introduction . 2.6.7. 3.3. Classes and Objects LH 6 4. Function in C++ LH 4 3. Introduction to Functions Passing arguments to function Returning values from function Reference arguments Returning by reference 3.8.4.5.1. 2. 2. 2.7. Functions overloading: different number of arguments.

4.9.6.1. 5.6.8. 5.6.4.2.2. Types of constructor 4. Parameterized Constructor 4. 5.4.2.1.7. Static data member Static member functions Passing objects as arguments Friend Functions & Friend Classes 5. 4. private and protected) Accessing class members Defining member function 4.6. Access Specifier (public.2. 5.5.2. 5.2.2.6.10.4. 4.4. Member function inside the class body 4. 4. 4.2. 4.6.3.5. Default Constructor 4.1. Introduction to operator overloading General rules for overloading operator Operator overloading restrictions Overloading Unary and Binary operators Operator Overloading Using a Friend Function Data Conversion . Copy Constructor 4. Overloaded constructor 4.4.3. “this” pointer Constructor & Destructor 4. Member function outside the class body 4.1. Operator Overloading LH 6 5.3.6.

Conversion between objects and basic types 5. 6.6. Late Binding Virtual Functions Pure Virtual Functions and Abstract Classes Virtual Base Classes 8. 6.1.2.3.5.5. Virtual Functions and Polymorphism LH 5 7.3.4. 7.1. 6.2.5. 6.6. 7. private and protected inheritance Ambiguity in multiple inheritance Containership 7. Introduction LH 6 . Conversion between objects of different classes 6. Introduction Benefits of Inheritance Types of Inheritance Inheritance: Base Classes & Derived Classes LH 6 Using Constructors and Destructors in Derived Classes Abstract Base Class Public. File I/O 8.1.1.9.4. 6. 7. Introduction Early vs. Conversion between basic types to object 5. 6.6.2.7.6. 6. 6.8.3. 7. Inheritance 6.

2.3. Basic function of seekg(). Reading and writing a class objects 9. 10. 10. tellg(). 11.1.1. put() and get() functions 8. 11.3. .4.3. Opening file using open() and open() file modes 8. seekp().4.4. Templates 9. 8.1.1. throw 11.1. Exception Handling LH 2 Introduction to Exceptions Exception Handling Model Exception Handling Construct: try.2. tellp() Sequential input/output operations 8. 9.2. Introduction to templates Functions templates Class templates LH 3 10.2. 9.8. Opening file using constructor 8.1.2.2.2. 11. write() and read() functions 8.1. catch.2.5. Namespaces LH 2 Using Namespace Using the scope resolution operator Through “using” keyword 10. Opening and closing file 8.1.

3/e Prentice Hall  Yashavant Kanetkar. Buddha Publication. Fago/Nawaraj Pokhrel.Reference Books:  Robert Lafore. “C++ How to Program”. Let Us C++. “Object-Oriented Programming in C++”. Galgotia Publication. BPB Publication. Object-Oriented Programming. India  E Balagurusamy “Object Oriented Programming with C++” MC GrawHill 4/e  Deitel & Deitel. 2/e . New Delhi  Uday Kr.

students will be able to develop small-scale software. Technical Description of Project System aspect of project Implementation Project task and time schedule Project team Project Supervisor . 6. 4. 3. On the completion of the project. 3. 5. 2. Information Gathering System Requirements Specifications Algorithms and Flow-Chart Coding Techniques Testing Result The Project report should contain: 1. 5.Project-II BIT179CO Year: I Teaching Schedule Hour/ Week Theory Tutorial Practica l 4 Internal Assessment Theor y Practical* 30 Final Theory ** Practic al 20 Total 50 Examination Scheme Semester: II Course Objective: To design and complete the software project by using high level language(C++ Programming). Each group has to submit the product and report at the end of semester to the supervisor. Course Contents: A total of 60 lab hours covering all features of object–oriented programming techniques will be assigned to the students (Group). 6. General Procedure: 1. 2. 4.