You are on page 1of 56

Department of

Computer Science and Engineering

Student Hand Book


II Year B Tech I Semester
2015-2016

Guru Nanak Institute of Technology


Name
Roll Number
Class/Section

Ibrahimpatnam, Ranga Reddy District 501 506 (Telangana)

TIME TABLE
(To be filled by the student with graphite pencil only)

Day /
Period

1
09.20

2
10.15

3
11.05

4
11.55

5
01.30

TUESDAY
WEDNESDA
Y
THURSDAY

FRIDAY

SATURDAY

GURU NANAK INSTITUTE OF TECHNOLOGY

12.45 01.30BREAK

MONDAY

6
02.20

7
03.10

CONTENTS

S. NO.

Particulars

Page No.

PART A
I

GENERAL INFORMATION

01

II

ACADEMICS

03

III

MONITORING AND GUIDANCE

05

IV

PROGRAM OBJECTIVES AND OUTCOMES

09

PART B

MATHEMATICAL FOUNDATION FOR COMPUTER


SCIENCE
DATA STRUCTURES

16

DIGITAL LOGIC DESIGN

20

ELECTRONIC DEVICES AND CIRCUITS

28

BASIC ELECTRICAL ENGINEERING

33

PROBABILTY & STATISTICS

38

DATA STRUCTURES (L)

44

BASIC ELECTRICAL ENGINEERING (L)

46

PART A
I. GENERAL INFORMATION
1. About the College
GURU NANAK INSTITUTE OF TECHNOLOGY

11

Guru Nanak Institute of Technology is sponsored by Barahmoula Educational Society,


which have been founded to educate, enrich and empower the youth who in turn will play
a decisive role in shaping the destiny of the nation. The endeavor at the Institution
stretches beyond just offering degrees to the building of character and personality of the
young professionals transforming them into complete professionals equipped with
technological competence and social consciousness.
JSN College of Engineering & Technology was established in the year 1999 with the sole
objective of providing a perfect platform to students in the field of Technology and
Management to invent applications for their academic and overall personality
development. In year 2008 the name was changed as Guru Nanak Institute of
Technology. Within a span of 14 years, GNIT has come a long way to become one of the
Premiere Engineering Colleges in the state with an overall intake of more than 720
students in various Undergraduate and Post Graduate Courses including B.Tech.,M.Tech.,
and M.B.A.GNIT has state-of-the-art laboratories, highly qualified and dedicated
teaching professionals and a sprawling lush green campus with a congenial atmosphere
for learning. The campus has a rich tradition of soaring high with academic excellence
and overall personal growth of the students. This is achieved by providing to them
excellent academic environment, state-of-the-art infrastructure and dedicated and highly
qualified faculty members with decades of teaching and industrial experience.
Highlights:

Teaching methodology involves technical case studies, creative exercises,


online assignments & descriptive tests.
E-class rooms
Industry focused knowledge is imparted by R & D and Industry peer
members.
Tie up with MNC companies and foreign Universities
State of art laboratories, sophisticated equipment and advanced software
Library is equipped with National and International Journals, 50000 volumes
and more than 7500 titles of books, NPTEL, SONET CDs and internet lab for
students and staff.
IEEE online journals and IEL online journals through AICTE INDEST
CONSORTIUM

GURU NANAK INSTITUTE OF TECHNOLOGY

Wi-Fi campus with 12 Mbps bandwidth.


Oracle, Microsoft Development suite, Microsoft academic license for
Microsoft Software Products, MAT LAB, PSPICE, VHDL, TINAPRO and
DSP softwares are available
State of art English Language lab and 800 computers connected with
dedicated high-end servers.
Scholarship and free books for meritorious students.
Book Bank Scheme facility to the students.
A new and unique Laptop lab with latest configuration Most of the classrooms
are fixed with LCDs and screens.
All major professional societies student chapters like ISTE, CSI, IETE and
IEEE etc.

Training & Placement:


Modern training department is established as per the corporate standards.
College has JKC training centre and special training is providing in the area of
soft skills and technical skills for students which is a part of their regular timeTable.

Large Number of students placed with Microsoft Inc, Infosys, Mahendra


Satyam Ltd, Infosys, IBM, TCS, ADP, Wipro, Sutherland Technologies,
CMC, SEMANTIC SPACE, and InfoTech Enterprises.
Industry experts are invited for guest lectures, seminars and student
presentations to maintain a strong Industry and Institution Interaction. Also,
industrial visits are arranged for students to enrich their knowledge.

Contact Information

Principal

Dr. S. Sreenatha Reddy

8096609821

Vice Principal

Dr. M. Narendra Kumar

8096609840

HOD CSE & IT

Prof. Sandeep Singh Rawat

HOD ECE

Prof. Kedarnath

80966 09829

HOD MECH

Prof. B. Vijay Kumar

8096609836

GURU NANAK INSTITUTE OF TECHNOLOGY

8096609826

HOD CIVIL

Prof. S. Madan Mohan

8096609827

HOD EEE

Mr. Kuldeep Singh

8498056996

HOD H & S

Dr.G.Srinivas

8096195678

General Manager

Mr. Col (Retd) Rajesh Kumar

8096611000

Administrative officer

Mr. S. Antony

8297975251

Transport Officer

Md.Hussain

8499071144

II. ACADEMICS
1

Department Profile
The CSE Department of GNIT was started in the year 2008 with an intake of 60
students. Currently the Department offers an under-graduate program (B.Tech) in
Computer science and engineering with an intake of 180 students and post graduate
program(M.Tech) in computer science and engineering with an intake of 18. The
department has highly competent faculty members with masters specialization in
Computer science and engineering, Computer Technology and Software Engineering
etc.with 4 supporting staff members.
Department of CSE is committed to Impart Technical and Research based quality
education and to develop innovative skills among the students. Enrich the Academic
activities through continual improvement in the teaching and learning processes. Infuse
confidence in the minds of students and to develop them as entrepreneurs. Developed
expertise for consultative activities by providing opportunities for industry institute
interaction. Constantly upgrading the technical expertise for producing competent
professionals to cater to the needs of society and to meet the global challenges. Involve
the faculty in the development of laboratories and to take an active interest in counseling
the students. Train the students to meet the challenges of advancement in technology,
which is a continuous process.
Students of our department actively participate in National-level Student
Paper Contests being organized at IIT's, NITSs, JNTU and various other
Engineering Colleges. Some of them have also been awarded in these paper
contests. A good number of Students are well placed in reputed organizations.
Department Strengths
GURU NANAK INSTITUTE OF TECHNOLOGY

The Department has highly qualified and well experienced faculty.

Students and lecturers are co-ordinated and work as a team.

Enrollment of high caliber students

Students are very disciplined and cultured

Active involvement in extra-curricular and co-curricular activities

Strong encouragement from management to improve qualification

Good infrastructure

Excellent training for students

Objectives:

To propagate and disseminate knowledge in Computer Science and Engineering


discipline to the society through the student and faculty.

To encourage students to serve social causes by Application of their specialized


knowledge paving way to better life for humanity.

To promote the concept of lifelong learning among faculty members.

2. Faculty Strength
The faculty in the department consists of Senior and well experienced Associate
Professors and Assistant Professors with M. Tech and B. Tech qualifications. An
experienced System Administrator and well-qualified Lab staff support the conduct of
Laboratories.
FACULTY LIST
S.N
1
2

Name of Faculty
Dr.Sandeep Singh
Rawat
Prof. Anirudha Batta

Charjya
GURU NANAK INSTITUTE
OF TECHNOLOGY

Designation
(Prof & HOD)
Professor

3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

Mr.K.Madhu Sudhana
Mr.K.Suresh
Mr.Imran Qureshi
Mr.B.Sudhakar
Mr.D.Prashanth
Mr. P.Satish
Mr.A.Vinay Sagar
Mr.M.Suresh
Mr.Deviprasad Mishra
Mr.Nusrath Khan
Ms.D.L.N.Prasunna
Mr.Y.Kethan Harish
Mrs. S.Laxmi
Mr. Narasimha
Ms.S. Sreeja
Ms.Seema Rai
Ms. Deepika
Mr. Phani Raja
Mrs. C. Sangeetha
Mrs. B.Swetha
Mr. K. Shoban
Mr. P.Srinivas

Assoc Professor
Assoc Professor
Assoc Professor
Assoc Professor
Asst.Professor
Asst.Professor
Asst.Professor
Asst.Professor
Asst.Professor
Asst.Professor
Asst.Professor
Asst.Professor
Asst.Professor
Asst.Professor
Asst.Professor
Asst.Professor
Asst.Professor
Asst.Professor
Asst.Professor
Asst.Professor
Asst.professor
Asst.professor

NON TEACHING FACULTY LIST


Name
Mr SUDHEER
Mr D. SURESH
Mr..NARESH
SHEKHAR
Ms.K.SWAPNA
KARTHIK SHARMA
Mr.VENKATARAMANA

GURU NANAK INSTITUTE OF TECHNOLOGY

