Data Structures and Algorithms (CSC-154)

Tribhuvan University

Institute of Science and Technology

Bachelor of Science in Computer Science and Information Technology

Course Title: Data Structures and Algorithms

Course no: CSC-154                                                                          Full Marks: 60+20+20

Credit hours: 3                                                                                    Pass Marks: 24+8+8

Nature of course: Theory (3 Hrs.) + Lab (3 Hrs.)

Course Synopsis: Study of basic data structure vocabulary, the concept of an algorithm.                        

Goal:  To provide the concept of data structure and its implementation using programming techniques.

Course Contents:

Unit 1:                                                                                                                          14 Hrs.

1.1  Introduction to Data Structures:  Information and its meaning, Array in C: The array as an ADT, Using one dimensional array, Two dimensional array, Multi dimensional array, Structure , Union, Classes in C++.

1.2  The Stack: Introduction, definition, primitive operation, the stack as an abstract data type, implementing the POP operation, testing for exceptional condition, implementing the PUSH operation.

1.3  The Infix, Postfix & Prefix: Introduction, evaluating the postfix operation, program to evaluate the postfix operation, limitation of program, converting from one to another.

1.4  Recursion: Introduction, factorial functions, multiplication of natural numbers, Fibonacci sequence, binary search, the tower of Hanoi problem, translation from prefix to postfix using recursion.

Unit 2:                                                                                                                          31 Hrs.

1.1  Queues: Introduction, the queue and its sequential representation: The queue as an abstract data type, implementation of queue, inserts operation, priority queue.           

1.2  Linked Lists: Introduction, inserting and deleting the nodes from a list, linked implementation of stack, getnode and freenode operation, linked implementation of queue, Linked list as a data structure, circular lists, stack as a circular list, queue as a circular list.

1.3  Tree: Introduction, Binary Trees: operation on Binary Trees, application of Binary Trees. Binary Tree Representation: node representation of binary tree, internal and external nodes, implicit array representation of binary tree, binary tree traversal, threaded binary tree, heterogonous binary tree. The Huffman algorithm. Representing lists as binary trees. Trees and their application.

1.4  Sorting: Introduction, O notation, efficiency of sorting, exchange sort: bubble sort, quick sort.

1.5  Selection and Tree Sorting: Introduction, straight selection sort, binary tree sort, heapsort, insertion sort, merge and radix sort. 

1.6  Searching: Introduction, sequential searching, binary search, interpolation search, tree search, general search tree, hashing.

1.7  Graphs: Introduction, linked representation of graphs.

1.8  Algorithm: Introduction, design of algorithm, algorithm validation, analysis of algorithm, algorithm testing. subalgorithm

Laboratory works:  

1. Write a code to multiply two matrixes and get the transpose of the third one.
2. Write a code to implement the stack, that should check overflow and underflow also.
3. Write a code to convert any prefix number to postfix.
4. Write a code to convert any infix number to postfix.
5. Write a code to convert any post fix number to prefix.
6. Implement tower of Hanoi.
7. Write a code to implement different sorting techniques.
8. Write a code to demonstrate the binary search.
9. Write a code to implement the queue.
10. Write a code to convert stack operation to queue operation.

Text books: 

Data Structure Using C & C++, Langsam Yedidyah, Augenstein Moshe J.,  Tennenbaum Aaron M., PHI

Reference:   

The Design and Analysis of Algorithm, Nitin Upadhyay, SK Kataria &  Sons.

Homework

Assignment: Assignment should be given from the above units in throughout the semester.

Computer usage:   No specific

Prerequisite:       C, C++

Category content:  Science Aspect:     40%

                                 Design Aspect:       60%

Microprocessor (CSC-153)

Tribhuvan University

Institute of Science and Technology

Bachelor of Science in Computer Science and Information Technology

Course Title: Microprocessor

Course no: CSC-153                                                                                   Full Marks: 60+20+20

Credit hours: 3                                                                                              Pass Marks: 24+8+8

Nature of course: Theory (3 Hrs.) + Lab (3 Hrs.)

Course Synopsis: This course contains of fundamental concepts of computer organization, basic I/O interfaces and Interrupt operations.

Goal: The course objective is to introduce the operation, programming, and application of microprocessor.

Course Contents:

Unit 1. Introduction                                                                                                     3 Hrs.

Introduction to Microprocessors, Basic organization

