FOUR YEAR B. TECH. Second Year, 3rd SEMESTER Batch … Session 2019-20/Faculty of Engineering/B.TECH...Punjabi University, Patiala. Four Year B. Tech (ECM) Batch: 2018 / BOS: 2019

Punjabi University, Patiala. Four Year B. Tech (ECM) Batch: 2018 / BOS: 2019

ECE Department Page 1 of 29

FOUR YEAR B. TECH.

(Electronics and Computer Engineering)

Second Year, 3rd SEMESTER

Batch 2018

(Session 2019-2020)

SCHEME OF PAPERS

CODE TITLE OF PAPER

LOAD

L T P CR .

ECE

201

Electronic

Devices

3 1 0 3.5

ECM

201

Wave Propagation 3 1 0 3.5

ECM

202

Data

Communication

3 1 0 3.5

CPE

206

Visual

Programming

Using VB.NET

3 1 0 3.5

ECM

203

Data Structures

and Algorithms

3 1 0 3.5

BAS

202

Discrete

Mathematical

Structures

3 1 0 3.5

ECE

251

Electronic

Devices Lab*

0 0 2 1.0

CPE

256

Visual

Programming

Using VB.NET

Lab*

0 0 2 1.0

ECM

253

Data Structure

Lab*

0 0 2 1.0

** Environment &

Road Safety

Awareness

18 6 6 24

Total contact hours: 33

* ECE 251, CPE 256, ECM 253 are practical papers only. There will not be any theory

examination for these papers.

* * In addition to above mentioned subjects, there will be an additional course on

Environment & Road Safety Awareness as a qualifying subject.



Faculty of Engineering

Punjabi University, Patiala.

General Instructions to the Paper Setters

(Common for B.Tech. in Computer Scienc e Engineering, Electronics and Communication

Engineering, Electronics and Computer Engineering, Mechanical Engineering, Civil Engineering

and Integrated B.Tech./MBA Branches)

Applicable from 2014 Batch

The paper structure will be as shown below:

Pattern of Question Paper TITLE OF SUBJECT (CODE----)

Bachelor of Technology (Branch): ………..

End Semester Exam

TIME ALLOWED: 3 Hour

Roll . No………….

Maximum Marks: 50

Note:- Section C is compulsory. Attempt any six questions by selecting three

questions from section A & three questions from section B.

Section-A (From Section A of the syllabus) Q1. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q2. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q3. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q4. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

3x5

Section-B (From Section B of the syllabus) Q6. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q7. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q8. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q9. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q10. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

3x5

Section-C (From whole syllabus) Q11

a). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

b) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

c) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

d) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

e) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

f) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

g) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

h). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

i ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

j ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

10x2=20

Note for the paper set ter:

1. Total numbers of questions to be set are nine (11) as per the above format. 2. There will be FIVE questions in each of the Sections A and B. Each question will be of five

(05) marks. However, a question may be segregated into subparts.

3. Section C is compulsory and contains ten (10) sub -parts each of two (2) marks. 4. The maximum limit on numerical problems to be set in the paper is 35% while minimum

limit is 20%.

5. The paper setter shall provide detailed marking instructions and solutions to numerical problems for evaluation purpose in the separate white envelopes provided for solutions.

6. The paper setters should seal the internal & external envelope properly with signatures & cello tape at proper place.

7. Log tables, charts, graphs, Design data tables etc. should be specif ied, whenever needed. 8. Use of Scientific calculator should be clearly specified.



ECE 201 ELECTRONIC DEVICES

L T P Cr

3 1 0 3.5

Course Objective: Diodes and transistors are basic devices in electronic circuits. These

devices are made of semiconductor materials. To understand the operation of these devices,

basic knowledge of the structure of atoms and the interaction of atomic particles in the

semiconductor material are necessary. The p -n junction formed by adjacent p and n

semiconductors is the basis of the operation of the diodes and transistors. This course

discusses on the current flow across the p -n junction that contributes to the characteristics

of the diodes, BJTs and FETs. The objective of this course is to give understanding on how

current flows through the p -n junction and relating this phenomena to the characteristics

and operation of the diodes, bipolar and field -effect transistors. Students will learn the

applications of diode as clipper, clamper and rectifier, operation of BJTs, FETs, behavior

of BJTs at low frequency and working of SCR.

Section-A

Semiconductor Diodes: Qualitative analysis of a P -N junction as a diode, V-I

characteristics and its temperature dependence, Break down diodes, Varactor diode, Tunnel

diode, Semiconductor photo voltaic effect , Light emitting diodes.

Application of Diodes: Diodes as a clipper, Diode as a clamper, Sampling gate, Diode as a

rectifier: Half wave rectifier, Full wave rectifier, Bridge rectifier, ripple factor, regulation,

capacitor input fi lters, inductor input fi lter, L -type and π type-filters, Electronic Voltage

regulator (Series and Shunt type).

Transistor Characteristics: Junction transistor current components, Transistor as an

amplifier, Transistor construction: Common base, Common emitter, Common collector

configuration, Various regions, photo transistor.

Transistor at Low frequencies: Graphical analysis of CE configuration two port devices

and hybrid model, h -parameters, Conversion formulas for parameters of three

configurations. Analysis of a transistor amplifier circuit using h -parameter, Miller theorem

& its dual, comparison of amplifier configuration.

Section-B

Transistor Biasing and Thermal Stabilization: Need of biasing, Types of biasing circuits,

Operating point, Bias stability, Stabil ization against variation in Ico, V BE and β,

Compensation techniques, Thermal run away, Thermal stabili ty.

Field Effect Transistors: Junction field effect transistor, Pinch off voltage, JFET

characteristics, and equivalent circuit , MOSFETS, Their construction and characteristics,

Biasing of JFETs.

Thyristors : Thyristor family, SCR-static and dynamic characteristics, Thyristor

commutated Techniques, Two transistor analogy, Triggering circuits, Thyristor

applications.

Text Books

1. Electronics Devices by Robert Boylsted, Tata McGraw Hill publica tions. 2. Electronic Devices and circuits, MC-Graw Hill Publication 1997 edition by Millman

& Halkias.

3. Power Electronics by P S Bhimbra, Khanna Publishers.

Reference Books

1. Integrated Electronics by Millman & Halkias Mc -Graw Hill Publication 1997 edition.

2. Electronic Devices and Circuits, S. Salivahanan etal, Tata McGraw hill , New Delhi

3. Electron Devices by Floyd, Pearson Asia, 5th Edition, 2001. 4. Microelectronic Circuits by Sedra Smith, Oxford University Press.

http://www.academia.edu/4016409/Microelectronic_Circuits_by_Sedra_Smith_5th_edition



ECM 201 WAVE PROPAGATION

L T P Cr

3 1 0 3.5

Course Objective: To enhance student’s comprehensive capabilities in electromagnetic

field theory by study the behavior of stat ics and time varying electric and magnetic field in

a medium and transmission line.

Section-A

Basic of Electromagnetic: Del operator, Curl , Divergence, Gradient, Gauss divergence

theorem, Stokes theorem, Coulomb’s law, Gaussian law, Faraday’s law, Ampere’s law,

Boundary conditions at electric interfaces and magnetic interfaces, Maxwell’s equation in

integral and differential form for static and time varying fields, Transmission line equation,

primary and secondary constants ,condition for loss -less and distortion-less line, loading of

lines, quarter wave transformer, stub matching ,concept of VSWR and reflection

coefficients.

Section-B

Antenna parameters: Radiation resistance, Radiation pattern. Beam width, Gain, Directivity, Effective

height, Effective aperture, Polarization, Bandwidth and antenna temperature. Radiating Wire Structures:

Folded dipole, loop antenna. Principles of pattern multiplication, Broadside arrays, End fire arrays, Yagi-Uda

Antenna. Horn Antenna, Log Periodic Antenna, Antenna Measurements (Gain & Radiation

pattern).Propagation of Radio Waves: Friss Free Space Equation, Different modes of propagation: Ground

waves, Space waves, Surface waves and Troposphere waves. Ionosphere, Wave propagation in the Ionosphere.

Critical frequency, Maximum usable frequency (MUF), Skips distance.

Text books:

1. Kraus, Electromagnetics, McGraw Hill., New York 2. Sadiku, Elements of Electromagnetics, Oxford Press. 3. Antennas Analysis & Design- C.A.Balanis, John Wiley,1997

Reference books:

1. E.C. Jordan, Electromagnetic Waves and radiating systems, Prentice Hall of India, New Delhi.

2. Antennas Analysis & Design- C. A. Balanis, John Wiley,1997



ECM 202 DATA COMMUNICATION

Course Objectives

At the end of the course, the students will be able to:

L T P Cr

3 1 0 3.5

Build an understanding of the fundamental concepts of computer networking.

Familiarize the student with the basic taxonomy and terminology of the computer networking area.

Introduce the student to advanced networking concepts, preparing the student for entry Advanced courses in computer networking.

Allow the student to gain expertise in some specific areas of networking such as the design and maintenance of individual networks.

