Evaluation Scheme B.Tech (Computer Science and Engineering) Semester-Iii

EVALUATION SCHEME
B.TECH (COMPUTER SCIENCE AND ENGINEERING)

SEMESTER- III
Shri Ram Murti Smarak Engineering Institutions. Page - 1 -

ACADEMIC HANDBOOK
DEPARTMENT OF
COMPUTER SCIENCE AND ENGINEERING
VISION
Engineering the future of the nation by transforming the students to be skilled technocrats, innovative
leaders and environmentally receptive citizens. The Vision of the department is to carve the youth as
dynamic, competent, valued and knowledgeable professionals who shall lead the Nation to a better future.
MISSION
 To flourish the SRMS as the World Leader in Computer Science & Engineering through continuous
research & development directed towards the betterment of the society.
 To establish the cooperative learning environment for facilitating the quality academics, state-of-the
art research and remarkable development activities.
 To establish World Class resources especially Research & Development Laboratories, Value Addition
courses etc. for the in-house up gradation & community services.
 To groom the students into Industry – Ready Professionals through a rigorous training in a self-
disciplined environment.
 To groom the learned pool of faculty in accordance with the recent advancements in the field of
Computer Science & Engineering.
PROGRAM EDUCATIONAL OBJECTIVES
 To encourage students to use their practical, computer and analytical skills to build industry ready
engineers to solve multi-disciplinary sustainable projects.
 To keep abreast the students with the use of modern tools, equipments and software and inculcating
the habit of lifelong learning.
 To foster team work and professional ethics among students towards devising feasible solutions to
problems and project work.
 To augment the existing facilities: Library, Labs and efforts excel classroom teaching, thereby
arousing curiosity, ultimately resulting in innovative ideas.
 To enhance technical skills of laboratory staff, provision to train the lab staff, encouraging staff to
improve qualifications offering incentives.
PROGRAM SPECIFIC OUTCOMES
 Foundation of mathematical concepts: To use mathematical concepts to solve problem using suitable
mathematical analysis, data structure and suitable algorithm.
 Foundation of Computer System: the ability to interpret the fundamental concepts and methodology of
computer systems. Students can understand the functionality of hardware and software aspects of
computer systems.
 Foundations of Software development: the ability to grasp the software development lifecycle and
methodologies of software systems. Possess competent skills and knowledge of software design
process. Familiarity and practical proficiency with a broad area of programming concepts and provide
new ideas and innovations towards research.

KOE-038: ELECTRONICS ENGINEERING
Unit-1
PN junction diode: Introduction of semiconductor materials; Semiconductor diode: Depletion layer, V-I
characteristics, ideal and practical, diode resistance, capacitance, diode equivalent circuits, transition and
diffusion capacitance, Zener diodes breakdown mechanism (Zener andavalanche).
Unit-2
Diode application: Series, parallel and series, parallel diode configuration, half and full wave rectification,
clippers, clampers, Zener diode as shunt regulator, voltage-multiplier circuits special purpose two terminal
devices : light-emitting diodes, Varactor (Varicap) diodes, tunnel diodes, liquidcrystal displays.
Unit-3
Bipolar junction transistors and field effect transistor: Bipolar junction transistor: Transistor construction,
operation, amplification action, common base, common emitter, common collector configuration dc biasing
BJTs: operating point, fixed-bias, emitter bias, voltage-divider bias
Configuration:Collector feedback, emitter-follower configuration. Bias stabilization. CE, CB, CC amplifiers
and AC analysis of single stage CE amplifier (re Model), Field effect transistor: Construction and
characteristic of JFETs. AC analysis of CS amplifier, MOSFET (depletionand enhancement) type, transfer
characteristic.
Unit-4
Operational amplifiers: Introduction and block diagram of Op-Amp, ideal & practical characteristics of Op-
Amp, differential amplifier circuits, practical Op-Amp circuits (inverting amplifier, non-inverting amplifier,
unity gain amplifier, summing amplifier, integrator, differentiator), Op- Amp parameters: input offset
voltage, output offset voltage, input biased current, input offset current differential and common-mode
operation.
Unit-5
Electronic instrumentation and measurements: Digital voltmeter: Introduction, RAMP techniques digital
multimeters: Introduction Oscilloscope: introduction, basic principle, CRT, block diagram of oscilloscope,
simple, measurement of voltage, current phase and frequency Using CRO, introduction of digital storage
oscilloscope and comparison of DSO with analog oscilloscope.
Text /Reference Books:

1. Robert L. Boylestand / Louis Nashelsky, ―Electronic Devices and Circuit Theory,‖ Latest Edition,
Pearson Education.
2. H S Kalsi, ―Electronic Instrumentation‖, Latest Edition, TMH Publication.
3. Meetidehran/ A.K. singh ―fundamental of electronics Engineering‖, new age international publisher.
KAS-301: TECHNICAL COMMUNICATION
Unit -1 Fundamentals of Technical Communication:

Technical Communication: Features; Distinction between General and Technical Communication; Language
as a tool of Communication; Dimensions of Communication: Reading & comprehension; Technical writing:
sentences; Paragraph; Technical style: Definition, types & Methods; The flow of Communication:
Downward; upward, Lateral or Horizontal; Barriers to Communication.
Unit - II Forms of Technical Communication:

Technical Report: Definition & importance; Thesis/Project writing: structure & importance; synopsis
writing: Methods; Technical research Paper writing: Methods & style; Seminar & Conference paper writing;
Expert Technical Lecture: Theme clarity; Analysis & Findings; 7 Cs of effective business writing:
concreteness, completeness, clarity, conciseness, courtesy, correctness, consideration, C.V./Resume writing;
Technical Proposal: Types, Structure & Draft.
Unit - III Technical Presentation: Strategies & Techniques

Presentation: Forms; interpersonal Communication; Class room presentation; style; method; Individual
conferencing: essentials: Public Speaking: method; Techniques: Clarity of substance; emotion; Humour;

Modes of Presentation; Overcoming Stage Fear; Audience Analysis & retention of audience interest;
Methods of Presentation: Interpersonal; Impersonal; Audience Participation: Quizzes & Interjections.
Unit - IV Technical Communication Skills:

Interview skills; Group Discussion: Objective & Method; Seminar/Conferences Presentation skills: Focus;
Content; Style; Argumentation skills: Devices: Analysis; Cohesion & Emphasis; Critical thinking; Nuances:
Exposition narration & Description; effective business communication competence: Grammatical; Discourse
competence: combination of expression & conclusion; Socio-linguistic competence: Strategic competence:
Solution of communication problems with verbal and non verbal means.
Unit - V Dimensions of Oral Communication & Voice Dynamics:

Code and Content; Stimulus & Response; Encoding process; Decoding process; Pronunciation Etiquette;
Syllables; Vowel sounds; Consonant sounds; Tone: Rising tone; Falling Tone; Flow in Speaking; Speaking
with a purpose; Speech & personality; Professional Personality Attributes: Empathy; Considerateness;
Leadership; Competence.
Reference Books
1.Technical Communication – Principles and Practices by Meenakshi Raman & Sangeeta Sharma, Oxford
Univ. Press, 2007, New Delhi.
2.Personality Development and Soft Skills by Barun K. Mitra, OUP, 2012, New Delhi.
3.Spoken English- A Manual of Speech and Phonetics by R.K.Bansal & J.B.Harrison, Orient Blackswan,
2013, New Delhi.
4.Business Correspondence and Report Writing by Prof. R.C. Sharma & Krishna Mohan, Tata McGraw Hill
& Co. Ltd., 2001, New Delhi.
5.Practical Communication: Process and Practice by L.U.B. Pandey; A.I.T.B.S. Publications India Ltd.;
Krishan Nagar, 2014, Delhi.
6.Modern Technical Writing by Sherman, Theodore A (et.al); Apprentice Hall; New Jersey; U.S.
7.A Text Book of Scientific and Technical Writing by S.D. Sharma; Vikas Publication, Delhi.
8.Skills for Effective Business Communication by Michael Murphy, Harward University, U.S.
9.Business Communication for Managers by Payal Mehra, Pearson Publication, Delhi.
COURSE OUTCOMES
1.Students will be enabled to understand the nature and objective of Technical Communication relevant for
the work place as Engineers.
2.Students will utilize the technical writing for the purposes of Technical Communication and its exposure in
various dimensions.
3.Students would imbibe inputs by presentation skills to enhance confidence in face of diverse audience.
4.Technical communication skills will create a vast know-how of the application of the learning to promote
their technical competence.
5.It would enable them to evaluate their efficacy as fluent & efficient communicators by learning the voice-
dynamics.

KCS-301: DATA STRUCTURE
Bloom‘s Knowledge
Course Outcome ( CO)
Level (KL)
At the end of course , the student will be able to understand
CO 1 Describe how arrays, linked lists, stacks, queues, trees, and graphs are represented in memory, K1, K2
used by the algorithms and their common applications.
CO 2 Discuss the computational efficiency of the sorting and searching algorithms. K2
CO 3 Implementation of Trees and Graphs and perform various operations on these data structure. K3
CO 4 Understanding the concept of recursion, application of recursion and its implementation and removal K4
of recursion.
CO 5 Identify the alternative implementations of data structures with respect to its performance to K5, K6
solve a real world problem.
DETAILED SYLLABUS 3-1-0
Unit Topic Proposed
Lecture
I Introduction: Basic Terminology, Elementary Data Organization, Built in Data Types in C. 08
Algorithm, Efficiency of an Algorithm, Time and Space Complexity, Asymptotic notations: Big
Oh, Big Theta and Big Omega, Time-Space trade-off. Abstract Data Types (ADT)
Arrays: Definition, Single and Multidimensional Arrays, Representation of Arrays: Row Major
II Order, and Column Major Order, Derivation of Index Formulae for 1-D,2-D,3-D and n-D Array
Application of arrays, Sparse Matrices and their representations. 08
Linked lists: Array Implementation and Pointer Implementation of Singly Linked Lists, Doubly
Linked List, Circularly Linked List, Operations on a Linked List. Insertion, Deletion, Traversal,
Polynomial Representation and Addition Subtraction & Multiplications of Single variable & Two
variables Polynomial.
Searching: Concept of Searching, Sequential search, Index Sequential Search, Binary Search.
III Concept of Hashing & Collision resolution Techniques used in Hashing. Sorting: Insertion Sort, 08
Selection, Bubble Sort, Quick Sort, Merge Sort, Heap Sort and Radix Sort.
Graphs: Terminology used with Graph, Data Structure for Graph Representations: Adjacency
IV Matrices, Adjacency List, Adjacency. Graph Traversal: Depth First Search and Breadth First
Search, Connected Component, Spanning Trees, Minimum Cost Spanning Trees: Prims and 08
Kruskal algorithm. Transitive Closure and Shortest Path algorithm: Warshal Algorithm and
Dijikstra Algorithm.
Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked
Implementation of Stack in C, Application of stack: Prefix and Postfix Expressions, Evaluation of
postfix expression, Iteration and Recursion- Principles of recursion, Tail recursion, Removal of 08
V recursion Problem solving using iteration and recursion with examples such as binary search,
Fibonacci numbers, and Hanoi towers. Tradeoffs between iteration and recursion. Queues:
Operations on Queue: Create, Add, Delete, Full and Empty, Circular queues, Array and linked
implementation of queues in C, Dequeue and Priority Queue.
Text books:
1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein, ―Data Structures Using C and C++‖, PHI
Learning Private Limited, Delhi India
2. Horowitz and Sahani, ―Fundamentals of Data Structures‖, Galgotia Publications Pvt Ltd Delhi India.
3. Lipschutz, ―Data Structures‖ Schaum‘s Outline Series, Tata McGraw-hill Education (India) Pvt. Ltd.
4. Thareja, ―Data Structure Using C‖ Oxford Higher Education.
5. AK Sharma, ―Data Structure Using C‖, Pearson Education India.
6. RajeshK. Shukla, ―Data Structure Using C and C++‖ Wiley Dreamtech Publication.
7. Michael T. Goodrich, Roberto Tamassia, David M. Mount ―Data Structures and Algorithms in C++‖, Wiley India.
8. P. S. Deshpandey, ―C and Data structure‖, Wiley Dreamtech Publication.
9. R. Kruse etal, ―Data Structures and Program Design in C‖, Pearson Education.
10. Berztiss, AT: Data structures, Theory and Practice, Academic Press.
11. Jean Paul Trembley and Paul G. Sorenson, ―An Introduction to Data Structures with applications‖, McGraw Hill.
12. Adam Drozdek ―Data Structures and Algorithm in Java‖, Cengage Learning