Designation
SYSTEM ADMINISTRATOR
PROGRAMMER
PROGRAMMER
PROGRAMMER
PROGRAMMER
OFFICE ASSISTANT

Course Calendar for the Semester ( to be filled by the candidate)


S.No
1
2
3
4
5

EVENT

Duration

Procedures for Laboratories


a
b
c
d
e
III.
1

Equipment in the lab for the use of student community. Students must use the
equipment with care. Any damage caused is punishable.
Students should carry their observation book along with the record book with
completed exercises/ calculations while attending the lab.
Students are supposed to occupy the experiment setup allotted to them and
maintain discipline in the lab.
Labs can be used in free time / lunch hours by the students with prior
permission from the lab in-charge.
15 marks are awarded for continuous evaluation in the laboratory.
Lab records need to be submitted on or before date of submission
MONITORING AND GUIDANCE

Student Feedback
In case the students find it difficult to cope up / understand a particular subject,
they are advised to discuss it with the concerned Teacher /The Class
Teacher/Counselor/HOD/ Principal.
Students can use the suggestion boxes for communicating their problems.
Necessary action will be taken by the concerned authorities. If required,
Principal/HOD will discuss the student to solve the problems.

Class Teacher:
S.No
.
1
2
3
4

Year
II B. Tech CSE-A
II B. Tech CSE-B
II B. Tech-CSE-C
III B. Tech CSE-A

Name of the faculty


SANGEETHA
PHANI RAJA
K.SHOBAN
K.ANNAPURNA

GURU NANAK INSTITUTE OF TECHNOLOGY

Phone Number
8500000076
9704209701

5
6
7

III B. Tech CSE-B


IV B Tech CSE -A
IV B Tech CSE-B

P.SATISH
A. VINAY SAGAR
B.SUDHAKAR

8019995450
9160608630
9291617654

Counselor:
One counselor is assigned to a group of 30students. Students can directly discuss
their college related or personal problems related to academics with them. The
Counselors are accessible to the students and they can talk to them, whenever
they are free from class / lab work. Counselors will interact with the students
once in a fortnight and discuss the progress.
Class Representatives and their role:
Two students from each class are selected as Class representatives from the
department based on their academic performance and discipline.
Responsibilities of the Class Representatives:

Communicating the departmental / college directives & information to the


students.
Communicating the Problems faced by the students and also
communicating the suggestions for improvement.
Coordinating academic events and co-curricular activities.
Encourage students to interact for better studies& sharing the knowledge
and information.

I-Semester Class Representatives are:


Class / Section

Roll No

Name of the Student

II B. Tech CSE-A
II B. Tech CSE-B
II B. Tech CSE-C
III B Tech CSE-A
III B Tech CSE-B
IV B Tech CSE-A

13831A0548
13831A0559
13831A05B3
13831A05B5
12831A0520

GURU NANAK INSTITUTE OF TECHNOLOGY

K.THARUNI REDDY
M.SAI AMAR
S.NITHISHA
YASH DALMIA
C.V.VISHAL

IV B Tech CSE-B

12831A0509
12831A05A1
12831A0574

B.KIRAN KUMAR REDDY


V.V.V.S.N.MURTHY
P.DEEKSHA

Role of a class Teacher:


Ensuring the conduct of classes
Monitoring the students attendance
SMS, phone calls to the parents and interacting with parents
Class Discipline
Arranging extra classes for coverage of syllabus
Ensuring the conduct of special tests, remedial classes for slow learners
Communicating the students attendance, Mid marks, special test marks,
attendance of Remedial classes etc.
Role of the Counselors
Talk to the student at least once in a fortnight
Updating the counseling book
Problems of the student may be discussed with the concerned
faculty/mentor/HOD
Identify the strengths , weakness and motivate the student
Counselors will evaluate the student individually for the following:
a Less marks in Internal exams
b Continuous Absence (3 days)
c Not understanding the subject
d Students from Telugu medium
e Assistance for back log subjects etc.
2

Special Tests:
Two Special tests will be conducted for students before the Mid exams to
improve their
performance in the mid examinations. If any student is not
performed, he/she will be asked to attend the re-exam to ensure the
understanding of the subject. If required the teacher will guide the student in the
subject.

Remedial classes:
Remedial classes will be conducted for students who are academically weak and
who do not perform well in their internal examinations and special class tests.

Backlog Management

GURU NANAK INSTITUTE OF TECHNOLOGY

The Class Teacher maintains a complete record of Examination results of each


student and they counsel and guide them in preparing for backlogs. Students are
provided with material and important questions are discussed.
5

Correspondence with Parents


Parents will be informed about the performance of their ward from time to time
during the course period, however parents are advised to contact class Teacher /
Department Head periodically.

NPTEL Classes
Department conducts NPTEL classes with Technical DVDs as virtual/visual
classes through faculties from IITS, NITS and IIITS

CSI activities
The department regularly organizes technical quiz, seminar, group discussions
etc. as part of promote curricular and extracurricular activities.

II B Tech I Semester (Reg.)Academic Calendar (2015-2016)


S
NO
1
2
3
4
5
6
7
8
9

EVENT

Date & Day

Duration
The vision of
the GNIT

To be a world class educational and research institution in the service of humanity by promoting high
quality Engineering, Management and Pharmacy education.

M1: Imbibe soft skills and technical skills.

The Mission
GNIT (in
pursuance of its
vision)

M2: Develop the faculty to reach the international standards.


M3: Maintain high academic standards and teaching quality that promotes the analytical thinking and
independent judgment.

GURU NANAK INSTITUTE OF TECHNOLOGY

M4: Promote research, innovation and Product development by collaboration with reputed foreign
universities.
M5: Offer collaborative industry programs in emerging areas and spirit of enterprise.

Vision of the Computer Science and Engineering Department


To be a premier department of Computer Science and Engineering in the region.

Mission of the Computer Science and Engineering Department

1. Nurture young individuals into knowledgeable, skillful and ethical professionals in their pursuit of
Computer Science and Engineering.
2. Nurture the faculty to expose them to world-class infrastructure.
3. Sustain high performance by excellence in teaching, research and innovations.
4. Extensive partnerships and collaborations with foreign universities for technology up- gradation.
5. Develop Industry-Interaction for innovation and product development.

Program Educational Objectives (PEOs)


PEO-1: Graduates shall have the ability to apply knowledge and technical skills in emerging areas of Computer
Science and Engineering for higher studies, research, employability, product development and handle realistic
problems.
PEO-2: Graduates shall maintain ethical conduct, sense of responsibility to serve the society and protect the
environment.
PEO-3: Graduates shall possess academic excellence with innovative insight, soft skills, managerial skills,
leadership qualities, knowledge of contemporary issues for successful professional career.
Program Outcomes (POs)
GURU NANAK INSTITUTE OF TECHNOLOGY

A. An ability to apply knowledge of mathematics, science and engineering


B. An ability to design and conduct experiments, as well as to analyze and interpret data
C. An ability to design a system, component or process to meet desired needs within realistic constraints
such as economic, environmental, social, political ethical, health and safety, manufacturability and
sustainability
D. An ability to function on multidisciplinary teams
E. An ability to identify, formulate and solve engineering problems
F. An understanding of professional and ethical responsibility
G. An ability to communicate effectively
H. The broad education necessary to understand the impact of engineering solutions in global economic
environmental and societal context
I. A recognition of the need for, and an ability to engage in lifelong learning
J. A knowledge of contemporary issues
K. An ability to use the techniques, skills and modern engineering tools necessary for engineering practice

PEOs

Program Outcomes
A

II
III

GURU NANAK INSTITUTE OF TECHNOLOGY

PART B
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
A.LESSON PLAN

GURU NANAK INSTITUTE OF TECHNOLOGY

MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE


Faculty

Mrs. Annapurna, Asst.Prof.


