Purbanchal University

Faculty of Engineering, Biratnagar, Nepal

Fourth Semester’s Course Structure
Program: Bachelor in Computer Engineering

Effective from 2021 (2078) Batch

Year-II Semester-IV

S.N. Course Subject Credit L T P Total Internal Final Total

code Hours Th. P Th. P
1 Database Management 7 40 30 60 20 150
3 3 1 3
System
2 Python Programming 3 3 2 3 8 40 30 60 20 150
3 Discrete Structure 3 3 2 - 5 40 -- 60 - 100
4 Microprocessor 3 3 2 3 8 40 50 60 - 150
5 Communication System 3 3 1 3/2 5.5 40 25 60 - 125
6 Probability & Statistics 3 3 2 2 7 20 20 60 - 100
Total 18 18 10 12.5 40.5 775

Note- L: Lecture T: Tutorial P : Practical Th. : Theory

 Purbanchal University
Faculty of Engineering, Biratnagar, Nepal

Syllabus
Level: Bachelor
Program: Bachelor in Computer Engineering
Subject: DATABASE MANAGEMENGT SYSTEM

Year-II Semester-IV

Teaching Schedule Examination Schedule Total

Hours/Week Final Internal Marks
Assessment
Theory Practical Theory Practical
Marks Marks
Credit L T P Total Duration Marks Duration Marks
Hours 40 30 150
3 3 1 3 7 3 Hrs. 60 - 20
Note: L: Lecturer T: Tutorial P: Practical

Course Objective: This course introduces the fundamental concept, theory and practices in
design of database and implementation of database management system. It provides a
thorough understanding of the fundamentals of database management system to a student so
that he/she will be able to code, compile and test backend query as well as to take up Systems
programming or Advanced database programming course.

Chapter Lecture Hours

Course Contents
Introduction

1.1 Data, Database and DBMS

1.1.1 Objectives of Database
1.1.2 Benefits and difficulties of DBMS
1.2 Needs of DBMS for engineering and organization
1.3 Major features of DBMS
1.3.1 Data abstraction, Data Independence and Data consistency 5 hrs.
1 1.4 Schema and Instances
1.4.1 Database schema and instance
1.4.2 Table/relation schema and instance

1.5 Three schema Approach of DBMS

1.6 Database administration and Users

1.7 DBMS Languages

1.7.1 Data definition language (DDL)

 1.7.2 Data manipulation language (DML)

1.7.3 Data control language (DCL)

1.7.4 Transaction control language(TCL)

Data Models

2.1 Introduction and importance of data models

2.2 Conceptual, Logical and Physical model

2.3 Hierarchical, Network and Relational Data Models

2.4 Object-based model, Entity Relationship Model(ER Model)

2.5 ER-diagram

2.5.1 Components of ER diagram

2.5.2 Role of ER diagram

2 2.5.3 Entity Relationship diagram Methodology 4 hrs.

2.5.3.1 Examples of ER-diagram

2.6 Converting ER model into relational model

2.5.1 Rules and examples

2.7 Business rule to design data models

2.7.1 Discovering business rules

2.7.2 Translating business rules into Data model components (rules)

2.7.3 Naming convention

Relational Model

3.1 Definitions and terminology

3.2 Structure of Relational databases

3.3 Relational Algebra

3.3.1 Relational algebra operations

3 3.3.1.1 Unary operations (select, project, rename) 5 hrs.

3.3.1.2 Binary (Union, Set-intersection, Set-difference, Division, Cartesian

product, Join)

3.3.1.3 Others (Assignment, Deletion, Insertion, Update)

3.4 Relational Calculus

3.4.1 TRC (Tuple oriented relational calculus)

 3.4.1.1 Introduction with basic examples

3.4.2 DRC (Domain oriented relational calculus)

3.4.2.1 Introduction with basic examples

3.5 Pitfalls of relational Model

Structured Query Language (SQL)

4.1 Introduction

4.1.1 Overview with major features

4.2 DDL (create, alter, drop, truncate)

4.2.1 Introduction and practical implementation of each command

4.3 DML (insert, delete, update, select)

4.3.1 Introduction and practical implementation of each command

4.4 TCL (commit, rollback, save point)

4.4.1 Introduction and practical implementation of each command

4.5 DCL (grant, revoke)

4 4.5.1 Introduction and practical implementation of each command 6 hrs.

4.6 Aggregate Queries

4.6.1 Introduction and practical implementation of each command

4.7 Set operations and joins

4.7.1 Introduction and practical implementation of each command

4.8 Triggers and Views

4.8.1 Introduction and practical implementation of each command

4.8.2 Benefits of triggers in DBMS

Relational Database Design and Normalization

5 5.1 Overview 8 hrs.
 5.1.1 Introduction

5.1.2 Keys in DBMS

5.2 Relational Constraints

5.2.1 Domain constraint, Key Integrity (Primary key), Referential Integrity (Foreign
key), Not null constraints, Check constraints, Unique constraints

5.3 Functional dependency

5.3.1 Introduction

5.3.2 Types functional dependency (Full, Partial, Trivial, Non-trivial, Multi-value,

Join )

5.4 Inference rules for functional dependency

5.5 Decomposition of Relation

5.5.1 Dependency preserving decomposition

5.6 Closure Set of Functional Dependency and attributes

5.7 Normalization, Role of Normalization

5.8 Normal forms ( 1 NF, 2NF, 3NF, BCNF)
5.9 Comparative study of all normal forms

Database Security

6.1 Introduction

6.1.1 Importance of database security

6.2 Different levels of security

6 6.3 Database security services: Confidentiality, Authentication, 2 hrs.

Authorization, Integrity, Availability, Non-Repudiation

6.4 Access control

6.4.1 Introduction with access control matrix
6.4.2 Types: Discretionary, Mandatory, Role-base, Rule-base
6.5 Encryption and Decryption
6.5.1 Introduction with basic example

Query Processing

7.1 Introduction to Query Processing

7.2 Query Cost

7 7.3 Representing Queries using query tree and query graph 2 hrs.
7.3.1 Introduction with examples

7.4 Query Decomposition

7.4.1 Introduction
 7.4.2 Stages of query decomposition

7.4.3 Basic examples

7.5 Query optimization

7.5.1 Introduction

Filing and File System

8.1 Storage devices

8.1.1 Storage device hierarchy

8.2 Buffer Management

8.2.1 Introduction with buffer pool

8.3 File Organization

8.3.1 Introduction

8.3.2 Types:

8.3.2.1 Sequential (Pile file and Sorted file)

8.3.2.2 Indexed sequential (Primary indexed file and Secondary indexed file)
8 3 hrs.
8.3.2.3 Hashed file

8.4 Hash Collision:

8.4.1 Introduction

8.4.2 Hash collision detection

8.4.2.1 Introduction

8.4.3 Hash collision Resolution

8.4.3.1 Introduction

8.5 Data Dictionary Storage

8.5.1 Introduction

Concurrency Control

9.1 Introduction

9 9.1.1 Database transaction, ACID properties and states 5 hrs.

9.1.2 Needs of Concurrency Control

9.1.2.1 Lost update problem

 9.1.2.2 Dirty read problem

9.1.2.3 Incorrect summary problem

9.2 Scheduling

9.2.1 Introduction and types

9.3 Concurrency Control Techniques : Lock based, Two-phase locking and Time-
stamp based protocols

9.4 Deadlock Handling

9.4.1 Deadlock detection

9.4.2 Deadlock prevention (Wait-die scheme, Wound-wait scheme)

Database Recovery

10.1 Introduction

10.1.1 Importance of database recovery

10.2 Failure Classification

10.3 Log based recovery:

10.3.1 Deferred update ( In Single/Multi User Environment)

10.3.2 Immediate update (In Single/Multi User Environment)

10.4 Write Ahead Logging Protocol

10 10.4.1 Introduction with basic example 3 hrs.

10.5 Shadow paging

10.5.1 Introduction with basic example

10.6 Backup

10.6.1 Introduction

10.6.2 Backup techniques (Full database backup, differential backup and

transaction log backup)

10.7 Dumping

10.7.1 Introduction with basic example

Advanced Database Models

11 11.1 Distributed Model 2 hrs.

11.1.1 Introduction with characteristics and applications
 11.1.2 Types (Homogeneous and Heterogeneous)

11.2 Multimedia Model

11.2.1 Introduction with features, application and example

11.3 ORDBMS (Object Relational Database Management Systems)

11.3.1 Introduction with major characteristics

11.3.2 Examples with application

Total: 45 Hrs.

Assignments:

Assignment should be given for each chapter.

Laboratory Work:
There shall be lab exercises covering concepts mentioned in syllabus of Database Management
System with SQL.

Marks Distribution:

Chapters Tentative marks

Distribution
Chapter 1 4+2
Chapter 2 4
Chapter 3 4+2
Chapter 4 8+2
Chapter 5 8
Chapter 6 4
Chapter 7 2
Chapter 8 4
Chapter 9 8
Chapter 10 4
Chapter 11 4
Total 60
Note: There might be minor deviation in mark distribution.
Text Books:

1. Database Management System (DBMS) A Practical Approach by Rajiv Chopra