SECTION-A

Introduction, history and development of computer networks, Types of computer networks: LAN,

MAN, WAN, broadcast and point to point networks, Network topologies.

Layered Architecture: concept of layers, protocols, interfaces and services, The OSI Reference

Model, The TCP/IP Reference Model, Comparison of OSI and TCP/IP Models

Physical Layer: Concept of Analog & Digital Signal, Bandwidth, Transmission Impairments:

Attenuation, Distortion, Noise, Data rate limits: Nyquist formula, Shannon Formula, Switching:

Circuit Switching, Message Switching and Packet Switching, Comparison of Repeaters, Hubs,

Switches.

Transmission media: Twisted Pair, Co-axial Cables, Fiber Optics, Wireless Transmission: Radio

and Microwave and Infrared Transmission

SECTION-B

Data Link Layer: Data link layer Design Issues, Error Detection and Correction, Elementary data

link protocols: An Unrestricted Simplex Protocol, A Simplex Stop and Wait Protocol, A Simplex

Protocol for a Noisy Channel. Sliding window protocols: A One Bit Sliding Window Protocol, A

Protocol Using go back N, A Protocol using Selective Repeat, CSMA CSMA/CD Protocols.

Network layer: IP Addressing, IPV4 header, Fragmentation, Routing algorithms:-Shortest Path

Routing, Flooding, Distance Vector Routing and Link State Routing, Introduction to Congestion,

Congestion Control.

Transport layer: Introduction to Elements of Transport Protocols UDP, TCP Application layer: Electronic-mail, WWW, Domain Name System, SMTP, HTTP.

Recommended Books:

1. A. S. Tannenbaum. Computer Networks, 3rd Edition, Prentice-Hall.

2. D. E. Comer. Internetworking with TCP-IP: Principles, Protocols and Architecture, Vol I, 2nd Edition, Prentice Hall, 1991.

3. D. E. Comer and D. L. Stevens. Internetworking with TCP-IP: Design, Implementation, and Internals, Vol II, Prentice Hall, 1990.



CPE-206 VISUAL PROGRAMMING USING VB.NET

L T P Cr

3 0 0 3.0

Course Objectives

The student will use Visual Basic.Net to build Windows applications using structured and

object-based programming techniques. Students will be exposed to the fo llowing concepts

and/or skills:

Analyze program requirements

Explain the structure of Visual Basic .NET projects.

Design/develop programs with GUI interfaces

Code programs and develop interface using Visual Basic .Net

Perform tests, resolve defects and revise existing code

Identify the purpose of each major controls of the Visual Basic .NET IDE.

Explain basic programming practices that contribute

SECTION-A

Introduction to .NET: NET Framework features & architecture, CLR, Common Type

System, MSIL, Assemblies and class libraries.

Introduction to Visual studio : Project basics, types of project in .Net, IDE of VB.NET -

Menu bar, Toolbar, Solution Explorer, Toolbox, Properties Window, Form Designer, Output

Window, Object Browser. Event driven programming: Methods and Events.

The VB.NET Language: Variables, Declaring variables, Data Type of variables, Scope &

lifetime of a variable, Constants. Control flow statements: conditional statement, loop

statement. Msgbox & Inputbox. Arrays, types of array, String.

Working with Forms: Loading, showing and hiding forms, controlling One form within

another.GUI Programming with Windows Form: Textbox, Label, Button, Listbox,

Combobox, Checkbox, PictureBox, Radio Button, Panel, Scroll bar, Timer, List View, Tree

View, Toolbar, Status Bar. Their Properties, Methods and Events.

Common Dialog Controls: OpenFile Dialog, SaveFileDialog, FontDialog, ColorDialog,

Print Dialog.

MDI: SDI vs MDI, Designing menus, Adding Menus.

SECTION-B

Procedures And Classes : Collections, Subroutines, Functions, Passing variable, Number

of Argument, Optional Argument, Returning value from function, classes. Object & Classes,

Namespaces, Error Handling, Debugging.

Using ADO.Net: Connection, Data Adapter, Data Sets, Data Commands, Advance Data

Bound Controls, Introduction to Crystal Reports.

Building a custom window control: Adding new properties, methods and events, testing a

control, enhancing existing controls.

Introduction to Database Concepts: Data independence, DBMS Architecture, components

of a database system, Advantages and disadvantages of Database system, Schemas,

Instances, ER Model.

Introduction to Relational Database Management System: DDL statements: Table

Creation and Management: Create Alter, Drop and Rename Table, create view, DML

statements: select , insert, update and delete. TCL statement: Commit, Rollback. Integrity

Constraints in SQL: Primary key , Foreign Key, Not Null, Unique, Check, Basic SQL Query,

Note: This subject is common to all branches. Only basics of Database concepts and SQL are covered.

RECOMMENDED BOOKS:

1. Brian Siler & Jeff Spotts, “Microsoft Visual Basic.Net” 2. Matthew MacDonald, “.NET Insight for VB Developers” 3. “Mastering in VB.Net” 4. “Using Microsoft Visual Basic.NET” by Brian Siler and Jeff Spotts, Pearson Education. 5. Prateek Bhatia, Database Management system, Kalayani Publishers 6. Korth and Silberschatz Abraham, Database Concepts, McGraw Hall, 1991



ECM 203 DATA STRUCTURES AND ALGORITHMS

L T P Cr

3 1 0 3.5

COURSE OBJECTIVES:

To impart the basic concepts of data structures and algorithms

To understand concepts about searching and sorting techniques

To Understand basic concepts about stacks, queues, lists, trees and graphs

To understanding about writing algorithms and step by step approach in solving problems with the help of fundamental data structures

SECTION-A

Basic Data Structures and Operations on them: Arrays, Stacks and Queues and Their

Applications, Linked and Sequential Representation. Linked List, Representation of Linked List,

Multi-Linked Structures

Searching and Sorting: use of Various Data Structures for Searching and Sorting, Linear and Binary

Search, Bubble Sort, Insertion Sort, Shell Sort, Selection Sort. Merge Sort, Radix Sort, Quick Sort.

Hashing: Introduction to hash table, hash function, resolving collision by chaining and open

addressing, deleting items from a hash table.

SECTION-B

Trees: Definitions and Basic Concepts, Linked Tree Representation, Representations in Contiguous

Storage, Binary Trees, Binary Tree Traversal, Searching, Insertion and Deletion in Binary Trees,

Binary Search Tree, Heap and Heap Sort Algorithm, AVL Trees.

Graphs and Their Application, Sequential and Linked Representation of Graph-Adjacency Matrix,

Operations on Graph, Traversing a Graph, Dijkstra's Algorithm for Shortest Distance, DFS and BFS,

Minimal Spanning Tree.

File Organization: Sequential, Relative, Index Sequential.

Recommended Books:

1. Data structures: a Pseudocode Approach with-C, IInd Edition,' Cengage Learning (Thomson).

2. Fundamentals of Data Structures, CBS Publishers and Distributors, Delhi, Ellis HorwitZ and Sartaj Sahni.

3. An introduction to data structures with applications, Mc-Graw Hill Inc., J.P. Trembley and P.G, Sorensen.

4. Data Structures and Program Design in C Prentice Hall of India, 1992, Robort L. Kruse, Bruce P. Leung, Cluvis L. Tundo.