COMPUTER ORGANIZATION AND ARCHITECTURE
(KCS302)
Course Outcome ( CO) Bloom’s Knowledge
Level (KL)
CO 1 Study of the basic structure and operation of a digital computer K1, K2
system.
CO 2 Analysis of the design of arithmetic & logic unit and understanding K2, K4
of the fixed point and floatingpoint arithmetic operations.
CO 3 Implementation of control unit techniques and the concept of K3
Pipelining
CO 4 Understanding the hierarchical memory system, cache memories and K2
virtual memory
CO 5 Understanding the different ways of communicating with I/O devices K2, K4
and standard I/O interfaces
Proposed
Unit Topic
Lecture
I Introduction: Functional units of digital system and their interconnections, 08
buses, bus architecture, types of buses and bus arbitration. Register, bus
and memorytransfer. Processororganization, general registers organization,
stack organization and addressing modes.
II Arithmetic and logic unit: Look ahead carries adders. Multiplication: 08
Signed operand multiplication, Booths algorithm and array multiplier.
Division and logic operations. Floatingpoint
arithmetic operation, Arithmetic & logic unit design. IEEE Standard for
Floating Point Numbers
Control Unit: Instruction types, formats, instruction cycles and sub cycles
III (fetch and execute etc), micro operations, execution of a complete instruction. 08
Program Control, Reduced Instruction Set Computer, Pipelining. Hardwire
and micro programmed control: micro programme sequencing,
concept of horizontal and vertical microprogramming.
Memory: Basic concept and hierarchy, semiconductor RAM memories, 2D
IV & 2 1/2D memory organization. ROM memories. Cache memories: concept 08
and design issues & performance, address mapping and replacement
Auxiliary memories: magnetic disk, magnetic tape and optical disks
Virtual memory: concept implementation.
Input / Output: Peripheral devices, I/O interface, I/O ports, Interrupts:
V interrupt hardware, types of interrupts and exceptions. Modes of Data 08
Transfer: Programmed I/O, interrupt initiated I/O and
DirectMemoryAccess.,I/Ochannelsandprocessors.SerialCommunication:Sync
hronous&
asynchronous communication, standard communication interfaces.
Text books:
1. Computer System Architecture - M.Mano
2. CarlHamacher,ZvonkoVranesic,SafwatZakyComputerOrganization,McGraw-
Hill,FifthEdition,Reprint2012
3. JohnP.Hayes,ComputerArchitectureandOrganization,TataMcGrawHill,ThirdEdition,1998.Referencebo
oks
4. William Stallings, Computer Organization and Architecture-Designing for Performance, Pearson
Education, Seventh edition,2006.
5. BehroozParahami, ―Computer Architecture‖, Oxford University Press, Eighth Impression,2011.
6. David A. Patterson and John L. Hennessy, ―Computer Architecture-A Quantitative Approach‖,
Elsevier, a division of reed India Private Limited, Fifth edition,2012
7. Structured Computer Organization,Tannenbaum(PHI)

KCS303: DISCRETE STRUCTURES & THEORY OF LOGIC
UNIT-1: Set Theory: Introduction, Combination of sets, Multisets, Ordered pairs. Proofs of some general
identities on sets. Relations: Definition, Operations on relations, Properties of relations, Composite
Relations, Equality of relations, Recursive definition of relation, Order of relations. Functions: Definition,
Classification of functions, Operations on functions, Recursively defined functions. Growth of Functions.
Natural Numbers: Introduction, Mathematical Induction, Variants of Induction, Induction with Nonzero
Base cases. Proof Methods, Proof by counter – example, Proof by contradiction.
UNIT-2: Algebraic Structures: Definition, Groups, Subgroups and order, Cyclic Groups, Cosets, Lagrange's
theorem, Normal Subgroups, Permutation and Symmetric groups, Group Homomorphisms, Definition and
elementary properties of Rings and Fields.
UNIT-3: Lattices: Definition, Properties of lattices – Bounded, Complemented, Modular and Complete
lattice. Boolean Algebra: Introduction, Axioms and Theorems of Boolean algebra, Algebraic manipulation
of Boolean expressions. Simplification of Boolean Functions, Karnaugh maps, Logic gates, Digital circuits
and Boolean algebra.
UNIT-4: Propositional Logic: Proposition, well formed formula, Truth tables, Tautology, Satisfiability,
Contradiction, Algebra of proposition, Theory of Inference. (8) Predicate Logic: First order predicate, well
formed formula of predicate, quantifiers, Inference theory of predicate logic.
UNIT-5: Trees: Definition, Binary tree, Binary tree traversal, Binary search tree. Graphs: Definition and
terminology, Representation of graphs, Multigraphs, Bipartite graphs, Planar graphs, Isomorphism and
Homeomorphism of graphs, Euler and Hamiltonian paths, Graph coloring, Recurrence Relation &
Generating function: Recursive definition of functions, Recursive algorithms, Method of solving
recurrences. Combinatorics: Introduction, Counting Techniques, Pigeonhole Principle.
Text books:
1.Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen, Discrete Mathematics and Its
Applications, 6/e, McGraw-Hill, 2006.
2. B. Kolman, R.C. Busby, and S.C. Ross, Discrete Mathematical Structures, 5/e, Prentice Hall, 2004.
3.E.R. Scheinerman, Mathematics: A Discrete Introduction, Brooks/Cole, 2000.
4.R.P. Grimaldi, Discrete and Combinatorial Mathematics, 5/e, Addison Wesley, 2004
5.Liptschutz, Seymour, ― Discrete Mathematics‖, McGraw Hill.
6.Trembley, J.P & R. Manohar, ―Discrete Mathematical Structure with Application to Computer Science‖,
McGraw Hill. 4. Deo,
7.Narsingh, ―Graph Theory With application to Engineering and Computer.Science.‖, PHI.
8. Krishnamurthy, V., ―Combinatorics Theory & Application‖, East-West Press Pvt. Ltd., New Delhi
KNC-302: PYTHON PROGRAMMING

Proposed
Unit Topic
Lecture
Introduction: The Programming Cycle for Python, Python IDE, Interacting with
Python Programs, Elements of Python, Type Conversion.
I 08
Basics: Expressions, Assignment Statement, Arithmetic Operators, Operator
Precedence, Boolean Expression.
Conditionals: Conditional statement in Python (if-else statement, its working and
execution), Nested-if statement and Elif statement in Python, Expression
II Evaluation & Float Representation. 08
Loops: Purpose and working of loops, While loop including its working, For Loop
, Nested Loops , Break and Continue.
Function: Parts of A Function, Execution of A Function, Keyword and Default
Arguments, Scope Rules.
Strings: Length of the string and perform Concatenation and Repeat operations in
it. Indexing and Slicing of Strings.
III 08
Python Data Structure : Tupels , Unpacking Sequences , Lists , Mutable
Sequences , List Comprehension , Sets , Dictionaries
Higher Order Functions: Treat functions as first class Objects , Lambda
Expressions

