User 07

BE COMPUTER

4 th semester

Latest Syllabus

Pokhara university
 Pokhara University
Faculty of Science and Technology

Course code: MTH 250 (3 Credits) Full marks: 100

Course title: Applied Mathematics (3-2-0) Pass marks: 45
Nature of the course: Theory Total lectures: 45 hrs.
Level: Bachelor Program: BE

1. Course Description
This course is designed for developing competency of the students in the applications of
various mathematical concepts they learned in courses in previous semesters. It is equipped
with complex analysis, Z-transform, Partial differential Equations and Fourier Transform.
The pre requisite for this course is Calculus I, II and Algebra and Geometry. The course will
be delivered through lecture method, assignment on practically base engineering problems
and class tests.

2. General Objectives
The course is designed with the general objective:
 To acquaint the students with applications of mathematical tools in engineering.
3. Methods of Instruction
Lecture, tutorials, discussions and assignments

4. Contents in Detail

Specific objectives Contents

 Understand and apply function Unit I: Complex Analysis (17 hrs.)
of complex variables, Calculus
of functions of complex 1.1 Complex numbers and functions (5 hrs.)
variables and their applications 1.1.1 Review on Complex number, their geometric
in Engineering problems. representation, Polar form, power and roots.
1.1.2 Sets and functions in complex plane, Limits
Continuity and derivatives of function of complex
variables. (Definition and concepts only
)
1.1.3 Analytic functions, Cauchy-Riemann(C-R)
equations as necessary conditions for functions to be
analytic, C-R equations as sufficient condition for
analyticity (without proof), Polar form of C-R equations
(No derivation).
1.1.4 Laplace equation, harmonic functions and harmonic
conjugate
1.1.5 Related problems

1.2 Integrals in complex plane (4 hrs.)

1.2.1 Line integrals in the complex plane, Evaluation of basic
line integrals in complex plane
1.2.2 Cauchy's Integral theorem, Cauchy's integral formula

1
 and Cauchy integral formula of higher order (for analytic
functions) without proof.
1.2.3 Related problems.
1.3 Taylor and Laurent series for functions of complex
variables. (6 hrs.)
1.3.1 Taylor series and Laurent series (Without Proof) and
Related Problems
1.3.2 Singularities and zeros, Residues and integration,
Cauchy Residue theorem
( Without proof) and related Problems.
1.4 Conformal mapping (2 hrs.): Special Linear fractional
transformation ( Bilinear fractional transformation) only.
 Understand and apply discrete Unit II: Z-Transform and its Applications (10 hrs.)
transforms and solve difference 2.1 Z-transform, Z-transform of elementary functions,
equations. Properties of Z-transforms, Shifting theorems, initial
value theorem, final value theorem.
2.2 Inverse z-transforms using division method, expansion
method, Partial fraction method and residue method.
2.3 Application: Difference equations and solution by using
Z-transform.
 Understand and apply higher Unit III: Partial Differential Equations (12 hrs.)
dimensional systems and 3.1 Partial differential equations and solutions by variable
describe them by partial separation method.
differential equations with 3.2 One dimensional wave equation and its solutions and
solution techniques and related problems.
interpretation of solutions. 3.3 One dimensional heat equation and it’s solutions and
related problems.
3.4 Two dimensional heat equation, Laplace equation (steady
state heat equation) and its solution for rectangular
boundaries. Laplace equation in polar form and its
solution for circular boundaries, related problems.
 Evaluate Fourier integrals and Unit IV Fourier integral and Transform (6 hrs.)
Transforms. 4.1 Fourier integral, Fourier sine and cosine integrals and
related problems.
4.2 Fourier integral in complex form and Fourier transform
and inverse transform, Fourier sine and cosine transforms
and their inverse transforms, Convolution theorem,
Parseval’s identity and related problems.

Note: The figures in the parentheses indicate the approximate periods for the respective units.

5. List of Tutorials

Tutorial work covers the work to be done in tutorial. This will enable the students to compute
the mathematics problem under the supervision of the course leader. The major tutorial works
are as follows:

2
 Total : 30 Hours
Unit Unit name List of Tutorials Tutorial
no. hours
1 Unit I: Complex 1.1 Problems on differentiability 1 hr.
Analysis (9 hrs.) 1.2 Problems on analyticity 1 hr.
1.3 Problems on Harmonic and conjugate harmonic
functions. 1 hr.
1.4 Problems on Integrals using Cauchy integral 2 hr.
theorem and formula.
1.5 Problems on Taylor’s series and Laurent’s 2 hr.
series
1.6 Problems on singularities and residues. 2 hr.

2 Unit II: Z- 2.1 Problems on Z-transforms of elementary 1 hr.

Transform and its functions.
Applications (7 2.2 Problems on Z-transforms using different 2 hrs.
hrs.) theorems.
2.3 Problems on inverse z-transforms. 2 hrs.
2.4 Solution of difference equations. 2 hrs.
3 Unit III: 3.1 Problems on separation of variables methods. 2 hrs.
Partial Differential 3.2 Problems related to one dimensional wave 2 hrs.
Equations (10 hrs.) equation.
3.3 Problems on one dimensional heat equation. 2 hrs.
3.4 Problems on two-dimensional heat equation 2 hrs.
rectangular boundaries
3.5 Problems on two-dimensional heat equation 2 hrs.
circular boundaries.
4 Unit IV Fourier 4.1Problems on Fourier integrals. 2 hrs.
integral and 4.2 Problems on Fourier Transforms and its inverse. 2 hrs.
Transform (4 hrs.)

6. Evaluation System and Students’ Responsibilities

Evaluation System
Internal evaluation is done as follows:

Internal Evaluation Marks External Evaluation Weight Marks

Attendance & Class Participation 10%
Assignments 20% Semester End Board
Presentations/Quizzes 10% Examination 50% 50
Term exam 60%
50
Total Internal
Full Marks: 50 + 50 = 100