5. Data Structure using (C & C++, Sanjeev Kumar, Khanna Publishers.

6. A Simplified Approach to Data Structures, Shroff Publications,Vishal Goyal, Lalit Goyal and Pawan Kumar.



BAS-202 DISCRETE MATHEMATICS

L T P Cr

3 1 0 3.5

Course Objectives: Throughout the course, students will be expected to demonstrate their

understanding of Discrete Mathematics by being able to do each of the following:

1. Use mathematically correct terminology and notation.

2. Construct correct direct and indirect proofs.

3. Demonstrate different methods for Graphs, Boolean Algebra and

Switching Theory.

4. Apply logical reasoning to solve a variety of problems.

Course Content

Section-A

Relations and Functions: Binary Relations; Types of Relations; Compositions and inverse

of Relations; Equivalence Relations and Partitions; Partial Ordering Relations; Chains and

Anti-chains; Functions; Injective Functions, Surjective Functions, Bijective Functions; Sum

and Product of Functions; Inverse and Composition of Functions; Inclusion and Exclusion;

Pigeon-hole Principle; Linear Recurrence Relations with constant coefficients;

Homogeneous solutions; Particular solutions; Solution by Method of Generating Functions.

Algebraic Structures: Algebraic structures with one binary operation: semi -group, monoid

and groups; Cosets ; Lagrange’s Theorem (only statement); Homomorphism of groups.

Section-B

Introduction to Graphs: Graphs and their basic terminology; Multigraphs and Weighted

Graphs; Matrix representation of Graphs; Paths and Circuits; Shortest Paths in Weighted

Graphs; Dijkstra’s Algorithm; Planar Graphs; Euler’s Theorem; Eulerian Paths and Circuits;

Hamiltonian Paths and Circuits.

Boolean Algebra: Partial ly Ordered Set; Lattices and Algebraic System; Principle of

Duality; Distributive and Complemented Latt ices; Boolean Algebra; Boolean Functions and

Boolean Expressions; Disjunctive and Conjunctive Normal Forms; Appli cations of Boolean

Algebra in Switching Theory; Series and Parallel connections.

RECOMMENDED BOOKS:

1. C. L. Liu, Elements of Discrete Mathematics, 2nd Ed., Tata McGraw-Hill, 2000.

2. J. P. Tremblay and R. P. Manohar, Discrete Mathematics with Applications to

Computer Science, Tata McGraw-Hill, 1997.

3. K. H. Rosen, Discrete Mathematics and i ts Applications, 6th Ed., Tata McGraw-Hill,

2007.



ECE 251 ELECTRONIC DEVICES LAB

L T P CR

0 0 2 1.0

List of Experiments

1. Study of h-Parameters of CE transistor. 2. Study of h-Parameters of CB transistor. 3. Study of V-I characteristics of Photodiode. 4. Study of V-I characteristics of photo transistor. 5. Study of V-I characteristics of JFET. 6. Study of VI characteristics of MOSFET. 7. Study of Clipping & clamping CKT using Diode. 8. Study of V-I characteristics of SCR. 9. Study of Diode as rectifier. 10. Study of different fil ters. 11. Study of V-I characteristics of DIAC 12. Study of V-I characteristics of TRIAC. 13. Study the applications of Thyristor.

Special Note: In addition to above experiments, every student has to prepare a

working project/kit /hardware or software model based on the above

syllabus/experiments. 20% weightage (internal (10%) + external (10%)) will be

given for this during evaluations.



CPE – 256 VISUAL PROGRAMMING using VB.NET

L T P Cr

0 0 2 1

OBJECTIVE:-

The students are required to do following exercises:

1. Write a windows application to demonstrate control structures of VB.NET.

2. Write a windows application to demonstrate various controls of VB.NET.

3. Write a Windows application that functions like a Mathematical Calculator.

4. Write a windows application that functions like a Stopwatch.

5. Write a Windows application demonstrating the use of string functions.

6. Write a Windows application demonstrating the use of Arrays.

7. Write a windows application that functions like a Notepad (using Menu Editor, Common Dialog Control, Textbox's properties).

8. Write a windows application demonstrating the use of ADO.

9. Write a Windows application for building a user control.

10. Write a windows application demonstrating various MDI features supported in VB.NET.

11. Creation of tables, virtual tables and views in SQL

12. Viewing the contents of data dictionary

13. Insert, update, delete of table rows in SQL

14. Changing of schema

15. Practice of simple SQL queries



ECM-253 DATA STRUCUTRE USING C++ LAB

L T P Cr

0 0 2 1.0

List of Experiments

1. Write a program to check whether a string is palindrome or not

2. Write a program to extract substring from given string.

3. Write a program to implement stack using arrays.

4. Write a program to implement queues using arrays.

5. Write a program to sort a given list of numbers using following algorithm.

1. Bubble sort

2. Insertion sort

3. Selection sort

4. Quick sort

5. Radix sort 6. Write a program to implement linear and binary search algorithm.

7. Write a program to create a linked list and perform following operations:

1) Insert element at beginning.

2) Insert element at end.

3) Insert element at given position.

4) Delete element from beginning

5) Delete element at end.

6) Delete element from given position.

8. Take a list of numbers and create a sorted linked list from given list

9. Implement stack using linked representation.

10. Implement queue using linked representation.


working project/kit /hardware or software model based on the above

syllabus/experiments. 20% weightage (internal (10%) + external (10%)) will be

given for this during evaluations.



All UG Courses - II Year

Environmental and Road Safety Awareness

Time Allowed : 3 hours Total Marks : 100

Total lectures : 50 Pass marks : 35

Instructions

a) The paper has been introduced from the session 2013-14. b) The paper will be taught in the Second year/fourth Semester of all the U.G. Courses (B.A.,

B.Com., B.Sc., Law, Engineering, Commerce, Agriculture etc.) except LL.B. three year

course and will be a qualifying paper only. The marks of this paper will not be counted

towards final score of the under graduate degree.

c) This will cover only preliminary and basics of the subject and the paper will be set accordingly.

d) The written paper will have two parts. Each part of the paper will be of 50 marks and will contain ten questions. The candidates will attempt five questions out of each part. The

answer to each question should not exceed 500 words. Each question will carry ten marks.

Section – I

Unit 1 : The multidisciplinary nature of environmental studies. Definition, scope and importance

Concept of Biosphere – Lithosphere, Hydrosphere, Atmosphere.

Need for public awareness (6 lectures) Unit – 2 Natural Resources – Renewable and non-renewable resources.

Natural resources and associated problems. a) Forest resources : use and over exploitation, deforestation and its impact. b) Water resources ; use and overutilization of surface and ground water and its

impact.

c) Mineral resources : use and effects on environment on over exploitation. d) Food resources : Effects modern agriculture, fertilizer-pesticide problem, water

logging and salinity.

e) Energy resources : Growing energy needs, renewable and non-renewable energy sources, use of alternate energy resources.

f) Role of an individual in conservation of natural resources for sustainable development. (7 lectures)

Unit 3 : Ecosystems

Ecosystem and its components : Definition, structure and function; producer, consumer and decomposer.

Types of Ecosystem (Introduction only)

Food Chains, food web and ecological pyramids (6 lectures) Unit – 4 : Biodiversity and conservation

Introduction – Definition : genetic, species and ecosystem diversity, value of biodiversity.

Hot spots of biodiversity

Threats to biodiversity : habitat loss, poocting of wildlife, man-wildlife conflicts.

Endangered and endemic species of India.

Conservation of Biodiversity. (6 lectures) Section – II

Units 5 : Environmental Pollution

Definition, causes, effects and control measures of a) Air pollution b) Water pollution c) Soil pollution d) Marine pollution e) Noise pollution f) Thermal pollution g) Nuclear hazard

Role of an individual in prevention of pollution.

Solid waste management : vermicomposting.

Disaster management : Floods, earthquake, cyclone and landslides (7 lectures) Unit 6 : Social Issues and the Environment

Urban problems related to energy.

Water conservation rain water harvesting, water shed management.

Resettlement and rehabilitation of people : its problems and concerns.

Climate changes, global warming, acid rain, ozone layer depletion.



Consumerism and waste products.

Population explosion – Family welfare programme (6 lectures) Unit 7 : Introduction to Environmental Protection Laws in India

Environmental Protection Act.

Air (Prevention and control of pollution) Act.

Water (Prevention and Control of pollution) Act.

Wild life Protection Act.

Forest Conservation Act.

Issues involved in the enforcement of environmental legislation. (6 lectures) Unit 8 : Road safety Awareness

Concept and significance of Road safety.

Traffic signs.

Traffic rules.

Traffic Offences and penalties.

How to obtain license.

Role of first aid in Road Safety. (6 lectures)



FOUR YEAR B. TECH.

(Electronics and Computer Engineering)

Second Year, 4th SEMESTER

Batch 2018

(Session 2019-2020)

SCHEME OF PAPERS

CODE TITLE OF PAPER

LOAD

L T P CR .

ECE

209

Digital Electronic

Circuits

3 1 0 3.5

ECE

210

Analog Electronic

Circuits

3 1 0 3.5

ECM

205

Computer System

Architecture

3 1 0 3.5

ECM

206

Operating System 3 1 0 3.5

ECE

213

Circuit Theory 3 1 0 3.5

ECE

214

Signals & Systems 3 1 0 3.5

ECM

254

Analog and Digital

Electronic Circuits

Lab*

0 0 2 1.0

ECM

256

Operating System

Lab*

0 0 2 1.0

ECE

263

Circuit Theory

Lab*

0 0 2 1.0

** Punjabi 3 0 0 0

21 6 6 33

Total contact hours: 33

* ECM 254, ECM 256, ECE 263 are practical papers only. There will not be

any theory examination for these papers.

* * In addition to above mentioned subjects, there will be an additional

course on Punjabi as a qualifying subject.



Faculty of Engineering

Punjabi University, Patiala.

General Instructions to the Paper Setters

(Common for B.Tech. in Computer Science Engineering, Electronics and

Communication Engineering, Electronics and Computer Engineering, Mechanical

Engineering, Civil Engineering and Integrated B.Tech./MBA Branches)

Applicable from 2014 Batch

The B. Tech paper structure will be as shown below:

Pattern of Question Paper TITLE OF SUBJECT (CODE----)

Bachelor of Technology (Branch): ………..

End Semester Exam

TIME ALLOWED: 3 Hour

Roll . No………….

Maximum Marks: 50

Note:- Section C is compulsory. Attempt any six questions by selecting three

questions from section A & three questions from section B.

Section-A (From Section A of the syllabus) Q1. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q2. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q3. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q4. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

3x5

Section-B (From Section B of the syllabus) Q6. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q7. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q8. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q9. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Q10. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