2. Concepts of Database Management 9th Edition by Joy L. Starks (Author), Philip J.
Pratt (Author), Mary Z. Last (Author)
3. SQL: The Complete Reference, Third Edition by Bradley Nice
 Detailed Syllabus of DATABASE MANAGEMENGT SYSTEM
Note: Define(D), Description(Des), Derive (DR), Design(DSG), Illustration (I), Algorithm(Alg), Experiment[ Program (P)/Hardware(H)],
Application (A), Numerical (N)

Depth
Chapter Topic Sub topic Hour
D Des DR DSG I Alg H/P A N

Data, Database and DBMS

1.1 1.1.1 Objectives of Database D A

1.1.2 Benefits and difficulties

of DBMS

1.2 Needs of DBMS for engineering Des A

and organization

1 Introduction Major features of DBMS 5 hrs.

1.3 1.3.1 Data abstraction, Des I

Data Independence
and Data
consistency

Schema and Instances

1.4 1.4.1 Database schema and Des DSG

instance
1.4.2 Table/relation schema
and instance
 1.5 Three schema Approach of Des DSG
DBMS

1.6 Database administration and Des

Users

1.7 DBMS Languages D

1.7.1 Data definition Des I

language (DDL)

1.7.2 Data manipulation Des I

language (DML)

1.7.3 Data control language Des I

(DCL)

1.7.4 Transaction control Des I

language(TCL)

2.1 Introduction and importance of D I

data models

2.2 Conceptual, Logical and Physical Des I

model
Data Models
2 2.3 Hierarchical, Network and Des I 4 hrs.
Relational Data Models

2.5 ER-diagram D I

2.5.1 Components of ER Des DSG I

diagram

2.5.2 Role of ER diagram

D I
 2.5.3Entity Relationship
diagram Methodology

2.5.3.1 Examples of Des DSG I

ER-diagram

Converting ER model into

2.6 relational model Des DSG I
2.6.1 Rules and examples

Business rule to design data

2.7 D I
models

2.7.1 Discovering business Des A

rules

2.7.2 Translating business

rules into Data model Des I
components (rules)

2.7.3 Naming convention

D DSG I

3.1 Definitions and terminology D A

3.2 Structure of Relational Des I A

databases
Relational
Model Relational Algebra
3 3.3 Des I 5 hrs.

3.3.1 Relational algebra Des I P

operations

3.3.1.1 Unary operations Des I P

(select, project, rename)
 3.3.1.2 Binary (Union, Set-
intersection, Set-difference, Des I P
Division, Cartesian product,
Join)

3.3.1.3 Others (Assignment, Des I P

Deletion, Insertion, Update)

3.4 Relational Calculus

3.4.1 TRC (Tuple oriented D A

relational calculus)

3.4.1.1 Introduction with

basic examples Des I P

3.4.2 DRC (Domain oriented

relational calculus) D I

3.4.2.1 Introduction with

basic examples Des I P

3.5 Pitfalls of relational Model Des

4.1 Introduction D
Structured
Query
Language 4.1.1 Overview with major D A
4 features 6 hrs.
(SQL)

4.2 DDL (create, alter, drop, D A

truncate)
 4.2.1 Introduction and
Des P
practical implementation of
each command

4.3 DML (insert, delete, update, D A

select)

4.3.1 Introduction and

Des P
practical implementation of
each command

4.4 TCL (commit, rollback, save D A

point)

4.4.1 Introduction and

practical implementation of Des P
each command

4.5 DCL (grant, revoke) D A

4.5.1 Introduction and

Des P
practical implementation of
each command

4.6 Aggregate Queries D A

4.6.1 Introduction and

practical implementation of Des P
each command

4.7 Set operations and joins D

4.7.1 Introduction and

practical implementation of Des P
each command

4.8 Triggers and Views D A

 4.8.1 Introduction and
practical implementation of Des P
each command

4.8.2 Benefits of triggers

in DBMS D I

5.1 Overview D A

5.1.1 Introduction D

5.1.2 Keys in DBMS Des I

5.2 Relational Constraints D A

5.2.1 Domain constraint,

Key Integrity (Primary key),
Referential Integrity (Foreign
key), Not null constraints, Check
constraints, Unique constraints Des I
Relational
Database
Design and 5.3 Functional dependency
5 Normalization 8 hrs.
5.3.1 Introduction D

5.3.2 Types functional

dependency (Full, Partial,
Trivial, Non-trivial, Multi-value,
Join ) Des I

Inference rules for functional

5.4 dependency Des I

5.5 Decomposition of Relation Des I

5.5.1 Dependency preserving

decomposition Des I
 Closure Set of Functional
5.6 Dependency and attributes Des I

5.7 Normalization, Role of D

Normalization
5.8 Normal forms ( 1 NF, 2NF, 3NF, Des DSG
BCNF)
Comparative study of all normal
5.9 forms Des A

6.1 Introduction D

6.1.1 Importance of
database security D A

6.2 Different levels of security Des I

Database security services:

Confidentiality,
Authentication, Authorization,
Database Integrity, Availability, Non-
Security 6.3 Des I
6 Repudiation 2 hrs.

6.4 Access control D

6.4.1 Introduction with D I

access control matrix
6.4.2 Types:
Discretionary, Mandatory, Des A
Role-base, Rule-base
6.5 Encryption and Decryption D I

6.5.1 Introduction with D I

basic example
7 Query Introduction to Query 2 hrs.
Processing 7.1 Processing D I
 7.2 Query Cost Des I

Representing Queries using

7.3 query tree and query graph D I

7.3.1 Introduction with

examples Des DSG

7.4 Query Decomposition

7.4.1 Introduction D

7.4.2 Stages of query

decomposition Des I

7.4.3 Basic examples D I

Query optimization

7.5.1 Introduction with

7.5 basic example Des I

8.1 Storage devices D

8.1.1 Storage device

hierarchy Des

8.2 Buffer Management D

Filing and File
System
8 8.2.1 Introduction with 3 hrs.
buffer pool Des I

8.3 File Organization

8.3.1 Introduction D I

8.3.2 Types: D
 8.3.2.1 Sequential
(Pile file and Sorted file) Des I

8.3.2.2 Indexed
sequential (Primary indexed
file and Secondary indexed
file) Des I

8.3.2.3 Hashed file Des I

8.4 Hash Collision:

8.4.1 Introduction D

8.4.2 Hash collision

detection Des

8.4.2.1 Introduction D

8.4.3 Hash collision

Resolution

8.4.3.1 Introduction Des I

8.5 Data Dictionary Storage

8.5.1 Introduction D

9.1 Introduction D

9.1.1 Database
Concurrency transaction, ACID properties
and states Des I
Control
9 5 hrs.
9.1.2 Needs of
Concurrency Control Des I

9.1.2.1 Lost update

problem Des DSG
 9.1.2.2 Dirty read
problem Des DSG

9.1.2.3 Incorrect
summary problem Des DSG

9.2 Scheduling

9.2.1 Introduction and

types D I

Concurrency Control
Techniques : Lock based, Two-
phase locking and Time-stamp
9.3 based protocols Des DSG I

Deadlock Handling

9.4.1 Deadlock detection

9.4 Des I

9.4.2 Deadlock prevention

(Wait-die scheme, Wound-wait
scheme)
Des I

10.1 Introduction

Database 10.1.1 Importance of

Recovery database recovery D I
10 3 hrs.

10.2 Failure Classification Des I

10.3 Log based recovery:

 10.3.1 Deferred update (
In Single/Multi User
Environment) Des I

10.3.2 Immediate
update (In Single/Multi User
Environment) Des I

10.4 Write Ahead Logging Protocol

10.4.1 Introduction with

basic example Des I

10.5 Shadow paging I

10.5.1 Introduction with

basic example Des I

10.6 Backup

10.6.1 Introduction D A

10.6.2 Backup
techniques (Full database
backup, differential backup
and transaction log backup) Des I

10.7 Dumping

10.7.1 Introduction with

basic example Des I

11.1 Distributed Model

11 Advanced 11.1.1 Introduction with 2 hrs.

characteristics and applications Des I A
Database
Models 11.1.2 Types Des I
(Homogeneous and
 Heterogeneous)

11.2 Multimedia Model

11.2.1 Introduction with

features, application and
example Des I A

ORDBMS (Object Relational

Database Management
11.3 Systems)

11.3.1 Introduction with

major characteristics Des A

11.3.2 Examples with

application D I

Total: 45 hrs.
 PURBANCHAL UNIVERSITY
SEMESTER FINAL EXAMINATION – 2023 (MODEL QUESTION)
LEVEL: Bachelor
Program: Bachelor in computer engineering
SUBJECT: Database Management System FULL MARKS: 60
TIME: 03:00 hrs PASS MARKS: 24

Group-A Answer all Questions [4*2=8]

1. Define instance with example.

2. What are the major terminologies of relational database model?
3. What is query cost?
4. What are the benefits of triggers in DBMS?

Group-B Answer any Seven Questions [7*4=28]

5. Explain three schema approaches.