3
Students’ Responsibilities
Each student must secure at least 45% marks in internal evaluation with 80% attendance in
the class in order to appear in the Semester End Examination. Failing to get such score will
be given NOT QUALIFIED (NQ) and the student will not be eligible to appear the Semester-
End Examinations. Students are advised to attend all the classes, formal exam, test, etc. and
complete all the assignments within the specified time period. Students are required to
complete all the requirements defined for the completion of the course.

7. Prescribed Books and References

Text Book
1. Advanced Engineering Mathematics, Erwin Kreszig
2. Text Book of Engineering Mathematics, Debashis Dutta , NEW AGE International
Publisher
References
1. Advanced Engineering Mathematics, Alan Jeffrey
2. Engineering Mathematics, S.S sastry Vol.1 and Vol.2

/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

4
 Pokhara University
Faculty of Science and Technology

Course No.: CMP 262 Full marks: 100

Course title: Computer Architecture (3-1-1) Pass marks: 45
Nature of the course: Theory & Practical Total Lectures: 45 hrs
Level: Bachelor Program: BE (Computer)

1. Course Description

This course is designed to provide the knowledge of the evolution of computer architecture and the
factors influencing the design of hardware and software elements of computer systems. It aims to
provide an understanding of the design of processing unit and control unit architectures. This course
introduces the concepts of instruction set design, processor processor organization, pipelining, cache
and virtual memory organizations, I/O and interrupts, parallel processing and multicore computers.

2. General Objectives
● To acquaint the students with the knowledge of computer architecture and associated
processing, control unit and ALU unit of very simple central processing unit.
● To provide the knowledge of the functions of each element of memory hierarchy.
● To develop the skills in students to choose the appropriate Memory and Input Output
organization used in real world computing systems.
● To acquaint the students with the knowledge of technology behind modern advanced
computer architectures for parallel processing and multicore architecture.

3. Methods of instructions

Lectures, Tutorials, Case Studies, Discussion, Readings and Practical Works.

4. Content in details

Specific objectives Contents

● Understand the concepts of computer Unit 1 Introduction to Architecture [4 Hrs]
architectures, functional units and 1.1.Brief overview of Computer organization and
components of computer systems and Architecture
various addressing modes. 1.2.Hierarchy structure of computer system
1.3. Computer evolution and generations
1.4. Computer Components and Functions
1.5. Future Trends in Computer
1.6. Review of Instruction sets, Addressing Modes
and Instruction format
● Understand the VHDL Programming Unit -2: Register Transfer Language and Micro
for simple operations. operations [4Hrs]
2.1 Register Transfer and RTL
2.2.Micro Operation
2.3 Data Transfer Micro Operations
2.4 Arithmetic and Logical Operations
2.5 Shift Micro operations
2.6 Introduction to HDL and VHDL
2.7 VHDL programming for Adder, Mux, ALU
Unit -3: Processor Organization [5 Hrs]
● Understand the functional units of
CPU and their organization. 3.1CPU Organization/Structure
3.2 Register Organization and Data paths
3.3 Instruction Cycle(T states)
3.4 Arithmetic and Logical Unit
3.5 Design Principles for Modern Systems
● Understand the design of Hardwired UNIT 4 Control Unit [5 Hrs]
and microprogrammed control units. 4.1 Control of the processor
4.2 Hardwired Control Unit(Control unit inputs/logic)
4.3 Microinstruction Format
4.4 Micro Programmed Control Unit
4.5 Architecture of Microprogrammed Control Unit
4.6 Microinstruction Sequencing and Execution
4.7 Application of Hardwired and Micro programmed
Control Units
4.8 RISC and CISC Architecture
● Understand the representation of UNIT 5 Computer Arithmetic [7 Hrs.]
binary numbers in signed and unsigned 5.1 Integer Representation
notation along with the algorithms 5.2 Integer Arithmetic
used for the basic arithmetic 5.3 Unsigned Binary Addition and Subtraction
operations. 5.4 Unsigned Binary Multiplication Algorithm
5.5 Booth Multiplication Algorithm
5.6 Unsigned Binary Division Algorithm
5.7 Floating Point Representation
● Understand the concepts of pipelining Unit 6: Pipelining [4 hrs]
for better performance. 6.1 Pipelining
6.2 Arithmetic Pipeline
6.3 Instruction Pipeline
6.4 Conflicts in Instruction Pipelining and their
solutions
6.5 RISC pipeline
6.6 Register Windowing and Register Renaming
● Review memory Hierarchy of UNIT 7 Memory Organization [4 Hrs.]
computer systems and understand the 7.1 Memory Hierarchy
principles of cache memory to increase 7.2 Main Memory and Auxiliary Memory
the performance of CPU 7.3 Associative Memory and Cache Memory
7.4 Cache mapping techniques- Direct,Associative
 and Set Associative Mapping
7.5 Cache Write Policy.
7.6 Cache Replacement algorithm (FIFO, LRU, LFU)
Unit 8: Input-Output Processing [4 Hrs]
● Familiarize with IO interfaces and
8.1 Peripheral Devices
introduce various methods for
8.2 I/O Modules
improving I/O performances.
8.3 I/O Interface and Techniques
8.4 Modes of Transfer: Programmed,Interrupt-Driven
and DMA
8.5 I/O Processor and IO channel
8.6 GPU and TPU
8.7 External Interfaces: FireWire and Infiniband 244
Unit 9: Parallel \Processing [4 Hrs]
● Understand the concept of parallel
processing and multi thread 9.1 Parallel Processing
architecture in modern processors. 9.2 Parallelism In Uniprocessor system
9.3 Multiprocessor System and their characteristics
9.4 Flynn Classification
9.5 Interconnection structures in Multiprocessors
9.6 Vector processing and Array processing
9.7 Introduction to Multithreaded Architecture
● Prevalent new development in Unit 10:Multi-core computer (4Hrs)
computer architecture: the use of 10.1 Hardware performance issues
multiple processors on a single chip 10.2 Software Performance Issues
10.3 Multicore Organization
10.4 Dual Core, Quad Core and Octa Core
10.5 Power Efficient Processor