3x5

Section-C (From whole syllabus) Q11

a). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

b) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

c) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

d) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

e) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

f) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

g) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

h). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

i ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

j ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

10x2=20

Note for the paper set ter:

1. Total numbers of questions to be set are nine (11) as per the above format. 2. There will be FIVE questions in each of the Sections A and B. Each question will

be of five (05) marks. However , a question may be segregated into sub parts.

3. Section C is compulsory and contains ten (10) sub -parts each of two (2) marks. 4. The maximum limit on numerical problems to be set in the paper is 35% while

minimum limit is 20%.

5. The paper setter shall provide detailed marking instructions and soluti ons to numerical problems for evaluation purpose in the separate white envelopes

provided for solutions.

6. The paper setters should seal the internal & external envelope properly with signatures & cello tape at proper place.

7. Log tables, charts, graphs, Des ign data tables etc. should be specified, whenever needed.

8. Use of Scientific calculator should be clearly specified.



ECE 209 DIGITAL ELECTRONIC CIRCUITS

L T P CR

3 1 0 3.5

Course Objectives: At the end of this course, the student should be able to demonstrate the ability

to use logic gates, Basic Boolean laws, minimization techniques for the designing of various

combinational circuits. The student should also be able to describe operation, characteristic

equations, excitation table of various flip flops and explain the conversion of flip flops. Design

and analyze sequential circuits from the basic building blocks and describe memories, A/D, D/A

Converters, Logic families and their characteristics.

Section-A

Review of Number Systems, Codes and Gates , Evaluating logic circuit outputs,

Implementing circuits from Boolean expressions. Boolean theorems, DeMorgan's

theorem, universality of NAND and NOR gates, IEEE/ANSI standard logic

symbols.

Combinational Logic Circuits: Sum of product form, Product of sum form,

Simplification of Boolean functions using algebraic and Karnaugh map methods.

Half adder, Full adder, half subtractor, full subtractor circuits, parity generator

and checker circui ts, comparator circuit.

Combinational digital circuit design : Multiplexer, Demultiplexer, Code

converters, Combinational logic circuits. Some examples of Boolean gate ICs.

Sequential Circuits: RS, JK, D and T fl ip-flops circuits and their conversions,

Serial and parallel counters and shift registers, Universal shift registers, some

examples of counter and shift register ICs.

Section-B

Logic families and digital ICs: Characteristics of digital ICs, Classification of

different logic families: TTL, ECL, MOS and CMOS, their operation and

specifications.

Memories: Semi-conductor memories, ROM and RAM, ROM using diodes, BJTs,

and FETs. RAM cell . Memory organization and expansion. An idea about other

types of memories.

Digital to Analog and Analog to Digital Converters: Variable register network,

R-2R D/A converters. D/A accuracy and resolution, A/D converters,

Simultaneous conversion and counter method.

Recommended Books:

1. Digital Design by Morris Mano, PHI, 4th edition 2008

2. Digital principles and Applications, by Malvino Leach, TMH 2011

3 Digital System Principles and Applications, by R J Tocci (PHI) 2009

4 Modern Digital Electronics, by R P Jain, TMH 2006

5 Digital Integrated Electronics, by Taub Schilling, TMH 2004

Course Outcomes: By the end of this course the student will be able to

1 Identify the components and design combinational and sequential circuits using them.

2 Compare the different logic families, memories and A/D-D/A converters.

3 Design an application based on digital circuits.



ECE 210 ANALOG ELECTRONIC CIRCUITS

L T P CR

3 1 0 3.5

Course Objective: Through this course, the students will acquire knowledge of: -

The behavior of BJTs at high frequency using pi -model, -Develop the ability to

analyze and design analog electronic circuits using discrete components, -Concept

of feedback used in amplifiers and its need, -Working of power amplifiers, power

amplifier circuits, tuned amplifiers, Oscil lators, compare experimental results in

the laboratory with theoretical analysis.

Section-A

High Frequency Transistor: The high frequency T model, CB short circuit

current frequency response, Alpha cut -off frequency, CE short circuit current

frequency response, Hybrid pi CE transistor model, hybrid pi conductance in

terms of low frequency h – parameters, CE short circuit current gain obtained

with hybrid pi model, current gain with resistive load.

Feedback Amplifier: Classification of amplifier, Feedback concept, General

characteristics of negative feedback amplifiers, Analysis of a feedback amplifier,

Various types of feedbacks and their effects on amplifier performance.

Section-B

Power Amplifiers: Class A large signal amplifier, second and higher harmonic

distortion, transformer coupled amplifiers, Efficiency of amplifiers, Push -pull

amplifiers (class A & class B).

Tuned Amplifiers: Single tuned capacitively coupled amplifier & its steady state

response, Determination of Gain, Bandwidth product, Tapped tuned, Inductively

coupled single tuned circuit, Double tuned circuits.

Oscillators: Condition for sustained oscillation, R -C phase shift, Hartley,

Colpitts , Crystal and Wien Bridge Oscillators.

Text Books

1. Electronics Devices by Robert Boylsted, Tata McGraw Hill publications. 2. Electronic Devices and circuits, MC-Graw Hill Publication 1997 edition by Millman &

Halkias.

3. Malvino, " Electronic Principles" Prentice Hall of India, New Delhi.

Reference Books

1. Integrated Electronics by Millman & Halkias Mc-Graw Hill Publication 1997 edition. 2. Electronic Devices and Circuits, S. Salivahanan etal, Tata McGraw Hill, New Delhi. 3. Electron Devices by Floyd, Pearson Asia, 5th Edition, 2001. 4. Liner Integrated circuits by Gayekward. 5. Engineering Electronics by Alley & Attwood. 6. Burns and Bond, "Principles of Electronic Circuits" PWS Publishing Company Boston.



ECM 205 COMPUTER SYSTEM ARCHITECTURE

L T P Cr

3 1 0 3.5

Course Objectives:

To have a thorough understanding of the basic structure and operation of a digital

computer.

To discuss in detail the operation of the arithmetic unit including the algorithms & implementation of fixed-point and floating-point addition, subtraction,

multiplication & division.

To study the different ways of communicating with I/O devices and standard I/O

interfaces.

To study the hierarchical memory system including cache memories and virtual

memory

SECTION-A

Introduction: Design of basic computer, Registers, Accumulator, Flags, Program Counter,

Stack Pointer, Machine Instructions, Instruction Cycle, Machine Cycle, Components of CPU.

Register Transfer and Micro operations: Register transfer Language, Register transfer,

Bus & memory transfer, Logic micro operations, Shift micro operation.

Controller Design: Hardwired and Micro programmed Approach.

Micro program Control Organization: Control Memory Address Sequencing, Micro

program Sequences, Microinstruction Formats, and Addressing modes.

Arithmetic Unit: Comparison and Subtraction of unsigned Binary Numbers, Addition,

Subtraction, Multiplication Algorithm.

SECTION-B

Memory System: Memory - CPU interaction, Principle of locality (Temporal and Spatial).

Memory Organization: Interleaved Memory Organization, Memory Hierarchy, Main

Memory, Virtual Memory, Cache Memory, Cache Organization (Direct, Fully Associative,

Set Associative), Cache Coherence, Memory Management Hardware, Performance

Considerations.

Input-Output Organization: I/O interfaces and Buses, I/O operations, Program driven

Input- Output, Interrupt driven Input-Output, DMA, Priority Interrupt.

Pipeline Processing: Overview of Pipelining, Types of Pipelining, Hazards (Data, Control,

Structural).

Computer Peripherals and Interfaces: Introduction to I/O buses: ISA, PCI, SCSI, EISA,

Local bus, VESA Local bus, PCI bus, PCI Express, Accelerated graphics port bus.

Recommended Books:

1. Computer System Architecture: M.M. Mano, Prentice Hall of India.

2. Structured Computer Organization: Andrew S. Tanenbaum, Prentice Hall of India

3. J.P. Hayes, Computer Systeui Architecture, Prentice Hall of India, New Delhi.

4. Ali leigh. System Architecture, South wester publishing co. New Delhi.

5. William Stallings, “Computer Organization and Architecture – Designing for Performance”, 6th Edition, Pearson Education, 2003.



ECM 206 OPERATING SYSTEMS

L T P Cr

3 1 0 3.5

Course objectives:

• To learn the fundamentals of Operating Systems.

• To learn the mechanisms of OS to handle processes and threads and their

communication

• To learn the mechanisms involved in memory management in

contemporary OS

• To gain knowledge on distributed operating system concepts that includes

architecture,

Mutual exclusion algorithms, deadlock detection algorithms and agreement

protocols

• To know the components and management aspects of concurrency

management

• To learn programmatically to implement simple OS mechanisms

SECTION-A

Basic Functions and Concepts of Operating Systems: Concept of an

operating system, batch system, Multi -programmed, Time sharing, Personal

Computer System, Parallel system, Real time system, Network Operating

System and Distributed Operating System.

Features and Objective of Operating Systems: System components,