6. Discuss the application of DBMS in engineering field.
7. Consider the following relations with primary keys underlined
Customer (c_id, c_name, c_address)
Branch (b_name, b_city, assets)
Account (c_id, act_no, b_name, balance)
Write the relational algebra for the following:
a. Find the name of customer, who is involved in branch computer.
b. Find the branch_name and branch_city who have assets greater than
Rs.50,000.
8. Differentiate between Discretionary and Mandatory access control.
9. What are different file organizations? Explain two of them.
10. Explain shadow paging with suitable example.
11. Explain distributed database model with its major features.
12. Explain query processing in detail.

Group- C Answer any Three Questions [3*8=24]

13. What are the benefits of normalization in relational database design? Explain 3NF, 4NF and 5NF
with suitable example.[2+6]
 14. Define database transaction. Explain concurrency control techniques in detail. [2+6]

15. Define view. Draw ER-diagram for library management system and convert in
relational model. [2+6]

16. Consider the following two tables:

Student

Roll_No S_name S_Contact S_address M_Id

101 Sajan 9846723457 Kathmandu 1
102 Raj 9845678223 Lalitpur 2
103 Rohan 9813556677 Bhaktapur 3

Marks

Marks_Id DBMS FOSP Math

1 89 87 65
2 77 67 80
3 88 65 85

Now answer the following question: 2*4=8

a) Write SQL query to find student name and DBMS marks that scores maximum marks in
DBMS.
b) Write SQL query to display all information of students, whose address are arranged in
descending order.
c) Write SQL query to increment FOSP marks by 13% who is from Lalitpur.
d) Write SQL to delete details of student whose name starts with ‘S’
 Purbanchal University
Faculty of Engineering, Biratnagar, Nepal

Syllabus
Level: Bachelor
Program: Bachelor in Computer Engineering
Subject: Python Programming

Year-II Semester-IV

Teaching Schedule Examination Schedule Total

Hours/Week Final Internal Marks
Assessment
Theory Practical Theory Practical
Marks Marks
Credit L T P Total Duration Marks Duration Marks
Hours 40 30 150
3 3 2 3 8 3 Hrs. 60 - 20
Note: L: Lecturer T: Tutorial P: Practical

Course Objectives:

This course introduces fundamental programming concepts and program design using Python
programming language. Students will be introduced to understand decision structures, loops,
functions, object-oriented programming as well as basic machine learning using Python.

Chapter Topic Duration

1. Introduction
Introduction to Python 2hrs.
History of Python
Features of Python
Installing python and environment set up

2. Fundamentals of Python 6hrs.

Constant and Variables
Naming and Using Variables
Avoiding Name Errors When Using Variables
Variable as a label
Data type:
Strings
Numbers
Integers
Floats
Operators and its types
Multiple Assignment
 Comments, Indentation and Statements
Basic Input statement, output statement
Debugging and Testing

3. Conditional Statements and Branching 3hrs.

if Statements
Simple if Statements
if-else Statements
The if-elif-else Chain
Using Multiple elif Blocks
Testing Multiple Conditions
Switch Case
4. Control Statements 5hrs.
while Statement, do… while, for Statement, foreach statement,
Nested loops
Break Statement
Continue Statement
Pass Statement

5. List and Tuple 5hrs.

What Is a List?
Accessing Elements in a List
List Operations and its Types
Changing, Adding, and Removing Elements
Modifying Elements in a List
Adding Elements to a List
Removing Elements from a List
Organizing a List
Sorting a List Permanently with the sort() Method
Sorting a List Temporarily with the sorted() Function
Printing a List in Reverse Order
Finding the Length of a List
Avoiding Index Errors When Working with Lists
Making Numerical Lists
Using the range() Function
Using range() to Make a List of Numbers
WORKING WITH LISTS
Looping Through an Entire List
Working with Part of a List
Slicing a List
Looping Through a Slice
Copying a List
Tuples
Defining a Tuple
Looping Through All Values in a Tuple
Writing over a Tuple
6. Dictionaries 3hrs.
Introduction: Simple dictionary, Adding, removing elements
Accessing values in dictionaries
Working with dictionaries
Properties
Functions: add, remove, modify
Looping Through a Dictionary
Nesting dictionary

7. FUNCTIONS 6hrs.
Defining a Function
Passing Information to a Function
Arguments and Parameters
Passing Arguments
Positional Arguments
Keyword Arguments
Default Values
Equivalent Function Calls
Avoiding Argument Errors
Return Types
Returning a Simple Value
Returning a Dictionary

Passing a List
Modifying a List in a Function
Preventing a Function from Modifying a List

Storing Your Functions in Modules

Importing an Entire Module
Importing Specific Functions
Using as to Give a Function an Alias
Using as to Give a Module an Alias
Importing All Functions in a Module
Namespaces
Packages
Bringing Everything into the Current Scope
Re-importing Modules and Packages
Basics of Testing Your Modules and Packages

8. Classes and Objects 6hrs.

Creating and Using a Class
Creating the Dog Class
Making an Instance from a Class
Working with Classes and Instances
The Car Class example
Setting a Default Value for an Attribute
 Modifying Attribute Values
Inheritance
The __init__() Method for a Child Class
Defining Attributes and Methods for the Child
Class
Overriding Methods from the Parent Class
Introduction to Importing Classes with example

9. FILES, DIRECTORIES AND EXCEPTIONS 5hrs.

Opening and closing a file
Reading and Writing from a file
Reading line by line
Reading Big file
Writing to a File
Writing to an Empty File
Appending to a File
Renaming, Moving, Copying, and Removing Files

10. Machine Learning/Deep Learning Framework 4 hrs.

Scikit-learn introduction (training and evaluating classifiers) -
introduction only

Keras / TensorFlow introduction (training deep learning classifiers)

- introduction only

NumPy, SciPy - introduction only

Pandas and Tabular - introduction only

Books

1. Beginning Python: Using Python 2.6 and Python 3.1 (Wrox Programmer to Programmer) by
James Payne
2. Introduction to Problem Solving with Python by E. Balagurusamy
3. The Complete Reference Python, Martin C. Brown, McGraw Hill
4. Head First Python, 2nd Edition
 Marks Distribution:

Chapters Marks Remarks

1 2
Th
2 6
Th + P
3 8
Th + P
4 4
Th + P
5 4
Th + P
6 4
Th + P
7 4
Th + P
8 10
Th + P
9 10
Th + P
10 8
Th + P
Total 60

Note: There might be minor deviation in mark distribution.

Question Type No. of Questions Marks Total Marks

Short 4 2 8
Medium 7 4 28
Long 3 8 24
Total 60
 Detailed Syllabus of Python Programming

Note: Define (D), Description (Des), Derive (Dr), Illustration (I), Explanation (E), Application (A), Algorithm (Alg), Experimentation [Hardware (H) /
Program(p)], Numerical (N)

Ch Depth
Topic Subtopic Hour
No. D Des Dr I E A Alg H N

1.1 Introduction to Python Des

1.2 History of Python Des I

1 Introduction 2
1.3 Features of Python Des I

Installing python and

1.4 Des I P
environment set up

Constant and Variables

• Naming and Using

2.1 Variables D E P
• Avoiding Name
Errors When Using
Fundamentals of
2 Variables 6
Python • Variables as Labels
Data type

2.2 • Strings D I
• Numbers
• Integers
• Floats
 Comments, Indentation and
Statements

Styling Your Code

2.3 • The Style Guide Des I P
• Indentation
• Line Length
• Blank Lines
• Other Style
Guidelines
Basic Input statement,
2.4 E P
output statement

2.5 Debugging and Testing E P

if Statements
3.1 E P
• Simple if Statements
if-else Statements
Conditional 3
3.2 • The if-elif-else Chain E P
3 Statements and
• Using Multiple elif
Branching
Blocks
3.3 Testing Multiple Conditions E P

3.4 Switch Case E P

Control while Statement, do… while

4 4.1 Des E P 5
Statements statement
 for Statement, foreach
4.2 Des E P
statement, Nested loops

Break Statement

4.3 Continue Statement Des E P

Pass Statement

What Is a List?
5.1 D
• Accessing Elements
in a List
List Operations and its Types

Changing, Adding, and

Removing Elements
5.2 • Modifying Elements E P
in a List
5 List and Tuples • Adding Elements to 3
a List
• Removing Elements
from a List
Organizing a List

• Sorting a List
Permanently with
5.3 the sort() Method Des E P
• Sorting a List
Temporarily with
the sorted()
Function
 • Printing a List in
Reverse Order
• Finding the Length
of a List
• Avoiding Index
Errors When
Working with Lists
Making Numerical Lists

• Using the
range()
5.4 Function E P
• Using range() to
Make a List of
Numbers

WORKING WITH LISTS

•
Looping
Through an
Entire List
Working with Part of a List
5.5 I E P
• Slicing a List
• Looping Through
a Slice
• Copying a List

Tuples
D Des P 2
5.6
• Defining a Tuple
 • Looping Through
All Values in a
Tuple
• Writing over a
Tuple
Introduction

• Simple dictionary,
Adding, removing 3
elements
6.1 • Accessing values in D E P
dictionaries
6 Dictionaries
Working with dictionaries