5. Laboratory Works

Laboratory works of 15 hours per group of maximum 24 students should cover the following lab
works:.

1. Write a program to implement the Booth Algorithm (2hr)

2. Write a program to implement the Non Restoring Division Algorithm (2 hr)
3. Write a VHDL Code for Realizing Logic Gates (1hr)
4. Write a VHDL code for Combination circuits (Decoder, Encoder, MUX, Demux
,Comparerator, Code converter) (6 Hrs)
5. Write a VHDL Program for Realizing Sequential Circuits Like Fliflop and counters (4
Hrs)

6. List of Tutorials:

The various tutorial activities that outfit this course should cover all the content of this course to
give students a space to engage more actively with the course content in the presence of
the instructor. Students should submit tutorials as assignments or class works to the
instructor for evaluation. The following tutorial activities of 15 hrs should be conducted
to cover all the content of this course:

A. Discussion based Tutorials (3 hrs)

1. Overview of Computer Organization and Architecture.
2. Memory hierarchy for modern processors.
3. Comparative analysis of different aspects of computing systems as defined in Flynn’s
Classification.

B. Problem Solving based Tutorials (6 hrs)

1. Design a CPU for any given registers set, instruction set and state diagram.
2. Develop a control unit for any given state diagram.
3. Design a microsequencer control unit for any given specifications following design
procedure.
4. Perform arithmetic addition and subtraction in signed and unsigned notation for any given
numbers.
5. Perform Multiplication operation for any given numbers using shift-add multiplication
algorithm and Booth’s algorithm.
6. Perform Division operation for any given numbers using restoring and Non restoring
Division algorithm.

C. Review and Question/Answer-based Tutorials: (6 hrs)

1. Case study on any of multi threaded and Multi core processors. It should include the
architecture of processor, control unit, memory as well as input output organization in
detail. An oral presentation with the submission of a report should be a part of work and
must be included as a component for evaluation.
2. Students ask questions within the course content and assignments and review key course
content in preparation for tests or exams.

7. Evaluation system and Students’ Responsibilities

Evaluation:

Internal Evaluation Weight Marks External Evaluation Marks

Theory 30
Attendance and class Participation 10%
Assignments 20%
Project work/Presentations 20%
Term Exam 50%
Practical 20
Attendance and Lab Participation 20% Semester End
Lab report 30% examination 50
Practical Exam 30%
Viva 20%
Total Internal Marks 50
Full marks=50+50
Students Responsibility:

Each student must secure at least 45% marks separately in internal assessment and practical
evaluation with 80% attendance in the class in order to appear in the semester End Examination.
Failing to get such a score will be given NOT QUALIFIED(NQ) to appear for the Semester End
Examination. Students are advised to attend all the classes, formal exam, test and complete all the
assignments within the specified time period. Students are required to complete all the
requirements defined for the completion of the course.

8. Prescribed Text Books and References

Text Books:

1. Stalling W. (2011). Computer Organization and Architecture, Pearson Education.

References:

2. Carpinelli, John D. (2001). Computer System Organization and Architecture. Pearson

Education Asia.
3. Hall, Douglas V. (2005). Microprocessor and Interfacing programming and Hardware.
McGraw Hill, New Delhi.
4. Tanenbaum, A.S. (2003). Structured Computer Organization. Pearson Education.
5. Uffenbeck, J. (1991). Microcomputers and microprocessors: the 8080, 8085, and Z-80
programming, interfacing, and troubleshooting. Prentice-Hall, Inc..
6. Moris M. M. (1992). Computer System Architecture. Pearson

/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 Pokhara University
Faculty of Science and Technology

Course No.: CMP 270 Full marks: 100

Course title: Research Fundamentals (2-0-2) Pass marks: 45
Nature of the course: Theory & Practical Total Lectures: 45 hrs
Level: Bachelor Program: BE (Computer, IT and Software)

1. Course Description

This course is designed to develop the skills of students to do a project/research work using the
fundamental concepts of research. This course introduces what the research or project work is, explores
in brief how it is done, explains what research ethics must be followed during the research/project work
and finally guides the students how the research/project documentation is done in the form of the
proposals report and final research/project report.

2. General Objectives

● To acquaint the students with basic knowledge of research/project work.

● To develop the skills in students to conduct research/project work.
● To develop the skills in students to work in a team.
● To develop the skills in students to write an impressive proposal report and final research/project
report and present their work orally.
● To acquaint the students with the knowledge of research ethics.

3. Methods of Instruction

Lecture, Discussion and Project work.

4. Contents in Detail.

Specific Objectives Contents

● Understand the basic concepts Unit 1: Introduction (4 hrs)
of research, purpose and 1.1 What is research?
outcomes of a research/project 1.2 Research Aim and Objectives
work. 1.3 Features of Research
1.4 Types of Research
1.5 The 6Ps of Research
1.6 Purpose of Research- reasons for doing research
1.7 Product of Research- outcomes of research
1.8 Research and Project

● Understand and implement the Unit 2: Research Process Model (10hrs)