operating system services, System calls, System Programmers, System

Structure: Simple Structure, Layered Approach, Microkernel

Process Management: Concept of process, process states, process control

block, Process Scheduling: Scheduling Queues, Schedulers, and Context

Switch, operations on processes CPU scheduling Algorithms: FCFS, SJF,

RR and priority, Multilevel queue scheduling, Multi level

feedback queue scheduling

Deadlocks: Introduction to deadlocks, Necessary Conditions for deadlock,

Resource allocation graph, Deadlock Prevention, Deadlock Avoidance: Safe

state, Resource-Allocation-Graph Algorithm, Banker's Algorithm,

Deadlock Detection, Recovery from Deadlock

SECTION-B

Memory Management: Logical and physical address space, Swapping,

Contiguous memory Allocation: Memory Protection, Memory Allocation,

Fragmentation, paging: basic method, Protection and shared pages,

segmentation: basic method, hardware, Protection and sharing, virtual

memory, Demand Paging, Page Replacement Algorithms ((FIFO, Optimal,

LRU, LRU Approximation page replacement), Allocation of Frames,

Thrashing.

Information Management: Files - fi le concept, file types, File attributes,

file operations, access methods, al location methods (contiguous, linked,

indexed), directory structure free -space management (bit vector, linked list ,

grouping, counting) ,

Disk Management: Disk structure, Disk Scheduling (FCFS, SSTF, SCAN,

C-SCAN, LOOK), Disk Management (Disk Formatting, Boot Block, Bad

Blocks), Swap Space Management: Swap Space Use, Swap Space Location.

Case Studies: Brief introduction of Windows, UNIX and LINUX.

Recommended Books:

1. Operating System: (Sixth Edition) 2005: Galvin Silberschatz, Addison

Wesley Publishing Ltd.

2. Flynn "Understanding operating Systems", Cengage Learning (Thomson)

3. DM Dhamdhere, "Operating System r A Concept Based Approach", Tata

Me Graw- Hill.



4. Operating Systems Design and Implementation: Andrew S. Tanembaum,

PHI (Latest Edition).



ECE 213 CIRCUIT THEORY

L T P CR

3 1 0 3.5

Course Objective: The study of electrical circuits takes off from principles of AC and DC theory

and introduces the student to parameters and characteristics of various networks. The aim of the

subject to understand the different types of circuits and their analysis based on network theorems

and to determine the current, voltage and power in the circuit. The students will be able to analyze

two port networks, stability of a circuit and to find time response of the circuit. The circuits are

designed using Foster and Cauer forms. The knowledge of Laplace's transform and Inverse

will help students to work in multi-disciplinary fields of electronics engineering.

Section-A

Network Theorems and Two Port Network Descriptions: Thevenin's theorem

as applied to ac circuits , Norton's theorem as applied to AC circuits,

Superposition theorem as applied to ac circuits, Maximum power transfer theorem

as applied to A.C. Circuits, Two port description in terms of open circuits,

impedance Parameters, Short circuit admittance parameters, Hybrid parameter s

and transmission, Inter -connection of two port network, Duality networks.

Inductively Coupled Circuits : Coefficient of coupling, mutual inductance in

loop and nodal equations.

Section-B

Time Domain Analysis: Unit functions-step, impulse and ramp funct ions,

Laplace's transform and Inverse, Solution of network problems using Laplace

transform, Solution of Transient and Steady state response of RL & RC networks

with different types of forcing functions. Solutions of transient and steady state

response of series RLC circuit with step input.

Network Synthesis: Synthesis vs. Analysis, Elements of circuit synthesis,

Introduction and general considerations in network synthesis, Purpose and scope

of network synthesis.

Positive Real Functions: Definition, Necessary and Sufficient conditions for a

function to be positive real , testing of driving point functions for positive

realness.

Foster & Cauer Forms: Foster and Cauer Forms realization in terms of RC, RL

and LC networks.

Text Books:

1. Sudhakar & Shyammohan, “Circuits & Networks”, Tata McGraw Hill. 2. Joseph Administer, “Circuit Theory”, S. Chand Series 3. Abhijit Chakarbarti, “Circuit Theory”, Dhanpat Rai & Sons, New Delhi 4. Vanvalkenberg, “Network Analysis”, Prentice Hall 5. D. Roy Choudhary, “Networks & Systems”, New Age International, New Delhi. 6. Vanvalkenberg, M.E., “Networks Analysis”, P rentice Hall of India (2007) 3rded. 7. Arshad, M., “Network Analysis and Synthesis”, Laxmi Publications (2008) 2nded.

Reference Books:

1. Franklin F. Kuo, Network Analysis and Synthesis, John Wiley (2003) 2nd ed. 2. Anderson, B.D.O., Vongpanitlerd, S., Network Analysis and Synthesis, Dover Publications

(2006) 3rd ed.

3. Charles A. Desoer, Ernest S. Kuh, “Basic Circuit Theory”, McGraw-Hill Book Company. 4. William H. Hayt Jr., Jack E. Kemmerly, “Engineering Circuit Analysis” McGraw-Hill

Book Company

http://privateweb.iitd.ernet.in/~shouri/index.htmlhttps://archive.org/details/EngineeringCircuitAnalysis_280



ECE 214 SIGNALS AND SYSTEMS

L T P CR

3 1 0 3.5

Course Objectives: The aim of this subject is to develop analytical capability of students, by

which they would be able to handle real time signal processing related problems and projects. The

understanding of various transforms will help the students to analyze the problems in both time

and frequency domain.

Couse Outcomes: The student will be able to:

explain the basic theory for discrete and continuous time signals and systems, and how they interact in the time and the frequency domain.

explain the basic principles for sampling of continuous time signals, the sampling theorem, and signal reconstruction,

analyze random phenomena and compute probabilities of random events and moments of random variables.

Section-A

Representation of Signal and Systems: Classifications of signals, Linear time

invariant systems, Representation of signals in terms of impulses, Discrete time

LTI systems, continuous time LTI systems, Properties of LTI systems, Systems

described by differential and difference equations.

Section-B

Fourier analysis: Signal representation using Fourier series, Representation of

periodic signals. Continuous and discrete t ime Fourier series, Exponential Fourier

series, Properties of Fourier series, Convergence of Fourier series, Continuous

and Discrete time Fourier transform, Properties of Fourier transform, Analysis of

discrete time signals and systems, Correlation, Autocorrelation.

Random Signals: Probability, Random variables, Probability density and

distribution functions, Moments of random variables, Random processes,

Transmission of signals through LTI systems, Gaussian Process, Central Limit

Theorem.

Recommended Books:

1. Oppenheim, Willisky and Nawab, "Signals & Systems", Tata Mcgraw

Hill,New Delhi.

2. Simon Haykin and Barry Van Been, “Communications System", Wiley

Eastern, USA

3. B.P.Lathi, “Communication Systems", Oxford Press, USA

4. A. Papouils, "Random Variables & Stochastic Process", Mcgraw Hill , USA

Reference Books/Articles:

1. Charles L. Philips, John M. Parr, Eve A. Riskin, “Signals, Systems and Transform”, Prentice Hall Third Edition 2003.



ECM 254 ANALOG ELECTRONIC CIRCUITS LAB

L T P Cr

0 0 2 1.0

List of Experiments

1. To plot frequency response characterist ics of a RC Single stage RC coupled Amplifier.

2. To determine the voltage gain of a two stage RC coupled amplifiers. 3. To plot frequency response characteristics of Transformer coupled

amplifier.

4. To plot frequency response of a tuned voltage amplif ier and to calculate its resonant frequency.

5. To find voltage gain of an emitter follower and find its operating point . 6. To study Wein Bridge Qscillator. 7. To study Phase Shift Qscillator. 8. To study OP-Amp as differentiator & Integrator. 9. To study diode as a biased and unbiased clipper. 10. To study Astable Multivibrator using Transistors.

11. To study Bistable Multivibrator using Transistors.

12. To study OP-Amp as an inverting and non-inverting amplifier.

13. To study OP-Amp as summing and Average Amplifier.

14. To study the frequency response of audio amplifier.


working project/kit/hardware or software model based on the above

syllabus/experiments. 20% weightage (internal (10%) + ex ternal

(10%)) will be given for this during evaluations.



ECM 256 OPERATING SYSTEM LAB

L T P Cr

0 0 2 1.0

Hardware Lab

List of Experiments:

1. Identification of various computer components: Motherboard, Processor, System

buses, Expansion Buses and PC Power supplies, Memories etc.

2. PC assembling

Operating Lab

List of Experiments:

1. Familiarization of UNIX/LINUX Environment.

2. Installation and Administration of UNIX/LINUX operating system.

3. Implementation of common commands of UNIX operating systems.

4. Working on vi editor using its different modes.

5. Redirection of input and output using Filters and Pipes.

6. Shell programming and its features.

7. Implementation of programs using shell scripts.

Recommended Books:

1. Forouzan UNIX and Shell Programming 1st Edition, Cengage L

earning (Thomson)

2. Subhadeep Choudhury ‘The A to Z of PC hardware and Maintenance’, Dhannpat Rai & Co.



syllabus/experiments. 20% weightage (internal (10%) + external




ECE 263 CIRCUIT THEORY LAB

L T P Cr

0 0 2 1.0

List of Experiments

Exp No.

1. To study and verify Thevenin's Theorem.

2. To study and verify Norton's Theorem.

3. To study and verify Reciprocity Theorem.

4. To study and verify Maximum Power Transfer Theorem.

5. To study and verify Superposition Theorem.

5. To plot step Response of series RLC Circuit.

6. To plot step response of series RC Circuit.

7. To solve mesh equations using Matlab.

8. To solve nodal equations using Matlab.

9. To plot frequency Response of a given transfer function using Matlab.

10. To find laplace transforms of a given sinusoidal signal using Matlab.

11. To study and verify Kirchhoff 's Voltage Law.

12. To study and verify Kirchhoff 's current Law.

13. To calculate and verify Z-parameters of a T-Network.

14. To calculate and verify-parameters of a Pi network.

15. To calculate and verify Transmission parameters of a cascaded network.



syllabus/experiments. 20% weightage (internal (10%) + external




ਅੰਡਰ ਗ੍ਰੈਜੂਏਟ ਪੱਧਰ ਤੇ ਪਰੋਫ਼ੈਸ਼ਨਲ ਕੋਰਸ ਾਂ ਲਈ ਕੁਆਲੀਫ ਇੰਗ੍ ਪੰਜ ਬੀ

2016–2017, 2017–2018 ਅਤੇ 2018–2019 ਸੈਸ਼ਲ ਲਈ ਸਸਲੇਬਸ

ਕੱੁਲ ਅੰਕ: 100 ਸਲਖਤੀ: 60 ਅੰਕ

ਸਮ ਾਂ: 3 ਘੰਟੇ ਇੰਟਰਨਲ ਅਸੈਸਮੈਂਟ: 40

ਅੰਕ

ਪੀਰੀਅਡ: 3 ਪਰਤੀ ਹਫ਼ਤ ਪ ਸ ਅੰਕ: 40%

ਕੁਆਲੀਫ ਈ ਾਂਗ੍ ਪੰਜ ਬੀ

ਪੰਜਾਬੀ ਯੂਨੀਵਰਸਿਟੀ ਸਵਖੇ ਬੀ .ਟ ੈੱਕ . ਦੇ ਸਵਸਦਆਰਥੀਆਂ ਨੰੂ ਪੰਜਾਬੀ ਕੁਲਾਈਫਾਈਗਂ ਸਵਸ਼ੇ ਵੈੱਜੋਂ

ਪੜ੍ਹਾਉਣ ਦਾ ਮੁੈੱਖ ਉਦੇਸ਼ ਸਵਸਦਆਰਥੀਆਂ ਨੰੂ ਪੰਜਾਬੀ ਭਾਸ਼ਾ , ਿਾਸਿਤ ਅਤੇ ਿੈੱ ਸਭਆਚਾਰ ਨਾਲ ਜੋੜ੍ ਕੇ

ਰੈੱਖਣਾ ਿ । ਮੁੈੱਖ ਰੂਪ ਸਵਚ ਕੁਆਲੀਫਾਈਗਂ ਪੰਜਾਬੀ ਰਾਿੀ ਂ ਸਵਸਦਆਰਥੀਆਂ ਨੰੂ ਮਾਤ ਭਾਸ਼ਾ ਸਵਚ ਸਲਖਣ ,

ਬੋਲਣ , ਪੜ੍ਹਨ ਦੀਆਂ ਿਮੈੱ ਸਿਆਵਾਂ ਨੰੂ ਦੂਰ ਕਰਨ ਦੇ ਨਾਲ–ਨਾਲ ਪੰਜਾਬੀ ਿੈੱ ਸਭਆਚਾਰ ਅਤੇ ਨ ਸਤਕ

ਕਦਰਾਂ–ਕੀਮਤਾਂ ਨਾਲ ਜੋੜ੍ ਕੇ ਰੈੱਖਣ ਦਾ ਉਪਰਾਲਾ ਕੀਤਾ ਜਾਂਦਾ ਿ ।

1. ਪੰਜ ਬੀ ਦੀ ਪ ਠ–ਪੁਸਤਕ

(ਮੁੈੱਖ ਿੰਪਾਦਕ : ਬਲਦੇਵ ਸਿੰਘ ਚੀਮਾ , ਪਰਕਾਸ਼ਕ ਪਬਲੀਕੇਸ਼ਨ ਸਬਊਰੋ , ਪੰਜਾਬੀ ਯੂਨੀਵਰਸਿਟੀ , ਪਸਟਆਲਾ)

ਭ ਗ੍ ਪਸਹਲ :– ਪੰਜ ਬੀ ਸ ਸਹਤ

(ੳ) ਕਸਵਤਾ

(ਅ) ਕਿਾਣੀ

(ੲ) ਨਾਟਕ

ਭ ਗ੍ ਦੂਜ :– ਪੰਜ ਬ ਸਸਭਆਚ ਰ ਅਤੇ ਲੋਕਧ ਰ

ਭ ਗ੍ ਤੀਜ :– ਪੰਜ ਬੀ ਭ ਸ਼ ਤੇ ਗੁ੍ਰਮੁਖੀ ਸਲਪੀ

ਇਿ ਸਵਸ਼ਾ 100 ਅੰਕਾਂ ਦਾ ਿੋਵੇਗਾ ਸਜਿ ਸਵਚ 40 ਅੰਕ ਇੰਟਰਨਲ ਅਿ ਿਮੈਂਟ ਦੇ ਿੋਣਗੇ

ਅਤੇ 60 ਅੰਕ ਦਾ ਿਾਲਾਨਾ ਸਲਖਤੀ ਪੇਪਰ ਿੋਵੇਗਾ।

ਇੰਟਰਨਲ ਅਿ ਿਮੈਂਟ ਦੇ 40 ਅੰਕਾਂ ਸਵਚੋਂ 10–10 ਅੰਕਾਂ ਦੇ ਦੋ ਸਮਡ ਿਮ ਿਟਰ ਟ ਿਟ

ਿੋਣਗੇ ਸਜਿਦੀ ਸਵਧੀ ਮੌਸਖਕ / ਸਲਸਖਤ ਪਰ ਕਟੀਕਲ ਵਾਲੀ ਿੋਵੇਗੀ। 10 ਅੰਕ ਿਾਜਰੀ ਦੇ ਿੋਣਗੇ। 75%

ਿਾਜਰੀ ਯਕੀਨੀ ਬਣਾਉਣੀ ਜ਼ਰੂਰੀ ਿੋਵੇਗੀ। 75–80% ਿਾਜਰੀ ਦੇ 6 ਅੰਕ , 80–85% ਿਾਜਰੀ ਦੇ 8 ਅੰਕ

ਅਤੇ 85% ਅਤੇ ਇਿ ਤੋਂ ਵੈੱਧ ਿਾਜਰੀ ਦੇ 10 ਅੰਕ ਿੋਣਗੇ। ਬਾਕੀ 10 ਅੰਕ ਓਵਰਆਲ ਇਵ ਲੂਏਸ਼ਨ ਦੇ

ਿੋਣਗੇ।

10+10+10+10=40

60 ਅੰਕ ਾਂ ਦ ਸ ਲ ਨ ਪੇਪਰ ਲਈ ਅੰਕ–ਵੰਡ ਅਤੇ ਪੇਪਰ ਸੈਟਰ ਲਈ ਹਦ ਇਤ ਾਂ

ਪੁਿਤਕ ਦੇ ਸਤੰਨ ਭਾਗ ਿਨ। ਪਰੰ ਤੂ ਪਰਸ਼ਨ ਪੈੱਤਰ ਦੋ ਭਾਗਾਂ ਸਵਚ ਿੋਵੇਗਾ। ਪਰਸ਼ਨ ਪੈੱਤਰ ਦਾ

ਪਸਿਲਾ ਭਾਗ ਪੁਿਤਕ ਦੇ ਪਸਿਲੇ ਭਾਗ ਉਤੇ ਆਧਾਸਰਤ ਿੋਵੇਗਾ। ਇਿ ਭਾਗ ਦੇ ਕੁੈੱਲ 36 ਅੰਕ ਿਨ। ਪਰਸ਼ਨ

ਪੈੱਤਰ ਦਾ ਦੂਜਾ ਭਾਗ ਪੁਿਤਕ ਦੇ ਦੂਜੇ ਭਾਗ ਉਤੇ



ਆਧਾਸਰਤ ਿੋਵੇਗਾ। ਇਿ ਭਾਗ ਦੇ ਕੁੈੱਲ 24 ਅੰਕ ਿੋਣਗੇ ਅਤੇ ਇਿ ਸਵਚ ਪੁਿਤਕ ਦੇ ਦੂਜੇ ਅਤੇ ਤੀਜੇ ਭਾਗ

ਦੇ 12–12 ਅੰਕ ਿੋਣਗੇ।

(1) ਪੁਸਤਕ ਦੇ ਪਸਹਲੇ ਭ ਗ੍ ਦੇ ਸਤੰਨ ਉਪ–ਭ ਗ੍ ੳ , ਅ ਅਤੇ ੲ ਹਨ। ਇਨ੍ ਾਂ ਸਤੰਨ ਾਂ ਉਪ–ਭ ਗ੍ ਾਂ

ਸਵਚੋਂ ਹੇਠ ਸਲਖੇ ਅਨੁਸ ਰ ਸੁਆਲ ਪੁੱਛੇ ਜ ਣਗੇ੍:

(ੳ) ਇਿ ਸਵਚ ਕੁੈੱਲ 12 ਪਰਸ਼ਨ ਐਬਜ ਕਸਟਵ ਟਾਈਪ/ਮਲਟੀਪਲ ਚੋਣ ਵਾਲੇ ਿੋਣਗੇ। ਿਰ ਉਪ–ਭਾਗ

ਸਵਚ 4–4 ਪਰਸ਼ਨ ਪੁੈੱ ਛੇ ਜਾਣਗੇ। ਿਾਰੇ ਪਰਸ਼ਨ ਕਰਨੇ ਜ਼ਰੂਰੀ ਿੋਣਗੇ। ਅੰਕ 12x1 = 12

(ਅ) ਿਰ ਉਪ–ਭਾਗ ਸਵਚੋਂ 5–5 ਲਘੂ ਪਰਸ਼ਨ ਪੁੈੱ ਛੇ ਜਾਣਗੇ ਸਜਨਹਾਂ ਸਵਚੋਂ 3–3 ਪਰਸ਼ਨ ਕਰਨੇ ਲਾਜ਼ਮੀ ਿੋਣਗੇ।

ਉਤਰ ਪੰਜ ਲਾਈਨਾਂ ਤੋਂ ਵੈੱਧ ਨਾ ਿੋਵੇ। ਅੰਕ 3x3 = 9x2 =18

(ੲ) ਿਰ ਉਪ–ਭਾਗ ਸਵਖੋਂ 1–1 ਪਰਸ਼ਨ ਪੁੈੱ ਸਛਆ ਜਾਵੇਗਾ। ਇਨਹਾਂ ਸਵਚੋਂ ਇਕ ਪਰਸ਼ਨ ਿੈੱਲ ਕਰਨਾ ਿੋਵੇਗਾ।

ਉਤਰ ਇਕ ਿਫ਼ੇ ਤੈੱਕ ਿੀਮਤ ਿੋਵੇ। ਅੰਕ 1x6 = 6

(2) ਪੁਸਤਕ ਦੇ ਦੂਜੇ ਅਤੇ ਤੀਜੇ ਭ ਗ੍ ਸਵਚੋਂ ਪਰਸ਼ਨ ਇਸ ਪਰਕ ਰ ਪੁੱਛੇ ਜ ਣਗ੍ੇ:

(ੳ) ਿਰ ਭਾਗ ਸਵਚੋਂ 4–4 ਪਰਸ਼ਨ ਔਬਜ ਕਸਟਵ ਟਾਈਪ/ਮਲਟੀਪਲ ਚੋਣ ਵਾਲੇ ਿੋਣਗੇ। ਿਾਰੇ ਪਰਸ਼ਨ ਕਰਨੇ

ਲਾਜ਼ਮੀ ਿੋਣਗੇ। ਅੰਕ 8x1 = 8

(ਅ) ਿਰ ਇਕ ਭਾਗ ਸਵਚੋਂ 4–4 ਪਰਸ਼ਨ ਪੁੈੱ ਛੇ ਜਾਣਗੇ। ਕੁੈੱਲ 5 ਪਰਸ਼ਨ ਿੈੱਲ ਕਰਨੇ ਿੋਣਗੇ। ਿਰ ਭਾਗ ਸਵਚੋਂ

2 ਪਰਸ਼ਨ ਲਾਜ਼ਮੀ ਿਨ। ਅੰਕ 5x2 = 10

(ੲ) ਿਰ ਇਕ ਭਾਗ ਸਵਚੋਂ 1–1 ਪਰਸ਼ਨ ਪੁੈੱ ਸਛਆ ਜਾਵੇਗਾ। ਇਕ ਪਰਸ਼ਨ ਿੈੱਲ ਕਰਨਾ ਿੋਵੇਗਾ। ਉਤਰ ਇਕ

ਿਫ਼ੇ ਤੈੱਕ ਿੀਮਤ ਿੋਵੇ। ਅੰਕ 6x1 = 6

ਨੋਟ: ਮੌਸਖਕ ਪਰੀਸਖਆ ਪ ਠ–ਪੁਸਤਕ ਤੇ ਹੀ ਆਧ ਸਰਤ ਹੋਵੇਗ੍ੀ। ਇਸਦੀ ਸਵਧੀ ਪਰੈਕਟੀਕਲ ਵ ਲੀ

ਹੋਵੇਗ੍ੀ।



ਪੰਜ ਬੀ ਲ ਜ਼ਮੀ (ਮੁੱਢਲ ਸਗ੍ਆਨ)

ਅੰਡਰ ਗ੍ਰੈਜੂਏਟ ਪੱਧਰ 'ਤੇ ਪਰੋਫ਼ੈਸ਼ਨਲ ਕੋਰਸ ਾਂ ਲਈ ਕੁਆਲੀਫ ਇੰਗ੍ ਪੰਜ ਬੀ

For Other State Students of

B. Tech & Six Year B.Tech-MBA Integrated Program Only

ਕੱੁਲ ਅੰਕ: 100 (ਇੰਟਰਨਲ ਅਸੈਸਮੈਂਟ 40 ਅੰਕ; ਬ ਹਰੀ ਪਰੀਸਖਆ 60 ਅੰਕ)

ਸਲਖਤੀ: 60 ਅੰਕ

ਸਮ ਾਂ: 3 ਘੰਟੇ ਇੰਟਰਨਲ ਅਸੈਸਮੈਂਟ: 40

ਅੰਕ

ਪੀਰੀਅਡ: 3 ਪਰਤੀ ਹਫ਼ਤ ਪ ਸ ਅੰਕ: 40%

ਪੰਜ ਬੀ ਮੁੱਢਲ ਸਗ੍ਆਨ

ਪੰਜਾਬੀ ਯੂਨੀਵਰਸਿਟੀ ਵੈੱਲੋਂ ਬੀ .ਟ ੈੱਕ . ਦੇ ਸਵਸਦਆਰਥੀਆਂ ਸਜਨਹਾਂ ਨੇ ਦਿਵੀ ਂਪੈੱਧਰ ਦੀ ਪੰਜਾਬੀ ਪਾਿ

ਨਿੀ ਂਕੀਤੀ ਿੁੰਦੀ , ਲਈ ਪੰਜਾਬੀ ਮੁੈੱਢਲਾ ਸਗਆਨ ਦਾ ਸਿਲੇਬਿ ਪੜ੍ਹਾਇਆ ਜਾਂਦਾ ਿ । ਪੰਜਾਬੀ ਮੁੈੱਢਲਾ

ਸਗਆਨ ਸਵਸ਼ੇ ਰਾਿੀ ਂ ਸਵਸਦਆਰਥੀਆਂ ਨੰੂ ਪੰਜਾਬੀ ਵਰਨਮਾਲਾ ਤੋਂ ਲ ਕੇ ਮਾਤਰਾਵਾਂ ਦੀ ਵਰਤੋਂ , ਸ਼ਬਦ

ਬਣਤਰਾਂ ,

ਵਾਕ ਬਣਤਰ ਅਤੇ ਪੰਜਾਬੀ ਸਵਆਕਰਨ ਿੰਬੰਧੀ ਪੜ੍ਹਾਇਆ ਜਾਂਦਾ ਿ । ਇਿ ਸਵਸ਼ਾ ਪੜ੍ਹਾਉਣ ਦਾ ਮੁੈੱਖ ਉਦੇਸ਼

ਪੰਜਾਬ ਦੇ ਮਾਤ ਭਾਸ਼ਾ ਦੇ ਸਗਆਨ ਤੋਂ ਵਾਂਝੇ ਰਸਿ ਗਏ ਸਵਸਦਆਰਥੀਆਂ ਨੰੂ ਭਾਸ਼ਾ ਸਿਖਾਉਣਾ ਅਤੇ ਬਾਿਰਲੇ

ਿੂਸਬਆਂ ਦੇ ਸਵਸਦਆਰਥੀਆਂ ਨੰੂ ਇਕ ਨਵੀ ਂਭਾਸ਼ਾ ਸਿਖਾ ਕੇ ਉਿਨਾਂ ਨੰੂ ਪੰਜਾਬ ਸਵਚ ਰੁਜ਼ਗਾਰ ਦੇ ਮੌਸਕਆਂ ਦੇ

ਯੋਗ ਬਣਾਉਣਾ ਿ ।

ਭ ਗ੍ ੳ

1) ਗੁਰਮੁਖੀ ਵਰਣਮਾਲਾ ਤੇ ਲੇਖਣ ਪਰਬੰਧ

(ੳ) ਅੈੱਖਰ ਸਿੈੱ ਸਖਆ : ਤਰਤੀਬਵਾਰ ਤੇ ਭੁਲਾਵੇਂ ਅੈੱਖਰ

(ਅ) ਅੈੱਖਰ ਬਣਤਰ : ਅੈੱਖਰ ਰੂਪ ਤੇ ਸਲਖਣ ਦੇ ਸਨਯਮ

2) ਗੁਰਮੁਖੀ ਅੈੱਖਰ ਤੇ ਪੰਜਾਬੀ ਧੁਨੀਆਂ ਦਾ ਪਰਬੰਧ

(ੳ) ਿਵਰ ਤੇ ਸਵਅੰਜਨ : ਵਰਗੀਕਰਨ ਤੇ ਸਿਧਾਂਤ ਤੇ ਉਚਾਰਨ

(ਅ) ਲਗਾਂ–ਮਾਤਰਾਂ ਦੀ ਪਛਾਣ ਤੇ ਵਰਤੋਂ

ਭ ਗ੍ ਅ

1) ਸਲਪੀ ਦੇ ਅੈੱਖਰਾਂ ਦੀ ਵਰਤੋਂ ਦੇ ਸਨਯਮ