Text Books (Text books (to be acquired by the Students)

Book 1
Book 2
Book 3

Book 4

Unit
I
II
III
IV
V

Discrete and combinational Mathematics An applied Introduction - 5 th edition Ralph. P. Grimaldi. Pearson education.
Discrete Mathematical Structures with Applications to Computer Science,
J.P. Tremblay, R. Manohar, Tata McGraw Hill
J. L. Mott, A. Kandel, T.P. Baker, Discrete Mathematics for Computer Scientists and
Mathematics, Prentice Hall, Second Edition
Reference Books
Kolman, Busby, Ross, Discrete Mathematical Structures, Pearson Education, Second
Education, Third Edition
Topic

Chapters

No of Classes

Book 1

Book 2

Book 3

1, 2

---

---

---

---

---

Mathematical Logic
and Predicates
Relations and
Algebraic structures
Elementary
Combinatory
Recurrence Relation
Graph Theory and
Applications

Contact classes for syllabus coverage

65

Lectures beyond the syllabus

Special descriptive tests

Tutorial classes & Remedial classes

Total Classes

75

B. SYLLABUS
GURU NANAK INSTITUTE OF TECHNOLOGY

UNIT- I

UNIT- II

UNIT- III

UNIT- IV

UNIT- V

Mathematical Foundations of Computer Science (MFCS)


(53022) Syllabus
Mathematical Logic: Statements and notations, Connectives, Well formed
formulas, Truth Tables, tautology, equivalence implication, Normal forms,
Quantifiers, universal quantifiers.
Predicates: Predicative logic, Free & Bound variables, Rules of inference,
Consistency, proof of contradiction, Automatic Theorem Proving.
Relations: Properties of binary Relations, equivalence, transitive closure,
compatibility and partial ordering relations, Lattice, Hasse diagram. Functions:
Inverse Function, Composition of functions, recursive Functions, Lattice and its
Properties.
Algebraic structures: Algebraic systems Examples and general properties, Semi
groups and monads, groups sub groups homomorphism, Isomorphism.
Elementary Combinatorics: Basis of counting, Combinations & Permutations,
with repetitions, Constrained repetitions, Binomial Coefficients, Binomial
Multinomial theorems, the principles of Inclusion Exclusion. Pigeon hole
principles and its application.
Recurrence Relation: Generating Functions, Function of Sequences Calculating
Coefficient of generating function, Recurrence relations, Solving recurrence
relation by substitution and Generating funds. Characteristics roots solution of In
homogeneous Recurrence Relation.
Graph Theory : Representation of Graph, DFS, BFS, Spanning Trees, planar
Graphs.
Graph Theory and Applications: Basic Concepts Isomorphism and Sub graphs,
Multi graphs and Euler circuits, Hamiltonian graphs, Chromatic Numbers

GURU NANAK INSTITUTE OF TECHNOLOGY

C. ASSIGNMENT QUESTIONS
Mathematical Foundations of Computer Science
Assignment Questions

Unit- I

Unit-II

1. Show the following statement for equivalence


(A (AVB))V(B(AB))B.
2. Find principal disjunctive normal form for (PQ) V(PVQVR), and also find
principle conjunctive normal form.
3. Let p ab=nd q be primitive statements for which pq id flase. Determine the
truth values of the following.
i). pq
ii). pVq
iii). qp
v) qp.
4. Explain the terms given belowi) Tautology
ii)Contrapositive
iii)Universal valid formulae
iv)Contradiction
5. Obtain principal conjunctive normal forms of the following formulas
(pq)r
ii) (pq)(q r)
6. What is predicate calculus? What is its significance? Give examples for 3-place,
4-place, 5-place predicates.
7. Explain different rules of inference.
8. Show that rs can be derived from the premises.
(((p(qs)) (rVp)))q
9.Show that r is valid conclusion from the premises
(pq)r ; p s ; q t
10. Prove that 2 is not a rational numbers
1. What is relation and function, explain clearly with suitable examples.
2. What the properties of binary relations explain with suitable examples.
3. What is irreflexive? Explain with suitable examples?
4. What id symmetric and anti- symmetric relation? Explain with examples.
5. Explain equivalence relation with suitable examples.
6.What is an algebraic structure? Explain with examples of binary operations with
* and +. Operators and its properties..
7. Explain about the properties associated with multiplication with examples
8. Explain semi-group and monoids? Give examples.

GURU NANAK INSTITUTE OF TECHNOLOGY

UnitIII

UnitIV

1. Explain the properties of algebraic system (S, +, *) where S indicates a set of


integers, + and * are binary operations of multiplication and addition
respectively.
2. Suppose that 200 faculty members can speak French, 50 can speak Russian
which 20 can speak both French and Russian. How many faculty members can
speak either French or Russian.
3 .If there are 200 faculty members that speak French, 50 can speak Russian, 100
that speak Spanish. 20 that French and Russian. 60 that speak French and
Spanish, 35 that speak Russian and Spanish. While only10 speak French,
Russian and Spanish. How many speak either French or Russian or Spanish.
4. In how many way can we distribute 10 white balls, 10 red balls, 10 blue balls
into 6 different boxez( any box can be left empty).
5. Compute p(8,5) and C(6,3)?
1. Compute a simple expression for the power series given below
(n+1)(n+1)(n) xn
n=1
2. Solve recurrence relation
un= un-1 + n(n+1)/2; n1.
3. Solve recurrence relations,
an 8an-1 +16an-2 = 0, given that a2=6, a3=80
4. Solve the recurrence relations,
un+ 5un-1 + 6un-2 = 42(4)n
5. Solve recurrence relations ,
un -2un-1 3un-2 = 5n, n2. And u0=1, u1=1

1. Define graph? Give examples. What is cycle graph explain with example.
2. Explain the following different graphs with examples,
i). Multi Graph
ii). General Graph iii). Planar Graph
3. Explain the following different graphs with examples,
i). Complete Graph ii). Regular Graph iii). Mixed Graph
4. Explain adjacency and incident matrices, and its advantages with suitable
examples
Unit- V 5. What binary tree, complete binary tree and full binary tree and explain with
examples.
6. Draw the following graphs
i)C5
ii) K5
iii)K3,3
iv)W6
7. What is a graph and give detailed explanation.
8. Distinguish between following terms.
i)Cycle and Circuit ii) Hamiltanian graph and Eulers graph
9. Find subgrapah of G which is isomorphic to k3,3,
10. Find chromatic number of Kn

GURU NANAK INSTITUTE OF TECHNOLOGY

D. PROGRAM EDUCATIONAL OBJECTIVES:


Course Educational Objectives:
a) To explain with examples the basic technology of functions, relations and sets
b) To describe the importance and limitations of predicate logic.
c) To performs operations associated with set, function, or relations.
d) To relate practical examples to appropriate set, function or relation model and
interpret the associated operations and terminology in context.
e) To relate the ideas of mathematical induction to recursion and recursively defined
structures.
f) To use graph theory for solving problems and relate its applications to real world
problems.
i)
ii)
iii)
iv)
v)

Course Outcomes:
Ability to illustrate by examples on the basic terminology of sets functions, relations and
predicate logic.
Ability to demonstrate knowledge on operations associated with sets, relations and
functions.
Ability to demonstrate in practical applications the use of basic counting, principles of
permutations, and combinations, inclusion and exclusion principles.
Ability to solve the problems those involve the concept of recursion and recursively
defined structures.
Ability to represent and apply graph theory in solving computer science problems and
other related problems.

GURU NANAK INSTITUTE OF TECHNOLOGY

DATA STRUCTURES
A. LESSON PLAN

GURU NANAK INSTITUTE OF TECHNOLOGY

DATA STRUCTURES
Faculty

Mr. P Satish, Assoc.Prof.

Text Books (to be acquired by the Students)


Book 1
Book 2

FundamentalsofData structuresinC,2

nd

Edition,E.Horowitz,S.Sahni andSusan

Anderson-Freed,UniversitiesPress.
DatastructuresA ProgrammingApproachwithC,D.S.Kushwaha andA.K.Misra,PHI.

Unit

Topic

Chapters

No of Classes

Book 1

Book 2

1&4

1&2

14

12

Basicconcepts

II

StackADT

III

Trees & Graphs

5&6

14

IV

Searching & Sorting

7&8

12

SearchTrees &
Patternmatchingalgorith
m

10 & 11

13

Contact classes for syllabus coverage

59

Special descriptive tests

02

Tutorial classes
Total Classes

B. Syllabus
GURU NANAK INSTITUTE OF TECHNOLOGY

04
65

DATA STRUCTURES

Unit I

Basic
concepts-Algorithm
SpecificationIntroduction,Recursivealgorithms,DataAbstractionPerformance analysis- time
complexity and space complexity, Asymptotic Notation-BigO, Omega and Theta
notations, Introduction to Linear and Non Linear data structures. Singly Linked
Lists-Operations-Insertion, Deletion, Concatenating singly linked lists, Circularly
linked lists- Operations for Circularly linked lists, Doubly Linked ListsOperations-Insertion, Deletion. Representation of single, two dimensional arrays,
spar sematrices-array and linked representations.

Unit II

StackADT,definition,operations,arrayandlinkedimplementationsinC,applicationsinfix to postfix conversion, Postfix


expression evaluation, recursion
implementation, Queue ADT, definition and operations, array and linked
Implementations in C, Circular queues-Insertion and deletion operations,
Deque(Double ended queue)ADT, array and linked implementations in C.

Unit III

Trees Terminology, Representation of Trees, Binary tree ADT, Properties of


Binary Trees, Binary Tree Representations-array and linked representations,
Binary Tree traversals, Threaded binary trees, Max Priority Queue ADTimplementation-Max Heap-Definition, Insertion into a Max Heap, Deletion from a
Max Heap.
Graphs Introduction, Definition, Terminology, Graph ADT, Graph
Representations- Adjacency matrix, Adjacency lists, Graph Traversals- DFS and
BFS.

Unit IV

Unit V

Searching-Linear Search, Binary Search, Static Hashing-Introduction, hash tables,