research process model to 2.1 Personal Experiences and Motivation
conduct a research/project 2.2 Literature Review
work. 1. Purpose and objectives of a literature review
2. Literature resources
3. Conducting a literature review
4. Citation and its types
5. Bibliographic Detail and Referencing Systems
6. Plagiarism
2.3 Research Question
2.5 Conceptual framework
2.5 Strategies
1. Survey
2. Design and Creation
3. Experiment
4. Case Study
5. Action Research and
6. Ethnography
2.6 Data Generation Methods
1. Interview
2. Observations
3. Questionnaire
4. Documents
5. Types of triangulation in a research project
2.7 Data Analysis
1. Quantitative and
2. Qualitative data analysis
● Familiarize with the laws and Unit 3: Participants and Research Ethics (4hrs)
ethics in research conduction. 3.1 Participants
3.2 The law and Research
3.3 Rights of People Directly Involved
3.4 Responsibilities of an Ethical Researcher
 ● Familiarize with the research Unit 4: Proposal Writing (4hrs)
proposal and its components. 4.1 What is a research proposal?
● Develop a research/project 4.2 Need of a Research Proposal
proposal. 4.3 Components of a Research Proposal
4.4 A case study on any research paper/project

● Familiarize with the Unit 5: Report Writing (4hr)

research/project report and its 5.1 What is a research report?
components. 5.2 Need of a Research Report
● Develop a research/project 4.3 Components of a Research Report
report. 4.4 A case study on any research paper/report

5. Practical Work

Laboratory works of 30 hours per group of maximum 24 students should cover all the concepts of
research fundamentals studied in the lectures. Students must find a new problem, write a proposal, solve
the problem as their project/research work and submit a final project/research report and present their
work orally. The marks for the practical work will be based entirely on their project/research work. The
entire project/research work shall be divided into two phases and evaluation shall be done accordingly:

Phase I:
• The students are grouped in teams each containing at most 4 students.
• Each team chooses a problem to solve as their project/research work and they work in a team.
• They must define clearly what the problem is, justify why they choose the problem and how
they will solve it and submit this as a proposal report (based on Unit 2 and 4).
• Each team presents their proposal orally.

Phase II:
• After the approval of their proposal, they start working on the project.
• Each team follows the research process studied in Unit 2 to do their project/research work.
• Students keep reporting their progress about the project/research work to their instructor.
• Students complete the project/research work, develop the final project/research report (based on
Unit 2 and 5) and again present it orally.

6. Evaluation system

Internal Evaluation Weight Marks External Evaluation Marks

Theory 30
Attendance & Class Participation 10%
Assignments 20%
Presentations/Quizzes 10%
Internal Assessment 60%
Practical (Project/research Work) 20 Semester-End 50
examination
Proposal Report 30%
Project Presentation 10%
Final Project Report 40%
Completeness of Project 20%
Total Internal 50
Full Marks: 50 + 50 = 100

7. Student Responsibilities:

Each student must secure at least 45% marks separately in internal assessment and practical evaluation
with 80% attendance in the class in order to appear in the Semester End Examination. Failing to get such
a score will be given NOT QUALIFIED (NQ) to appear for the Semester-End Examinations. Students
are advised to attend all the classes, formal exam, test, etc. and complete all the assignments within the
specified time period. Students are required to complete all the requirements defined for the completi on
of the course.

8. Prescribed Books and References

1. Oates, B. J., Griffiths, M., & McLean, R. (2022). Researching information systems and
computing. Sage.
2. Walia, A. M., & Uppal, M. (2020). Fundamentals of Research. Notion Press.

8. Annex

A. Components of Research Proposal

1. Title Page
2. Abstract
3. Table of Contents, List Figures, List of Tables and Abbreviations
4. Introduction
a. Rationale/background
b. Problem and motivation
c. Aim and objectives of research
d. Significance of research
 e. Scope of research
f. Limitation
5. Literature review
6. Research problem and Solution
7. Methodology
a. Research design
b. Participants
c. Data collection methods
d. Data analysis techniques
e. Ethical considerations
f. Validation Techniques
8. Data Analysis and Findings
9. Discussions and Conclusion
10. Contributions and Future Works
11. Reference list/bibliography
12. Annexes

B. Components of Research Report:

1. Title
2. Abstract
3. Keywords
4. Rationale/background and motivation
5. Aim and objectives of research
6. Literature review
7. Research problem
8. Methodology
9. Research plan and budget
10. Contributions- impact and significance
11. Reference list/bibliography
12. Annexes

Other Parts of Research Report:

1. Funding and Acknowledgement

2. Table of Contents, List Figures, List of Tables and Abbreviations
3. Title Page and Copyright Page
4. Declaration and Recommendation
5. Certification Page

Note: The components of research proposal and research report may vary based on the research
strategy and nature of the research problem.

/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 Pokhara University
Faculty of Science and Technology

Course No.: CMP264 Full marks: 100

Course title: Theory of Computation (3-1-0) Pass marks: 45
Nature of the course: Theory Total Lectures: 45 hrs
Level: Bachelor Program: BE (Computer)

1. Course Description

This course is designed to provide basic knowledge of the theory of automata, formal languages and
computational complexity.

2. General Objectives

● To acquaint the students with the basic knowledge of automata and formal languages.
● To develop the skills in students to design various types of automata and analyze them.
● To acquaint the students with the concepts of computability, computational bounds and
computational complexity.

3. Methods of Instruction

Lecture, Discussion, Readings, Tutorials.

4. Contents in Detail.

Specific Objectives Contents

- Understand the concept of Unit 1: Introduction (4 hrs.)
alphabet and language 1.1 Review of set, relation and function
1.2 Proof techniques– proof by contradiction, pigeon
hole principle, induction and diagonalization.
1.3 Alphabets and language
1.4 Chomsky’s hierarchy?
- Design and implement the Unit 2: Finite Automata and Regular Language (10
deterministic and non- hrs)
deterministic finite automata. 2.1 Deterministic Finite Automata, Non‐Deterministic
- Develop the equivalence of Finite Automata
regular languages and finite 2.2 Regular expressions and regular language,
automata equivalence of regular language and finite automata
2.3 Properties of regular language
2.4 Pumping lemma for regular sets
2.5 Closure properties of regular sets
2.6 Decision algorithms for regular sets