Sieve of Eratosthenes: generate prime numbers with the help of an algorithm
given by the Greek Mathematician named Eratosthenes, whose algorithm is known
as Sieve of Eratosthenes.
File I/O : File input and output operations in Python Programming
Exceptions and Assertions
IV Modules : Introduction , Importing Modules , 08
Abstract Data Types: Abstract data types and ADT interface in Python
Programming.
Classes : Class definition and other operations in the classes , Special Methods (
such as _init_, _str_, comparison methods and Arithmetic methods etc.) , Class
Example, Inheritance , Inheritance and OOP.
Iterators & Recursion: Recursive Fibonacci , Tower Of Hanoi
Search : Simple Search and Estimating Search Time , Binary Search and
V Estimating Binary Search Time 08
Sorting & Merging: Selection Sort , Merge List , Merge Sort , Higher Order Sort
Text books:
A. Allen B. Downey, ``Think Python: How to Think Like a Computer Scientist‗‗, 2nd edition, Updated
for Python 3, Shroff/O‗Reilly Publishers, 2016 (http://greenteapress.com/wp/thinkpython/)
B. Guido van Rossum and Fred L. Drake Jr, ―An Introduction to Python – Revised and updated for
Python 3.2, Network Theory Ltd., 2011.
C. John V Guttag, ―Introduction to Computation and Programming Using Python‗‗, Revised and
expanded Edition, MIT Press , 2013
D. Robert Sedgewick, Kevin Wayne, Robert Dondero, ―Introduction to Programming in Python: An Inter-
disciplinary Approach, Pearson India Education Services Pvt. Ltd., 2016.
E. Timothy A. Budd, ―Exploring Python‖, Mc-Graw Hill Education (India) Private Ltd.,, 2015.
F. Kenneth A. Lambert, ―Fundamentals of Python: First Programs‖, CENGAGE Learning, 2012.
Charles Dierbach, ―Introduction to Computer Science using Python: A Computational Problem Solving
Focus, Wiley India Edition, 2013.
Paul Gries, Jennifer Campbell and Jason Montojo, ―Practical Programming: An Introduction to Computer
Science using Python 3‖, Second edition, Pragmatic Programmers, LLC, 2013.
G. John M. Zelle- Python Programming: An Introduction to Computer Science
H. The Sieve of Eratosthenes- An algorithm for finding prime numbers
Mapped With : https://ict.iitk.ac.in/product/python-programming-a-practical-approach/
KCS 351: DATA STRUCTURES USING C LAB
LIST OF EXPERIMENTS
S.No. Experiment Related Topic
1 Programs based on Simple C logic, Pointers and Structure. Pointers and Structures
2 Programs based on Arrays. Arrays
3 Programs Based on Linear Linked List. Linear Linked List
4 Programs Based on Circular Linked List Circular Linked List
Doubly and Circular
5 Programs Based on Doubly and Circular Doubly Linked List.
Doubly Linked List
6 Programs Based on Stack. Stack
7 Programs Based on Queues and Circular Queues. Circular Queue
8 Programs Based on Binary Trees. Binary Tree
9 Programs Based on Binary Search Tree. Binary Search Tree
10 Programs Based on Graphs. Graphs
11 Programs Based on Searching Techniques. Searching Techniques
12 Programs Based on Sorting Techniques (Bubble, Selection, Insertion).
Sorting Techniques
13 Programs Based on Sorting Techniques (Heap, Merge).
14 Application of Data Structure in Project ―Calendar Program‖. Overview of C Based
15 Application of Data Structure in Project ―Employee Database Project‖ Projects

KCS352: COMPUTER ORGANIZATION LAB
EXPERIMENTS LIST
1. Implementing HALF ADDER, FULL ADDER using basic logic gates

2. Implementing Binary -to -Gray, Gray -to -Binary code conversions.
3. Implementing 3-8 line DECODER and Implementing 4x1 and 8x1 MULTIPLEXERS.
4. Verify the excitation tables of various FLIP-FLOPS.
5. Design of an 8-bit Input/ Output system with four 8-bit Internal Registers.
6. Design of an 8-bit ARITHMETIC LOGIC UNIT.
7. Design the data path of a computer from its register transfer language description.
8. Design the control unit of a computer using either hardwiring or microprogramming based on its register
transfer language description.
9. Write an algorithm and program to perform matrix multiplication of two n * n matrices on the 2-D mesh
SIMD model, Hypercube SIMD Model or multiprocessor system.
10. Study of Scalability for Single board Multi-board, multi-core, multiprocessor using Simulator
11. Design 4 bit carry look ahead adder.
12 Design 4 bit Ripple carry adder.
KCS-353: DISCRETE STRUCTURE & LOGIC LAB
Programming Language/Tool Used: C and Mapple
EXPERIMENTS LIST:
1. Write a program in C to create two sets and perform the Union operation on sets.
2. Write a program in C to create two sets and perform the Intersectison operation on sets.
3. Write a program in C to create two sets and perform the Difference operation on sets.
4. Write a program in C to create two sets and perform the Symmetric Difference operation.
5. Write a program in C to perform the Power Set operation on a set.
6. Write a program in C to Display the Boolean Truth Table for AND, OR , NOT .
7. Write a C Program to find Cartesian Product of two sets
8. Write a program in C for minimum cost spanning tree.
9. Write a program in C for finding shortest path in a Graph
Note: Understanding of mathematical computation software Mapple to experiment the followings

(exp. 10 to 25):
10. Working of Computation software

11. Discover a closed formula for a given recursive sequence vice-versa
12. Recursion and Induction
13. Practice of various set operations
14. Counting
15. Combinatorial equivalence
16. Permutations and combinations
17. Difference between structures, permutations and sets
18. Implementation of a recursive counting technique
19. The Birthday problem
20. Poker Hands problem
21. Baseball best-of-5 series: Experimental probabilities
22. Baseball: Binomial Probability
23. Expected Value Problems
24. Basketball: One and One
25. Binary Relations: Influence

KOE- 038 ELECTRONICS ENGINEERING
I. COURSE OBJECTIVES:
1. To make students familiar with fundamentals of semiconductor material and PN junction diode.
2. To understand the basics of rectification, Clipping, Clamping and other application of Semiconductor
diode.
3. To understand the basics of Transistor and Analyze the I-V characteristics of BJT and FET in different
configuration.
4. To identify various types of Op-Amp circuit and their analysis
5. To understand the working concept of various types of Oscilloscope and their application.
Bloom’s Knowledge
Level (KL)
At the end of course , the student will be able to understand :

Understand the concept of PN junction and special purpose
CO 1 K1, K2
diodes.
Study the application of conventional diode and
CO 2 K1, K2
semiconductor diode.
CO 3 Analyze the I-V characteristics of BJT and FET. K1, K2
Analyze the Op-Amp, amplifiers, integrator, and
CO 4 K2, K3, K4
differentiator.
Understand the concept of digital storage oscilloscope and
CO 5 compare of DSO with analog oscilloscope K1, K2,K4
K1- Remember, K2- Understand, K3- Apply, K4- Analyze , K5- Evaluate , K6- Create
II. MAPPING OF COURSE OUTCOME (CO’S), PROGRAMME OUTCOME (PO’S) AND

PROGRAMME SEPECIFIC OUTCOME (PSO’S)
PROGRAMME
PROGRAMME OUTCOME SPECIFIC
OUTCOME
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 3 2 2 1 - - - - - - - 3 3 2
CO2 2 3 2 2 3 - - - - - - 2 2 3 2
CO3 2 2 2 2 3 - - - - - - - 2 3 2
CO4 2 3 1 2 2 - - - - - - - 2 3 3
CO5 2 2 1 1 3 - - 2 - - - 2 2 3 3
AVE
2.2 2.6 1.6 1.8 2.4 - - 2 - - - 2 2.2 3 2.4
RAGE

COURSE PLAN
ELECTRONICS ENGINEERING
KOE-308
UNIT
TOPIC Hs. PAGES TEXT BOOK
NO
Semiconductor materials (Si, Ge,
2 2-10 Robert Boylestad
GaAs, P Type, N Type )
PN junction, BJT Depletion
Layer 1 10-13 Robert Boylestad
Unit-1 Biasing-VI Characteristics(Ideal

&Practical),
Diode Resistances, Diode
Capacitances, Equivalent Circuit
Breakdown Mechanism (Zener and
avalanche)
Series and Parallel Configuration 1 62-72 Robert Boylestad
Half wave and Full Wave 1 73,78 Robert Boylestad
Bridge Rectifier , Efficiency and
Ripple Factor
Clippers: Positive, negative. Series
and parallel Clippers (Biased 1 79-85 Robert Boylestad
Unit-2
&Unbiased)
Clampers: Basic Operation, Types 1 86-89 Robert Boylestad
Multiplier Circuits: Doublers and
Tripler
LED & LCD 1 852-854 Robert Boylestad
Tunnel Diodes, Varactor Diodes 1 838,856 Robert Boylestad
BJT: Construction and working of
Transistor.
Amplifying Action, CB, CE &CC
Configuration, V-I Characteristics 2 134-146 Robert Boylestad
Input & Output
Load Line and bias Stabilization 1 170-173 Robert Boylestad
Fixed Bias, Emitter Bias
Stability Factor
Voltage-Divider bias , collector
Feedback
Unit-3 AC analysis of single stage CE
amplifier (re Model),
JFET:
Construction and working Principle
Transfer & Drain Characteristic,
Parametres
MOSFET:
D Type- Construction and working
Principle, Transfer and Drain 1 402-407 Robert Boylestad
characteristics
E Type- Construction and

Characteristics
CS ,CD ,CG Amplifier and its
Analysis

BasicIntroduction, Robert Boylestad
1 621-627
Equiv.Circuit,Parameters
Virtual Ground Concept Inverting, Robert Boylestad
1 634-638
Non Inverting Mode, Unit Follower
Summing (Inverting & non Robert Boylestad
1 649-641
Inverting) , Integrator
Unit-4
Differentiator, Sub tractor,input Robert Boylestad
2 641-645
offset and
output offset voltage input bias and Robert Boylestad
1 642-647
offset current
Differential andCommon Mode Robert Boylestad
1 653-656
DVM: Block diagram, RAMP
2 128-130 H S KALSI
Technique.
DMM: Block Diagram ,Working
2 148-150 H S KALSI
Principle
Unit-5 CRO and DSO: Block diagram,
2 176-182 H S KALSI
Working, Voltage,
Phase and Frequency Measurement,
comparison with Analog 2 183-194 H S KALSI
oscilloscope

ELECTRONICS ENGINEERING (KOE308)
ASSIGNMENT SHEET –1
1. Explain the behavior of p-n junction at no bias and reverse bias.

2. Define knee voltage of diode. Write short notes on semiconductor material.
3. What is the basic difference between clippers and clampers?
4. What is the basic difference between Zener and Avalanche breakdown?
5. Explain how you will determine the static resistance and dynamic resistance of p-n junction diode
6. Derive the expression for root mean square and average value of output voltage for full wave bridge
rectifier. Assuming an ideal diode, sketch Vi, Vd, and id for the half-wave rectifier of Fig.3
8. Sketch the circuit diagram of a full wave centre tap rectifier for producing positive voltage. Sketch the
input and output waveform and explain the circuit operation.
9. For the network of Fig. 2, determine the output voltage.
10. How we can use zener diode as a shunt regulator? Also draw its V-I characteristics.

ASSIGNMENT SHEET -2
1. Draw and explain the input and output characteristics of common base configuration of BJT.
2. Derive the stability factor S(Ico) for the emitter bias configuration. For the circuit shown in Fig.4, find
out Ic, Vcc and
3. Voltage divider biasing is best among all biasing for transistor. Explain? Determine the DC bias
voltage VCE and the current IC for the voltage divider, given β= 100.
4. Explain the construction, working and characteristics of n channel JFET. For the circuit shown in
Fig. 7, calculate the values of RD and RS that will result in a gain of 8 with VGSQ = VP/4.
5. What do you mean by pinch off voltage? How it is differ from cut off voltage?
6. Draw the structure of n-channel Depletion type MOSFET & explain its principle of operations. Also draw
its drain & Transfer Characteristics with the help of suitable circuit.
7. What is the significance of the threshold voltage VT in enhancement mode MOSFET? Draw the circuit of
JEET Amplifier in common source configuration and perform analysis.

8. Determine Describe how an FET can be used as a voltage controlled resistor.
9. Derive the expression of stability factor for fixed biased configuration.
10. Find expression of current & voltage for voltage divider bias. What do you mean by Stability Factor for
Transistor? Derive the Expression for CE & CB Configuration.
ASSIGNMENT SHEET –3
1. An inverting amplifier has Rf=500 KΏ & R1=5 KΏ determine the amplifier circuit voltage gain, input
resistance & output resistance Determine also the output voltage & input current If the input voltage
is 0.1V. Assume op-amp to be ideal one.
2. Determine the output voltage for the given Fig.5
3. Explain CRO with the help of block diagram and how we measure the voltage?
4. Explain the working of digital storage oscilloscope with suitable diagram. Also compare it with analog
storage oscilloscope.
5. What is the various specification of digital meter? Also explain the advantage of digital meter over analog
meter.

TUTORIAL SHEET –1
1. Describe how diffusion and transition capacitance differ? Draw the characteristics of transition and
diffusion capacitance versus applied voltage. Explain the role of Varicap in tuning circuit. (Boylestad)
2. Find the range of wavelength for the frequency range of visible light (400THz-750THz).
3. Calculate the PIV rating of full wave centre tapped rectifier.
(Boylestad)
4. Sketch the V-I characteristic of Si-pn junction diode.
(Robert L. Boylestad/ Jacob Millman, C.C. Halkias)
5. A full wave bridge rectifier uses RL = 2KΩ , each diode is to have forward resistance Rf = 2Ω &
reverse resistance Rs = 0. A sinusoidal voltage having peak amplitude of 20 v is applied. Find –
(i) Peak dc & rms value of load current
(ii) DC & rms value of o/p voltage
(iii) Efficiency
TUTORIAL SHEET –2
1. (fDifferentiate between positive and negative clamper circuit. Draw the o/p waveform for the circuit
shown in figure.
2. Is it possible to regulate to regulate the 6 volt dc voltage using 7805 IC? Explain the working of
Zener diode as a shunt regulator. Also explains how we can maintain constant voltage across zener
diode for variable load resistor. (Jacob Millman, C.C. Halkias)
3. Determine the dc resistance levels for the diode of Fig. at (Robert L. Boylestad)
a. I D=2 mA (low level)
b. I D= 20 mA (high level)
c. V D=10 V (reverse-biased)
4. 4.Determine vofor the network of Fig. for the input shown (Robert L. Boylestad)

5. Differentiate between clipper and clipper. Describe the role of negative clamper in air conditioning
system. Sketch the output Voltage waveform for given circuit. (Robert L. Boylestad)
TUTORIAL SHEET –3
1. Determine the voltage Vofor the network of Fig. (Vk for Green =2.2 V)
(Robert L. Boylestad)
2. Determine the output waveform for the network of Fig. below and calculate the output dc level and
the required PIV of each diode.
3. Sketch the circuit diagram of a bridge rectifier for producing positive voltge.Sketch the input and output
waveform and explain the circuit operation. (Robert L. Boylestad/ Jacob Millman,C.C. Halkias)
4. Find the value of R to maintain a current of 20 mA in the circuit shown below.
( Boylestad)

5. Determine Vi (range) that will maintain zener diode of fig given below in the on state.
TUTORIAL SHEET –4
1. .In transistor, EB junction is always forward biased and CB junction is always reverse biased in active
region. Explain. Why Inverse operation is not possible? Draw the output characteristics of NPN
transistor CE configuration. (Robert L. Boylestad/ Jacob Millman, C.C. Halkias)
2. Determine the DC bias voltage VCE and the current IC for the voltage divider, given β= 140.
3. Voltage divider biasing is best among all biasing for transistor. Explain? Determine the DC bias
voltage VCE and the current IC for given circuit (Robert L. Boylestad)
4. Determine the value of IC,IB,VCE (Robert L. Boylestad)

TUTORIAL SHEET –5
1. Draw the structure of n-channel Enhancement type MOSFET & explain its principle of operations. Also
draw its drain & Transfer Characteristics with the help of suitable circuit. Describe how an FET can be
used as a voltage controlled resistor.
2. What is the significance of the threshold voltage V T in enhancement mode MOSFET? Draw the circuit
of JEET Amplifier in common source configuration and perform analysis.
3. Determine VGSQ IDQ, VG, VS , VD ,VDS of network shown in fig(c).Given VP= -6 V,IDSS=12mA.
4. Determine VGSQ, IDQ, VDG, VS, VD and VDS of network shown in fig(d).Given VP= -4V, IDSS=8mA.
5. Find expression of current & voltage for voltage divider bias. What do you mean by Stability Factor for
TUTORIAL SHEET –6
1. Design a non inverting amplifier circuit that is capable of providing a voltage gain of 10, (resistance
should not exceed 30 KΏ). Assume an ideal operational amplifier. (Robert L. Boylestad)
2. Calculate the output offset voltage of the circuit in fig. The op-amp spec lists VIO = 1.2 mV.
3. Calculate the dc voltages and currents in the circuit of fig.


4. Explain ideal characteristics of ideal opamp.Also find the expression for integrator.
(Robert L. Boylestad/Sedra Smith)
5. Define following terms (Robert L. Boylestad)

a. Slew rate
b. virtual ground
c. CMRR
TUTORIAL SHEET –7
2. What is the gain of the amplifier when switch s is off & when switch is on?
1.
3. Determine the expression of V0 in terms of input voltages.
4. For a given op-amp, CMMR=105 & differential gain Ad=105. Determine the common mode gain Acm
of the OP-AMP.
5. What is loading effect? How we can reduce it with the help of buffe
TUTORIAL SHEET –8
1. A differential dc amplifier has a differential mode gain of 100 and a common mode gain 0.01 .what is
its CMMR in dB? (Robert L. Boylestad)
2. For a given op-amp, CMMR=105 & differential gain Ad=105. Determine the common mode gain Acm
of the OP-AMP.
4. Sketch the circuit of summer using op-amp to get

(RobertL.Boylestad)
V0 = -(-V1+2V2- 3V3 )
5 Design an adder CKT using an op-amp to get the output expression as under
Vout = -(V1+ 10V2 + 100V3)Where V1,V2 & V3 are the inputs, given that Rf =100 KΏ

TUTORIAL SHEET –9
1. Explain CRO with the help of block diagram and how we measure phase difference & frequency.
(David A. Bell)
2. What are the necessary blocks in the multimeter for measuring AC voltage? What are Lissajous
figures?
3. Explain the basic principle of signal display in a CRO. Also describe the method of measurement of
frequency, Amplitude & phase, current.
(David A. Bell)
4. Carefully explain the construction detail of CRT.
(David A. Bell)
5. Draw the block diagram of DVM. Find the resolution for 3 and ½ digit display corresponding to 5v
volt. (H S Kalsi)
TUTORIAL SHEET –10
1. Explain the working of DSO. How we can control the intensity of waveform on CRT screen.
(David A. Bell)
2. What is the various specification of digital meter? Also explain the advantage of digital meter over analog
meter. (David A. Bell)
3. What are the necessary blocks in the multimeter for measuring AC voltage? What are Lissajous figures?
(David A. Bell)
4. Why we used time base generator in CRO? Explain its working.
(David A. Bell)
5. Draw the circuit for single slope & dual slope type integrator DVM. Explain working.
(David A. Bell)

MODEL QUESTION PAPER
CODE: KEC 038
ELECTRONICS ENGINEERING
Time: 3Hours Total Marks: 100

Note: Attempt All questions. If require any missing data; then choose suitably.
SECTION- A
1. Attempt all question in brief. 2×10=20
a. Draw the characteristics of transition and diffusion capacitance versus applied voltage.
b. Determine ac resistance for a semiconductor diode having a forward bias of 200 mV & reverse saturation
current of 1 μA at room temperature.
c. Describe how an FET can be used as a voltage controlled resistor.
d. Derive the relation between  and .
e. Describe characteristics of an ideal op-amp.
f. Draw the lissazous patter for fy:fx=1:3
g. Sketch the V-I characteristic of Si-pn junction diode.
h. Differentiate between BJT and FET.
i. Transistor used as an amplifier in active region.Why?
g. Explain the role of Varicap in tuning circuit.
SECTION-B
2. Attempt any three parts of the following: 3×10=30

a. Differentiate between clipper and clipper. Describe the role of negative clamper in air conditioning
system. Sketch the output Voltage waveform for given circuit
b. For the emitter bias network determine IB, IC, VCE, VC, VE, VB and VBC. Given β =50
c. Sketch the circuit of summer using op-amp to get
V0 = -(-V1+2V2- 3V3 )
d. Explain CRO with the help of block diagram and how we measure phase difference & frequency
e. Differentiate between positive and negative clamper circuit. Draw the o/p waveform for the circuit shown
in figure.
Section-C

3. Attempt any one part of the following: 1×10=10
a. Determine Vi (range) that will maintain zener diode of fig given below in the on state.
b. Sketch the circuit diagram of a bridge rectifier for producing positive voltge.Sketch the input and output
waveform and explain the circuit operation.

a. Draw the structure of n-channel Enhancement type MOSFET & explain its principle of operations. Also
draw its drain & Transfer Characteristics with the help of suitable circuit. Describe how an FET can be used
as a voltage controlled resistor.
b. Find expression of current & voltage for voltage divider bias. What do you mean by Stability Factor for

a. Explain ideal characteristics of ideal opamp. Also find the expression for integrator.
b. Define following terms
i. Slew rate
ii. Virtual ground
iii. CMRR

a. Explain the working of DSO. How we can control the intensity of waveform on CRT screen.
b. Draw the block diagram of DVM. Find the resolution for 3 and ½ digit display corresponding to 5v volt

a. Explain the basic principle of signal display in a CRO. Also describe the method of measurement of
frequency, Amplitude & phase, current..
b. Design an adder CKT using an op-amp to get the output expression as under Vout = -(V1+ 10V2 +
100V3)Where V1,V2 & V3 are the inputs, given that Rf =100 K

COURSE PLAN
TECHNICAL COMMUNICATION
KAS-301/401
UNIT-1 FUNDAMENTALS OF TECHNICAL COMMUNICATION
S. Knowledge Input Lecture Text Book Referred

Page No.
No. (Topic) Duration(hr)
Introduction: Syllabus, University Syllabus (KAS204)
1. Structure of course, 1
Evaluation method, etc.
Technical Communication: Technical Communication (OUP
Features Press Second Edition) :Meenakshi
2. 1 45-46
Raman and Sangeeta Sharma
Distinction between General Technical Communication (OUP

and Technical Press Second Edition) :Meenakshi
3. 1 26-27
Communication Raman and Sangeeta Sharma
Dimension of Technical Communication (OUP

communication: reading Press Second Edition) :Meenakshi
4. 1 45-46
comprehension Raman and Sangeeta Sharma
Importance of Language as Professional Communication

a Tool of Communication (OUP Press Second Edition)
5. 1 :Meenakshi Raman and Sangeeta 5-8
Sharma
Technical Writing: Effective Technical

sentences, paragraph Communication (Mcgraw Hill,
6. 1 10, 25-30
Technical style: definition, New Delhi) M Ashraf Rizvi
types & methods
Flow of Communication Professional Communication
Downward, Upward, (OUP Press Second Edition)
6. Lateral of Horizontal (Peer 1 :Meenakshi Raman and Sangeeta 11-13
group) Sharma
Barriers to Communication Professional Communication

and Causes (OUP Press Second Edition)
7. 1 :Meenakshi Raman and Sangeeta
Sharma 16-30
UNIT-2 FORMS OF TECHNICAL COMMUNICATION
S. Knowledge Input Lecture Text Book Referred Page

No. (Topic) Duration No.
Technical Reports: Technical Communication (OUP Press 284-
Definition and Second Edition) :Meenakshi Raman and 290
1 1
Significance Sangeeta Sharma
Thesis/PropjetWriting Professional Communication (S K Kataria&

Sons, New Delhi) RaveeTripathi 184-
2. 1
185
Technical Research Technical Communication (OUP Press Third 419-

3. Paper Writing 1 Edition) :Meenakshi Raman and Sangeeta 433
Sharma
4. Seminar and 1 Effective Technical Communication (Mcgraw 480-

conference Paper Hill, New Delhi) M Ashraf Rizvi 481
writing
Expert (Guest) https://www.campusexplorer.com/college-
5. Technical Lecture 1 advice-tips/A41868CD/What-Are-Guest-
Lecturers/
7 C‘s Business Communication (Pearson, Noida) P 123-
6. 1
D Chaturvedi 124
CV/ Resume Professional Communication (Vayu, New 169
7. 1
Delhi) SK Singh
Technical Proposal Professional Communication (Vayu, New 209
8.
Delhi) SK Singh
UNIT-3 TECHNICAL PRESENTATION: STRATEGIES & TECHNIQUES

Presentation: https://www.bobpikegroup.com/resources/trainer-
Forms blog/presentations
1. 1
Interpersonal Technical Communication (OUP Press Third

2. communication 1 Edition) :Meenakshi Raman and Sangeeta Sharma 8
Class room https://www.edutopia.org/blog/8-tips-classroom-

3. 1
presentation presentation-jason-cranford-teague
Public Speaking:
Methods, https://en.wikipedia.org/wiki/Public_speaking
Techniques,
4. 1
clarity of
substance,
emotion, humour
Modes of Technical Communication (OUP Press Third
125-
5. Presentation 1 Edition) :Meenakshi Raman and Sangeeta Sharma
127
Stage Fear: Technical Communication (OUP Press Third
121-
6. Confident 1 Edition) :Meenakshi Raman and Sangeeta Sharma
33
speaking
Audience analysis Effective Technical Communication (Mcgraw Hill, 198-
7. 1
New Delhi) M Ashraf Rizvi 199
Methods of
Presentation: https://prezi.com/w03malzjc0c0/interpersonal-
8. 1
Interpersonal; impersonal-communication/
Impersonal
Audience
Participation: Handouts
9. 1
Quizzes and
Interjection
UNIT-4 TECHNICAL COMMUNICATION SKILLS

Interview Skills Business Communication (Pearson, Noida) P D
Group Discussion: Chaturvedi 289-
1. 2
Objectives and 295
Methods
Seminar/Conferences Developing Communication Skills (Macmillan,
94-
2. Presentation Skills: 2 New Delhi) Krishna Mohan
100
Focus; Content; Style; https://en.wikipedia.org/wiki/Academic_conference
Argumentation skills
Nuances: Exposition
3. narration & 1 Handouts
Description
Effective Business https://www.mindtools.com/page8.html
4. 1
Comm Competence
Solution of Professional Communication (Vayu, New Delhi)
communication SK Singh 26-
5. 1
Problems with Verbal 27
and non verbal means
UNIT 5 KINESICS AND VOICE DYNAMICS

Communication Professional Communication (Vayu, New Delhi)
1. 1 7-8
Process SK Singh
Pronunciation Handout
2. 2
Etiquettes
Tone, Linguistic Professional Communication (Vayu, New Delhi)
3. Features of voice 2 SK Singh 257-259
control
Vowel and consonant Professional Communication (S K Kataria& Sons,
4. 1 222-234
sound New Delhi) RaveeTripathi
Empathy, https://thesaurus.plus/related/considerate/empathetic
5. 1
Considerateness
Leadership & https://www.indeed.com/career-advice/career-
6. 2
Competence development/key-leadership-competencies

TUTORIAL SHEET
TECHNICAL COMMUNICATION (KAS301)
UNIT 1
TUTORIAL 1
1. Define communication.
2. What are its characteristics?
3. What are the differences between general and technical communication?
4. What are the various barriers to communication?
5. ‗It is almost impossible to communicate without a language.‘ comment on it.
TUTORIAL 2
1. How can one develop reading & comprehension?

2. What are dimensions of communication?
3. What are sentences?
4. What are the essentials of paragraph writing?
5. What are the flows of communication?
UNIT 2
TUTORIAL 3
1. What is a technical report? Define it. Reveal its significance.

2. What is a thesis? Describe its structure.
3. Explain the utility of the project report.
4. Elucidate the 7 c‘s of effective communication.
5. What is an expert technical lecture?
TUTORIAL 4
1. Draft a CV for the post of a junior engineer.

2. What are the types and structure of a technical proposal?
3. What is the utility of technical proposal?
4. How can stage phobia be removed?
5. What is the difference between a seminar and conference?
UNIT 3
TUTORIAL 5
1. What are the methods of a class room presentation?

2. What are the strategies of technical presentation?
3. What are the forms of technical presentation?
4. What is interpersonal communication technical presentation?
5. What are the styles of a class room presentation?
TUTORIAL 6
1. What is an individual conferencing?

2. Define public speaking.
3. Differentiate between public speaking and presentation.
4. Elaborate the significance of humour.
5. Elaborate the significance of emotion.
UNIT 4
TUTORIAL 7
1. What are the dos of an interview for an interviewee?

2. What precautions should one take for group discussion?
3. Describe focus and content regarding presentation.

4. What are argumentation skills?
5. What are cohesion & emphasis?
TUTORIAL 8
1. What is critical thinking?

2. Explain exposition narration & description.
3. What are the components of effective business communication competence?
4. What is socio-linguistic competence?
5. What are the solutions of communication problems with verbal and non-verbal means?
UNIT 5
TUTORIAL 9
1. Explain the code and content.
2. What are stimulus & response?
3. How can one improve pronunciation etiquette?
4. Define syllables?
5. ―Speech & personality are inseparable‖. Elucidate.
TUTORIAL 10
1. What are vowel sounds and consonant sounds?

2. What is a tone?
3. Explain the professional personality attributes.
4. What is communication process?
5. What is a falling tone?

MODEL PAPER
Printed Pages: Sub Code: KAS301

Paper Id: Roll No.
B TECH SECOND YEAR

(SEM ODD) THEORY EXAMINATION 2019-20
TECHNICAL COMMUNICATION
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If required any missing data; then choose suitably.
SECTION A
1. Attempt all questions in brief. 2 x 10 = 20

Q No. Question Marks
a. What is technical communication? Define it. 2
b. Explain the need of a language as a tool of communication. 2
c. What are the dimensions of communication? 2
d. What is a technical report? Define it. 2
e. Describe the structure of a project. 2
f. What is an interpersonal communication? 2
g. What is a conference? 2
h. What do you understand by effective business communication? 2
i. How are vowel sounds different from consonant sounds? Give examples. 2
j. What is pronunciation etiquette? 2
SECTION B
2. Attempt any three of the following:

a. What are the techniques of reading and comprehension? 10
b. Explain the barriers to communication. 10
c. Describe the flows of communication? 10
d. How should a seminar paper be written? 10
e. What are the ways to overcome the stage fear? 10
SECTION C
3. Attempt any one part of the following:

a. What are the methods of synopsis writing? 10
b. What are the do‘s and don‘ts of an interview? 10

a. What are the methods of public speaking? 10
b. Explain the objectives of a group discussion. 10

a. What are the essentials of writing a good paragraph? 10
b. What is the importance of thesis writing? 10

Describe the need of theme clarity, analysis and findings in an expert technical
a. 10
lecture.
b. How is a technical proposal drafted? Explain its structure. 10

a. What are the essentials of an individual conferencing? 10
b. Elucidate the professional personality attributes. 10

COURSE PLAN
DATA STRUCTURES
KCS301
Course Description: Data structure is a subject of primary importance to the discipline of Computer
Science. Organizing of structuring data is vital to the design and implementation of efficient algorithms
and program development. This course is designed to help the students to gain an understanding of Data
Structures Linear as well as non Linear.
PRE-Requisite: Student must have basic knowledge of computer operation, input, output devices some
mathematical concepts such as basic mathematical formulas. Fibonacci series, Armstrong number, HCF,
LCF, GCD of numbers and concept about matrix and an understanding of the ‗C‘ programming language.
PAGE
UNIT TOPICS HR. TEXT BOOK REFERRED
NO.
1. Basic Terminology : Data ,Data Item, Seymour Lipschutz, Data
Entity Set, Record , File, Key, 1 Structures, Schaum‘s Outline 1.1
Information Series, TMH
2. Elementary Data organization :
Seymour Lipschutz, Data
Concept of Data Type, Definition Of 1.3-1.9,
1 Structures, Schaum‘s Outline
Data structure, Primitive Data Type, 2.20
Series, TMH
Abstract Data Type
3. Description of various Data Seymour Lipschutz, Data
Structure: Linear Arrays, Linked list, 1 Structures, Schaum‘s Outline 1.3-1.9
Stacks, Queues Series, TMH
4. Description of various Data Seymour Lipschutz, Data
Structure: Trees, Heaps, Graphs, One 1 Structures, Schaum‘s Outline 1.3-1.9
& two dimensional Arrays, Linked Lists Series, TMH
5. Algorithm Complexity and Time
Space Trade off: Space Complexity,
1 Structures, Schaum‘s Outline 2.14-2.17
Time Complexity, Time, Space Trade
Series, TMH
Off.
1 6. Asymptotic notations: asymptotic
1 Structures, Schaum‘s Outline 2.17
notations, Big Oh Notation.
Series, TMH
7. Arrays: Array Definition, Seymour Lipschutz, Data
Representation and analysis, Single and 1 Structures, Schaum‘s Outline 4.1-4.18
multidimensional Array Series, TMH
8. Arrays: Address Calculation,
Operations on Arrays, Sparse Matrix
Series, TMH
9. Linked lists: Representation &
implementation of singly linked lists.
Series, TMH
10. Doubly Linked List: 1 Structures, Schaum‘s Outline 5.35
Series, TMH
11. Applications Of Linked Lists :
Addition of Polynomials, Multiplication
of Polynomials,
Series, TMH
Representing Sparse Matrix.
1.Stack : Primitive Stack operations,
Push and pop
Series, TMH
2.Implementation of stack: Static and Seymour Lipschutz, Data
2 dynamic implementation, Creation, 1 Structures, Schaum‘s Outline 6.2-6.7
insertion deletion. Series, TMH
3.Applications of stack : Infix, postfix Seymour Lipschutz, Data
representation of expression, Evaluation 1 Structures, Schaum‘s Outline 6.9-6.14
and conversion of various expression Series, TMH

PAGE
NO.
4.Recursion : Principles of recursion, Seymour Lipschutz, Data
Types of recursion, removal of recursion 1 Structures, Schaum‘s Outline 6.18
,tail recursion Series, TMH
5.Tower of Hanoi problem : simulation 1 Structures, Schaum‘s Outline 6.22
Series, TMH
6.Queues: Operations on queue, Seymour Lipschutz, Data
Insertion, deletion, checking empty and 1 Structures, Schaum‘s Outline 6.32
full queue Series, TMH
7.Types of queue Circular, linear, Seymour Lipschutz, Data
dequeue, priority queue 1 Structures, Schaum‘s Outline 6.36
Series, TMH
8. Static(Array) implementation of Seymour Lipschutz, Data
queue : Insertion, deletion, empty ,full 1 Structures, Schaum‘s Outline 6.39
check Series, TMH
9. Dynamic (Linked) list Seymour Lipschutz, Data
implementation of queue : Insertion, 1 Structures, Schaum‘s Outline 6.40
deletion, empty ,full check Series, TMH
1. Searching : Concept of Searching
Series, TMH
2.Searching: Sequential Search, Index
searching
Series, TMH
3 3. Searching :Binary Search 1 Structures, Schaum‘s Outline 9.18
Series, TMH
4.Hashing:Concept of Hashing 1 Structures, Schaum‘s Outline 9.2
Series, TMH
5.Hashing: Collision resolution
Techniques used in Hashing
Series, TMH
6. Sorting Insertion Sort, bubble sort 1 Structures, Schaum‘s Outline 9.8
Series, TMH
7. Sorting techniques : Selection Sort,
Quick Sort
Series, TMH
8. Sorting techniques :Merge sort 1 Structures, Schaum‘s Outline 9.9-9.10
Series, TMH
9. Sorting techniques : Heap Sort,
radix sort
Series, TMH
1.Graph terminology: Various terms
related to the graphs.
Series, TMH
2.Graph representations : Sequential
& Linked representation, Adjacency Seymour Lipschutz, Data
4 Matrix Representation Of the Graph, 1 Structures, Schaum‘s Outline 8.5
Adjacency List representation of the Series, TMH
graph
3.Graph Traversal : Breadth First Seymour Lipschutz, Data
Search, Depth First Search, Strongly 1 Structures, Schaum‘s Outline 8.21
Connected Component Series, TMH

PAGE
NO.
4.Application Of Graphs : Minimum Seymour Lipschutz, Data
cost spanning tree, Prim‘s & Kruskal 1 Structures, Schaum‘s Outline 8.7
Algorithm Series, TMH
5.Shortest Path Algorithms: Seymour Lipschutz, Data
Warshall‘s Algorithm, Dijkstra 1 Structures, Schaum‘s Outline 8.8
Algorithm Series, TMH
1.Tree: Basic terminology, binary tree, Seymour Lipschutz, Data
root node, child node, degree of a 1 Structures, Schaum‘s Outline 7.1 – 7.7
node. Series, TMH
2.Binary tree: Binary tree Seymour Lipschutz, Data
Representation, Binary tree 1 Structures, Schaum‘s Outline 7.12
implementation. Series, TMH
3.Types of binary tree Rooted Trees, Seymour Lipschutz, Data
Ordered Trees, Position Trees, Complete 1 Structures, Schaum‘s Outline 7.5-7.35
Binary Trees, Extended Binary Trees Series, TMH
4. Algebraic Expression Prefix, infix,
postfix Expression , representing the
algebraic expression with the
Series, TMH
help of Tree
5. Traversing Binary Trees Pre Order
Traversal Of a Binary Search Tree, In Seymour Lipschutz, Data
5
Order Traversal Of a Binary Search 1 Structures, Schaum‘s Outline 7.9
Tree, Post Order Traversal of a Binary Series, TMH
Search Tree
6.Operations on Binary Search Tree
Determining Height of a Binary Search
Tree, Determining Number of
Nodes/Elements, Determining Number
Series, TMH
of Internal Nodes, Inserting a new
element, Searching an element
7. Threaded Binary Trees Representing Seymour Lipschutz, Data
a Threaded Binary Tree in Memory, 1 Structures, Schaum‘s Outline 7.46
Traversing threaded Binary tree Series, TMH
8. Tree Applications : Huffman Coding 1 Structures, Schaum‘s Outline 67
Series, TMH
Reference Books:
 Seymour Lipschutz, Data Structures, Schaum‘s Outline Series, TMH
 Yashwant Kanetkar, Data Structures through C, BPB Publications
 Reema Thareja,Data Structures Using C,Oxford University Press
 G A V Pai, ―Data Structures and Algorithms‖, TMH
 Horowitz and Sahani, ―Fundamentals of Data Structures‖, Galgotia Publication

TUTORIAL SHEETS
DATA STRUCTURES
KCS301
NOTE: Every Student must submit each Tutorial Sheet within Three Days of completion of The Unit
Related to the Sheet for its Evaluation. Each tutorial sheet is of 10 marks.
TUTORIAL SHEET 1
1. Explain the terms data, record, file and information?

2. Discuss about a Data Type? Explain its different categories.(UPTU 2011-12)
3. Discuss about algorithm complexity? Discuss about the need of measuring the complexity of an
algorithm? (UPTU 2012-13)
4. Which of the following data structure is linear type? (Gate 2004)
Option A: Strings
Option B: Lists
Option C: Queues
Option D :All of the above
5.The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of
n numbers is (Gate)
Option A: O(n)
Option B: O(n Ig n)
Option C: O(n*n)
Option D: None of the above
TUTORIAL SHEET 2
1. Discuss about an array? What are different types of arrays? (UPTU 2012-13)
2. How a linear array is represented in memory? Give example. (UPTU 2013-14)
3. How a two dimensional array is represented in memory? Give example.
4. Let T(n) be the function defined by T(n) = 1 and T(n) = 2T (n/2) + n, which of the following is TRUE ?
Option A: T(n) = O( n*n*n), Option B: T(n) = O( log2n) Option C: T(n) = O( n) , Option D: T(n) = O(
n*n)
(Gate)
5.The efficient data structure to insert/delete a number in a stored set of numbers is (Gate)
Option A: Queue
Option B: Linked List
Option C: Doubly Linked List
Option D:Binary Tree
TUTORIAL SHEET 3
1.Given the following arithmetic expression in infix notation as 12/(7-3)+2*(3+8)-7 Translate this
expression into postfix notation and then evaluate it using tabular method..(AKTU 2015-16)
2. What do you mean by recursion? Implement Tower of Hanoi with four disks.Draw tree Diagram with
stack contents.(UPTU 2014-15)
3. How peek() operation differs from pop() operation. Explain with Example.
Gate Questions:
4.Given an empty stack, after performing push (1), push (2), Pop, push (3), push (4), Pop, Pop, push(5), Pop,
what is the value of the top of the stack ? (Gate)
Option A: 4, Option B: 3 Option C: 2 , Option D: 1
5. Which of the following permutations can be obtained in the output using a stack of size 3 elements
assuming that input, sequence is 1, 2, 3, 4, 5 ? (Gate)
Option A: 3, 2, 1, 5, 4, Option B: 5, 4, 3, 2, 1 Option C: 3, 4, 5, 2, 1 , Option D: 3, 4, 5, 1, 2

TUTORIAL SHEET 4
1. Discuss about a queue? Is queue a linear or non linear data structure? Explain with Example.
(UPTU2014-15)
2. How can we implement a queue in C with Insert and delete operations? Explain with Example. Show dry
run.(UPTU 2010-11)
3. Explain the term Dequeue in detail.
4. Explain the term Priority Queue in detail. (Gate)
Consider the following statements for priority queue : S1 : It is a data structure in which the intrinsic
ordering of the elements does determine the result of its basic operations. S2 : The elements of a priority
queue may be complex structures that are ordered on one or several fields. Which of the following is
correct?
Option A: Both S1 and S2 are incorrect., Option B: S1 is correct and S2 is incorrect.
Option C: S1 is incorrect and S2 is correct Option D: Both S1 and S2 are correct
5. . Give the name of the Linear list in which elements can be added at ends but not in the middle: (Gate)
Option A: Array., Option B: Queue., Option C: Tree , Option D: Circular Queue
TUTORIAL SHEET 5
1. WAP to create a linked list, with all conditions. Explain how nodes can be created dynamically in a linked
list.(AKTU 2015-16)
2. WAP for the Polynomial addition and explain with example.
3. How can a node be inserted in the beginning of a linear linked list. Explain the steps with all
possibilities.(UPTU 2012-13)
4. To represent hierarchical relationship between elements, which data structure is suitable? (Gate)
Option A: Dequeue, Option B: Priority Option C: Tree, Option D: All of the above
5. .The min. number of nodes in a binary tree of depth d (root at level 0) is(Gate)
Option A: 2d – 1, Option B: 2d Option C: d+1 , Option D: d
TUTORIAL SHEET 6
1. Discuss about tree data structure. Explain different types of binary trees.
2. Define the Huffmans algorithm related to tree with an example and its use.? (AKTU 2015-16)
3. Draw the binary trees for the different Algebraic expressions. Take five different examples and also find
their preorder traversal.(UPTU 2008-09)
4.Consider the In-order and Post-order traversals of a tree as given below : In-order : j e n k o p b f a c l g m
d h i Post-order : j n o p k e f b c l m g h i d a The Pre-order traversal of the tree shall be (Gate)
Option A: a b f e j k n o p c d g l m h i
Option B: a b c d e f j k n o p g l m h i
Option C: a b e j k n o p f c d g l m h i
Option D: j e n o p k f b c l m g h i d a
5.The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal (Gate)
Option A: ABFCDEi
Option B: ADBFEC
Option C: ABDECF
Option D: None of the above
TUTORIAL SHEET 7
1. Discuss about a graph? Explain with examples. Is graph a linear or non linear data structure? (UPTU
2014-15)
2 Discuss about Depth First Search? Explain with a suitable example.
3. Explain Minimum Cost spanning tree. Take an example and solve it with Prim‘s and Kruskal‘s
Algorithm?(AKTU 2015-16)

4. Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so
that the graph is not connected is (Gate)
Option A: 2451
Option B: 4950
Option C: 4851
Option D: 9900
5. A simple graph G with n − vertices is connected if the graph has (Gate)
Option A: (n − 1) (n − 2)/2 edges
Option B: more than (n − 1) (n − 2)/2 edges
Option C: less than (n − 1) (n − 2)/2 edges
Option D: ∑ k(i=1) C(ni, 2) edges
TUTORIAL SHEET 8
1.Explain Activity Network. With an Example.(UPTU 2013-14)

2.Explain the Adjacency Matrix representation with an example of graph.(UPTU 2013-14)
3. Explain Dijkstra Algorithm.
4. Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It
is known that the shortest path from source vertex s to u has weight 53 and shortest path from s to v has
weight 65. Which statement is always true? (Gate)
Option A: Weight (u, v) < 12 Option B: Weight (u, v) = 12
Option C: Weight (u, v) > 12 Option D: None of the above
5.Consider the following statements : (i) A graph in which there is a unique path between every pair of
vertices is a tree. (ii) A connected graph with e = v − 1 is a tree. (iii) A graph with e = v − 1 that has no
circuit is a tree. Which of the above statements is/are true ? (Gate)
Option A: (i) & (iii) Option B: (ii) & (iii) Option C: (i) & (ii) Option D: All of the above
TUTORIAL SHEET 9
1. Explain the Sequential search with an example.(UPTU 2008-09)

2. Explain the Binary search with an example.(AKTU 2015-16)
3. Give the steps for Selection Sort. Sort the list 32, 17, 57,14,9,23,7,41,5 using this method.
4.Linked Lists are not suitable for _____. (Gate)
Option A: Binary Search
Option B: Polynomial Manipulation
Option C: Insertion
Option D: Radix Sort
5. A binary search tree is a binary tree : (Gate)
Option A: All items in the left sub tree are less than root
Option B: All items in the right sub tree are greater than or equal to the root
Option C: Each sub tree is itself a binary search tree
Option D: All of the above
TUTORIAL SHEET 10
1. Give the steps for Quick Sort. Sort the list 32, 17, 57,14,9,23,7,41,5 using this method.
2. Give the steps for radix sort. Sort the list 32, 17, 57,14,9,23,7,41,5 using this method.
3. Discuss about an AVL tree? Explain the details of AVL tree.(UPTU 2013-14)
4. Explain the Heap Sort with an example.(UPTU 2011-12)
5. In which tree, for every node the height of its left sub tree and right sub tree differ almost by one ? (Gate)
Option A: Binary search tree
Option B: AVL tree
Option C: Threaded Binary Tree
Option D: Complete Binary Tree

MODEL PAPER
(SEM. III) ODD SEMESTER EXAMINATION 2019-20
DATA STRUCTURES
Time 3 Hours Total Marks 70
Note: Attempt all sections. If requires any missing data; then choose suitably
1. Attempt all questions in brief. 2x7=14

a) Differentiate Data Structure and Data Type.
b) What do you mean by Tail recursion?
c) What is Compaction?
d) Write the basic concept of KRUSKAL‘s algorithm.
e) Write over flow conditions for a circular queue.
f) Describe the space and time complexities of a program are necessary.
g) Obtain an addressing formula for the element A[i1][i2]….[in] in an n-dimensional array
declared as A[u1][u2]….[un], Assume a column major representation of the array with one
word per element.
2. Attempt any three of the following. 7x3=21
a) Write a function in C which searches string X for the first occurrence of string Y. If Y does
not appear in X, then function returns zero. Otherwise function returns starting position in X
of the first occurrence of Y.
b) Write an algorithm for evaluating an expression in postfix form.
c) State the Towers of Hanoi problem. Write a recursive algorithm for solving this problem
when the numbers of disk are three.
d) If the in-order traversal of a binary tree is B,I,D,A,C,Q,E,H,F and its postorder traversal is
I,D,B,Q,C,H,F,E,A, determine the binary tree.
e) Write a program in C for binary search. What is the worst case time complexity of binary
search?
3. Attempt any one part of the following. 7x1=7
a) Write an algorithm to add two polynomials when the polynomials are represented using
singly linked lists.
b) Illustrate the quick sort algorithm on list 9,20,12,21,3,5,1,22,19,7.
a) Discuss the different cases of rotations in AVL trees.
b) Use Prim‘s algorithm to determine the minimum spanning tree of the graph given below:

a) Explain Dijkstra‘s Algorithm and illustrate it on a suitable graph.
b) Implement typical stack operation when stacks are represented using singly linked lists.
a) Write an algorithm to insert and delete a node from doubly linked list.
b) Write an algorithm to convert a valid arithmetic infix expression into its equivalent postfix
expression. Trace your algorithm for A-B/C+D*E+F.
a) State the merits and demerits of static and dynamic memory allocation techniques.
b) Write short notes on any two :
(i) Direct file organization
(ii) Priority Queue
(iii) Indexing.

COURSE OUTCOME
Bloom’s Knowledge Level

(KL)
At the end of course , the student will be able to understand :
Study of the basic structure and operation of a digital K1, K2
CO 1 computer system.
Analysis of the design of arithmetic & logic unit and K2, K4
CO 2 understanding of the fixed point and floating-
point arithmetic operations.
Implementation of control unit techniques and the concept of K3
CO 3
Pipelining
Understanding the hierarchical memory system, cache K2
CO 4 memories and virtual memory
Understanding the different ways of communicating with I/O K2, K4

CO 5 devices and standard I/O interfaces
K1- Remember, K2- Understand, K3- Apply, K4- Analyze , K5- Evaluate , K6- Create
I.MAPPING OF COURSE OUTCOME (CO’S), PROGRAMME OUTCOME (PO’S) AND