hash functions, Overflow Handling.
Sorting-Insertion Sort, Selection Sort, Radix Sort, Quick sort, Heap Sort,
Comparison of Sorting methods.
SearchTrees-BinarySearchTrees,Definition,Operations-Searching,Insertionand
Deletion, AVL Trees- Definition and Examples, Insertion into an AVL Tree, BTrees, Definition, B-Tree of order m, operations-Insertion and Searching
,Introduction to Red-Black and Splay Trees(Elementary treatment-only
Definitions
and
Examples),
Comparison
of
Search
Trees.
Patternmatchingalgorithm-TheKnuth-Morris-Prattalgorithm,Tries(examplesonly).

GURU NANAK INSTITUTE OF TECHNOLOGY

C.Assignment Questions
DS Assignments

Week - 1

Week - 2

Unit 1
1) What is mean by performance measurements? Write the recursive factorial algorithm
and count the number of steps to compute the complexity?
2) Distinguish between Big O & little o?
3) Explain the advantages of one over the other between Double Linked List and Singly
Linked List with illustrative examples.
4) Explain Sparse matrix and Circular Linked List with an example?
Unit 2
1) Write about Stack ADT? Write a C program to implement Stack ATD using array?

Week - 3

Week - 4

2) Explain Infix to Postfix conversions with examples?


3) Explain Queue ADT and Write a C program to implement Queue ADT using Linked
List?
4) Write about Double Ended Queues with some possible operations?
Unit 3
1) Explain Graph Traversal methods using suitable examples?

Week 5

2) What is Heap and differentiate MIN heap and MAX heap?

3) Explain how to construct Binary Tree given the In order and Preorder sequences?
In order: abcdefgh , Preorder: bdachgef
Week 6
4) Explain the properties of Binary Tree and explain the Binary Tree representation
using Arrays and Linked representation.
Unit 4
1) Write a C program to sort the given list of integers in Ascending Order by using
Insertion Sort
Week - 7
2) Write a C program to sort the given list of integers in Ascending Order by using
Quick Sort
3) Explain about Double Hashing and Extendable Hashing?
Week - 8 4) Write Heap Sort algorithm and Sort the list of numbers {20, 12, 35, 10, 80, 30, 17, 2,
1}.
Unit 5
1) Construct AVL Tree for the list {25, 30, 35, 40, 50, 55, 60, 65, 70, 75}
Week - 9
2) Write and explain Knuth-Morris-Pratt pattern matching algorithm?
GURU NANAK INSTITUTE OF TECHNOLOGY

3) Define B-Tree? Generate a B-Tree of order 3 for the following key values 25, 10, 12,
15, 39, 64, 53.
Week-10
4) Write a program to create a Binary Search tree and Recursive Traversal methods for
Inorder, Preorder and Postorder traversals.
D. PROGRAM EDUCATIONAL OBJECTIVES:
COURSE OBJECTIVES:
To understand the basic concepts such as Abstract Data Types, Linear and Non
Linear Data structures.
To understand the notations used to analyze the Performance of algorithms.
Tounderstandthebehaviorofdatastructuressuchasstacks,queues,trees,hashtables,
searchtrees, Graphs and their representations.
To choose the appropriate data structure for a specified application.
To understand and analyze various searching and sorting algorithms.
To write programs in C to solve problems using data structures such as arrays,
linked lists, stacks, queues, trees, graphs, hash tables, search trees.
COURSE OUTCOMES:
Students will be able to
The analysis and design of programs based on requirements and performance
considerations.
Evaluation of various possible technical solutions.
Implementation of these solutions in language. Syntax and logics. Program
Structure. Program Execution.

GURU NANAK INSTITUTE OF TECHNOLOGY

DIGITAL LOGIC DESIGN


A.LESSON PLAN
Subject
DIGITAL LOGIC DESIGN (A30401)
Faculty
S.Vasanti, Cell No:9490943660 vasantisambu16@gmail.com
Text Books (to be acquired by the Students)
Digital Design Morris Mano, PHI, 3rd Edition, 2006.
Book 1
Reference Books
Book-2.

Switching and finite automata theory by Zvi. Kohavi, Tata McGraw Hill.

Book-3.

Switching and Logic Design C. V. S Rao, Pearson Education.

Book-4.

Digital Principles and design Donald D. Givone, Tata McGraw Hill.

Book-5.

Fundamentals of Digital Logic and Micro Computer Design, 5th edition M.


Rafiquzzaman John Wiley.

Unit

Topic

Chapters in Book
1
2(R) 3(R)

Digital Systems

II

GateLevel Minimization

III

Combinational Circuits (CC)

IV

Synchronous Sequential Circuits

Memory

Total classes for syllabus coverage


Lectures beyond syllabus
Special Descriptive Tests
Tutorial classes
GURU NANAK INSTITUTE OF TECHNOLOGY

No
4(R)

5(R)

Classes
12
09

11

11

of

10
53
2
2
5

Gaps in syllabus
Total No. of classes

2
64

B. Syllabus

UNIT I

Digital Systems: Binary Numbers, Octal, Hexa Decimal and other base numbers,
Number base conversions, complements, signed binary numbers, Floating point
number representation, binary codes, error detecting and correcting codes, digital
logic gates(AND, NAND,OR,NOR, Ex-OR, Ex-NOR), Boolean algebra , basic
theorems and properties, Boolean functions, canonical and standard forms.

UNIT II

Gate Level Minimization and combination circuits , The K-Maps Methods,


Three Variable, Four Variable, Five Variable , sum of products , product of sums
Simplification, Dont care conditions , NAND and NOR implementation and other
two level implantation.

UNIT III

Combinational Circuits (CC): Design Procedure, Combinational circuit for


different code converters and other problems, Binary Adder, subtractor, Multiplier,
Magnitude Comparator, Decoders, Encoders, Multiplexers, Demultiplexers.

UNIT IV

UNIT V

Synchronous Sequential Circuits: Latches, Flip-flops, analysis of clocked


sequential circuits, design of counters, Up-down counters, Ripple counters ,
Registers, Shift registers, Synchronous Counters. Asynchronous Sequential
Circuits: Reduction of state and follow tables, Role free Conditions.
Memory: Random Access memory, types of ROM, Memory decoding, address and
data bus, Sequential Memory, Cache Memory, Programmable Logic Arrays,
memory Hierarchy in terms of capacity and access time.

GURU NANAK INSTITUTE OF TECHNOLOGY

C.Assignment questions
Unit-I
Convert the following numbers
1

1. 65738 to base 10
2. 00111101.01012 to base 4 and base 8
3. 95.7510 to base 2
Determine the base of the number in each case for the following operations to be correct

1.14/2=5
2. 54/4=13
3.24+17=40
Encode the word STLD in ASCII using 8 bit code

1.With left most bit always zero


2. With left most bit selected to produce even parity

Give the 8 bit data word 01011011 to generate the 12 bit composite word for the hamming code
to correct and detect the signal even

Perform the subtraction with the following unsigned binary number by taking 2s complement
1. 11011-10010
2. 11011-1101
3. 100-110000
4. 1010100-1010100
GURU NANAK INSTITUTE OF TECHNOLOGY

5. 11-1011
Simplify the following Boolean expressions to the indicated number of literals
1. AC+ABC+AC+AB to two literals
6

2. (X+Y+Z)+XY+WZ
3. AB(D+CD)+B(A+ACD) to one literal
4. (A+C)(A+C)(A+B+CD) to four literals
5. ABCD+ABD+ABCD+AD
Implement the function F with the following two level forms
1. NAND- AND

2. AND-NOR
3. OR-NAND
4. NOR-OR
F(A,B,C,D)=m(0,1,2,3,4,8,9,12)
Express the following function in standard SOP form

F=AB+CD+ABC
(b) Convert the given expression in standard POS form
F=(A+C)(B+D)(A+B)
Verify the foll0wing boolean alzebric manipulation justify each step with a reference to a
postulate

1. (X+Y+XY)(X+Y)XY=0
2. (AB+C+D)(C+D)(C+D+E)=ABC+D
B. PROVE THAT (A+B)(A+C)(B+C)=(A+B)(A+C)
(a) State duality theorem list Boolean laws and their duals
(b) Write the dual of the following

10

1. (A.B)=A+B
2. A.A=0
3. A.B=B.A
4. A.1=A

GURU NANAK INSTITUTE OF TECHNOLOGY

Unit-II
(a) Design a logic circuit to produce an output when any two or three or four switches are
closed

(b) Minimize the following Boolean functions using k map F=(2,7,8,9,10,12)


2

Minimize
the
following
Boolean
functions
using
F(A,B,C,D,E)=m(0,2,4,6,8,16,18,20,22,24,26,28,30)+d(3,7,11,15,19,23,27,31)

Using k map obtain minimal sop and minimal pos forms of the function F=(1,2,3,5,6,7,8,13)

Design a odd parity generator using gates for the decimal digits 0 to 9 represented in 8421 BCD
to the necessary truth table and draw the logic diagram and explain

Simplify the following 5 variable Boolean expression using Quine Mccluskey method
F=m(0,1,9,15,24,29,30)+d(8,11,31)

Design a combinational circuit with three inputs whose output is equal to 1 if the number of
inputs has more 1s than 0 .Realize using Nand gates

Implement the following Boolean function using 8 to 1 mux f=m(0,1,3,4,8,9,15)