• Properties
• Functions: add,
remove, modify
• Looping Through a
6.2 Dictionary E P
• Nesting dictionary
Defining a Function

• Passing
Information to a
Function
7.1 • Arguments and D Des E P
7 FUNCTIONS Parameters 7
Passing Arguments

• Positional
Arguments
• Keyword
7.2 Arguments E P
• Default Values
 • Equivalent
Function Calls
• Avoiding
Argument Errors
Return Types

• Returning a Simple
Value
7.3 • Returning a E P
Dictionary
Passing a List

• Modifying a List in a
Function
• Preventing a
7.4 Function from E P
Modifying a List
Storing Your Functions in
Modules

• Importing an Entire
Module
• Importing Specific
Functions
• Using as to Give a
Function an Alias
• Using as to Give a
Module an Alias
• Importing All
Functions in a
7.5 Module E P
• Namespaces
 Packages

• Bringing Everything
into the Current
Scope
• Re-importing
Modules and
Packages
• Basics of Testing
7.6 Your Modules and E P
Packages
CLASSES

• Creating and Using a

Class
• Creating the Dog
Class
• Making an Instance
from a Class
Classes and
8 • Working with
Objects Classes and
Instances
• The Car Class
example
• Setting a Default
Value for an
Attribute
8.1 • Modifying Attribute D Des E A P
Values
Inheritance
6
• The __init__()
8.2 Method for a Child D Des E P
Class
 • Defining Attributes
and Methods for the
Child
• Class
• Overriding Methods
from the Parent
Class
Introduction to Importing
8.3 Classes with example D Des

Opening and closing a file

Reading and Writing from a

file

Reading line by line

FILES,
9.1 Reading Big file D E P
DIRECTORIES
9. 5
AND Writing to a File
EXCEPTIONS
• Writing to an Empty
File
• Appending to a File

• Renaming, Moving,
9.2 Copying, and E P
Removing Files
Machine Scikit-learn introduction
Learning/Deep (training and evaluating
10. 4
Learning classifiers) - introduction
Framework 10.1 only D Des P
 Keras / TensorFlow
introduction (training deep
learning classifiers) -
10.2 introduction only D Des P

NumPy, SciPy - introduction

only

Pandas and Tabular -

10.3 introduction only D Des P

Laboratory Works:

1. There shall be at least 15 Laboratory classes of python programming.

 PURBANCHAL UNIVERSITY

Model Questions Paper - 2023

LEVEL: - BE Computer/ Fourth Semester

SUBJECT: - Python Programming FULL MARKS: - 60

TIME: - 03:00 hrs. PASS MARKS: - 24

Candidates are required to give their answers in their own words as far as practicable.

Group - A Attempt All Questions. 4x2=8

Q.1. In some languages every statement ends with a semicolon. What
happens if you put a semi-colon at the end of a Python statement?
[2 ]

Q.2. What is the difference between the List type and the Tuple type? [2]

Q.3. What do you need to do first when you want to use a module? [2]

Q.4. Write a python function called do_plus that accepts two

parameters and adds them together with the "+" operation? [2]

Group – B (Attempt any seven Questions.) 4 x 7 = 28

Q.5. How do you perform input and output in Python? Provide

examples to illustrate your answer. [1+3]

Q.6. Explain increment and decrement operators that are included

within the python language with examples. [4]

Q.7. What is the difference between using the 'with' statement and
manually closing a file? [4]

Q.8. Defines a function called calculate_average that takes a list of

numbers as input and calculate the average of list. Finally, the
function returns the average of that list. [ 4]

Q.9. Describe car class with an example using python. [4]

Q.10.What is Dictionaries? How do you add, remove and access

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
38
elements in dictionaries? [ 1+3 ]

Q.11. What is an exception in Python, and when does it occur? What is

the purpose of using try-except blocks in Python? [4]

12. Write a program to perform add and remove operation on [4]

dictionary.

Group – C (Attempt any three Questions.) 3 x 8 = 24

Q.13. Write a Python class called Person with the following attributes:
name (string), age (integer), gender (string)
The class should have a constructor method that initializes these
attributes, as well as methods to do the following:
introduce: Print a message introducing the person, including their
name, age, and gender.
have_birthday: Increase the person's age by 1. [ 8]

Q.14. What are the differences between the 'for' loop, 'while' loop, and
'do-while' loop in Python? When would you use each one, and what are
some advantages and disadvantages of each type of loop? [ 3 + 3 + 2 ]

Q.15. What is a module? How do you store functions in a module? List

and describe different way of importing module in your program?
[ 1+3+4]

Q.16. Write a short note on the following python based artificial

intelligence libraries: (i) TensorFlow (ii) Scikit-learn [ 4+4]

The End

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
39
 Purbanchal University
Faculty of Engineering, Biratnagar, Nepal

Syllabus
Level: Bachelor
Program: Bachelor in Computer Engineering
Subject: Discrete Structure

Year-II Semester-IV

Teaching Schedule Examination Schedule Total

Hours/Week Final Internal Marks
Assessment
Theory Practical Theory Practical
Marks Marks
Credit L T P Total Duration Marks Duration Marks
Hours 40 - 100
3 3 2 - 5 3 Hrs. 60 - -
Note: L: Lecturer T: Tutorial P: Practical

Objective: On completion of this course, students will be able to explain and apply the basic methods
of discrete (non continuous) mathematics in computer engineering. They will be able to use these
methods in subsequent courses in the design and analysis of algorithms, computability theory,
software engineering, computer systems and compiler design.

Course Contents:

Chapter Topic Subtopic Hour

1 Mathematics 1.1 Set and subsets 3 hrs
preliminaries 1.2 Operation on sets
1.3 Basic principle of counting, permutation and
combination
1.4 Pigeonhole principle and application

2. Logic, proof 2.1. Proposition, compound proposition and Truth 12 hrs

,Induction and values
Reasoning 2.2. Tautology and contradiction
2.3. Propositional Logic
2.4. Converse, inverse and contrapositive
2.5. Logical equivalence
2.6. Validity and argument
BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
40
 2.7. Normal forms
2.8. Informal Deduction in Predicate Logic
2.9. Universe of discourse, Quantifiers, Universal
quantifier and Existential quantifier, Negation of
quantified statement
2.10. Rules of Inference and Proofs
2.11. Informal Proofs and Formal Proofs
2.12. Mathematical induction
2.13 Elementary Induction and Complete Induction

3. Relation 3.1. Relations, type of relation and their 7 hrs

properties

3.2.n-ary relations and their applications,

3.3. Representing relations, representing

relation using graph, composition of relation,
closure of relations, equivalence of relations,
partial order relation

3.4. Transitive closure and Warshall’s

algorithms

4. Recurrence 4.1. Introduction 9 hrs

Relation 4.2. Order and degree of recurrence relation
4.3. Recursive Definition of Sequences
4.4. Particular solution
4.5. Solution of Linear recurrence relations with
constant coefficients
4.6. Solution to Nonlinear Recurrence Relations
4.7. Generating function
4.8. Application to Algorithm Analysis
4.9. Integer function

5. Graph Theory 5.1. Graph and its type 10 hrs

5.2. Undirected and Directed Graphs
5.3. Adjacency and degree of graph
5.4. Walk, Paths, Circuits, Components
5.5. Types of graph (Bipartite Graphs, Planar Graphs,
Regular Graphs, complete graph, connected graph )
5.6. Hand Shaking Theorem
5.7. Eulerian Graph

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
41
 5.8. Hamiltonian Graph
5.9. Tree as a Directed Graph
5.10. Cut sets and Cut vertices

6. Language, 6.1. Introduction , strings and languages 4 hrs

Grammar and
6.2. Regular Expression and its characteristics
Automata
6.3. Grammars
6.4. Introduction to Finite state Machine
6.5. Finite State Automata
6.6. DFA

References:

• Kenth Rosen, “Discrete Mathematical Structures with Applications to Computer Science”,

WCB/ McGraw Hill
• Joe L Mott, Abraham, Thoedore P. Baker “Discrete Mathematics for Computer scientists and
mathematics” India, Printice Hall 2004
• G. Birkhoff, T.C. Bartee, “Modern Applied Algebra”, CBS Publishers
• R. Johnsonbaugh, “Discrete Mathematics”, Prentice Hall Inc.
• G.Chartand, B.R.Oller Mann, “Applied and Algorithmic Graph Theory”, McGraw Hill

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
42
Detailed Course Contents of Discrete Structure
Note: Define(D), Description(Des), Derive (DR), Design(DSG), Illustration (I), Algorithm(I), Application (A), Experiment[ Program
(P)/Hardware(H)], Numerical (N)

Ch Depth
Topic Subtopic Hour Remarks
No. D Des DR/DSG I Alg H/P A N

Set and subsets

1.1 D I

Operation on sets
Mathematics 1.2 Des
1 3 hrs
preliminaries
Basic principle of counting, permutation
1.3 Des N
and combination

1.4 Pigeonhole principle and application Des N

Proposition, compound proposition and

Logic, proof,
2.1 Truth values D I 12 hrs
Induction
2
and
Reasoning Tautology and contradiction
2.2 D I

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
43
 2.3 Propositional Logic D