PROGRAMME
OUTCOME
PO PO PO PO PO PO PO PO PO PO PO PO PSO1 PSO2 PSO3
1 2 3 4 5 6 7 8 9 10 11 12
CO1 3 3 3 2 - - - - - - - 3 3 3 -
CO2 3 3 3 1 2 - - - - - - 3 3 3 -
CO3 3 2 3 2 2 - - - - - - 3 2 3 -
CO4
3 2 2 - - - - - - - - - - - -
CO5
3 2 3 3 - - - - - - - - 2 3 -
AVE
3 2.4 2.8 2 2 - - - - - - 3 2.5 3 -
RAGE
*3: HIGH 2: MEDIUM 1: LOW -: NONE

COURSE PLAN
KCS-302
UNIT Lecture Contents Hours Ref. Book

Carl Hamacher,
Functional units of digital system and their interconnections 1
William Stallings
Carl Hamacher
Buses, bus architecture 1
William Stallings
I
Types of buses and bus arbitration 2 Carl Hamacher
Register, bus and memory transfer 1 M.Morris Mano
Processor organization, general register organization 1 Carl Hamacher
Stack organization 1 M.Morris Mano
Addressing modes 1 M.Morris Mano
Look ahead carry address, Multiplication: Signed operand
2 M.Morris Mano
multiplication
Booths algorithm 2 Carl Hamacher
II Array multiplier 1 M.Morris Mano
Division and logic operations, Floating point arithmetic
1 Carl Hamacher
operation
Arithmetic & logic unit design. IEEE Standard for Floating
2 William Stallings
Point Numbers
Instruction types, formats 1 Carl Hamacher,
William Stallings,
Instruction cycles and sub cycles. 1
Carl Hamacher
Micro-operations, execution of a complete instruction 1 Carl Hamacher
III
Program Control, Reduced Instruction Set
1 Carl Hamacher
Computer, Pipelining.
Hardwire and microprogrammed control 2 Carl Hamacher
Microprogramme sequencing, 1 Carl Hamacher
Concept of horizontal and vertical microprogramming. 1 William Stallings
Basic concept and hierarchy, semiconductor RAM memories 1 Carl Hamacher
2D & 2 1/2D memory organization. ROM memories 1 Carl Hamacher
Cache memories: concept and design issues, performance,
IV 2 William Stallings,
addressmapping and replacement
Auxiliary memories: magnetic disk, magnetic tape and
2 William Stallings
optical disks
Virtual memory: concept implementation 2 Carl Hamacher
Peripheral devices, I/O interface, I/O ports 1 Carl Hamacher,
Interrupts: interrupt hardware, types of interrupts and
1 Carl Hamacher
exceptions
Modes of Data Transfer: Programmed I/O 1 William Stallings
William Stallings
V Interrupt initiated I/O and Direct Memory Access 2
I/O channels and processors 1 William Stallings
Serial Communication: Synchronous & asynchronous
1 Carl Hamacher
communication
Standard communication interfaces 1 Carl Hamacher