Show how a 16 to 1 mux can be realized using a tree type network of 4 to 1 muxes

Implement full subtractor using de multiplexers

10

map

Give hazard free realization for the following Boolean function


F=m(0,2,6,7,8,10,12)

Unit-III
Implement the following functions using PROM
1

F1=(1,9,12,15)
F2=(0,12,3,4,5,2,7,8,10,11,13,14,15)
A combinational circuit is defined by the functions f1=m(3,5,6,7)

F2=m(0,2,4,7) Implement the circuit using PLA having 3 inputs, 4 product terms and 2
outputs
Implement the following functions

F1=(0,1,2,3,6,9,11)
F2=(0,1,6,8,9) using PLA

Illustrate how a PLA can be used for combinational logic design waith reference to the
functions
F1=m(0,1,3,4)
F2==m(1,2,3,4,5). Realise the same assuming that a PLA is available
GURU NANAK INSTITUTE OF TECHNOLOGY

Tabulate the PLA programmable table for the four Boolean functions listed below
A==m(1,2,4,6)
5

B==m(0,1,6,7)
C==m(2,6)
D==m(1,2,3,5,7)
Define the following terms of a flip flop
1. Hold time

2. Set up time
3. Propagation delay time

Give the comparison between synchronous and asynchronous sequential circuits

Convert SR Flip flop to JK flip flop

Construct a JK flip flop using a D flip flop, a 2*1 Multiplexer and inverter

10

Obtain the characteristic equations of JK,SR, D and T type flip flops. Also Explain excitation
tables of all these flip flops

Unit-IV
1

Explain capabilities and limitations of finite state state machine


Find the equivalence Partition for the given machine and a standard form of the corresponding
reduced machine
PS

NS,Z
X=0

X=1

B,0

E,0

E,0

D,0

D,1

A,0

C,1

E,0

B,0

D,O

For the machine given below find the equivalence partition and a corresponding reduced
machine in standard form
PS

NS,Z
X=0

X=1

GURU NANAK INSTITUTE OF TECHNOLOGY

D,0

H,1

F,1

C,1

D,0

F,1

C,0

E,1

C,1

D,1

D,1

D,1

D,1

C,1

B,1

A,1

Find the equivalence partition for the machine shown below


PS

NS,Z
X=0

X=1

B,1

H,1

F,1

D,1

D,0

C,0

F,1

D,1

E,1

C,1

E,1

C,1

D,1

C,0

A,1

E,1

Find the equivalence partition for the machine shown below.Show a standard form of the
corresponding reduced machine
PS

NS,Z
X=0

X=1

F,0

B,1

G,0

A,1

B,0

C,1

C,0

B,1

D,0

A,1

E,1

F,1

E,1

G,1

GURU NANAK INSTITUTE OF TECHNOLOGY

Unit-V
A. What is PLA ?

B. What are the different types of ROM ?


Tabulate the PLA programming table for the following Boolean functions.

I . A(x,y,z) = m(0,2,3,7)
II. B(x,y,z) = m(1,3,4,6)
III. C(x,y,z) = m(1, 4)

Design ,draw and explain 128 * 8 ROM using 32 * 8 ROM.

Using PLA logic, implement a BCD to excess -3 code converter. Draw and explain its truth
table and logic diagram.

Write a notes on a) ROM b) RAM c) PLA d) PAL

D. PROGRAM EDUCATIONAL OBJECTIVES:


COURSE OUTCOMES:
1.
2.
3.
4.

Students could able to understand the number systems.


Students could able to design combinational circuits.
Students could able to design sequential circuits.
They should in a position to continue with computer organization.

GURU NANAK INSTITUTE OF TECHNOLOGY

COURSE EDUCATIONAL OBJECTIVES:


1.
2.
3.
4.

To understand basic number systems codes and logical gates.


To understand the Boolean algebra and minimization logic.
To understand the design of combinational, sequential circuits.
To understand the basics of various memories.

ELECTRONIC DEVICES AND CIRCUITS


A.LESSON PLAN
Subject

ELECTRONICS DEVICES AND CIRCUITS

Faculty

GURU NANAK INSTITUTE OF TECHNOLOGY

Text Books (to be acquired by the Students)


Millmans Electronic Devices and Circuits J. Millman, C.C. Halkias and
Book 1
SatyabrataJit, 2ed., 1998, TMH.
Book 2
Electronic Devices and Circuits Mohammad Rashid, CengageLearing, 2013
Electronic Devices and Circuits David A. Bell, 5 Ed, Oxford
Book 3
Reference Books
Book 1
Book 2
Book 3
Book 4
Book 5
Book 6
Unit

Integrated Electronics J. Millman and Christos C. Halkias, 1991 ed., 2008, TMH
Electronic Devices and Circuits R.L. Boylestad and Louis Nashelsky, 9 Ed., 2006,
PEI/PHI.
Electronic Devices and Circuits B. P. Singh, Rekha Singh, Pearson, 2Ed, 2013.
Electronic Devices and Circuits - K. Lal Kishore, 2 Ed., 2005, BSP.
Electronic Devices and Circuits Anil K. Maini, VarshaAgarwal, 1 Ed., 2009, Wiley
India Pvt. Ltd.
Electronic Devices and Circuits S.Salivahanan, N.Suresh Kumar, A.Vallavaraj, 2 Ed.,
2008, TMH.
Chapters in Book
No of Classes
Topic
B1
B2
B3
B4 B5

P-N Junction Diode

II

Rectifiers and Filters

III

Bipolar Junction Transistor and


UJT
Transistor Biasing and
Stabilization
Field Effect Transistor and FET
Amplifiers\

IV
V

1, 5

12

12

12

Contact classes for syllabus coverage


Lectures beyond syllabus
Special Descriptive Tests
Tutorial classes
Remedial classes
Total No. of classes

B.SYLLABUS
GURU NANAK INSTITUTE OF TECHNOLOGY

12

56
2
2
2
2
64

Unit I

P-N Junction Diode: Qualitative Theory of P-N Junction, P-N Junction as a Diode,
Diode Equation, Volt-Ampere Characteristics, Temperature dependence of VI
characteristic, Ideal versus Practical Resistance levels (Static and Dynamic), Transition
and Diffusion Capacitances, Diode Equivalent Circuits, Load Line Analysis, Breakdown
Mechanisms in Semiconductor Diodes, Zener Diode Characteristics. Special Purpose
Electronic Devices: Principle of Operation and Characteristics of Tunnel Diode (with the
help of Energy Band Diagram), Varactor Diode, SCR and Semiconductor Photo Diode.

Unit II

Rectifiers and Filters : The P-N junction as a Rectifier, Half wave Rectifier, Full wave
Rectifier, Bridge Rectifier, Harmonic components in a Rectifier Circuit, Inductor Filters,
Capacitor Filters, L- Section Filters, - Section Filters, Comparison of Filters, Voltage
Regulation using Zener Diode.

Unit III

Bipolar Junction Transistor and UJT: The Junction Transistor, Transistor Current
Components, Transistor as an Amplifier, Transistor Construction, BJT Operation, BJT
Symbol, Common Base, Common Emitter and Common Collector Configurations, Limits
of Operation , BJT Specifications, BJT Hybrid Model, Determination of h-parameters
from Transistor Characteristics, Comparison of CB, CE, and CC Amplifier
Configurations, UJT and Characteristics.

Unit IV

Transistor Biasing and Stabilization: Operating Point, The DC and AC Load lines,
Need for Biasing, Fixed Bias, Collector Feedback Bias, Emitter Feedback Bias, Collector
- Emitter Feedback Bias, Voltage Divider Bias, Bias Stability, Stabilization Factors,
Stabilization against variations in VBE and , Bias Compensation using Diodes and
Transistors, Thermal Runaway, Thermal Stability, Analysis of a Transistor Amplifier
Circuit using h-Parameters.

Unit V

Field Effect Transistor and FET Amplifiers


Field Effect Transistor: The Junction Field Effect Transistor (Construction, principle of
operation, symbol) Pinch-off Voltage - Volt-Ampere characteristics, The JFET Small
Signal Model, MOSFET (Construction, principle of operation, symbol), MOSFET
Characteristics in Enhancement and Depletion modes.
FET Amplifiers: FET Common Source Amplifier, Common Drain Amplifier,
Generalized FET Amplifier, Biasing FET, FET as Voltage Variable Resistor, Comparison
of BJT and FET.

GURU NANAK INSTITUTE OF TECHNOLOGY

C. ASSIGNMENT QUESTIONS
S.NO.
UNIT-I
1
2

3
4
5

QUESTIONS
Explain the principle with necessary equations how do you determine whether a
given semiconductor is p-type or n-type.
Draw the band diagram of pn junction under open circuit conditions and explain.
Sketch charge density, electric field intensity and potential energy biased for
electrons and holes.
Distinguish between
(i)
Drift current and diffusion current.
(ii)
Diffusion capacitance and transition capacitance
Explain the term Transition capacitance CT of a PN junction diode
Explain the process of breakdown of a p-n junction diode due to
(i) Avalanche effect (ii)
Zener effect