- Explain the theory and design Unit 3: Context-Free Language and Pushdown
of context-free grammar and Automata (13 hrs)
pushdown automata and their 3.1 Context-free grammar
equivalence. 3.2 Derivative trees and simplification of context-free
- Explore the derivation trees, grammar
simplification and formal 3.3 Normal forms (CNF, GNF)
forms of context-free 3.4 Pushdown automata (formal description and final
grammar. state PDA design)
3.5 Equivalence of pushdown automata and context-
free grammar
3.6 Properties of context-free languages (CFL)
3.7 Pumping lemma for CFL’s
3.8 Closure properties of CFL’s
3.9 Decision algorithms for CFL’s

- Explain the theory and Unit 4: Turing Machines (10 hrs)

significance of Turing 4.1 Introduction to Turing machine
machines 4.2 Computing with Turing machine
- Explain computing 4.3 Extensions of Turing machine
mechanism and extensions of 4.4 Unrestricted grammar
Turing machines 4.6 Recursively enumerable languages
- Understand the computable
languages, functions and
unrestricted grammar
- Use the idea of undecidability Unit 5: Undecidability (4 hrs)
introducing Church-Turing 5.1 The Church‐Turing thesis
thesis and the halting problem 5.2 Halting Problem
- Understand the universal 5.3 Universal Turing machines
Turing machines and 5.4 Undecidable problems about Turing machines
undecidable problems of 5.5 Properties of Recursive and Recursively
Turing machines enumerable languages.
 - Understand the concept of Unit 6: Computational Complexity (4 hrs)
computational complexity 6.1 Introduction to Complexity theory, tractable and
and different classes of intractable problems.
problems 6.3 Class P and Class NP problems
6.4 NP‐complete problems.

5. List of Tutorials:

The various tutorial activities that suit this course should cover all the content of this course to give
students a space to engage more actively with the course content in the presence of the instructor.
Students should submit tutorials as assignments or class-works to the instructor for evaluation. The
following tutorial activities of 15 hours per group of maximum 24 students should be conducted to cover
the content of this course:

A. Discussion-based Tutorials: (2 hrs)

1. Review discussion on set theory concepts like functions, relations, etc.
2. Discussion on the theoretical meaning and significance of computation and computers
3. A study and presentation can be done on the history of computation and Alan Turing as the father
of computation (Oral Presentation).

B. Problem solving-based Tutorials: (8 hrs)

1. Solve problems to design deterministic and non-deterministic finite automata (DFA and NDFA) to
recognize/generate given regular languages.
2. To develop regular expressions to recognize/generate given regular languages.
3. To convert a given NDFA to DFA.
4. To design Context-Free Grammar (CFG) to recognize/generate given Context-Free Language
(CFL)
5. To simply a given CFG and convert it into CNF and GNF
6. To design Pushdown Automata (PDA) to recognize/generate given Context-Free Language (CFL)
7. To design Turing machines to recognize/generate given languages

C. Review and Question/Answer-based Tutorials: (5 hrs)

1. Case study of examples of DFA, PDA and Turing Machines for some practical tasks followed by
Oral Presentation/demonstration in class.
2. Case study of Unsolvable problems such as the Tiling problem followed by Oral Presentation in
class.
3. Case study of Class NP and NP-complete problems (eg, Travelling Salesman Problem) followed
by Oral Presentation in class.

7. Evaluation system and Students’ Responsibilities

Internal Evaluation
The internal evaluation of a student may consist of assignments, attendance, internal assessment, etc.
The internal evaluation scheme for this course is as follows:

Internal Evaluation Weight Marks External Evaluation Marks

Theory 50
Attendance & Class Participation 10%
Assignments 20%
Presentations/Quizzes 10%
Internal Assessment 60% Semester-End 50
examination
Total Internal 50
Full Marks: 50 + 50 = 100

Student Responsibilities:

Each student must secure at least 45% marks separately in internal assessment and practical evaluation
with 80% attendance in the class in order to appear in the Semester End Examination. Failing to get such
a score will be given NOT QUALIFIED (NQ) to appear for the Semester-End Examinations. Students
are advised to attend all the classes, formal exam, test, etc. and complete all the assignments within the
specified time period. Students are required to complete all the requirements defined for the completi on
of the course.

8. Prescribed Books and References

Text Books:

1. Lewis, H. R., & Papadimitriou, C. H., Elements of theory of computation, Pearson Education.
2. R. McNaughton, Elementary Computability, Formal Languages, and Automata, Prentice Hall of
India.
3. Hopcroft, J. E., Motwani, R., & Ullman, J. D. (2008). Introduction to automata theory,
languages, and computation. Pearson.

References:

1. M. Sipser, Introduction to the Theory of Computation, Thomson Course Technology

2. E. Engeler, Introduction to the Theory of Computation, Academic Press.

/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 P o k h a r a U n i v e rs i t y
Faculty of Science and Technology

Course Code: M T H 252 F u l l Marks: 100

Course title: Numerical methods (2-1-2) Pass Marks: 45
Nature of the Course: Th eory and Practical T o t a l L ectures: 30 hours
L e v e l : Bach elo r Program: B E

1. C o u r s e Desc ription
T h i s course explains how to uti lize a computer to solve issues that calculus and algebra might not
be able to. It fosters the development of mathematical relationships that can be uti lized to model
real-world situations and the problem-solving skill s necessary to study other engineering courses.

2. G e n e r a l Objectives
T h e general objectives of this course is to equip students with knowledge and tools required to
solve different equations that are applicable in the fields of engineering.

3. Methods of Ins truc tions:

Lecture, Tuto rial, Discussion, Readings and Practical works

4. Contents in Detail

Specific Objectives Contents