TUTORIALSHEETS
TUTORIAL SHEET – 1
1. Perform subtraction using 1‘s and 2‘s complement :

a. 1101 from 1111 b. 1111 from 1001.
2. Represent in 6 bit 2‘s complement form: -7, +7, +16 and -16.
3. Discuss bus structure.
4. Describe generation of computer.
5. Differentiate architecture and organization.
1. Discuss overflow in computers. Add the given signed binary numbers

a. -23 and -47 b. -12 and +8
2. Multiply using booth algorithm
a. -13 and +11. B. 13 and -11 c. -13 and -11 d. 13 and 11.
3. What is memory transfer? What are the different registers associated for memory transfer?
4. Discuss the need of fast adders. Explain carry look ahead carry adder.
5. Explain the memory operation for the following:
R2 M [AR]
1. Write advantages and disadvantages of daisy chain method of bus arbitration.

2. Discuss basic organization of microprogrammed control unit.
3. Show the contents of the registers E, A, Q, SC during the process of multiplication of two binary
numbers 11111 (multiplicand) 10101 (multiplier) the signs are not included
4. Discuss the Bus arbitration and its types?
5. Differentiate single bus structure and multiple bus structure.
1. Discuss stack and explain the working of push and pop operations?
2. Write a program to evaluate arithmetic expression X = (A + B * C)/ (D- E/F)
(a) Using a general register computer with three address instruction.
(b) Using a general register computer with two address instruction.
(c) Using an accumulator type computer with one address instruction.
(d) Using stack organized computer with zero address instruction.
3. Show the block diagram of hardware that implements following:
yT2: R2  R1, R1R2
4. Represent by RTL: If (P=1) then (R1R2) else if (Q=1) then (R1R3).
5. What must be the address field of an indexed addressing mode instruction to make it same as a
register indirect mode instruction?
1. A 2 word instruction is stored in memory at an address designated by symbol W. The address field
of instruction is stored at W+1 is designated by symbol Y. The operand used during execution of
instruction is stored at address Z. An index register contains value X. State how Z is calculated from
other address if addressing mode of instruction is:
a. Direct
b. Indirect
c. relative
d. indexed
2. An instruction is stored at location 300 with its address field at 301. The address field has value 400.
A processor register R1 contains the number 200. Evaluate effective address if addressing mode of
instruction is:
a. Direct

b.Register Indirect
c. relative
d. indexed with R1 as index register
e. immediate
3. Determine the micro operations that will be executed in the processor when following 14 bit control
words are applied:
a. 00101001100101
b. 00000000000000
c. 01001001001100
d. 00000100000010
e. 11110001110000
4. Let SP = 000000 in stack of 64 word stack. How many items are there in the stack if:
a. FULL =1 and EMTY = 0
b. FULL = 0 and EMTY =1
5. Convert to infix:
a. ABCDE+*-/
b. ABCDE*/-+
1. To upgrade 256x 1 chip to 1024 x 8 memory organization, how many chips are needed?
2. A digital computer has a common bus system for 16 registers of 32 bits each. The bus is constructed
with multiplexers.
a. How many selection inputs are there in each mux?
b. What size of mux are needed?
c. How many multiplexers are there in the bus?
3. Specify the control word that must be applied to processor to implement following:
a. R5  R5-1
b. R1R2+R3
c.R6shlR1
4. Given 16 bit value 1001101011001101. What operation must be performed in order to:
a. clear to 0 first 8 bits.
b. set to 1 last 8 bits
5. Register A holds 8-bit binary 11011001. Determine the B operand and logic operations to be
performed to change the value in A to:
a. 01101101
b. 11111101
1. A computer has 16 registers, an ALU with 32 operations, and a shifter with eight operations, all
connected to a common bus system.
(i) Formulate a Control Word for a microoperation.
(ii) Specify the number of bits in each field of the control word and give a general encoding scheme.
(iii) Show the bits of the control word that specify the micro-operation R4 <— R5 + R6.
2. How many 32K X 1 RAM chips are needed to provide a memory capacity of 256K – bytes?
3. When a device interrupt occurs how the processor does determine which device has issued the
interrupt?
4. When a DMA module takes control of a bus and while it retains control of the bus, what does the
processor do? [AKTU 2011-12]
5. What is the use of Modem in synchronous communication? [AKTU 2015-16]
1. Draw an explain VAN neumanarchitectye.

2. Represent 128.25 in double pecesion.
3. List the key services provides by operating system.

4. Explain and differentiate between programmed i/o and interrupt driven i/o.
5. Explain in detail: (a) PCI (b) ALU (c) Microcontroller families
TUTORIAL SHEET –9
1. Explain basic structure of micro program control unit.

2. Write short note on
Block replacement policy
Address translation scheme from main memory.
3. Describe parallelism in micro instructions.
4. Why Input Output interface is required? Describe in detail. [AKTU 2015-16]
5. Differentiate between Synchronous and Asynchronous transmission? [AKTU 2016-17]
TUTORIAL SHEET –10
1. What is the purpose of swapping? Explain the purpose of a translation look aside buffer in arm
memoy management with block diagram.
2. Explain hamming code with example.
3. Explain the concept of bus memory transfer.
4. Explain microprogram sequencer with block diagram.
5. Write short note on Interrupts with their types and exceptions? [AKTU 2013-14]
ASSIGNMENTS
ASSIGNMENT-1
1. Discuss method of subtraction using 1‘s and 2‘s complement.
2. Why do we need virtual memory?
3. Compare horizontal microcode with vertical microcode.
4. Explain evolution of different computer generations.
5. What is bus arbitration? List different types of bus arbitration.
ASSIGNMENT -2
1. Let SP = 00000 in the stack. How many items are there in the stack of FULL= 1 and EMPTY= 0 ?
2. What is hit ratio?
3. Discuss the Booth's algorithm for 2‘s-complement number. Multiply (-7)10 with (3)10 by using Booth's
multiplication algorithm.
4. Explain most common fields found in instruction formats. Evaluate the arithmetic statement X = (A +
B) x (C + D) using a general register computer with three address, and two address instruction
format.
5.What is the difference between implied and immediate addressing modes? Explain with an example.

MODEL PAPER
Time: 3Hr. Total Marks: 100
SECTION A
Q.1 Attempt all parts of this section. (2x10=20)
a Using 8-bit 2's complement representation of negative numbers, perform - 35 + (-11).