Unit 2. Basic Computer Architecture                                                                         10 Hrs.

SAP Architectures,  Instructions, Microprogram; 8-bit "W" bus, 4-bit program counter, 4-bit Memory Address Register (MAR), 16x8-bit memory,  8-bit instruction register (IR),  6-cycle controller with 12-bit micro-instruction word,  8-bit accumulator,  8-bit B register,  8-bit adder-subtractor, 8-bit output register,  SAP-1 Instructions,  Fetch & Execution, microprogram, fetch cycle, execution cycle, microprogram, controller implementation, SAP 2 Architecture,  architectural differences with SAP-1, bi-directional registers, instruction set, flags.

Unit 3. Instruction Cycle                                                                                             3 Hrs.

Fetch Operation and Timing Diagram, Execute Operation and Timing Diagram, Machine Cycle and States

Unit 4. Intel 8085\8086\8088                                                                                       8 Hrs.

Functional Block Diagram and Pin configuration, Timing and Control Unit, Registers, Data and Address Bus, Instructions, Operation Code and Operands, Addressing Modes, Interrupts, Flags, Instructions and Data Flow

Unit 5. Assembly Language Programming                                                                9 Hrs.

Assembly instruction format, Instruction Types,  Mnemonics, Operands, Macro assemblers, Linking, Assembler directives, Simple sequence programs, Flags, Branch, Jumps, While-Do, Repeat-Until, If-Then-Else and Multiple If-then Programs, Debugging.

Unit 6. Basic I/O, Memory R/W and Interrupt Operations                                      6 Hrs.

Memory Read, Memory Write, I/O Read, I/O Write, Direct Memory Access, Interrupt, Types, Interrupt Masking, 8259 operation.

Unit 7. Input/ Output Interfaces                                                                                 6 Hrs.

Parallel communication, Serial communication, Data transfer wait operation, 8255A working, 8255A Modes, RS-232 interface, Keyboard and display controller.

Laboratory works:

Assembly language programming using 8085\8086\8088 trainer kit. The programming should include: Arithmetic operation, base conversion, conditional branching etc. Sample Lab work list may include:

• Assembly language program using 8085 microprocessor kit.
• Program should comprise the use of all types of instructions and addressing modes.
• The programming should include the concept of Arrays and the concept of Multiplications and Division operations on Microprocessor.
• Assembly language programming, using any type of Assembler, which should include the different functions of Int 10h, and Int 21h.

References:

1. Ramesh S. Gaonkar,  Microprocessor Architecture, Programming, and Applications with 8085,  Prentice Hall
2. P. Malvino and J, A. Brown, Digital Computer Electronics, 3rd Edition,  Tata McGraw Hill
3. D. V. Hall,  Microprocessors and Interfacing - Programming and Hardware, McGraw Hill
4. 0000 to 8085 Introduction to 8085 Microprocessor for Engineers and     Scientists, A. K. Gosh, Prentice Hall

Discrete Structure (CSC-152)

Tribhuvan University
Institute of Science and Technology
Bachelor of Science in Computer Science and Information Technology

Course Title: Discrete Structure

Course no: CSC-152                                                                                     Full Marks: 80+20

Credit hours: 3                                                                                               Pass Marks: 32+8

Nature of course: Theory (3 Hrs.)

Course Synopsis:  This course contains the fundamental concepts of logic, reasoning and algorithms.

Goal:  After completing this course, the target student will gain knowledge in discrete mathematics and finite state automata in an algorithmic approach. It helps the target student in gaining fundamental and conceptual clarity in the area of Logic, Reasoning, Algorithms, Recurrence Relation, and Graph Theory.

Course Contents:

Unit 1. Logic, Induction and Reasoning                                                                     12 Hrs.

Proposition and Truth function, Propositional Logic, Expressing statements in Logic Propositional Logic, The predicate Logic, Validity, Informal Deduction in Predicate Logic, Rules of Inference and Proofs, Informal Proofs and Formal Proofs, Elementary Induction, Complete Induction, Methods of Tableaux, Consistency and Completeness of the System.

Unit 2. Finite State Automata                                                                                     10 Hrs.

Sequential Circuits and Finite state Machine, Finite State Automata, Language and Grammars, Non-deterministic Finite State Automata, Language and Automata, Regular Expression.

Unit 3. Recurrence Relations                                                                                     8 Hrs.