(ੳ) ਪੂਰੇ ਤੇ ਅੈੱਧੇ ਅੈੱਖਰ ਦੀ ਪਛਾਣ ਤੇ ਵਰਤੋਂ

(ਅ) ਿਵਰ ਿੂਚਕ ਅੈੱਖਰਾਂ ਦੀ ਪਛਾਣ ਤੇ ਵਰਤੋਂ

2) ਪੰਜਾਬੀ ਸ਼ਬਦਾਵਲੀ ਨਾਲ ਜਾਣ–ਪਛਾਣ

(ੳ) ਿਫ਼ਤੇ ਦੇ ਸਦਨ

(ਅ) ਮਿੀਸਨਆਂ ਦੇ ਨਾਮ

(ੲ) ਰੰਗਾਂ ਦੇ ਨਾਮ

(ਿ) ਪੰਜਾਬੀ ਸਰਸ਼ਤਾ–ਨਾਤਾ ਪਰਬੰਧ ਸ਼ਬਦਾਵਲੀ

ਭ ਗ੍ ੲ

1) ਸ਼ਬਦ ਪਰਬੰਧ: ਸ਼ਬਦ ਜੋੜ੍ਾਂ ਦੀ ਵਰਤੋਂ

(ੳ) ਦੋ ਅੈੱਖਰੀ ਸ਼ਬਦਾਂ ਦੇ ਸ਼ਬਦ–ਜੋੜ੍