b Which three mapping techniques are used in cache memory?
c Why do we need virtual memory?
d Compare horizontal microcode with vertical microcode.
e What is hit ratio?
f What is bus arbitration? List different types of bus arbitration.
g Starting from initial value of R=11011101, determine the sequence of binary values in
R after a logical shift left, followed by circular shift right.
h Represent the number (+46.25)10asfloating point binary number with 32 bits.
i Explain the concept of bus memory transfer.
j Draw block diagram of a processor.
SECTION B
Q.2 Attempt any three parts: (3x10=21)
a Discuss the Booth's algorithm for 2‘s-complement number. Multiply (-7)10 with (3)10 by
using Booth's multiplication algorithm.
b What is the difference between implied and immediate addressing modes? Explain with
an example.
c Explain most common fields found in instruction formats. Evaluate the arithmetic
statement X = (A + B) x (C + D) using a general register computer with three address,
and two address instruction format.
d Discuss the basic structure of micro program control unit and hardwired control unit.
Describe any one method used for designing of hardwired control unit.
e What do you mean by cache memory? How does it affect the performance of the
computer system?
SECTION C
Q.3 Attempt any one part (1x10=10)
a What is an interrupt? Explain how processor responds to an interrupt.

b. Design parallel priority interrupt hardware for a system with eight interrupt sources.
a Explain the need of memory hierarchy. What is the main reason for not having a large
main memory for storing the totality of information in a computer system?
b. Differentiate 2D and 2 memory organization.
a What is the difference between isolated I/O and memory mapped I/O? State the
advantages and disadvantages of each.
b. Write the sequence of control steps required for the single bus structure for the
following instruction
Add((R2)), R1

a A general- register organization has 16 register with 32 bits in each ALU and a
destination decoder.
(i) How many multiplexers are there in the A bus and what is the size of each
multiplexer?
(ii) How many selection inputs are needed for MUX A and MUX B ?
(iii) How many inputs and outputs are there in the decoder?
b. A computer uses RAM chips of 1024 x 1 capacity. How many chips are needed and
how should their address lines be connected to provide a memory capacity of 1024
bytes?
a Let the address stored in the program counter be designated by the symbol X1. The
instruction stored in X1 has an address part X2. The operand needed to execute the
instruction is stored in the memory word with address X3. An index register contains
the value X4. What is the relationship between these various quantities if the addressing
mode of the instruction is (a) direct; (b) indirect ?
b. Show the block diagram of the hardware that implements the following register transfer
statement
yT2 : R2 ←R1, R1← R2.
c. A set associative mapping cache has a set size of 4. The cache capacity is 2 K words
and that of main storage is 128 K x 32. Derive all pertinent information required to
design the Cache memory and note the data path for the set associative organization.
Determine the average memory access time for a cache hit of 0.85, cache access time of
100 nsec and main storage access time of 500 nsec.

COURSE PLAN
DISCRETE STRUCTURES & THEORY OF LOGIC
KCS-303
Course Description: This course includes set theory, relations, functions, combinations, preposition
graphs, Poset, Hasse Diagram, Lattices. This course is designed to enhance student ability to perceive, to
formulate and to solve the computer related problems in a mathematical way.
PRE-Requisites: As prerequisite the students must be familiar with basic concepts of mathematics like
sets, functions, relations, combinatorics. They also must know the data structure like tree, graph.
Time Text Book

Unit Topics Page No.
(Hr.) Referred
Introduction and combination of sets,
1 Lipson 1.1, 1.2 1-3
Multisets.
Ordered pairs, Proofs of some general
1 Lipson 1.3 3-4
identities on sets.
Definition, Operations, Properties of Lipson 2.1,2.3,
1 27-32
UNIT-1 Relations, Composite Relations 2.4,2.5
(SET THEORY, Equality of Relations, Recursive Lipson 2.6,
1 32-38
RELATIONS, Definition of relation, Order of relation 2.7,2.8,2.9
FUNCTION, Definition, Classification, Operation of
1 Lipson 3.1,3.2 50-54
NATURAL Functions
NUMBER) Recursively defined functions, Growth
1 Lipson 3.6 59-61
of Functions
Mathematical Induction, Variants of
1 C.L. Liu 1.5 13-21
Induction
C.L. Liu 4.8, p
Base Cases, Types of Proof Methods. 1 126
126
Definitions & Properties of Algebraic
1 G.S. Rao 9.4 357-365
structure
G.S.Rao
Group, Subgroups and order 1 365-371
9.5,9.6
G.S. Rao
UNIT-2 Cyclic Group 1 372-375
9.9,9.11
(ALGEBRAIC
Cosets, Lagrange‘s Theorem 1 G.S. Rao 9.21 376-379
STRUCTURES)
Normal Subgroup 1 G.S. Rao 9.24 381-382
Permutation and Symmetric group 1 G.S. Rao 9.28 388-395
Group Homomorphisms 1 G.S. Rao 9.30 395-396
Definition & Elementary properties of G.S. Rao
1 401-404
Rings & Fields 9.33.1
Definition, properties and combination C.L. Liu
1 49,117
of partial ordered sets 2.3,4.5
Hasse Diagram 1 Lipson 14.3 444

Lipson 14.7
UNIT-3 Definition and properties of lattices 1 449
(PARTIAL ORDER Lipson 12.1-
SETS, LATTICES, Types of Lattices 1 455-460
12.4
BOOLEAN Introduction & Axioms and Theorems
ALGEBRA) 1 Lipson 15.3 477-478
of Boolean Algebra
Algebraic Manipulation of Boolean
Lipson
Expression, Simplification of Boolean 1 481-483
15.7,15.8
Functions
Karnaugh Maps, Logic Gates 1 Lipson 15.10 486-490
Digital Circuits and Boolean algebra 1 Lipson 15.12 492-497
UNIT-4 Lipson 4.4 80-82
Proposition, Well-formed Formula 1
(PROPOSITIONAL
AND PREDICATE Truth Table 1 Lipson 4.5 82-83

LOGIC) Tautology,Satisfiability,Contradiction 1 Lipson 4.6 83
Algebra of proposition 1 Lipson 4.7 83-84
Theory of Inference 1 Lipson 4.8 84-85
First order predicate, Well-formed
1 Lipson 4.9 85-86
formula
Quantifiers 1 Lipson 4.10 87
Inference theory of predicate Logic 1 Lipson 4.11 89
C.L. Liu 3.1,p
Definition of Tree and Binary tree 1 66 66
Binary Tree Traversal and Binary C.L. Liu 3.2

1 66
Search Tree.
Definition and representation of graph, C.L. Liu 3.3

1 67
UNIT-5 Multigraphs
(TREES, GRAPHS,
RECURRENCE
Bipartite graph, Planar graph,
RELATION &
Isomorphism graph, Homeomorphism 1 C.L. Liu 3.4 67
GENERATING
Graph.
FUNCTION,
COMBINATORICS)
Euler and Hamiltonian path, Graph
1 C.L. Liu 3.5 73
Coloring.
C.L. Liu 10.1-
Recurrence Relation 1 306-309
10.2
Generating Function 1 C.L. Liu 10.3 309-312
Counting Techniques and Pigeonhole C.L. Liu 9.4
1 289-296
Principle
POST-Requisites: Discrete mathematics is the study of mathematical structures that are

fundamentally discrete rather than continuous. In contrast to real numbers that have the property of varying
"smoothly", the objects studied in discrete mathematics – such as integers, graphs, and statements in logic –
do not vary smoothly in this way, but have distinct, separated values.[2] Discrete mathematics therefore
excludes topics in "continuous mathematics" such as calculus and analysis. Discrete objects can often
be enumerated by integers. More formally, discrete mathematics has been characterized as the branch of
mathematics dealing with countable sets (sets that have the same cardinality as subsets of the natural
numbers, including rational numbers but not real numbers). However, there is no exact definition of the term
"discrete mathematics."[4] Indeed, discrete mathematics is described less by what is included than by what is
excluded: continuously varying quantities and related notions.
References:
1. C.L. Liu "Elements of Discrete mathematics" McGraw Hill
2. Seymour Lipschitz, " Discrete Mathematics" TMH
3. Kenneth H. Rosen, "Discrete Mathematics and its applications", McGraw Hill
4. Krishan Murthy V., "Combination‘s theory & application", McGraw Hill

TUTORIAL SHEET
DISCRETE STRUCTURES & THEORY OF LOGIC
KCS 303
TUTORIAL SHEET-1
Q1 Let A= {7,7,7,2,2,3,3,5}; B={7,8,8,8,9,2,2}. Find (i) AUB (ii) A+B (iii) A∩B (iv) A-B.
Q2 In a city 1000 families, it was found that 40% families buy newspaper A, 20% families buy
Newspaper B, and 10% buy C. Only 5% families buy A and B, 3% buy B and C and 4% buy A and C
and 2% families buy all the three newspapers. Find the number of families which buy:
(a) A only (b) B only (c) None of A,B and C Ans: 330, 140, 400.
Q3 Let R ={ (a,b), (c,d), (b,b) } and S = { (d,b), (b,e), (c,a), (a,c)} find (i) RoS (ii) SoR (iii) RoR
(iv) Ro(SoR).
Q4 Let R be relation on set of natural number N defined by
Show that R is a equivalence
relation.
Q5 Let R be relation on set defined by

Determine (i) Reflexive closure of R (ii) Symmetric closure of R (ii) Transitive closure of R
TUTORIAL SHEET-2
Q1 The relation on a set A={a,b,c,d} is defined by R={(a,a),(a,b),(b,b),(b,a),(b,d),(c,d),(c,b)} Find relation

matrix and diagraph.
Q2 Let be the functions defined by find (i) fof

(ii) gof (iii) fog
Q3 Prove by Mathematical induction for
Q4 Prove that where n>0
Q5 Prove that for
TUTORIAL SHEET-3
Q1 Construct a Cayley table for the set under the composition define by:
1)
2) .
Q2 Show that the set of cube root of unity is an abelian group with respect to multiplication.
Q3 Let . Show that G is a group under matrix multiplication.
Q4 Prove that any group of order 3 is cyclic.
Q5 How many generators are there of the cyclic group G of order 10. Ans:

TUTORIAL SHEET-4
Q1 If , then compute .
List all the elements of
Q2 Show that , s.t. is a homomorphism.
Q3 Show that the multiplicative group is isomorphic to permutation group .
Q4 State and Prove Lagrange‘s theorem for group. Is the converse being true?
Q5 Prove that set is a commutative ring with respect to as two ring
composition.
TUTORIAL SHEET-5
Q1 Prove that the set of integers with usual ordering read as ―less than or equal to‖ is a poset.
Q2 Draw the Hasse diagrams for .
Q3 If A and B are two poset then prove that AXB is also poset where iff
Q4 such that (P(A), is poset. Find minimal, maximal, greatest and least element. Also
show it is lattice.
Q5 Prove that is lattice.
TUTORIAL SHEET-6
Q1 Prove that dual of lattice is lattice.

Q2 For any and in a Boolean algebra B prove that
(i) (ii)
Q3 Write the Boolean function in CNF and DNF form.
Q4 Simplify using K-map
Q5 Using K map simplify
TUTORIAL SHEET-7
Q1 Show that is a tautology.

Q2 Show that and are logically equivalent.
Q3 Show that is a tautology without truth table.
Q4 Show that the truth value of the following independent of their component.
Q5 (i) Write the contra positive, converse and inverse of statement ―Indian team wins whenever match
played in Kolkata, home town of Ganguly‖.
(ii)The contra positive of a statement is given as ― if then . Write converse and
inverse.

TUTORIAL SHEET-8
Q1 Show is contingency.
Q2 If the races are fixed and the casinos are crooked, then the tourist trade will decline. If the trade
decrease, then police will be happy. The police force is never happy, therefore, the races are not fixed.
Check validity of argument.
Q3 Translate following statement using quantifier:
(i) Every mammal is warm blooded
(ii) There are some animals which are not mammals
(iii) Some Mathematicians are not good in English.
Q4 Negate the statement:
(i) All integer are greater than zero
(ii) Some person are not wise
Q5 Discuss validity of argument:
All educated persons are well behaved. Ram is educated. No well-behaved person is quarrelsome.
Therefore, Ram is not quarrelsome.
TUTORIAL SHEET-9
Q1 Draw the diagram of tree using inorder and preorder traversal of a tree
inorder Q B K C F A G P E D H R
preorder G B Q A C K F P D E R H
Q2 Draw the diagram of tree using inorder and postorder traversal of a tree
inorder h f e a B i g d c
preorder b e h f A c d g i
Q3 Show that a simple complete graph with n-vertices has the n(n-1)/2 edges.
Q4 A simple graph with n vertices and k components cannot have more than (n-k)(n-k+1)/2 edges.
Q5 Draw graph.
TUTORIAL SHEET-10
Q1 Determine the particular solution of ans:

Q2 Solve
Ans
Q3 Use generating function to solve with conditions

Ans
Q4 How many arrangement are possible for word ALLAHABAD.
Q5 How many integral solutions are there of
, where ans C(24,20)

COURSE PLAN
PYTHON PROGRAMMING
KNC-302
I. COURSE DESCRIPTION: Python is a language with a simple syntax, and a powerful set of
libraries. It is an interpreted language, with a rich programming environment, including a robust
debugger and profiler. While it is easy for beginners to learn, it is widely used in many scientific
areas for data exploration. This course is an introduction to the Python programming language
for students without prior programming experience.
II. PRE REQUISITES: The prerequisite for learning Python is basic knowledge of concepts like
Variables, Loops, Control Statements etc.
III. PYTHON PROGRAMMING COURSE OUTCOME
Bloom’s Knowledge
Level (KL)
CO 1 To read and write simple Python programs. K1, K2
CO 2 To develop Python programs with conditionals and loops. K2, K4

To define Python functions and to use Python data structures –- lists,
CO 3 K3
tuples, dictionaries
CO 4 To do input/output with files in Python K2
CO 5 To do searching ,sorting and merging in Python K2, K4
K1- Remember, K2- Understand, K3- Apply, K4- Analyze
IV. Program Outcome(PO)
Engineering Knowledge: Apply knowledge of

mathematics and science, with fundamentals of Computer
PO1
Science & Engineering to be able to solve complex
engineering problems related to CSE.
Modern Tool Usage: Create, Select and apply
appropriate techniques, resources and modern
engineering and IT tools including prediction and
PO5
modeling to computer science related complex
engineering activities with an understanding of the
limitations
Life-Long Learning: Recognize the need for and have
PO12 the preparation and ability to engage in independent
and life-long learning the broadest context of
technological change
V. Program Specific Outcome(PSO)
Foundation of mathematical concepts: To use mathematical concepts to

PSO1 solve problem using suitable mathematical analysis, data structure and
suitable algorithm.

VI. MAPPING OF COURSE OUTCOME (CO’S), PROGRAMME OUTCOME (PO’S) AND
PROGRAMME
OUTCOME
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 - - - 3 - - - - - - 3 3 - -
CO2 3 - - - 3 - - - - - - 3 3 - -
CO3 3 - - - 3 - - - - - - 3 3 - -
CO4
3 - - - 3 - - - - - - 3 3 - -
CO5
3 - - - 3 - - - - - - 3 3 - -
AVE
3 - - - 3 - - - - - - 3 3 - -
RAGE
VII. Lecture Plan:
Time Text Book Page No./Website

Unit Topics
(Hr.) Referred Referred
The Programming Cycle for 1 Page No. 8-9
F
Python
Python IDE 1 F Page No. 22-24
Interacting with Python 1 Page No. 24- 28
F
Programs
I Elements of Python, Type 1 Page No. 41-49
Conversion F,I Page No. 66-68
Expressions, Assignment 1 Page No. 9 -11
A
Statement
Arithmetic Operators 1 A Page No. 3
Operator Precedence 1 A Page No. 11-12
Boolean Expression 1 Page No. 77-78
II Conditional statement in Python 1 Page No. 78-80
(if-else statement, its working F
and execution)
Nested-if statement and elif 1 Page No. 80-81
F
statement in Python
Expression Evaluation and Float 1 Page No. 49-53
F
Representation Page No. 47
Purpose and Working of Loops 1 Page No. 65-70
F
Page No. 173-178
While loop including its 1 Page No. 86-88
F
working
For Loop 1 F Page No. 65- 66
Nested Loops 1 Page No. 244-246
F,I
Page No. 394-396
Break and Continue 1 B Page No. 27-28
Function: Parts of a Function 1 Page No.146-147
and Execution of a Function F

Function: Keywords, Default 1 F Page No. 147-153
Arguments and Scope Rule
III
Strings: Length of the string , 1 F Page No. 115-117

perform Concatenation and
Repeat operations in it
Strings: Indexing and Slicing of 1 F Page No. 104-106
Strings
Python Data Structure : 1 F,A Page No. 144-145
Tuples, Unpacking Sequences , Page No. 115-120
Lists and Mutable Sequences
Python Data Structure : List 1 A Page No. 184-188

Comprehension and Sets
Dictionaries 1 A Page No. 103-108
Higher Order Functions: Treat 1 A,F Page No. 93-94
functions as first class Objects Page No. 365-366
and Lambda Expressions
Sieve of Eratosthenes: 1 J Page No. 55-58
Generate prime numbers with
the help of an algorithm given
by the Greek Mathematician
named Eratosthenes, whose
algorithm is known as Sieve of
Eratosthenes.
File I/O : File input and output 1 A Page No. 137-140
operations in Python
Programming
Exceptions and Assertions 1 A Page No. 140-141
Modules : Introduction , 1 A,I Page No. 143-.144

Importing Modules Page No. 204-.206
Abstract Data Types: Abstract 1 A Page No. 147-152
data types and ADT interface in
Python Programming
Classes : Class definition and 1 A Page No. 161-168
IV other operations in the classes ,
Special Methods ( such as
_init_,
_str_ Comparison methods and
Arithmetic methods etc.)
Classes : Class Example , 1 A Page No. 171-.177
Inheritance , Inheritance and
OOP.
Iterators & Recursion: 1 F Page No. 176-179

Recursive Fibonacci Page No. 684-685
Iterators & Recursion: Tower 1 I Page No. 450-455
Of Hanoi Page No. 690-692

Search : Simple Search and 1 F Page No. 391-393
Estimating Search Time
V
Search : Binary Search and 1 F Page No. 403-405
Estimating Binary Search Time
Sorting & Merging: Selection 1 F Page No. 406-407

Sort
Sorting & Merging: Merge 1 F Page No. 415-418
List
Sorting & Merging: Merge 1 F Page No. 415-418
Sort
Sorting & Merging: Higher 1 A Page No. 92-93
Order Sort Page No. 792-794
Total Lectures=40

MODEL PAPER
PYTHON PROGRAMMING (KNC-302)
B.TECH CS/IT
TIME: 3 HOURS MAX. MARKS:100

SECTION – A 10 X 2 = 20
1. Attempt all questions from this section. All parts carry equal marks.
What does the ‗>>>‘ on Python shell indicate?.
What is Polymorphism and Abstraction?
Is python a case-sensitive language?
Duplicate keys are not allowed(but duplicate values are allowed). Why?
Differentiate between user-defined and library-defined functions.
What is the output of the following code?
t1, t2 = (1, ‗one‘) , (2, ‗two‘)
t1, t2 = t2, t1
print ( ‗t1->‘ , t1, ‗t2->‘ , t2)
t3 , t4 = t1
print( ‗t3->‘ , t3 , ‗t4->‘ ,t4)
State the syntax to open, write text and close a file.
What are local and global variables?
What is the difference between assigning a list to another list and copying a list?
SECTION -B 10 X 3 = 30
2. Attempt any three questions from this section.

a.
hat are CPython, Jython, and IronPython, how are they different?
b.
string in python can have a positive index as well as a negative index. Explain the terms
positive index and negative index. What does the index of -1 represent?
c. What is inheritance? Explain types of inheritance.
d. Create a list of tuples such that each tuple has two items, that is, a number and its square. Example:
[(0,0),(1,1),(2,4),(3,9),(4,16),(5,25),(6,36),(7,49),(8,64)]
e. Explain all File Handling operations. Explain the use of seek() in file handling.
SECTION C
3. Attempt any one part of the following: 10X 1 = 10
(a) List the uses of zip, lambda, map and filter in functions.
(b)Write a function print_reverse(Lst) to reverse the elements of a list.
Lst=[12,23,4,5]
#Should reverse the contents of list as follows.
Lst= [5, 4, 23, 12]
4. Attempt any one part of the following: 10 X 1 = 10

(a) In python, the multiply operator, that is, ‗*‘, can be used to multiply a string with an integer . But
you cannot multiply two strings. Explain.
(b)Write a function Assign_grade (Lst) which reads the marks of a student from a list and assigns a
grade based on the following conditions:
if marks>=90 then grade A
if marks>=80 && <90 then grade B
if marks>65 && <80 then grade C
if marks>=40 && <=65 then grade D
if marks< 40 then grade F
Consider the List of Marks of a 5 student in English Subject.
Lst = [78, 90, 34, 56, 89]

(a)Write a generator function which prints a list of all numbers between 0 to 100 and which is divisible both
by 3 and by 5.
(b) Write a program to sort items in a dictionary into a list of tuples in ascending order of keys of dictionary.
The following steps must be followed:
(i)Make a list of keys of the dictionary.
(ii)Sort the list in-place.
(iii)Use the sorted list to make another list of tuples of key-value pair as a tuple for each key in the dictionary.

(a)There are two methods of insertion in a list: append() and extend(). What is difference between them?
(b) (i)Write the function replacevowels(word) which removes all the vowels (‗a‘, ‗e‘, ‗i‘, ‗o‘, ‗u‘) in a word
and returns the remaining letters in the word.
(ii) Write the function UpperCaseVowels(word) which returns the word with all the vowels capitalized.

(a) Explain Operator Precedence and Associativity. Convert the following equations into their corresponding
Python expressions.
(i) (2XY)/(C+10)-X/[4(Z+D)] (ii) Z=[{10Y(ab+C)/d}-(0.8+2b)]/(x+a)(1/z)
(b)Write a program to calculate area of a rectangle by assigning the value to the attributes of a rectangle ,
i.e. length and breadth using object oriented concepts.


Evaluation Scheme B.Tech (Computer Science and Engineering) Semester-Iii

Uploaded by

Copyright:

Available Formats

Evaluation Scheme B.Tech (Computer Science and Engineering) Semester-Iii

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Evaluation Scheme B.Tech (Computer Science and Engineering) Semester-Iii

Uploaded by

Copyright:

Available Formats

EVALUATION SCHEME

B.TECH (COMPUTER SCIENCE AND ENGINEERING)

Shri Ram Murti Smarak Engineering Institutions. Page - 1 -

PROGRAM EDUCATIONAL OBJECTIVES

PROGRAM SPECIFIC OUTCOMES

Shri Ram Murti Smarak Engineering Institutions. Page - 2 -

Text /Reference Books:

KAS-301: TECHNICAL COMMUNICATION

Unit -1 Fundamentals of Technical Communication:

Unit - II Forms of Technical Communication:

Unit - III Technical Presentation: Strategies & Techniques

Shri Ram Murti Smarak Engineering Institutions. Page - 3 -

Unit - IV Technical Communication Skills:

Unit - V Dimensions of Oral Communication & Voice Dynamics:

Shri Ram Murti Smarak Engineering Institutions. Page - 4 -

Shri Ram Murti Smarak Engineering Institutions. Page - 5 -

Shri Ram Murti Smarak Engineering Institutions. Page - 6 -

KNC-302: PYTHON PROGRAMMING

Shri Ram Murti Smarak Engineering Institutions. Page - 7 -

KCS 351: DATA STRUCTURES USING C LAB

Shri Ram Murti Smarak Engineering Institutions. Page - 8 -

1. Implementing HALF ADDER, FULL ADDER using basic logic gates

KCS-353: DISCRETE STRUCTURE & LOGIC LAB

Programming Language/Tool Used: C and Mapple

Note: Understanding of mathematical computation software Mapple to experiment the followings

10. Working of Computation software

Shri Ram Murti Smarak Engineering Institutions. Page - 9 -

At the end of course , the student will be able to understand :

II. MAPPING OF COURSE OUTCOME (CO’S), PROGRAMME OUTCOME (PO’S) AND

Shri Ram Murti Smarak Engineering Institutions. Page - 10 -

Unit-1 Biasing-VI Characteristics(Ideal

E Type- Construction and

1 430-447 Robert Boylestad

Shri Ram Murti Smarak Engineering Institutions. Page - 11 -

Shri Ram Murti Smarak Engineering Institutions. Page - 12 -

1. Explain the behavior of p-n junction at no bias and reverse bias.

9. For the network of Fig. 2, determine the output voltage.

Shri Ram Murti Smarak Engineering Institutions. Page - 13 -

Shri Ram Murti Smarak Engineering Institutions. Page - 14 -

Shri Ram Murti Smarak Engineering Institutions. Page - 15 -

Shri Ram Murti Smarak Engineering Institutions. Page - 16 -

Shri Ram Murti Smarak Engineering Institutions. Page - 17 -

4. Determine the value of IC,IB,VCE (Robert L. Boylestad)

Shri Ram Murti Smarak Engineering Institutions. Page - 18 -

3. Calculate the dc voltages and currents in the circuit of fig.

Shri Ram Murti Smarak Engineering Institutions. Page - 19 -

5. Define following terms (Robert L. Boylestad)

3. Determine the expression of V0 in terms of input voltages.

4. Sketch the circuit of summer using op-amp to get

Shri Ram Murti Smarak Engineering Institutions. Page - 20 -

TUTORIAL SHEET –10

Shri Ram Murti Smarak Engineering Institutions. Page - 21 -

Time: 3Hours Total Marks: 100

2. Attempt any three parts of the following: 3×10=30

c. Sketch the circuit of summer using op-amp to get

Shri Ram Murti Smarak Engineering Institutions. Page - 22 -

4. Attempt any one part of the following: 1×10=10

5. Attempt any one part of the following: 1×10=10

6. Attempt any one part of the following: 1×10=10