Recursive Definition of Sequences, Solution of Linear recurrence relations, Solution to Nonlinear Recurrence Relations, Application to Algorithm Analysis. Combinatory, Partial Order relation.

Unit 4. Graph Theory                                                                                                   15 Hrs.

Undirected and Directed Graphs, Walk Paths, Circuits, Components, Connectedness Algorithm, Shortest Path Algorithm, Bipartite Graphs, Planar Graphs, Regular Graphs, Planarity Testing Algorithms, Eulerian Graph, Hamiltonian Graph, Tree as a Directed Graph, Binary Tree, Spanning Tree, Cutsets and Cutvertices, Network Flows, Maxflow and Mincut Theorem, Data Structures Representing Trees and Graphs in Computer, Network Application of Trees and Graphs, Concept of Graph Coloring.

Text / Reference books:

1. Kenth Rosen, Discrete Mathematical Structures with Applications to Computer Science, WCB/ McGraw Hill
2. G. Birkhoff, T.C. Bartee, Modern Applied Algebra, CBS Publishers.
3. R. Johnsonbaugh, Discrete Mathematics, Prentice Hall Inc.
4. G.Chartand, B.R.Oller Mann,  Applied and Algorithmic Graph Theory, McGraw Hill
5. Joe L. Mott, Abrahan Kandel, and Theodore P. Baker, Discrete Mathematics for Computer Scientists and Mathematicians, Prentice-Hall of India

Digital Logic (CSC-151)

Tribhuvan University
Institute of Science and Technology
Bachelor of Science in Computer Science and Information Technology

 

Course Title: Digital Logic

Course no: CSC-151                                                                                    Full Marks: 60+20+20

Credit hours: 3                                                                                              Pass Marks: 24+8+8

Nature of course: Theory (3 Hrs.) + Lab (3 Hrs.)

Course Synopsis: General concepts to be used in the design and analysis of digital systems and introduces the principles of digital computer organization and design.

Goals:

Introduce fundamental digital logics and switching networks. Exposure of Boolean algebra and its application for circuit analysis.

Introduction to multilevel gates networks, flip-flops, counters and logic devices.

Course Contents:

Unit 1. Binary Systems                                                                                               7 Hrs.

Digital Systems, Binary Numbers, Number base conversion, Octal and hexadecimal numbers, Binary Systems, Integrated Circuits

Unit 2. Boolean algebra and Logic Gates                                                                  6 Hrs.

Basic definition of Boolean Algebra, Basic Theory of Boolean Algebra, Boolean Function, Logic operations, Logic Gates, IC Digital Logic Families

Unit 3. Simplification of Boolean Functions                                                               6 Hrs.

K-map, Two and three Variable Maps, Four variable Maps, Product of Sums, sum of product simplification, NAND and NOR implementation

Unit 4. Combinational Logic                                                                                       6 Hrs.

Design Procedure, Adders, Subtractors, Code Conversion, Analysis Procedure, NAND Circuits, NOR Circuits, Exclusive -OR Circuit

Unit 5. Combinational Logic with MSI and LSI                                                         6 Hrs.

Binary Parallel Adder, Decimal Adder, Magnitude Comparator, Decoders, Multiplexers, Read- Only- Memory (ROM), Programmable Logic array (PLA)

Unit 6.  Sequential Logic                                                                                             8 Hrs.

Flip-flops, Triggering of flip-flops, Design procedure, Design with state equations and state reduction table.

Unit 7. Registers and Counters                                                                                  6 Hrs.

Resisters, Shift registers, Ripple Counters, Synchronous Counters, Timing Sequences, The Memory Unit

Laboratory works:

• Familiarization  with logic gates
• Encodes and decodes
• Multiplexer and de-multiplexer
• Design of simple combination circuits
• Design of adder/subtractor
• Design f Flip-Flop
• Clock driven sequential circuits
• Conversion of parallel data into serial format
• Generation of  timing signal for sequential system

Text Book:

M. Morris Mao, "Logic & Computer Design Fundamentals", Pearson Education.

Statistics I (STA 108)

Tribhuvan University

Institute of Science and Technology

Bachelor of Science in Computer Science and Information Technology

Course Title: Statistics ICourse no: STA-108                                       Full Marks: 60+20+20

Credit hours: 3                                                                                         Pass Marks: 24+8+8

Nature of course: Theory (3 Hrs.) + Lab (3 Hrs.)