Solv e non-linear equations by different Unit 1: Solu tion of Non-linear equations (5 hrs)
numerical methods. 1.1. Introduction, Importance of Numerical
Methods
1.2. Approximation and Errors in computation
1.3. Bis ecti on Method
1.4. Secant method
1.5. Newton Raphson method
1.6. Fixed point iterative method
Vis u a l i z e and solve mathematical Unit 2: Interpo lation and approximation (5hrs)
relationships of practical observations. 2.1. Lagrange interpolation
2.2. Fin it e differences (forward, backward, and
divided difference)
2.3. Newton’s Interpolation (forward, backward)
2.4. L e a st square method of fitting linear and
nonlinear curve for discrete data and continuous
function
2.5. C u b i c Sp l i n e Interpolation
Calculate definite integration and Unit 3: Numerical Differentiation and
d i f f e re n t i a t i o n n u m e r i c a l l y . Integration (4 hours)
3.1. Numerical Differentiation formulae
3.2. Trapezoidal, Si mpson’s 1/3, 3/8 rule
3.3. Romberg integration
 3.4. Gaussian integration (2- point and 3- point
for mul a)
Solv e the system of linear equations by Unit 4: Solu tion of system of li ne ar algebraic
different techniques. equations (6 hours)
4.1. Gauss elimination method and concept of
pi v o t i n g
4.2. Ill- conditioned system of linear equations
4. 3. L U Factorization method (Dolittle, C rout’s,
Chole sky’s)
4.4. Iterative methods (Jacobi method, Gauss‐
Se id e l method)
4.5. E i g e n value and E i g e n vector using Power
method
Solv e the ordinary differential equations Unit 5: Solu tion of ordina ry differential
which may exist in the field of equations (6 hours)
engineering. 5.1. Review of ordinary differential equations
5.2. Runge-Kutta methods (first, second and fourth)
for first and second order differential equations
5.3. Solu tion of boundary value problem by
shooting method
Solv e numerically the partial differential Unit 6: Numerical solution of Partial differentia l
equations which exist in the field of Equ ation (4 hours)
engineering. 6.1. Classification of partial differential equation
(elliptic, parabolic and hyperbolic)
6.2. Solu tion of L a pl a ce equation (standard 5-point
formula with iterative methods)
6.3. Solu tion of Poisson equation (finite difference
approximation method)
6.4. Solu tion of one-dimensional Heat equation by
Schmidt method

Note: T h e figures in the parentheses indicate the approximate periods for the respective units.

5. L i s t of T u t o r i a l s
T h e following tutorial activities of 15 hours per group of maximum 24 students should be
conducted to cover al l the required contents of this course.

S.N . L i s t of T u t o r i a l s
1 Determination of a root by all methods and their comparison. 3 hrs
2 Fin ding of different interpolating polynomials, regression curve 2 hrs
and Cubic-splin e.
3 Determination of the first and second order derivatives by 2 hrs
difference method and its comparison with exact value. Integration
by Trapezoid, Sim pson’s rules, Romberg method, Gaussian
method and comparison with exact value.

2
 4 So lutio n of system of linear equations by Gauss E limin ation, 4 hrs
matrix factorization, Jacobi, Gauss-seidel method
Findin g E i g e n value and E i g e n vector by power method.
5 So lutio n of first and second order differential equation by R K 2 hrs
methods, and Shooting method.
6 So lutio n of L apla ce, and Poisson’s equations by five-point 2 hrs
for mul a.

6. L i s t of Practical

SN L i s t of Practicals
1. Solution of nonlinear equations.
2. Interpolation and regression.
3. Differentiation and Integration.
4. L i n e a r system of equations and power method.
5. Ordinary differential equations.

B y using M A T L A B / C / C + + or any other relevant high level programming languages.

7. Evalu ation System and Students’ Respo nsib ilities

E v a l u a t i o n Sy s tem
T h e internal evaluation of a student may consist of assignments, attendance, term-exams, lab
reports and projects etc. T h e tabular presentation of the internal evaluation is as follows:

I n t e r n a l Eval u ation W e ig h t M a r k s E x t e r n a l E v a l u a t i o n Marks

Theory 30 Semester E n d 50
A t t e n d a n c e & C l a s s P a r ti c i p a t i o n 10%
Assignments 20%
Presentations/Quizzes 10%
In t e r n a l A s s e s s m e n t 60%
P r a c ti c a l 20
A t t e n d a n c e & C l a s s P a r ti c i p a t i o n 10%
L a b Report/Project Repo rt 20%
Practical Exam/Project Work 40%
Viva 30%
T o t a l I n t e rn a l 50
F u l l M a r k s : 50 + 50 = 100

Stud en ts’ R e sp o n s i b il i t ie s
Each student must secure at least 45% marks separately in internal assessment and practical
evaluation with 80% attendance in the class in order to appear in the Semester E n d Examination.
Fa i l i n g to get such score w i l l be given N O T Q U A L I F I E D (NQ) to appear the Semester-End
Examinations. Students are advised to attend all the classes, formal exam, test, etc. and complete
all the assignments within the specified time period. Students are required to complete a l l the
requirements defined for the completion of the course.
3
8. Prescribed B o o k s and Refer ences

Text Books
1. C . F . Gerald and P.O. Wheatley Applied Numerical Analysis (7 th edition), New york.
2. B . S . Grewal, Numerical Methods in Engineering and Science K h a nn a Publication, (10th
ed i t i o n )
3. S . S . Sastry Introductory Methods of Numerical Analysis (4 th edition), Prentice-Hall of
India, New Delhi, 2008.

R e fe r en c e s :
1. Ric hard L . Burden, J . Douglas Faires, “Numerical Analysis 7th edition”, Thomson /
Brooks/Co le
2. E . Balagurusamy Numerical methods. New Delhi; Ta ta McGraw H ill, 2010.
3. Dr. V . N. Vedamurthy & Dr. N. C h . S . N. Iyengar Numerical Methods, Noida, V i k a s h
Publication House 2009.
4. Rudra Pratap Getting Started with MATLAB, Oxford University Press 2010
 Pokhara University