2.4 Converse, inverse and contrapositive D I

2.5 Logical equivalence D I

2.6 Validity and argument D I

Normal forms (Disjunctive normal form,

Conjunctive normal form, Principle
2.7 D Des N
conjunctive normal form and principle
disjunctive normal form

2.8 Informal Deduction in Predicate Logic D

Universe of discourse, Quantifiers,

Universal quantifier and Existential
2.8 D I
quantifier, Negation of quantified
statement

2.9 Rules of Inference and Proofs D Des N

2.10 Informal Proofs and Formal Proofs D

2.11 D Des N
Mathematical induction

Elementary Induction and Complete

2.12 D
Induction

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
44
 Relations, type of relation and their
properties
3.1 D Des I

3.2 n-ary relations and their applications, D Des I A

3 Relation 7 hrs
Representing relations, representing
relation using graph, composition of
3.3 D Des I N
relation, closure of relations, equivalence
of relations, partial order relation

Transitive closure and Warshall’s

3.4 D DR N
algorithms

4.1 Introduction D

4.2 Order and degree of recurrence relation D Des DR N

4.3 Recursive Definition of Sequences D

Recurrence
4 Relation 4.4 Particular solution D Des DR N 9 hrs

Solution of Linear recurrence relations

4.5 D Des DR N
with constant coefficients

Solution to Nonlinear Recurrence

4.6 D Des DR N
Relations

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
45
 4.7 Introduction to Generating function D

4.8 Application to Algorithm Analysis D A

4.9 Integer function D

5.1 Graph and its type D

5.2 Undirected and Directed Graphs D I

5.3 Adjacency and degree of graph D I

5.4 Walk, Paths, Circuits, Components D I

Types of graph(Bipartite Graphs, Planar

Graphs, Regular Graphs, complete graph,
5 Graph Theory 5.5 connected ) D I 10 hrs

5.6 Hand Shaking Theorem D DR

5.7 Eulerian Graph D I

5.8 Hamiltonian Graph D I

5.9 Tree as a Directed Graph D I

5.10 Cut sets and Cut vertices D I

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
46
 Network Flows, Maxflow and Mincut
5.11 Theorem D I N

Introduction to alphabets, strings and

languages D
Langauage Regular Expression and its characteristics D I
,Grammer
6 4 hrs
and Grammars D
Automata
Finite state Machine D I N

Finite State Automata D I N

Introduction to DFA D I

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
47
Mark scheme:

Chapter marks

Chapter 1 5

Chapter 2 15

Chapter 3 10

Chapter 4 10

Chapter 5 15

Chapter 6 5

PURBANCHAL UNIVERSITY

Model Questions Paper - 2023

LEVEL: - BE Computer/ Fourth Semester

SUBJECT: - Discrete Structure FULL MARKS: - 60

TIME: - 03:00 hrs. PASS MARKS: - 24

Group A (very short question) Attempt all questions

1. State the inverse, converse and contrapositive statement of the following statement: “If the triangle is equilateral, then it is equiangular”.
[2]
2. Let A= {1, 2, 3, 4} and B= {x, y, z}. Let R be the following relation from A to B:
BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
1
 R ={(1,y),(1,z),(3,y),(4,x),(4,z)}. Draw the arrow diagram of R. [2]
3. Describe the law of modes tollen with example. [2]
4. State pigeon hole principle [2]

Group B (short questions) Attempt any seven questions

5. Prove by mathematical induction that 23n -1 is divisible by 7. [4]

6. Solve the recurrence relation: ar -2ar-1 +6ar+2 =6. [6]

7. Prove that if a and b are two positive integers, then 𝑔𝑐𝑑(𝑎, 𝑏) × 𝑙𝑐𝑚(𝑎, 𝑏) = 𝑎𝑏. Verify with an example.
[4]
8. What is finite state automata? Differentiate between finite state machine and finite state automata. [2+2]
9. Obtain the principle disjunctive normal form of(~𝑝 → 𝑟)⋀(𝑞 ↔ 𝑝). [4]
10. Describe the bipartite graph with example. [4]
11. Let R= {(1,2).(2,3),(3,1)} and A= {1,2,3}. Find reflexive, symmetric and transitive closure of R. using composition relation of R.
12. A collection of 10 electric bulbs contain 3 defective ones. (i) In how many ways can a sample of four bulbs e selected? (ii) In how many ways can a sample
of four bulbs be selected which contain 2 good bulbs and 2 defective one? [4]

Group C (Long questions) Attempt any three questions

1 0 0 1
12. Let A= {1, 2, 3, 4}, for the relation R whose matrix is given. Find the matrix of transitive closure by using warshall’s algorithm. MR= [ 1 1 0 0
]
0 1 0 1
0 0 0 1
[8]

13. Define rule of inference. Check the validity of the following argument: if the races are fixed or the casinos are crooked, then the tourist trade will decline. If
the tourist trade decreases, then the police will be happy. The police force is never happy. Therefore, the races are not fixed.
[2+8]
BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
2
 14. What do you by Euler circuit and path? Determine whether the given graph below contains an Euler circuit. If it has, then find them.
[4+4]

a b
c

d
e

Q15. Solve the recurrence relation: 𝑎𝑟+2 − 2𝑎𝑟+1 + 𝑎𝑟 = 2𝑟 given that 𝑎0 =2 and 𝑎1 =1. [8]

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
3
 Purbanchal University
Faculty of Engineering, Biratnagar, Nepal

Syllabus
Level: Bachelor
Program: Bachelor in Computer Engineering
Subject: Microprocessor

Year-II Semester-IV

Teaching Schedule Examination Schedule Total

Hours/Week Final Internal Marks
Assessment
Theory Practical Theory Practical
Marks Marks
Credit L T P Total Duration Marks Duration Marks
Hours 40 50 150
3 3 1 3 7 3 Hrs. 60 - -
Note: L: Lecturer T: Tutorial P: Practical

Course Objectives: The objective of this course is to provide fundamental knowledge to understand the
operation, programming and application of 8085 and 8086 microprocessor.

1. Introduction to microprocessor (4 hours)

1.1 Evolution of microprocessor
1.2 Microcomputer System with bus organization
1.3 Comparison among CPU, microprocessor and microcontroller
1.4 Application of microprocessors

2. Intel 8085 Microprocessor (12 hours)

2.1 Internal Architecture

2.2 Pin diagram and pin function

2.3 Addressing modes

2.4 Instruction Set

2.5 Instruction and machine cycle

2.6 Timing diagram for opcode fetch, memory read and write and I/O read and write

2.7 Assembly language programs of 8085, macro assembler, assembler directives and
subroutine

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
1
 2.8 Time delay and counter design

3. Intel 8086 Microprocessor (12 hours)

3.1 Internal Architecture

3.2 Memory segmentation

3.3 Addressing modes

3.4 Instruction Set

3.5 Fetch-execution overlap

3.6 Assembly language programs of 8086

4. Memory Interface (3 hours)

4.1 SRAM and ROM interface requirements

4.2 Address Decoding
4.3 Memory Interfacing with 8085

5. Input/output Interfaces: (9 hours)

5.1 Serial communication

5.2 Parallel communication
5.3 Programmable Peripheral Interface 8255: block diagram and mode of initialization

5.1 RS-232C standard

5.2 Programmable Communication Interface 8251: block diagram

6. Interrupt: (5 hours)

6.1 Basic Interrupt processing

6.2 Types of interrupt
6.3 Interrupt priority: polled and chained interrupt
6.4 DMA: block diagram and Timing diagram

Laboratory
BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
2
1. Familiarization with 8085 microprocessor trainer kit and simulator

2. Data transfer instructions

3. Arithmetic and logical instructions

4. Subroutine and branching instructions

5. Stack operations

6. Timers and delay

7. Code conversion

8. Familiarization with assembly language program, assembling and macro assembler

(MASM)

9. Operations related to data transfer, arithmetic and logical instruction in 8086

10. Operation related to case conversion (Upper case to lower case and vice-versa)

References:

1. Ramesh S. Gaonkar, ”Microprocessor – Architecture, Programming & Applications

with the 8085”, Penram International Publisher, 5th Ed., 2006

2. Douglas V. Hall, “Microprocessors & Interfacing: Programming & Hardware”, 2nd

Ed., Tata McGraw Hill, 2006

3. Ghosh, P. K., Sridhar P. R.,"0000 to 8085: Introduction to Microprocessors for Engineers

and Scientists", Second Edition, Prentice Hall of India Private Limited, 1997.

4. " Lance, A. Leventhal., "Introduction to Microprocessors: Software, Hardware, and

Programming”, Eastern Economy Edition, Prentice Hall of India Private Limited, 1995.

5. Malvino, A. P., "An Introduction to Microcomputers", Prentice Hall of India Private

Limited, 1995.

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
3
 Detailed Syllabus of Microprocessor
Note: Define(SD), Description (D), Derive (Dr), Illustration (I), Explanation (E), Application (A), Experimentation (Ex), Numerical (N)

Depth
Ch No. Topic Subtopic Hour Remarks
SD D DR I E A EX N

1.1 Evolution of microprocessor ✔

Microcomputer System with

1.2 ✔ ✔
bus organization

1 Introduction Comparison among CPU, 4

1.3 microprocessor and ✔ ✔
microcontroller

Application of
1.4 ✔
microprocessors

2.1 ✔ ✔
2 Intel 8085 Microprocessor Internal Architecture 12

2.2 Pin diagram and pin function ✔ ✔

2.3 ✔ ✔

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
1
 Addressing modes

2.4 Instruction Set ✔ ✔

2.5 Instruction and machine cycle ✔ ✔

Timing diagram for opcode

fetch, memory read and
2.6 write and I/O read and write ✔ ✔ ✔

Assembly language programs

of 8085, macro assembler,
2.7 ✔ ✔
assembler directives and
subroutine

Time delay and counter

2.8 design ✔ ✔

3.1 Internal Architecture ✔ ✔

3 Intel 8086 Microprocessor 12
3.2 Memory segmentation ✔

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
2
 3.3 Addressing modes ✔ ✔ ✔

3.4 Instruction Set ✔ ✔ ✔

Fetch-execution overlap
3.5 ✔ ✔ ✔

Assembly language programs

3.6 ✔ ✔
of 8086

SRAM and ROM interface

4.1 ✔ ✔
requirements

4 Memory Interface 4.2 Address Decoding ✔ ✔ 3

Memory Interfacing with

4.3 ✔ ✔
8085

5.1 Serial communication ✔ ✔ ✔

5.2 Parallel communication ✔ ✔ ✔

Programmable Peripheral
5.3 Interface 8255: block diagram ✔ ✔
5 Input/output Interfaces and mode of initialization 9

5.4 RS-232C standard ✔ ✔ ✔

Programmable
5.5 Communication Interface ✔ ✔
8251: block diagram

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
3
 6.1 Basic Interrupt processing ✔

6.2 Types of interrupt ✔ ✔ ✔

6 Interrupt Interrupt priority: polled and 5

6.3 chained interrupt ✔ ✔ ✔

DMA: block diagram and

6.4 Timing diagram ✔ ✔

Note: Define(SD), Description (D), Derive (Dr), Illustration (I), Explanation (E), Application (A), Experimentation (Ex), Numerical (N)

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
4
Laboratory

1. Familiarization with 8085 microprocessor trainer kit and simulator

2. Data transfer instructions

3. Arithmetic and logical instructions

4. Subroutine and branching instructions

5. Stack operations

6. Timers and delay

7. Code conversion

8. Familiarization with assembly language program, assembling and macro assembler

(MASM)

9. Operations related to data transfer, arithmetic and logical instruction in 8086

10. Operation related to case conversion (Upper case to lower case and vice-versa)

References:

2. Ramesh S. Gaonkar, ”Microprocessor – Architecture, Programming & Applications

with the 8085”, Penram International Publisher, 5th Ed., 2006

2. Douglas V. Hall, “Microprocessors & Interfacing: Programming & Hardware”, 2nd

Ed., Tata McGraw Hill, 2006

3. Ghosh, P. K., Sridhar P. R.,"0000 to 8085: Introduction to Microprocessors for Engineers

and Scientists", Second Edition, Prentice Hall of India Private Limited, 1997.

4. " Lance, A. Leventhal., "Introduction to Microprocessors: Software, Hardware, and

Programming”, Eastern Economy Edition, Prentice Hall of India Private Limited, 1995.

5. Malvino, A. P., "An Introduction to Microcomputers", Prentice Hall of India Private

Limited, 1995.

Final Examination Scheme:

Chapters Marks Remarks

1 4

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
1
 2 18

3 14

4 4

5 12

6 8

Total 60

Note: There might be minor deviation in mark distribution.

Mandatory: Marks should be evaluated based on solving steps.

Evaluation Scheme;
Marks Division
Question Type No. of Questions Marks Total Marks
Short 4 2 8
Medium 7 4 28
Long 3 8 24
Total 60

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
2
 PURBANCHAL UNIVERSITY

Model Questions Paper - 2023

LEVEL: - BE Computer/ Fourth Semester

SUBJECT: - Microprocessor FULL MARKS: - 60

TIME: - 03:00 hrs. PASS MARKS: - 24

Attempt all questions.

Group A [2X4=8]

1. “Microprocessor is commonly known as CPU”, justify the statement. Also if the microprocessor is of
8 bits, what does it specify? [2]
2. What are the general characteristics of microprocessor? Explain in brief. [2]
3. What is I/0 interface? Why it is needed? [2]
4. Differentiate between Register based and accumulator based microprocessor. [2}

Group B [4X7=28]

1. What do you mean by flag register in 8085A microprocessor? Explain in brief with example.
[1+3]
2. Draw a timing diagram for the instruction MVI M, 11H such that the instruction is in the location
BFFFH and the op-code as 67H. [4]
3. WAP in 8085 for 10ms of delay. [4]
4. What is addressing modes? Also explain any six addressing modes of 8086 microprocessor in brief.
[1+3]
5. Interface a 4KB ROM and two 8KB RAM memory chip with 8085 microprocessor. Also illustrate the
address range of the chip. [4]
6. What happen when microprocessor is interrupted? Classify the interrupt on the basis of priority.
[1+3]
7. Differentiate between maskable and non-maskable interrupt. [4]

Group C [8X3=24]

1. WAP in 8085 to provide the given on/off time to three traffic lights (Green, Yellow and Red) and
two pedestrian signs (WALK and DON’T WALK). The signal lights and signs are turned on/off by the
data bits of an output port as shown below.

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
1
 S.N Lights Data Bits On Time

1 Green D0 15seconds

2 Yellow D2 5 seconds

3 Red D4 20 seconds

4 WALK D6 15 seconds

5 DON’T WALK D7 25 seconds

The traffic and pedestrian flow are in the same direction, the pedestrian should cross the road
when the green light is on. [8]

OR

Write a program in 8086 that will display the string “electronics in purbanchal university”.Also
display each word in next line in uppercase. [8]

2. Write a block diagram of 8255 PPI. Also explain the function of each block in brief along with
control word. [8]

3. Draw the internal architecture of 8086 microprocessor. Explain about its two units along with
general registers and PSW. [8]
OR

Write a program in 8086 that will display the string “ExerCise”. Also count the number of vowels and store it
at variable count. [8]

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
2
 Purbanchal University
Faculty of Engineering, Biratnagar, Nepal

Syllabus
Level: Bachelor
Program: Bachelor in Computer Engineering
Subject: Communication System

Year-II Semester-IV

Teaching Schedule Examination Schedule Total

Hours/Week Final Internal Marks
Assessment
Theory Practical Theory Practical
Marks Marks
Credit L T P Total Duration Marks Duration Marks
Hours 40 25 125
3 3 1 3/2 5.5 3 Hrs. 60 - -
Note: L: Lecturer T: Tutorial P: Practical

Course Objectives: To familiarize the students of Computer Engineering with basic principles of analog
and digital communication.

1. Introduction 5 Hrs

Types, Representation and Properties of signals used in Communication system

Review of Fourier series
Fourier transforms and examples
Energy and power signal; Parseval’s theorem
Types and Properties of systems

2. Basic Communication System 2 Hrs

Block Diagram of Analog Communication System and concept of bandwidth

Need for modulation
Noise and its effect on communication systems

3. Transducers 2 Hrs

Introduction to Transducers
Types of different transducers: Audio, LVDT, Piezoelectric, Capacitive, Accelerometer, temperature
transducers

4. Continuous Wave Linear Modulation: 6 Hrs

Time domain expression, spectral representation, power, and transmission bandwidth of DSB-AM,
DSB-SC, SSB

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
3
 Generation methods of DSB-AM, DSB-SC, SSB
Demodulation of AM signals: Square law, envelope detection

5. Non-Linear Modulation 5 Hrs

Definition, time domain representation and transmission bandwidth of single tone modulated FM and
PM
Transmission bandwidth for FM, Carlson's rule
Narrow-band and wide-band FM
Generation methods of FM: Direct Method and Armstrong Method
Demodulation of FM: Limiter discriminator method.

6. Introduction to Digital Communication system 7 Hrs

Block Diagram of Digital Communication System; Advantages and Disadvantages to Analog

Communication System
Nyquist sampling theorem, sampling of band limited analog signals, spectrum of sampled signals,
Aliasing effects, reconstruction of original analog signal
Pulse Amplitude Modulation, bandwidth requirement and reconstruction methods
Pulse Code Modulation.
Quantization noise in PCM
Need for companding in PCM

7. Information Theory and Base band Digital Communication System 4 Hrs

Introductions to Information Theory: Definition of information and Entropy

Shannon’s channel capacity theorem and the information rate. Nyquist Data rate
Base-band (BB) digital communication system, Line coding schemes-NRZ,RZ, Manchester, AMI
Inter-symbol Interference

8. Modulated Digital Data Communication System: 3 Hrs

ASK, FSK, PSK

M-ary data communication systems and its impact on bandwidth
QPSK

9. Multiplexing Systems 3 Hrs

Introduction to Multiplexing, types of multiplexing – TDM, FDM

FDM in telephony hierarchy
TI and EI hierarchy in digital telephony and calculation of data rate
Introduction to Multiple Access Techniques – FDMA, TDMA, CDMA

10. Communication Systems: 8 Hrs

Satellite communication: system-block diagram and working principle

Terrestrial microwave links: block diagram, working principle and concept of Fresnel zone clearance
Optical fiber links: block diagram, working principle advantages of optical fiber, and types
Evolution of mobile communication system: 1G, 2G, 3G, 4G and 5G system architecture and features
BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
4
Laboratory works:

1. Modulation and Demodulation of DSBAM, DSBSC and SSB.

2. Modulation and Demodulation of FM.
3. Sampling and Reconstruction of signal.
4. Digital Modulation Techniques – ASK, FSK and PSK.
5. Multiplexing: TDM and FDM
6. Transducer.
7. Field visit to demonstrate nearest communication systems

References:

1. S. Haykin, "An introduction to Analog and Digital Communication" (Latest Edition)

2. Leon W. Couch , "Digital and Analog Communication System", Latest Edition, Pearson Education
Asia.
3. B.P. Lathi, "Modern Digital and Analog Communication Systems", Latest Edition.
4. J. Proakis, M. Saheli, "Communication Systems Engineering", Prentice Hall, New Jersey.
5. Harri Holma and Antti Toskala, "WCDMA for UMTS – HSPA evolution and LTE"

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
5
 Detailed Syllabus of Communication System
Note: Define(SD), Description (D), Derive (Dr), Illustration (I), Explanation (E), Application (A), Experimentation (Ex), Numerical (N)

Ch Depth
Topic Subtopic Hour Remarks
No. SD D DR I E A EX N

Types, Representation and Properties

1.1 ✓ ✓ ✓
of signals

1.2 Review of Fourier series ✓

1 Introduction 1.3 Fourier transforms and examples ✓ ✓ ✓ 5

Energy and power signal, Parseval’s

1.4 ✓ ✓
theorem

1.5 Types and Properties of systems ✓ ✓ ✓ ✓ ✓

Block Diagram of Analog

2.1 ✓ ✓
Communication System
Basic Communication
2 2
System 2.2 Need for modulation ✓ ✓

Noise and its effect on communication

2.3 ✓ ✓
systems

3.1 Introduction to Transducers ✓

3 Transducers 2
3.2 Types of different transducers: Audio, ✓ ✓ ✓
LVDT, Piezoelectric, Capacitive,

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
1
 Accelerometer, temperature
transducers

Time domain expression, spectral

4.1 representation, power, and transmission ✓ ✓ ✓ ✓
Continuous Wave Linear bandwidth of DSB-AM, DSB-SC, SSB
4 Generation methods of DSB-AM, DSB- 6
Modulation 4.2 ✓ ✓
SC, SSB

4.3 Demodulation of AM signals: Square ✓ ✓

law, envelope detection
Definition, time domain representation
5.1 and transmission bandwidth of single ✓ ✓ ✓ ✓
tone modulated FM and PM
5.2 Transmission bandwidth for FM, ✓ ✓
Carlson's rule
5 Non-Linear Modulation Narrow-band and wide-band FM 5
5.3 ✓

5.4 Generation methods of FM: Direct ✓ ✓

Method and Armstrong Method
5.5 Demodulation of FM: Limiter ✓ ✓
discriminator method.
Block Diagram of Digital
Communication System; Advantages ✓ ✓ ✓
6.1 and Disadvantages to Analog
Communication System
Nyquist sampling theorem, sampling of
Introduction to Digital band limited analog signals, spectrum of
6 7
Communication system 6.2 sampled signals, Aliasing effects, ✓ ✓ ✓ ✓
reconstruction of original analog signal
Pulse Amplitude Modulation,
6.3 bandwidth requirement and ✓ ✓ ✓
reconstruction methods
6.4 Pulse Code Modulation. ✓ ✓ ✓ ✓

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
2
 6.5 Quantization noise in PCM ✓ ✓

6.6 Need for companding in PCM ✓

7.1 Introductions to Information Theory: ✓ ✓

Definition of information and Entropy
Shannon’s channel capacity theorem
Information Theory and 7.2 and the information rate. Nyquist Data ✓ ✓
7 Base band Digital rate 4
Communication System Base-band (BB) digital communication
7.3 system, Line coding schemes-NRZ,RZ, ✓ ✓ ✓ ✓
Manchester, AMI
7.4 Inter-symbol Interference ✓

8.1 ASK, FSK, PSK ✓ ✓ ✓

Modulated Digital Data
8 8.2 M-ary data communication systems and ✓ 3
Communication System its impact on bandwidth
8.3 QPSK ✓ ✓ ✓

9.1 Introduction to Multiplexing, types of ✓ ✓ ✓

multiplexing – TDM, FDM
9.2 FDM in telephony hierarchy ✓ ✓ ✓
9 Multiplexing Systems 3
9.3 TI and EI hierarchy in digital telephony ✓ ✓ ✓
and calculation of data rate
9.4 Introduction to Multiple Access ✓ ✓ ✓
Techniques – FDMA, TDMA, CDMA
10.1 Satellite communication: system-block ✓ ✓ ✓
diagram and working principle
Terrestrial microwave links: block
Communication Systems
10 10.2 diagram, working principle and concept ✓ ✓ ✓ 8
of Fresnel zone clearance
Optical fiber links: block diagram,
10.3 working principle advantages of optical ✓ ✓ ✓
fiber, and types
BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
3
 Evolution of mobile communication
10.4 system: 1G, 2G, 3G, 4G and 5G system ✓
architecture and features

Note: Define(SD), Description (D), Derive (Dr), Illustration (I), Explanation (E), Application (A), Experimentation (Ex), Numerical (N)

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
4
 Final Examination Scheme:

Chapters Marks Remarks

1 6

2 2

3 2

4 10

5 8

6 10

7 4

8 4

9 4

10 10

Total 60

Note: There might be minor deviation in mark distribution.

Mandatory: Marks should be evaluated based on solving steps.

Evaluation Scheme;
Marks Division
Question Type No. of Questions Marks Total Marks
Short 4 2 8
Medium 7 4 28
Long 3 8 24
Total 60

Laboratory works:

1. Modulation and Demodulation of DSBAM, DSBSC and SSB.

2. Modulation and Demodulation of FM.
3. Sampling and Reconstruction of signal.
4. Digital Modulation Techniques – ASK, FSK and PSK.
5. Multiplexing: TDM and FDM
6. Transducer.
BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
1
 7. Field visit to demonstrate different communication systems

References:

1. S. Haykin, "An introduction to Analog and Digital Communication" (Latest Edition)

2. Leon W. Couch , "Digital and Analog Communication System", Latest Edition, Pearson Education Asia.
3. B.P. Lathi, "Modern Digital and Analog Communication Systems", Latest Edition.
4. J. Proakis, M. Saheli, "Communication Systems Engineering", Prentice Hall, New Jersey.
5. Harri Holma and Antti Toskala, "WCDMA for UMTS – HSPA evolution and LTE"

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
2
 • Modulation coefficient and percentage of modulation
8. Explain narrow band and wide band FM.
9. What are the advantages and disadvantages of digital communication
system compare to analog communication system.
Purbanchal University
Model Question 2023 10. Demonstrate your understanding on Line coding schemes of NRZ and AMI.
Program: BE Computer 11. Explain FSK and QAM modulation with their input and output diagrams.
Year: II Semester: IV
OR
Subject: COMMUNICATION SYSTEMS
Answer all questions Illustrate the similarities and differences between T1 and E1 in

Group-A (4 X 2 = 8) telecommunication.

1. Explain the purpose of Fourier Transform with an example. Group-B (8 X 3 = 24)

2. What do you mean by Transducer? Explain about audio transducers. 12. Interpret time domain and frequency domain DSB-SC. How can we
3. What do you mean by information? Why inter-symbol Interference is generate it?
occurs? 13. Explain Armstrong Method for the generation of FM signal.
4. What are FDMA and CDMA? 14. State and proof the sampling theorem
OR OR
Draw and label the block diagram of Satellite communication system. Draw and label the system architecture of 2G and 4G system along with
their major features.
Group-B (7 X 4 = 28)

5. State and prove the Parseval’s theorem.

6. Explain the need of modulation for communication
7. For an AM DSB Full carrier, envelop with +Vmax = 40v and Vmin = 2v.
Determine the following
• Peak amplitude of carrier
BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
1
 Purbanchal University
Faculty of Engineering, Biratnagar, NEPAL
Syllabus
Level: Bachelor
Program: Bachelor in Computer Engineering
Subject: Probability and Statistics

Year: II Semester: IV

Examination Scheme Total Marks

Teaching
Hours/week
Internal Final
Theory Practical Theory Practical
Credit
L T P Duration Marks Duration Marks
Hour
3 3 2 2 20 20 3 Hrs. 60 - - 100

Objectives:

1. To give an exposure to the students the basic concepts of probability and statistical methods
and their application.
2. To serve as a foundation to analyze problems in engineering applications through statistical
testing methods.

Course contents

Unit1. Descriptive Statistics [6 Hrs]

Measures of location: mean, combined mean, median, mode, partition values and their properties;
Measures of dispersion: absolute and relative measure of variation; standard deviation, variance and
Coefficient of variation

Unit 2. Correlation and Regression [5 Hrs]

Simple Correlation: Karl Pearson's correlation coefficient and its properties, Simple Linear Regression:
Model and assumptions of simple linear regression; Least square estimators of regression coefficients;
properties of regression coefficients; Coefficient of determination

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
2
Unit 3 Probability [6 Hrs]

Introduction of probability: Basic terminology in probability: random experiment ,sample space, trial
and events, type of events: mutually exclusive events, equally likely events, independent events;
Definitions of probability, basic principles of counting; Laws of probability: Additive and
multiplicative; Conditional probability; Bayes' Theorem.

Unit 4. Random Variable and Expectation [3 Hrs]

Random Variables: Discrete and continuous random Variables; Probability distribution of random
variables; Expected value of discrete & continuous random Variable.

Unit 5. Discrete Probability Distributions [5 Hrs]

Binomial distribution, condition for using for using binomial distribution, properties of binomial
distribution, Computing binomial probabilities, Fitting of binomial distribution; poisson distribution,
condition for using for using poisson distribution, properties of poisson distribution, Computing
poissson probabilities, Fitting of poissson distribution.

Unit 6. Continuous Probability Distributions [7 Hrs]

Normal distribution, standard normal distribution, curve of normal and standard normal distribution,
properties of normal distribution, computing normal probabilities, Measurement of areas under the
normal curve; student’s t-distribution and its application, chi-square distribution and its application

Unit 7. Estimation [4 Hrs]

Concept of sample, population, statistic, parameter, estimation and its types, criteria for good estimator,
confidential interval, standard error, confidential interval of mean for mean, confidential interval of
mean for the difference of two means, confidential interval of mean for proportion, confidential
interval of mean for the difference of two proportions.

Unit 8. Testing of hypothesis [8Hrs]

Concept of hypothesis testing; hypothesis and its types, level of significance, degree of freedom, error
in testing of hypothesis, z-test: for single proportion, for the difference of two proportions, for single
mean, for the difference of two means, t-test: for single mean, t-test for the difference of two means,
paired t-test, chi-square test: for goodness of fit, for independence of attributes, ,validity of chi-square
test.

Laboratory

Practical problems to be covered in computer lab using any one of application software( Excel, SPSS,
Minitab, etc.)
BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
3
References:

1. Gupta, S.C.. Fundamental of statistics, Sultan Chand and Sons, delhi

2. Richard A. Johnson, Miller and Freund's probability and Statistics for Engineers, 6th Edition,
Indian reprint: Pearson Education, 2001.
3. Ronald E. Walpole, R.H. Myers, S.L. Myers, and K. Ye, Probability and Statistics for
Engineers and Scientists, 7th Edition, Indian reprint: Pearson Education, 2005.
4. Gaire, Arjun Kumar,Probability and statistics for Engineers.
5. Poudel , Toya Narayan and Kunwar, Pradeep, Probability and statistics for Engineers, Sukunda
publication

Mark Scheme
Chapter Mark distribution
I 10
II 15
III 15
IV 5
V 5
VI 10
VII 5
VIII 15

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
4
 Detailed Course Contents of Probability and Statistics

Year: II Semester: IV

Unit 1. Descriptive Statistics [6 Hrs.]

Measures of location: mean, combined mean, median, mode, partition values(quartiles and
percentiles); Measures of dispersion: absolute and relative measure of variation; standard deviation,
variance and Coefficient of variation

Unit 2. Correlation and Regression [4 Hrs.]

Simple Correlation: Karl Pearson's correlation coefficient and its properties, Simple Linear Regression:
Model and assumptions of simple linear regression; Least square estimators of regression coefficients;
properties of regression coefficients; Coefficient of determination

Unit 3. Probability [5 Hrs.]

Introduction of probability: Basic terminology in probability: random experiment ,sample space, trial
and events, type of events: mutually exclusive events, equally likely events, independent events;
Definitions of probability, basic principles of counting; Laws of probability: Additive and
multiplicative(statement only); Conditional probability, Bayes' Theorem(statement only).

Unit 4. Random Variable and Expectation [2 Hrs.]

Random Variables: Discrete and continuous random Variables; Probability distribution of random
variables; Expected value of discrete & continuous random Variable.

Unit 5. Discrete Probability Distributions [5 Hrs.]

Binomial distribution, condition for using for using binomial distribution, properties of binomial
distribution(without proof), Computing binomial probabilities, Fitting of binomial distribution;
poisson distribution, condition for using for using poisson distribution, properties of poisson
distribution(without proof), Computing poissson probabilities, Fitting of poissson distribution.

Unit 6. Continuous Probability Distributions [7 Hrs.]

Normal distribution, standard normal distribution, curve of normal and standard normal distribution,
properties of normal distribution, computing normal probabilities, Measurement of areas under the
normal curve; student’s t-distribution and its application, chi-square distribution and its application

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
5
Unit 7. Estimation [4 Hrs.]

Concept of sample, sampling , determination of sample size, population, statistic, parameter, estimation
and its types, criteria for good estimator, confidential interval, standard error, confidential interval of
mean for mean, confidential interval of mean for the difference of two means, confidential interval of
mean for proportion, confidential interval of mean for the difference of two proportions.

Unit 8. Testing of hypothesis [8Hrs.]

Concept of hypothesis testing; hypothesis and its types, level of significance, degree of freedom, error
in testing of hypothesis, z-test: for single proportion, for the difference of two proportions, for single
mean, for the difference of two means, t-test: for single mean, t-test for the difference of two means,
paired t-test, chi-square test: for goodness of fit, for independence of attributes, ,validity of chi-square
test.

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
6
 PURBANCHAL UNIVERSITY

SEMESTER FINAL EXAM – 2023 (MODEL QUESTION)

LEVEL: B. E. (Civil)

SUBJECT: Probability & Statistics FULL MARKS: 60

TIME: 03:00 hrs PASS MARKS: 24

Group-A: Long answer type questions

Answer TWO questions [2 X 10 = 20]

1. Three different machines M1, M2, and M3 are used to produce similar electronic components.
Machines M1, M2, and M3 produce 20%, 30% and 50% of the components respectively. It is known
that the probabilities that the machines produce defective components are 1% for M1, 2% for M2, and
3% for M3. If a component is selected randomly from a large batch, and that component is defective,
find the probability that it was produced: (a) by M2, and (b) by M3.

2. In trying to evaluate the effectiveness in its advertising campaign, a firm compiled the following
information:

Year 2001 2002 2003 2004 2005 2006 2007

Advertising 12 14 17 22 35 42 50
Expenditure(‘000
Rs)
Sales(lakh Rs.) 5.1 5.5 5.8 7.0 7.5 8.2 9.5
(a) Obtain the regression equation of sales on advertising expenditure.
(b) Estimate the probable sales when advertisement expenditure is Rs. 65 thousand.

3. In an industry , 200 workers, employed for a specific job, were classified according to their
performance and training received/not received to test independence of a specific training and
performance. The is summarized as follows:
Performance Total
Good Not Good
Trained 100 50 150
Untrained 20 30 50
Total 120 80 200
Use chi-square test of independence at 5% level of significance and write your conclusion.

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
7
Group- B: short answer type questions

Answer EIGHT questions [8 X 5 = 40]

4. The following is the frequency distribution of the number of telephone calls received in 245
successive one-minute intervals at an exchange:

No. of calls 0 1 2 3 4 5 6 7
Frequency 14 21 25 43 51 40 39 12
Find mean and variance of number of calls per minute.

5. A company has bid on two large construction projects. The company president believes that the
probability of winning the first contract is 0.6, the probability of winning the second contract is 0.4,
and the probability of winning both contracts is 0.2.

a) What is the probability that the company wins at least one contract?

b) What is the probability that the company wins the first contract but not the second contract?

6. A random variable X has the following probability distribution:

Value of x -2 -1 0 1 2 3
P(x) 0.1 K 0.2 2k 0.3 K
(i) Find the value of k.
(ii) Find the expected value and variance of X.

7. A factory produces components of which 1% are defective. The components are packed in
boxes of 10. A box is selected at random.

a) Find the probability that the box contains exactly one defective component.

b) Find the probability that there are at least 2 defective components in the box.

8. A random sample of 100 items drawn from a large batch of articles contain 5 defective items. Find
95 % and 99% confidence limits for the proportion of defective items.

9. A random sample of size 50 was drawn and sample mean was found to be 90. Test whether this
sample could have come from a normal population with mean 100 and standard deviation 8 at 5%
level of significance.

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
8
10. A certain type of wooden beam has a mean breaking strength of 1500 kgs and a standard deviation
of 100 kgs. Find the relative frequency of all such beams whose breaking strengths lie between 1450
and 1600 kgs.

11. Distinguish between correlation and regression.

12.write short notes on the following

a) Primary and secondary data

b) Estimation

BE Computer Fourth Semester’s Syllabus of Purbanchal University Faculty of Engineering, Biratnagar, NEPAL
9