Course Synopsis: Concept of Applied Statistical Techniques and its Applications

Goal:This course makes students able to understand Applied Statistical Techniques and their applications in the allied areas.

Course Contents:

Unit 1: Sampling Techniques                                                                                      10 Hrs.

Types of Sampling; Simple Random Sampling with and without Replacement; Stratified Random Sampling; Ratio and Regression Method of Estimation under Simple and Stratified Random Sampling; Systematic Sampling; Multistage Sampling; Estimation of population total and its Variance.

Unit 2: Non Parametric Test                                                                                      16 Hrs.

Chi-square test: Test of goodness of fit; Test for independence (Categorical Data). Definition of Order Statistics; Run Test; Sign Test; Wilcoxon Matched Pairs Signed Ranks Test; Mann-Whitney U Test; Median Test; Kolmogorov Smirnov Test (One Sample Case); Cochran Q Test; Kruskl Wallis One way ANOVA Test; Friedman Two way ANOVA Test.

Unit 3: Correlation and Regression Analysis                                                            19 Hrs.

Partial and Multiple Correlations; Multiple Linear Regressions: Assumptions; Coefficient Estimation, and Significance Test; Coefficient of Determination; Cobb-Dauglas Production Function; Growth Model; Logistic Regression; Autoregressive Model of order One, and Appraisal of Linear Models (Heteroscedasticity, Multicolinearity, Autocorrelation).

Note:   

• Theory and practice should go side by side.
• It is recommended 45 hours for lectures and 15 additional hours for tutorial class for completion of the course in the semester.
• SPSS Software should be used for data analysis.
• Home works and assignments covering the lecture materials will be   given   throughout the semester.

Text Books:

1. Draper, N. and H. Smith, Applied Regression Analysis, 2nd edition, New York: John Wiley & Sons, 1981.
2. Hogg & Tanis, Probability & Statistical Inference, 6th edition, First Indian Reprint, 2002.
3. Gujaratii, D. Basic Econometrics, International edition, 1995.
4. Gibbons, J.D. Nonparametric Statistical Inference. International Student Edition.
5. Siegel, S. Nonparametric Statistics for the Behavioural Sciences. McGraw-Hill, New York.

References:              

Hollander, M. & Wolfe, Nonparametric Statistical Methods. Johns Wiley & Sons, New York.

Geology I (GEO 107)

Tribhuvan University

Institute of Science and Technology

Bachelor of Science in Computer Science and Information Technology

Course Title: Geology I

Course no: GEO-107                                                                        Full Marks: 60+20+20

Credit hours: 3                                                                                  Pass Marks: 24+8+8

Nature of course: Theory (3 Hrs.) + Lab (3 Hrs.)

Course Synopsis:  Fundamental concepts of contemporary earth and environmental science and engineering with increasing computer application.

Goal:  This course aims at providing general understanding of Earth and environmental science and engineering

Course Contents:

Unit 1.                                                                                                                          10 Hrs.

1.1 New Global Tectonic framework of the earth: Continental margins, earthquakes, volcanoes and mountain ranges.

1.2 Crystal, minerals and rocks: rock types and rock systematic

Unit 2.                                                                                                                          10 Hrs.

2.1 Mineral deposits and mineral mining: technologies, reserves, economics and environment

2.2 Engineering geology: construction and stability of structures and natural and artificial face stability

Unit 3.                                                                                                                          10 Hrs.

3.1 Climate changes and natural disasters: Landslides, Floods and Desertification.

3.2 Natural resources depletion: Hydrocarbons, metals and new sources of energy and materials.

Unit 4.                                                                                                                          10 Hrs.

4.1 Geographic Information system (GIS): Vectors and raster and remote sensing database management.

4.2 Computer aided data management: remote sensing data acquisition, storage, processing and interpretation.

4.3 GIS and RS packages: ERDAS, ER Mapper, ArcView and other operating systems and capabilities

Laboratory works: Mineral / Rock identification, Soil types, Reserve calculation, Slope stability calculation, Rock Mass Ratings, ER Mapper, ArcView, ILWIS tour, RS data analysis, Digitization, practice and Geographic locking, GIS Layers shows and illustrations, GIS assignment with digital RS data.

Practical:      