Faculty of Science and Technology

Course No.: Full marks: 100

Course title: Advanced Programming with Java Pass marks: 45
Nature of the course: Theory/Tutorial/Practical Time per period: 1 hour
Year: Total periods: 45
Level: Undergraduate Program: BE
Computer/IT/Software

1. Course Description
This comprehensive course provides students with an in-depth understanding of advanced Java
programming, covering essential theoretical and practical aspects. Topics include Java
architecture, object-oriented principles, graphical user interface development, networking,
database integration, web development, and advanced Java topics like ORM, Hibernate, and
concurrency. By the end of the course, students will be proficient in Java programming,
equipped to build GUI applications, handle networked and database-driven projects, and explore
advanced Java concepts, making them well-prepared for diverse Java-related challenges in the
professional world.

2. General Objectives
The course is designed with the following objectives:

1. To impart a thorough understanding of Java programming fundamentals, including its

architecture, data types, and control structures, enabling students to build robust and
efficient Java applications.
2. To delve into advanced object-oriented principles, such as inheritance,
polymorphism, and abstraction, equipping students with the skills to design and
implement sophisticated Java programs.
3. To develop expertise in creating graphical user interfaces (GUIs) using AWT, Swing,
and JavaFX, enabling students to design interactive and visually appealing software
applications.
4. To explore networking and distributed programming concepts, including socket
programming, URL handling, and email integration, empowering students to develop
networked Java applications.
5. To provide comprehensive knowledge of database connectivity with Java through
JDBC, covering connection management, SQL operations, and security measures.
6. To introduce web development with servlets and JSP, teaching students how to create
dynamic web applications with database integration, session management, and form
processing.
7. To expose students to advanced Java topics, including Object-Relational Mapping
(ORM), Hibernate, Spring Boot, concurrency, and design patterns, enabling them to
tackle complex Java projects and applications effectively.
 3. Methods of Instruction

As this course encompasses a wide range of Java programming concepts, it will adopt a diverse
instructional approach to cater to various learning dimensions. The delivery will include
traditional lectures that provide students with a strong theoretical foundation in advanced Java. In
addition to lectures, practical classes will allow students to gain hands-on experience in Java
programming, reinforcing their understanding. Tutorials will complement lectures and encourage
interactive discussions to address questions and clarify complex topics. To promote knowledge
sharing and exploration of emerging trends, students will engage in group discussions and
presentations related to advanced Java programming. Periodic short quizzes will be conducted to
gauge students' comprehension, and project work will be assigned, challenging students to create
Java software applications that demonstrate their mastery of the course material.

4. Contents in detail with specific objectives

Specific Objectives Contents

Unit 1: Basics of Programming in Java
The chapter intends to provide a brief (7 hrs)
introduction of programming in JAVA
and familiarize students with concepts 1.1 Java Architecture, Class paths, Sample Program
of basics of Programming. It intends to 1.2 Classes, Objects, Constructors
enhance the understanding 1.3 Packages and Data Types
of the programming with respect to 1.4 Conditional Statements
JAVA along with concepts of Access 1.5 Access Modifiers
Modifiers and Java Collections. 1.6 Exception Handling
1.7 Java Collections

Students will learn about object- Unit 2: Object Oriented Principles in Java
oriented principles in JAVA. Students (6hrs)
will be able to implement the concepts
of inheritance, abstraction, 2.1 Review of object-oriented principles
polymorphism. This chapter helps 2.2 Super class, sub class, inheritance, and member
students learn how object-oriented access
concepts are implemented in JAVA. 2.3 Types of inheritance
2.4 Extends and super keyword
2.5 Overriding/Overloading
2.6 Final classes and methods
2.7 Abstract classes and methods
2.8 Upcasting vs Down casting
2.9 Interfaces and Implementations
 Unit 3: Building Components using Swing and JavaFX
This chapter intends to provide (6 hrs.)
students’ knowledge on how UI
components like Swing, AWT and 3.1 Introduction to AWT and Swing: Concept, Applets,
JavaFX is used to create desktop Swing Class Hierarchy, Components/Containers
applications along with elements, 3.2 Layout Management
layouts and controls. 3.3 GUI Controls
3.4 Menu Elements and Tooltips
3.5 Dialogs and Frames
3.6. Event handling and Listener Interfaces
3.7. Handling Action Events
3.8 JavaFX vs Swing
3.9 JavaFX Layouts
3.10 JavaFX UI Controls
Unit 4: Distributed Network Programming (8 Hrs.)
This chapter intends to provide
students basic of networking and how 4.1 TCP, UDP, IP Address and Ports
JAVA programming can be used to 4.2 Socket Programming using TCP and UDP
perform basic to advanced network 4.3 Working with URLs and URL Connection Class
programming. This also intends to 4.4 Email Handling using Java Mail API
cover the basics of Email Handling 4.5 Architecture of RMI
along with advanced concepts like 4.6. Creating and Executing RMI Applications
RMI, IDL and CORBA. 4.7. Architecture of CORBA
4.8. RMI vs CORBA
4.9. IDL and Simple CORBA Program

This chapter intends to provide Unit 5: Database Connectivity with JAVA (5 hrs)
information on how Database
connectivity is handled in JAVA along 5.1 JDBC Architecture
with the architecture, drivers, and 5.2 JDBC Driver Types and Configuration
basics of database. 5.3 Managing Connections and Statements
5.4 Result Sets and Exception Handling
5.5 DDL and DML Operations
5.6. SQL Injection and Prepared Statements
5.7. Row Sets and Transactions
5.8. SQL Escapes