(ਅ) ਸਤੰਨ ਅੈੱਖਰੀ ਸ਼ਬਦਾਂ ਦੇ ਸ਼ਬਦ–ਜੋੜ੍

2) ਸ਼ਬਦਾਂ ਦੀ ਸ਼ਰੇਣੀਆਂ ਤੇ ਸਵਆਕਰਨਕ ਵਰਗਾਂ ਦੀ ਪਛਾਣ

(ੳ) ਸ਼ਬਦਾਂ ਦੀਆਂ ਸ਼ਰੇਣੀਆਂ ਦਾ ਸਿਧਾਂਤ , ਪਛਾਣ ਤੇ ਵਰਤੋਂ

(ਨਾਂਵ , ਪੜ੍ਨਾਂਵ , ਸਵਸ਼ੇਸ਼ਣ , ਸਕਸਰਆ ਸਵਸ਼ੇਸ਼ਣ ਆਸਦ)

ਭ ਗ੍ ਸ

1) ਸ਼ਬਦ ਬਣਤਰਾਂ ਤੇ ਸਵਆਕਰਨਕ ਇਕਾਈਆਂ ਦਾ ਸਿਧਾਂਤ ਤੇ ਵਰਤੋਂ

(ੳ) ਪੰਜਾਬੀ ਸ਼ਬਦ ਬਣਤਰਾਂ ਦਾ ਸਿਧਾਂਤ , ਪਛਾਣ ਤੇ ਵਰਤੋਂ