• To identify elements of symmetry of a cube.
• To identify 5 oxides and 5 sulphide minerals. 
• To calculate reserve of a ore deposit.
• To calculate cost - benefit analysis of a mining enterprise 
• To calculate the stability of natural slope
• To calculate and interpret precipitation data
• To calculate rock mass rating form data
• To perform digitization and geographic locking in computer
• GIS assignment with RS data.

Text Books: No specific text book covering all materials but a working manual could be easily prepared.

Homework: Homework assignments covering lecture materials and primary numerical exercises.

Assignments: Given throughout the semester.

Computer Usage: MS-WINDOWS (WINDOWS 98/XP) base PC of workstation

Prerequisites: Basic IT literacy

Category contents: Science Aspect: 50%

                                 Engineering Aspect: 50%

Biology I (BIO 106)

Tribhuvan University

Institute of Science and Technology

Bachelor of Science in Computer Science and Information Technology

Course Title: Biology I

Course no: BIO-106                                                                                     Full Marks: 60+20+20

Credit hours: 3                                                                                               Pass Marks: 24+8+8

Nature of course: Theory (3 Hrs.) + Lab (3 Hrs.)

Course Synopsis: Living System and their properties, major biological molecules, basic physiological processes, introduction of genetics, basic concepts of diversity and evolution.

Goal: The course is aimed at providing the introduction of biological system with respect to nature, behavior and functioning of the cell.

Course Contents:

Unit 1.                                                                                                             5 Hrs.

1.1    Introduction: Brief introduction to all aspects of Biology

1.2    Bio-molecular: Carbohydrates, Lipids, Proteins and Nucleic acid

Unit 2.                                                                                                             19 Hrs.

2.1    Cell structure and functions: Cell theory, cell membrane, transport system across the membrane, organelles composed of membranes, nonmenbranous organelles, nuclear components and major cell types

2.2    Enzymes: Nomenclature, biocatalysis, action of enzymes, environmental factors, co-enzymes, enzyme activation and inhibition.

2.3    Biochemical Pathways: Introduction, cellular respiration, glycolysis, TCA Cycle, ETC, ATP calculation, fermentation, protein and fat metabolism, photosynthesis-C3 and C4 pathways, photorespiration, chemosynthesis, transpiration.

Unit 3.                                                                                                               7 Hrs.

3.1    Genetics: Laws of inheritance, linkage and crossing over

3.2    Diversity within species: Gene pool concept, genetic variety, role of natural selection in evolution, factors influencing natural selection, Hardy-Weinberg equilibrium concept and application

Unit 4.                                                                                                                6 Hrs.

4.1    Material exchange in the body: Basic principle, blood circulation, pulmonary and systemic, nature of blood and role of heart, gas exchange, respiratory anatomy, lung function, digestive system, kidney structure and function

Unit 5.                                                                                                                8 Hrs.

5.1    Body's control mechanism: Nerve impulse, synapse, CNS organization, endocrine system, sensory input and output coordination

5.2    Immune system: Defense mechanism, humeral and cell mediated immune responses, vaccines and monoclonal antibody.

Laboratory Works:

• Identification of biomolecules: cellulose, Lignin, Lipid, Protein.
• Analysis of amino acids in protein by paper chromatography and paper electrophoresis.
• Separation of photo synthetic pigments by paper chromatography.
• Determination of value of RQ of different respiratory substrates.
• Study of different types of plant and anima cells in temporary preparation.

Text Books:

E.D. Enger & F.C. Ross, Concepts in Biology, 9th Edition, Tata McGraw Hill

Reference Book:

P.H. Reven et.al, Biology, 5th Ed. WBC McGraw Hill.

Physics I (PHY 105)

Tribhuvan University

Institute of Science and Technology

Bachelor of Science in Computer Science and Information Technology

Course Title: Physics I

Course no: PHY-105                                                                      Full Marks: 60+20+20

Credit hours: 3                                                                                Pass Marks: 24+8+8

Nature of course: Theory (3 Hrs.) + Lab (3 Hrs.)

Course Synopsis:      The course deals with related topics in Mechanics and Electrodynamics. Mechanics: Non Relativistic Particle dynamics, conservation laws, harmonic Oscillator, dynamics of rigid body, strength of materials, hydrodynamics. Electrodynamics: Electrostatics, dielectrics, Electrostatic and magnetic energy, Maxwell's equation, propagation of electromagnetic wave. Laboratory works are designed to complement and supplement the theory course.

Goal: The course aims at introducing the concepts and methods of physics needed for application in various branch of modern science and technology.