UNIT-II
6
7
8
9

10

UNIT-III
11
12
13
14
15

Define the terms as referred to Full wave rectifier circuit.


i.
PIV
ii. Average dc. Voltage
iii. RMS current
iv. Ripple factor.
Compare the performance of inductive, L-section and section filters
Compare half wave, Full wave and Bridge rectifier
Compare the performance of series inductor, L-Section and p - Section filters
Derive the following expression for
(a) Ripple in a - section filter when used with a half wave rectifier.
(b) The ripple factor of half wave rectifier and full wave rectifier.
(c) Ripple factor in a full wave rectifier using an inductor filter.
(d) D.C. or average value of current, R.M.S. value of current and Average
voltage across the load for a half wave rectifier.
Explain the mechanism of current flow in a PNP and NPN Transistor
Draw neat sketches and explain the cut off region, active region and saturation
region of a transistor output characteristic.
Define , , of a transistor show have they are related to each other
Draw the input and output characteristics of transistor in CE, CB, and CC
configurations with regions of operation and explain
What is meant by base width modulation? Explain how input characteristics can be
affected due to this effect.

GURU NANAK INSTITUTE OF TECHNOLOGY

UNIT-IV
16
17
18
19
20
21
22
23
24
25
UNIT-V
26
27
28
29
30
31
32
33
34
35

Write down the need for bias stabilization


Write down the requirements of a biasing circuit
Explain briefly about the simplest biasing circuit
Explain thermal instability
Draw a BJT fixed bias circuit and derives the expression for the stability factors
Draw the h-Parameters equivalent circuit of CC, CE configuration and what are the
typical values of h-Parameters for a transistor in CE and CB configuration
Draw the circuit diagram of small signal CE amplifier circuit and give its
equivalent hybrid model.
Compare transistor amplifier configurations related to AI, AV, input resistance RI
and out resistance RO
Mention the advantages of and disadvantages of graphical analysis of the operation
of transistor as an amplifier
Draw a low frequency equivalent circuit for a CC amplifier and derive the relations
for the current gain, voltage gain and input resistance in terms of h-parameters
How does the FET behave for the small and large values of | VDS |
Define pinch off voltage Vp. Sketch the depletion region before and after pinchoff
Draw and explain the VI characteristics of JFET
Define Tran conductance gm, Drain resistance rd, and Amplification factor of an
FET
Draw and explain the drain characteristics and transfer curve of Enhancement
MOSFET
Explain the biasing of JFET
Study thoroughly and list out different types of uni-polar and bi polar devices and
compare their salient features
xplain the working principle of UJT with its characteristics. Draw the circuit
diagram of a saw tooth wave form generator using UJT and explain its
operation
Discuss why transistor is considered as current control device and why FET is
considered as voltage controlled device
Draw the circuit diagram of common drain amplifier and derive expressions for
voltage gain and input resistance

GURU NANAK INSTITUTE OF TECHNOLOGY

D. PROGRAM EDUCATIONAL OBJECTIVES:


COURSE OBJECTIVES:
This course aims to provide students with the basic concepts behind the design and
operation of common semiconductor devices and electronic circuits. The objective is to
enable students to analyze simple but important applications of these devices in electronic
circuits
COURSE OUTCOMES:
Upon successful completion of this course, students should be able to:
1. Ability to know and to understand the categories in the field of solid state materials
and get to know about the importance of semiconductors.
2. Know the property of semiconductor materials by projecting the view of

energy

bands and analyzing the characteristics of semiconductor components like diode.


3. Know the complete internal structure of PN junction including types of bias.
4. Consequently view the nature of electronics compromising 4 Cs components,
communication, computation and control.
5. Application of diode in power supply circuits by rectifiers, filters and by regulation
using zener diode.
6. Introducing the theory of bipolar transistor by this, to know about the operation,
biasing effects and stabilization of factors, introducing the hybrid models to know
how to block the large capacitive values and to know about how small signal models
are needed in various configurations to determine frequency response and phase
operations of voltage gain and application of configurations in hardware
implementations.
7. Introducing the theory of channel effect transistors, by analyzing then to introduce the
GURU NANAK INSTITUTE OF TECHNOLOGY

concept of MOS transistor and to know the operation of MOS transistor. And get to
apply the concept of charge inversion on MOSFET.
8. Gain the idea of MOSFET later to know the structure CMOS by considering the
factors in application of determining digital circuits.
9. Further to know the knowledge in the field of solid or integrated circuit technology
and its trends.
10. Idea of digital electronics. Scope to introduce digital circuits.

BASIC ELECTRICAL ENGINEERING


A. LESSION PLAN
Subject

BASIC ELECTRICAL ENGINEERING

Faculty
Book 1

Text Books (to be acquired by the Students)


Basic Concepts of Electrical Engineering By P.S.Subramanyam

Book 2

Basic Electrical Engineering - By S.N.Singh

Book 3
Book 4
Book 5
Book 6
Book 7
Unit
I

Reference Books
Basic Electrical engineering By
,Chandrakumarchanda,Tata-McGraw Hill

AbijitCharbartha,SudittaNath

Principles of Electrical Engineering By V.K Mehta, S.Chand Publications.


Basic Electrical Engineering By T.K.Nagasarkar and M.S. Sukhija Oxford
University Press
Fundamentals of electrical engineering By RajendraPrasad,PHI

Basic Electrical Engineering -By D.P.Kothari& I.J. Nagrath ,McGraw Hill


Chapters in Book
No of
Topic
Classes
1
2
3
4
1,
2
1,2,3
1,2
1,2
17
INTRODUCTION TO
ELECTRICAL ENGINEERING

GURU NANAK INSTITUTE OF TECHNOLOGY

II

ALTERNATING QUANTITIES

III
IV
V

TRANSFORMER
DC & AC MACHINES
BASIC INSTRUMENTS

4, 5

3,4

12

6,7

09

9,10

7,8

7,8

15

10

9,10

10

11

Contact classes for syllabus coverage


Lectures beyond syllabus
Special Descriptive Tests
Tutorial classes
Remedial classes
Total No. of classes

64
2
2
4
2
74

B. SYLLABUS
BASIC ELECTRICAL ENGINEERING SYLLABUS

UNIT-1

Ohms law, basic circuit components, Kirchhoffs laws. Simple problems. Network AnalysisBasic definitions, types of elements , types of sources, resistive networks, inductive
networks, capacitive networks, series parallel circuits, star delta and delta star
transformation , Network theorems-Superposition, Theveninss, analysis of dc networks and
simple problems.

UNIT-2

Principle of ac voltages , waveforms and basic definitions, root mean square and average
values of alternating currents and voltage, form factor and peak factor, phasor representation
of alternating quantities, the J operator and phasor algebra, analysis of ac circuits with single
basic network element, single phase series circuits

GURU NANAK INSTITUTE OF TECHNOLOGY

UNIT-3

Principles of operation, Constructional Details, Ideal transformer and practical Transformer,


Losses, Transformer Tests, Efficiency and Regulation calculations(All the above topics are
only elementary treatment and simple problems)

UNIT-4

Principles of operation, Constructional Details, Ideal transformer and practical Transformer,


Losses, Transformer Tests, Efficiency and Regulation calculations(All the above topics are
only elementary treatment and simple problems)

UNIT-5

Basic Instruments : Introduction, classification of instruments, operating principles, essential


features of measuring instruments, Moving coil permanent magnet (PMMC) instruments,
Moving Iron of Ammeters and Voltmeters(Elementary Treatment only)

C. ASSIGNMENT QUESTIONS
UNIT I
1 Explain the terms a) voltage b) current c) power d) energy
.
2 Explain the Ohms law? Explain the Kirchhoffs Laws?
.
3 Explain the Thevenins theorem?
4 Derive the expression for star-to-delta transformation?
5 Explain KVL & KCL.

GURU NANAK INSTITUTE OF TECHNOLOGY

UNIT II
6 Explain the terms a) cycle b) frequency c) tie period d) peak value
7 Compare the series and parallel circuits?
For RLC series circuit, R=200 ohms, L=10xe3 henries, C=0.5 e-6 faradas and
8 applied voltage E=230v and angular frequency is 320 radians, find the voltage
across elements and draw the phasor diagram ?
9

Explain behavior of voltage and current in pure resistive circuit?

10

Derive the expression for power in capacitive circuit?


UNIT: III
1 Explain the Working principle of transformers?
1
1 Derive the expression for EMF equation of transformer?
2
1 Derive the expression for condition of maximum efficiency of a practical
3 transformer?
A 1- transformer 600kv,6000w,50hz, 100v, 700watts from supply with o.c on
1 secondary sc, primary takes I1=10A at 160v & 1000w. Determine efficiency
4 at p.f=0.8 & find secondary Il at which maximum efficiency is occurred?
A 50kva, 200/110 v , transformer has full test results ,
1 o.c test LV side - 110v, 10a, 400w SC test HV side 90v, 20.5a, 808w
5 calculate parameters of HV side

16

17

18