This chapter intends to provide Unit 6: Servlets and JSP (6 hrs.)

students’ knowledge on how web
programming is achieved in JAVA 6.1 Overview of Web Application
with the help of Servlets and JSP. 6.2 HTTP Methods and Responses
6.3 Life Cycle of Web Servlets
6.4 Writing Servlet programs with Servlet APIs
6.5 Reading and Processing Forms
6.6. Handling GET/POST Requests
6.7. Database connectivity through servlets
 6.8. Cookies and Sessions

In this chapter, students will get to Unit 7: Advanced Topics in JAVA (7 Hrs)
know advanced topics like ORM,
Frameworks, concurrency, 7.1 Overview of ORM
multithreading and how it can be used 7.2 Hibernate
in JAVA. Along with these, students 7.3 Web Framework Introduction
will also learn basics of design 7.4. Basics of Spring Boot
patterns. 7.5. Concurrency and Multithreading in JAVA
7.6. Design Patterns: Singleton, Factory and Abstract
Factory

5. List of Tutorials

The following tutorial activities of 15 hours per group of maximum 24 students should be
conducted to cover all the required contents of this course.
S.N. Tutorials
1
Setting Up Your Java Development Environment: A tutorial on installing and
configuring the Java Development Kit (JDK) and Integrated Development
Environment (IDE) for Java programming.
2
Creating Your First Java Program: A step-by-step guide to writing,
compiling, and running a simple Java program to understand the basic
structure.
3
Working with Classes and Objects: Tutorials covering the creation of classes,
instantiation of objects, and implementing constructors and methods.
4
Packages and Data Types: Exploring Java packages and different data types,
with hands-on exercises to practice variable declarations and data
manipulation.
5
Conditional Statements: Tutorial sessions on using if-else statements, switch-
case constructs, and logical operators for conditional programming.
6
Access Modifiers: Understanding access modifiers like public, private,
 protected, and default, and their implications on class members.
7
Exception Handling in Java: Comprehensive tutorials on try-catch blocks,
checked vs. unchecked exceptions, and best practices for handling
exceptions.
8
Working with Files in Java: Step-by-step guidance on reading from and
writing to files using Java I/O classes.
9
Java Collections Framework: In-depth tutorials on ArrayLists, LinkedLists,
HashMaps, and other collection classes, including common operations and
use cases.
10
Object-Oriented Concepts: Exploring inheritance, polymorphism,
encapsulation, and abstraction with practical examples.
11
Advanced Inheritance and Interfaces: Tutorials on creating subclasses,
implementing interfaces, and understanding multiple inheritance in Java.
12
Graphical User Interfaces (GUIs) with Swing: A series of tutorials on
building interactive user interfaces using Swing, covering components, event
handling, and layout management.
13
Introduction to JavaFX: Learning the basics of JavaFX, including scene
graphs, UI controls, and event handling for creating modern Java
applications.
14
Network Programming with Sockets: Hands-on exercises demonstrating
socket programming for both TCP and UDP protocols.
15
Database Connectivity with JDBC: Step-by-step tutorials on JDBC
configuration, database connection management, executing SQL queries, and
handling result sets.
16
Advanced Inheritance and Interfaces: Tutorials on creating subclasses,
implementing interfaces, and understanding multiple inheritance in Java.
17
Servlet Development: A comprehensive guide to creating Java servlets,
understanding their life cycle, and processing HTTP requests and responses.
18
JSP (JavaServer Pages) Essentials: Tutorials on developing dynamic web
pages using JSP, including form handling and database connectivity.
 19
Concurrency and Multithreading: Exploring multithreading in Java, including
synchronization, thread pools, and concurrent data structures.
20
Design Patterns: Detailed tutorials on the Singleton, Factory, and Abstract
Factory design patterns, with practical examples.

6. Practical Work

S.N. Practical Works

1
Basic Java Application: Create a simple Java application that demonstrates
your understanding of Java's syntax, variables, and control structures.
2
Object-Oriented Programming: Develop a Java program that showcases
object-oriented principles such as inheritance, encapsulation, and
polymorphism.
3
GUI Application with Swing: Build a graphical user interface (GUI)
application using Swing, featuring interactive components like buttons, text
fields, and labels.
4
JavaFX Project: Create a JavaFX application that utilizes JavaFX layout
managers, UI controls, and event handling to build a modern user interface.
5
Socket Programming: Develop a client-server application using socket
programming, allowing communication between two Java applications over a
network.
6
JDBC Database Application: Create a Java application that connects to a
database using JDBC, performs CRUD (Create, Read, Update, Delete)
operations, and handles exceptions.
8
Servlet-Based Web Application: Build a web application using Java servlets
to handle HTTP requests and display dynamic content on a web page using
JSP a well
9
Concurrency Demonstration: Develop a Java program that illustrates the
concept of multithreading, showing how threads can run concurrently and
safely.
 10
Hibernate Integration: Create a Java application that integrates Hibernate for
Object-Relational Mapping (ORM) with a database, demonstrating CRUD
operations.
11
Spring Boot Project: Develop a small Spring Boot application that showcases
the use of Spring Boot's features, such as auto-configuration and dependency
injection.

7. Evaluation system and students’ responsibilities

Internal Evaluation
In addition to the formal end-semester exam(s), the internal (formative) evaluation of a student
may consist of quizzes, assignments, lab reports, projects, class participation and presentation
etc. The tabular presentation of the internal evaluation is as follows. The components may differ
according to the nature of the subjects.

Internal Evaluation Weight Marks External Marks

Evaluation

Theory 30

Attendance & Class Participation 10%

Assignments 20%

Presentations/Quizzes 10%

Internal Assessment 60%

Practical 20
Semester-End 50
examination
Attendance & Class Participation 20%

Lab Report/Project Report 30%

Practical Exam/Project Work 30%