Course Content:

Mechanics

Unit 1. Newton's Law of Motion and Galilean Invariance                                4 Hrs.

1.1    Newton's laws of motion

1.2    Reference frame, Galilean transformation, Galilean Invariance

1.3    Transformation equations

1.4    Non inertial frames of reference fictious forces

•          Centrifugal and coriolis forces

Unit 2. Non Relativistic Particle Dynamics                                                       4 Hrs.

2.1    Equation of motion of uncharged and charged particles, Charged particles in constant and alternating electric field

2.2    Charged particles in a fields, magnetic field- cyclotron, magnetic focusing

2.3    Charge particles in combined electric and magnetic field

Unit 3. Conservation Laws                                                                                 7 Hrs.

3.1    Laws of conservation of momentum and energy.

3.2    Conservative forces, potential energy,

3.3    Potential energy in electric and gravitational fields.

3.4    Non conservative forces, General laws of conservation of energy.

3.5    Collision in three dimensions, lab and cm. frames of reference, final velocities after collision, scattering angle,

3.6    Law of conservation of angular momentum - rotational invariance of    potential energy

3.7    Example - motion of a planet, Kepler's laws

Unit 4. Harmonic Oscillator                                                                               6 Hrs.

4.1    Harmonic oscillator, energy, example: diatomic molecule.

4.2    An harmonic oscillator - pendulum with large oscillation

4.3    Damped oscillations, power factor, Q - factor

4.4    Driven oscillations, resonance, phase and half width

4.5    LCR and parallel resonance circuits.

Unit 5. Viscosity                                                                                                  2 Hrs.

5.1    Viscosity, Newton's law of viscous force, analogy between current flow and viscous flow

5.2    Motion of a body in a viscous medium.

Electrodynamics

Unit 6. Electrostatics                                                                                         7 Hrs.

6.1    Electric field and electric potential

6.2    Divergence of E and Gauss's law, applications

6.3    Solution of electrostatic problems, Poisson's and Lap lace's equations

6.4    Solution of Lap laces equations in spherical cylindrical coordinates and rectangular coordinates

6.5    Examples conducting sphere in a uniform E field, method of images, point charge and a conducting sphere, line charge and line images, systems of conductors.

6.6    Solution of Poisson's equation

Unit 7. Dielectrics                                                                                             4 Hrs.

7.1    Electric field in a dielectric media

• Polarization, field inside and outside a dielectric gauss's law in a dielectric medium-displacement vector, electric susceptibility and dielectric constant
• Boundary conditions on field vectors, boundary value problems in a dielectric medium, dielectric sphere in a uniform el. field.

7.2    Molecular theory of dielectrics, induced dipoles

Unit 8. Electrostatic Energy                                                                              1 Hr.

8.1    Potential energy of a group of charges and charge distributions, energy density.

8.2    energy of a system of charged conductors

Unit 9. Magnetic Field Energy                                                                         1 Hr.

9.1    Vector potential, and magnetic field

9.2    Energy density in the magnetic field, magnetic energy of coupled circuits.

Unit 10. Slowly Varying Current                                                                      3 Hrs.

10.1  Transient and steady state behavior

10.2  Series and parallel connection of impedances

10.3  Power, power factor, Resonance.

Unit 11. Maxwell's Equation                                                                            6 Hrs.

11.1  Maxwell's equations - displacement current

11.2  Electromagnetic energy

11.3  Wave equations without and with source, boundary conditions

Laboratory Works:

• To draw I-V characteristics of Ohmic and non Ohmic resisters and find voltage current ration.
• To study the junction diode and LED characteristics.
• To study the temperature dependence of resistance of a given semiconductors
• To determine the moment of inertia of a fly wheel.
• To determine the modulus of rigidity for the material of a rod by using the horizontal pattern of the twisting apparatus.
• To determine the terminal velocity and find coefficient of viscosity by Stoke's method.
• To determine the surface tension of work with a capillary tube.
• To determine the impedance of a given LCR circuit.
• To study characteristics of NPN transistor.
• To determine dielectric constant by using Lissagous pattern.
• To construct CE amplifier for the determination of the voltage gain of the amplifier.
• To study the characteristic of a Zener a diode (Switches) and use it to regulate power supply.
• To construct and study the working of NOT-AND-OR, NAND and NOR gates.
• To construct and study the working of OR, NAN and NOR gates.