(ਅਗੇਤਰ , ਸਪਛੇਤਰ , ਿਮਾਿ , ਦੁਿਰੁਕਤੀ)

(ਅ) ਸਵਆਕਰਨਕ ਇਕਾਈਆਂ ਦਾ ਸਿਧਾਂਤ , ਪਛਾਣ ਤੇ ਵਰਤੋਂ

(ਵਾਕੰਸ਼ , ਉਪ–ਵਾਕ ਤੇ ਵਾਕ)

ਇਿ ਸਵਸ਼ਾ 100 ਅੰਕਾਂ ਦਾ ਿੋਵੇਗਾ ਸਜਿ ਸਵਚ 40 ਅੰਕ ਇੰਟਰਨਲ ਅਿ ਿਮੈਂਟ ਦੇ ਿੋਣਗੇ ਅਤੇ 60

ਅੰਕ ਦਾ ਿਾਲਾਨਾ ਸਲਖਤੀ ਪੇਪਰ ਿੋਵੇਗਾ।

ਇੰਟਰਨਲ ਅਿ ਿਮੈਂਟ ਦੇ 40 ਅੰਕਾਂ ਸਵਚੋਂ 10–10 ਅੰਕਾਂ ਦੇ ਦੋ ਸਮਡ ਿਮ ਿਟਰ ਟ ਿਟ ਿੋਣਗੇ

ਸਜਿਦੀ ਸਵਧੀ ਮੌ ਸਖਕ / ਸਲਸਖਤ ਪਰ ਕਟੀਕਲ ਵਾਲੀ ਿੋਵੇਗੀ। 10 ਅੰਕ ਿਾਜਰੀ ਦੇ ਿੋਣਗੇ। 75% ਿਾਜਰੀ

ਯਕੀਨੀ ਬਣਾਉਣੀ ਜ਼ਰੂਰੀ ਿੋਵੇਗੀ। 75–80% ਿਾਜਰੀ ਦੇ 6 ਅੰਕ , 80–85% ਿਾਜਰੀ ਦੇ 8 ਅੰਕ ਅਤੇ

85% ਅਤੇ ਇਿ ਤੋਂ ਵੈੱਧ ਿਾਜਰੀ ਦੇ 10 ਅੰਕ ਿੋਣਗੇ। ਬਾਕੀ 10 ਅੰਕ ਓਵਰਆਲ ਇਵ ਲੂਏਸ਼ਨ ਦੇ ਿੋਣਗੇ।

10+10+10+10=40

60 ਅੰਕ ਾਂ ਦ ਸ ਲ ਨ ਪੇਪਰ ਲਈ ਅੰਕ–ਵੰਡ ਅਤੇ ਪੇਪਰ ਸੈਟਰ ਲਈ ਹਦ ਇਤ ਾਂ

(1) ਿਲੇਬਿ ਦੇ ਚਾਰੇ ਭਾਗ ੳ , ਅ , ੲ ਅਤੇ ਿ ਸਵਚੋਂ 5–5 ਮਲਟੀਪਲ ਚੋਣ ਪਰਸ਼ਨ ਪੁੈੱ ਛੇ ਜਾਣਗੇ। ਿਾਰੇ

ਪਰਸ਼ਨ ਕਰਨੇ ਲਾਜ਼ਮੀ ਿੋਣਗੇ। 4x5 = 20x 1 = 20

(2) ਿਰੇਕ ਭਾਗ ੳ , ਅ , ੲ ਅਤੇ ਿ ਸਵਚੋਂ 4–4 ਿੰਖੇਪ ਉਤਰਾਂ ਵਾਲੇ ਪਰਸ਼ਨ ਪੁੈੱ ਛੇ ਜਾਣਗੇ ਸਜਨਹਾਂ ਸਵਚੋਂ 2–2

ਪਰਸ਼ਨ ਕਰਨੇ ਲਾਜ਼ਮੀ ਿੋਣਗੇ। 4x 2 = 8x 2 = 16

(3) ਿਰੇਕ ਭਾਗ ੳ , ਅ , ੲ ਅਤੇ ਿ ਸਵਚੋਂ 2–2 ਵਰਣਾਤਮਕ ਪਰਸ਼ਨ ਪੁੈੱ ਛੇ ਜਾਣਗੇ ਸਜਨਹਾਂ ਸਵਚੋਂ 1–1 ਪਰਸ਼ਨ

ਕਰਨਾ ਲਾਜ਼ਮੀ ਿੋਵੇਗਾ। 4x 1 = 4x 6 = 24

FOUR YEAR B. TECH. Second Year, 3rd SEMESTER Batch … Session 2019-20/Faculty of Engineering/B.TECH...Punjabi University, Patiala. Four Year B. Tech (ECM) Batch: 2018 / BOS: 2019

Documents