Unit-IV
a) Explain the constructional features of a D.C. Machine with a help of a neat
sketch.
b) Name the main parts of a D.C. Machine and state the materials of which each
part is made.
Explain the working principle of a dc motor and derive the expression for the
torque developed in armature?
(a)With the help of neat sketches, explain torque-speed characteristics of he
following
D.C. Motors (i) D.C. Series (ii) D.C. Shunt
(b)Find the torque in N-m exerted by a 4-pole series motor whose armature has
1200 conductors connected up in a 2-circuit winding. The motor current is 10A
and the flux per pole is 0.02 Wb.
c)A 4-pole ,220 V shunt motor has 540 lap wound conductor. it takes 32 A from
the supply mains and develops o/p power of 5.595kw.the field winding takes 1
A .the armature resistance is 0.09ohm and the flux per pole is 30 mwb
.calculate(i)the speed(ii)the torque developed in Newton-meter?

GURU NANAK INSTITUTE OF TECHNOLOGY

19

( a)What are all the various losses in a D.C. Machine?


(b) Derive an expression for efficiency of a D.C. Machine.
(c) A 20 kw, 250 V d.c. shunt generator has armature and field resistances of
0.04and 200 respectively. Determine the total armature power
developed
when working
(i) as generator delivering 20 kw output and
(ii) as a motor taking 20 kw input. .
Explain the construction and working principle of 3-phase induction motor.

20
Unit-V
21

22

23
24
25

What is the essential torques in an electrical instrument?


(a) Explain principle and operation of PMMC with a neat sketch
(b) The coil of a moving coil meter has a resistance of 5 ohms and given
full scale deflection when a current of 15A passes through it. What
modifications must be made to the instrument to convert it to (i) an
ammeter reading of 15 A (ii) an volt meter reading of 15 V
Explain the steps involved in the extension range of voltmeters.
The coil of a moving coil meter has a resistance of 5 ohms and given full scale
deflection When a current of 15mA passes through it.What modification must
be made to the instrument to convert it in to
i)an ammeter reading to 15A ii) an voltmeter reading to 15V
Describe different methods to produce control torque.

COURSE EDUCATIONAL OBJECTIVES (CEOS):


1. To introduce the concepts of Electrical Engineering and basic Circuits.
2. To clearly understand fundamentals of Alternating Quantities.
3. To introduce the Electrical Transformers.
GURU NANAK INSTITUTE OF TECHNOLOGY

4. To introduce the design of DC & AC Machines


5. To design the basic Measuring Instruments
COURSE OUTCOMES (COS):
On successful completion of the module students will be able to:
a) Understand the basic concepts of Electrical quantities and its characteristics.
b) Able to design different electrical circuits
c) Understand the concept of AC quantities and its waveforms.
d) Able to understand the ideal and practical Transformers.
e) Understand the DC Generator and its characteristics.
f) Understand the DC Motor with different loads.
g) Understand the concept AC Machines and is characteristics.
h) Understand the classifications of instruments.
i) Able to design the AC and DC measuring instruments

GURU NANAK INSTITUTE OF TECHNOLOGY

PROBABILITY & STATISTICS


A. LESSON PLAN
Subject

Probability & Statistics

Faculty
Text Books (to be acquired by the Students)
Book 1
Book 2

1) Higher Engineering Mathematics by Dr. B.S. Grewal, Khanna Publishers


2) Probability and Statistics for Engineers and Scientists by Sheldon M.Ross, Academic
Press

Book 3

3) Operations Research by S.D. Sarma,

Reference Books
Book 4

. Mathematics for Engineers by K.B.Datta and M.A S.Srinivas,Cengage Publications

Book 5

2. Probability and Statistics by T.K.V.Iyengar&B.Krishna Gandhi Et

Unit

Topic

Chapters in the Books


1

2
1

No of Classes

Single Random variables and


probability distributions

1,2

II

Multiple Random variables,


Correlation & Regression

1,2

10

III

Sampling Distributions and Testing


of Hypothesis

1,2

15

IV

Queuing Theory:

Stochastic processes

15

10
3

10

Contact classes for syllabus coverage

60

Contact classes for syllabus coverage: 60


Unit test:02, Tutorial : 03
Total Classes

65

GURU NANAK INSTITUTE OF TECHNOLOGY

B. SYLLABUS

Unit I

Single Random variables and probability distributions: Random variables


Discrete and continuous, Probability distributions, mass function/ density function
of a probability distribution. Mathematical Expectation Moment about origin,
generating function of probability distribution Central moments Moment.
Binomial, Poisson & normal distributions and their properties. Moment generating
functions of the above threedistributions, and hence finding the mean and variance.

Unit II

Multiple Random variables, Correlation & Regression: Joint probability


distributions- Joint probability mass /density function, Marginal probability mass /
density functions, Covariance of two random variables, Correlation -Coefficient of
correlation, The rank correlation. Regression- Regression Coefficient, The lines of
regression and multiple correlation & regression.
Sampling Distributions and Testing of Hypothesis
Sampling: Definitions of population, sampling, statistic, parameter. Types of
sampling, Expected values of Sample mean and variance, sampling distribution,
Standard error, Sampling distribution of means and sampling distribution of
variance. Parameter estimations likelihood estimate, interval estimations Testing
of hypothesis: Null hypothesis, Alternate hypothesis, type I, & type II errors
critical region, confidence interval, Level of significance. One sided test, two sided
test, Large sample tests:

Unit III

(i) Test of Equality of means of two samples equality of sample mean and
population mean (cases of known variance & unknown variance, equal and unequal
variances)
(ii) Tests of significance of difference between sample S.D and population S.D.
(iii) Tests of significance difference between sample proportion and population
proportion & difference between two sample proportions.
Small sample tests: Student t-distribution, its properties; Test of significance
difference between sample mean and population mean; difference between means
of two small samples Seducers F- distribution and its properties. Test of equality of
two population variances Chi-square distribution, its properties, Chi-square test of
goodness of fit.

Unit IV

Queuing Theory: Structure of a queuing system, Operating Characteristics of


queuing system, Transient and steady states, Terminology of Queuing systems,
Arrival and service processes- Pure Birth-Death process Deterministic queuing
models- M/M/1 Model of infinite queue, M/M/1 model of finite queue .

GURU NANAK INSTITUTE OF TECHNOLOGY

Unit V

Stochastic processes: Introduction to Stochastic Processes Classification of


Random processes, Methods of description of random processes, Stationary and
non-stationary random process, Classification of Random processes, Methods of
description of random processes Markov process, Markov chain, classification of
states Examples of Markov Chains, Stochastic Matrix.

C.ASSIGNMENT PROBLEMS
UNIT I
1. Out of 800 families with 5 children each, how many would you expect to have
a) 3 boys
b) 5 girls
c) either 2 or 3 boys d) at least 1 boy? Assume equal probabilities for boys
and girls.
2. If x is a Poisson variate such that 3p(x=4)=1/2 p(x=2)+p(x=0), find
a) the mean of x
b) p(x2)
3. Fit a Poisson distribution for the following data.
x:0
1
2
3
4
f : 109 65
22
3
1
4. Average no of accidents on any day on a national highway is 1.8. Determine the probability that the
no. of accidents are a) at least one b) at most one
5. In a sample of 1000 cases, the mean of a certain test is 14 and S.D is 2.5. Assuming the distribution
to be normal, find how many students will have
1) Score between 12 and 15?
2) Above 18?
6. Two dice are thrown .Let X assigns to each point (a,b) in S the maximum of its numbers i.e., X(a,b)
= max (a,b) .Find the probability distribution. X is a random variable with X(s) = { 1,2,3,4,5,6 }.Also
find the mean and variance of the distribution.
UNIT II
1. Calculate karlpearsons correlation co-efficient for the following data
X
28
41
40
38
35
33
40
32
36
33
Y
23
34
33
34
30
26
28
31
36
38
2. From the following data calculate the rank correlation co-efficient after making
adjustment for
tied ranks?
X 48 33
40
9
16
16
65
24
16
57
Y 13 13
24
6
15
4
20
9
16
19.
3. Find the two regression lines from the following data?
X 78 77
85
88
87
82
81
77
76
83
97
93
Y 84 82
82
85
89
90
88
92
83
89
98
99
4. By the method of least squares fit a parabola of the form y= a+ bx +cx2 for the following data
X 2
4
6
8
10
Y 3.07 12.85 31.47 57.38 91.29
5. The following table gives the classification of 100 works according to sex and nature of work. Test
whether the nature of work is independent of the sex of the worker.
Stable
Unstable
Total
GURU NANAK INSTITUTE OF TECHNOLOGY

Male
Female
Total

40
10
50

20
30
50

60
40
100

6. Show that the maximum value of rank correlation coefficient is 1.