Text books:   

1. D.S. Mathur, Mechanics, S. Chand and Company Ltd
2. John R. Ritz, Frederick J. Milford and Robert W. Christy, Foundations of Electromagnetic Theory, Narosa Publishing House

References:

David J Griffith, Introduction to Electrodynamics, 2nd Edition, Prentice Hall of India, 1994. 

Prerequisite: Calculus based introductory physics

Note: Home work assignments: Several numerical problems to be given every week.

Calculus and Analytical Geometry (MTH 104)

Tribhuvan University

Institute of Science and Technology

Bachelor of Science in Computer Science and Information Technology

Course Title: Calculus and Analytical Geometry

Course no: MTH-104                                                                                     Full Marks: 80+20

Credit hours: 3                                                                                                P.M: 32+8

Nature of Course: Theory

Course Synopsis: Preliminaries revision of differentiation and integration; Techniques of integration infinite series; Vectors and analytical geometry in space (differential geometry). Vector valued functions. Multivariable functions and partial derivatives. Multiple integrals and integration in vector fields. Partial derivatives; Equations of First Partial Derivatives.

Goal:  This course aims at providing students with some advanced topics in undergraduate calculus and fundamental concepts of partial differentiation and P.D.E of second order. It is assured that a student who has done Certificate Level papers in mathematics will be able to study this course.

Course Contents:

Unit 1. Topics in Differential Calculus and Integral Calculus                                   8 Hrs.

1.1    Functions and Graphs     

1.2    Extreme values of functions; graphing of derivatives          

1.3    Mean value integers                  

1.4    Definite integers, Properties and application, Mean value theory for definite integers        

1.5    Fundamental theory of Integral Calculus and application, Improper integrals     

Unit  2. Infinite Series                                                                                                 5 Hrs.

2.1    Infinite sequence and sequence of convergence and divergence                  

2.2    Integral test, comparison test, ratio and root test                 

2.3  Absolute and conditional convergence Power series, Taylor and Maclaurin series, convergence of Taylor series

Unit 3. Conic Section                                                                                                  3 Hrs.

3.1    Classifying conic sections by eccentricity      

3.2    Plane curves, parametric and polar equations, integration in polar coordinates

Unit 4. Vectors and Vectors Valued Functions                                                          6 Hrs.

4.1    Vectors in the space      

4.2    Lines and planes in space          

4.3    Cylinders and Quadric surfaces           

4.4    Cylindrical and Spherical Coordinates

4.5    Vector valued functions and space curves  

4.6    Unit tangent vector, curvature and torsion and TNB system          

Unit 5. Multiple Integrals                                                                                          5 Hrs.

5.1    Double integrals in rectangular polar coordinates   

5.2    Finding areas, moments and centre of mass

5.3    Triple integrals in rectangular coordinates and application         

5.4    Substitutes in multiple integrals

Unit 6. Multivariate Calculus                                                                                    9 Hrs.

6.1    Functions, limits and continuity of two or more variables  

6.2    Partial derivatives                                                                                             

6.3    Differentiability, Differentials, Total Differential Coefficients

6.4    Directional derivatives and gradient vectors           

6.5    Extreme values     

6.6    Lagrange Multiplies         

Unit 7. Partial Differential Equations                                                                       9 Hrs.

7.1    Review of Ordinary Differential Equations                                                     

7.2    Analysis of P.D.E of 1st and 2nd order                                                                 

7.3    Linear equations of the 1st order and the general solutions                                    

7.4    P.D.E of 2nd order, its derivation and basic concepts                                  

7.5    Solution of general P.D.E with constant coefficients, complimentary solution and integral solution        

7.6   Wave equations and heat equations and their solutions (Chapter II, Section 11.1, 11.2, 11.4, 11.5). Erwin and Kreyszig. 8th edition, John-Wiley Publications                                                      

Text Books: 

1. Thomas and Fenns: Calculus and Analytical Geometry, 9th Edition, 2004. (Thomas, Jr. G. B., and Finney, Ross L. Publisher: Pearson Education Pvt. Ltd.
2. Kreyszig, Erwin, Advanced Engineering Mathematics, John- Wiley & Sons (1991). 5th Edition.

References 

1. E.W. Swokowski, Calculus with Analytical Geometry, Second Alter Edition.
2. Sneddan Ian- Elements of Partial Differential Equations.