Professional Documents
Culture Documents
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
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
05
IV
09
PART B
16
20
28
33
38
44
46
PART A
I. GENERAL INFORMATION
1. About the College
GURU NANAK INSTITUTE OF TECHNOLOGY
11
Contact Information
Principal
8096609821
Vice Principal
8096609840
HOD ECE
Prof. Kedarnath
80966 09829
HOD MECH
8096609836
8096609826
HOD CIVIL
8096609827
HOD EEE
8498056996
HOD H & S
Dr.G.Srinivas
8096195678
General Manager
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
Good infrastructure
Objectives:
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
Designation
SYSTEM ADMINISTRATOR
PROGRAMMER
PROGRAMMER
PROGRAMMER
PROGRAMMER
OFFICE ASSISTANT
EVENT
Duration
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
Phone Number
8500000076
9704209701
5
6
7
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:
Roll No
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
K.THARUNI REDDY
M.SAI AMAR
S.NITHISHA
YASH DALMIA
C.V.VISHAL
IV B Tech CSE-B
12831A0509
12831A05A1
12831A0574
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
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.
EVENT
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.
The Mission
GNIT (in
pursuance of its
vision)
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.
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.
PEOs
Program Outcomes
A
II
III
PART B
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
A.LESSON PLAN
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
65
Total Classes
75
B. SYLLABUS
GURU NANAK INSTITUTE OF TECHNOLOGY
UNIT- I
UNIT- II
UNIT- III
UNIT- IV
UNIT- V
C. ASSIGNMENT QUESTIONS
Mathematical Foundations of Computer Science
Assignment Questions
Unit- I
Unit-II
UnitIII
UnitIV
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
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.
DATA STRUCTURES
A. LESSON PLAN
DATA STRUCTURES
Faculty
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
5&6
14
IV
7&8
12
SearchTrees &
Patternmatchingalgorith
m
10 & 11
13
59
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
Unit III
Unit IV
Unit V
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
Week 5
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.
Switching and finite automata theory by Zvi. Kohavi, Tata McGraw Hill.
Book-3.
Book-4.
Book-5.
Unit
Topic
Chapters in Book
1
2(R) 3(R)
Digital Systems
II
GateLevel Minimization
III
IV
Memory
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
UNIT III
UNIT IV
UNIT V
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
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
Unit-II
(a) Design a logic circuit to produce an output when any two or three or four switches are
closed
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
Show how a 16 to 1 mux can be realized using a tree type network of 4 to 1 muxes
10
map
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
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
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
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
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
Unit-V
A. What is PLA ?
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)
Using PLA logic, implement a BCD to excess -3 code converter. Draw and explain its truth
table and logic diagram.
Faculty
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
II
III
IV
V
1, 5
12
12
12
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
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
UNIT-IV
16
17
18
19
20
21
22
23
24
25
UNIT-V
26
27
28
29
30
31
32
33
34
35
energy
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.
Faculty
Book 1
Book 2
Book 3
Book 4
Book 5
Book 6
Book 7
Unit
I
Reference Books
Basic Electrical engineering By
,Chandrakumarchanda,Tata-McGraw Hill
AbijitCharbartha,SudittaNath
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
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
UNIT-3
UNIT-4
UNIT-5
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.
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
10
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?
19
20
Unit-V
21
22
23
24
25
Faculty
Text Books (to be acquired by the Students)
Book 1
Book 2
Book 3
Reference Books
Book 4
Book 5
Unit
Topic
2
1
No of Classes
1,2
II
1,2
10
III
1,2
15
IV
Queuing Theory:
Stochastic processes
15
10
3
10
60
65
B. SYLLABUS
Unit I
Unit II
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
Unit V
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
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 ?
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.
COURSE OUTCOMES:
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.
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.
a)
Insertion sort
Week8: Write C
b) Merge sort
Quick sort
b) Selection sort
Write
programforimplementingKnuth-Morris-
Prattpatternmatchingalgorithm.
Week12: Write C programs for implementing the following graph traversal
algorithms:
a)Depth 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.
PART-A
PART-B
GURU NANAK INSTITUTE OF TECHNOLOGY
5.