UNIT - III
1 . a . It is desired to estimate the mean number of hours of continuous use of a certain computer will
first require repairs. If it can be assumed that = 48 hours, how large a sample be needed so that one
will be able to assert with 90% confidence that the sample mean is off by most 10 hours.
b. What is the size of the small required to estimate an unknown proportion to within a maximum error
of 0.06 with at least 95% confidence.
2. A population consists of six numbers 4,8,12,16,20,24. Consider all samples of size two which can be
drawn without replacement from this population. Find a) the population mean b) The population
standard deviation c) The mean of the sampling distribution of means d) The standard deviation of
sampling distribution of means.
3. A sample of 400 items is taken from a population whose S.D is 10. The mean of the sample is 40.
Test whether the sample has come from a population with mean 38. Also calculate 95% confidence
interval for the population.
4. Define
i.
Statistical hypothesis and its types.
ii.
Types of errors.
iii.
Critical region.
iv. Level of significance
v.
5. A random sample of size 25 from a normal population has the mean x = 47.5 and the standard
deviation s = 8.4 . Does this information tend to support or refuse the claim that the mean of the
population is = 42.5 ?
6. For an F-distributin .find a) F0.05 with v1 = 7 and v2 = 15 b) F0.01 with v1 = 24 and v2 = 19
c ) F0.95 with v1 = 19 and v2 = 24 c ) F0.99 with v1 = 28 and v2 = 12
UNIT IV
1. Define
a).Queue or Waiting line. b). Queue discipline.
2. A bank plans to open a single sever drive-in banking facility at a certain centre . It is estimated that
20 customers will arrive each hour on average, if on average , it requires 2 minutes to process a
customers transaction, determine a) the proportion of time that the system will be idle b) On average
, how long a customer will have to wait before reaching the sever c) The fraction of customers who
will have to wait.
3. A toll gate is operated on a freeway where cars arrive according to a Poisson distribution with mean
frequency of 1.2 cars per min. the time of completing payment follows an exponential distribution with
GURU NANAK INSTITUTE OF TECHNOLOGY

mean of 20 sec. Find


i.
The idle time of the counter.
ii.
Average no of cars in the system.
iii.
Average no of cars in the queue.
iv. Average time that a car spends in the system.
v. Average time that a car spends in the queue.
vi.
The probability that a car spends more than 30 sec. in the system.
4. Barber a takes 15 min. to complete one hair cut. Customers arrive in his shop at an average rate of
one every 30 min. Barber B takes 25 min. to complete one hair cut. and Customers arrive in his shop at
an average rate of one every 50 min. The Arrival processes are Poisson and the service times follow an
exponential distribution.
a).Where would you expect a bigger queue?
b). Where would you require more time waiting included to complete a hair cut.
5. Patients arrive at a clinic in poisson manner at an average rate of 6 per hour . The doctor on average
can attend to 8 patients per hour. Assuming that the service time distribution is exponential, find a)
Average number of patients waiting in queue b) Average time spent by a patient in the clinic.
6. Consider a box office ticker window being managed by a single server . Customer arrive to
purchase tickets according to poisson input process with mean rate of 30 per hour. The time required to
sever a customer has an exponential distribution with mean a mean of 910 seconds. Determine a)
Fraction of the time the server is busy. b) The average number of customers queuing for service.
UNIT V
1. Define stochastic process and its types.
2 .Define

a). Stochastic matrix.

b). Markov chain.

3. The transition probability matrix of a Markov chain is given by


0.6 0.7 0
0.1 0.4 0.5

0 0.2 0.8
4. Which of the following matrices are stochastic?
0
1
0
1 / 2 1 / 4 1 / 4
0
1 / 3 2 / 3 4 / 3
1

0
1
0
1 1/ 2
a).
b). 1 / 2
c). 1 / 2 1 / 2
5. A gambler has Rs. 2. He bets Rs. 1 at a time and wins Rs. 1 with probability 0.5 .He stops playing if
he loosesRs. 2 or wins Rs. 4. a) What is the Transition probability matrix of the related markov
chain ? b) What is the probability that he has lost his money at the end of 5 plays ?
6. Three boys A,B and C are throwing a ball to each other . A always throws the ball to B and B always
GURU NANAK INSTITUTE OF TECHNOLOGY

throws the ball to C but c is just as likely to throw the ball to B as to A. Show that the process is
Markovian.Find the transition matrix and classify the states. Do all the states are ergodic ?

D. PROGRAM EDUCATIONAL OBJECTIVES:


COURSE OBJECTIVES:

These graduates will develop the statistical skills needed for their own research
programs. Depending on particular graduate needs, necessary skills may include
knowledge of advanced statistical concepts, design of experiments, collection of
data, and analysis of data.

Understand linear algebra and mathematical statistics that are the foundation for
econometric analysis.

General knowledge of methodological approaches in econometrics (e.g., least


squares, maximum
likelihood, general method of moments, non-parametric models, simulation and
Monte Carlo
techniques).

COURSE OUTCOMES:

GURU NANAK INSTITUTE OF TECHNOLOGY

Demonstrate understanding of statistical concepts embedded in their courses.:


Demonstrate proficiency in analyzing data using methods embedded in their
courses.

Be proficient with statistical software packages appropriate for needed data


analysis.

Be proficient with multiple statistical software packages and use appropriate


statistical software for data analysis.
Apply concepts and skills to solve problems that arise in other
disciplines.

GURU NANAK INSTITUTE OF TECHNOLOGY

DATA STRUCTURES LAB


Objectives:

To write and execute programs in C to solve problems using data structures such as
arrays, linked lists, stacks, queues, trees, graphs, hash tables and search trees.

To write and execute write programs in C to implement various sorting and


searching methods.

Recommended Systems/Software Requirements:

Intel based desktop PC with minimum of 166 MHZ or faster processor with at
least 64 MB RAM and 100MB free disk space.

C compiler.

Week1: Write a C program that uses functions to perform the following:


a) Create a singly linked list of integers.
b) Delete a given integer from the above linked list.
c) Display the contents of the above list after deletion.
Week2: Write a C program that uses functions to perform the following:
a) Create a doubly linked list of integers.
b) Delete a given integer from the above doubly linked list.
c) Display the contents of the above list after deletion.
Week3:Write a C program that uses stack operations to convert a given infix
expression into its postfix Equivalent, Implement the stack using an array.
Week4:Write C program to implement a double ended queue ADT using
i)array and ii)doubly linked list respectively.
Week5: Write a C program that uses functions to perform the following:
a) Create a binary search tree of characters.
b) Traverse the above Binary search tree recursively in Post order.
Week6: Write a C program that uses functions to perform the following:
a) Create a binary search tree of integers.
b) Traverse the above Binary search tree non recursively in inorder.
Week7: Write C program for implementing the following sorting methods to arrange
a list of integers in Ascending order:
GURU NANAK INSTITUTE OF TECHNOLOGY

a)

Insertion sort

Week8: Write C

b) Merge sort

programs for implementing the following sorting methods to

arrange a list of integers in ascending order:


a)

Quick sort

b) Selection sort

Week9:i)Write a C program to perform the following operation:


a)Insertion in to a B-tree.
ii)Write a C program for implementing Heap sort algorithm for sorting a
given list of integers in ascending order.
Week10: Write a C program to implement all the functions of a dictionary (ADT)
using hashing.
Week11:

Write

programforimplementingKnuth-Morris-

Prattpatternmatchingalgorithm.
Week12: Write C programs for implementing the following graph traversal
algorithms:
a)Depth first traversal

b)Breadth first traversal

TEXT BOOKS:
1. C and Data Structures, Third Edition, P.Padmanabham, BS Publications.
2. C and Data Structures, Prof. P.S.Deshpande and Prof. O.G. Kakde, Dreamtech Press.
3. Data structures using C, A.K.Sharma, 2ndedition, Pearson.
4. Data Structures using C, R.Thareja, Oxford University Press.
5. C and Data Structures, N.B.Venkateswarlu and E.V.Prasad,S.Chand.
6. C Programming and Data Structures, P.Radha Krishna, Hi-Tech Publishers.
Outcomes:
1. Ability to identify the appropriate data structure for given problem.
2. Graduate able to design and analyze the time and space complexity of algorithm or
program.
3. Ability to effectively use compilers includes library functions, debuggers and trouble
shooting.

GURU NANAK INSTITUTE OF TECHNOLOGY

BASIC ELECTRICAL ENGINEERING LAB

PART-A

1. Verification of super position and reciprocity theorems.


2. Verification of maximum power transfer theorem. verification on DC with
resistive load.
3. Experimental determination of Theremins theorem.
4. Magnetisation characteristics of DC shunt generator.
5. Swinburnes test on DC shunt machine(Pre-Determination of efficiency of a
given DC shunt machine working as motor and generator).
6. Brake test on DC shunt motor. Determination of the performance
characteristics.
7. OC&SC Test on single phase transformer(predetermination of efficiency and
regulation at given power factors).
7. Brake test on three phase induction motor (performance characteristics).

PART-B
GURU NANAK INSTITUTE OF TECHNOLOGY

5.

1. P N Junction diode characteristics (Forward bias, Reverse bias)


2. Zener diode characteristics.
3. Transistor CE Characteristics (input and output).
4. Rectifier without filters (full wave and half wave).
Rectifier with filters (full wave and half wave).

GURU NANAK INSTITUTE OF TECHNOLOGY

You might also like