Osmania University-2 year- SYLLUBUS-CSE Department

CSE-SYLLABUS241

SCHEME OF INSTRUCTION & EXAMINATION

  B.E.II/IV  (Regular)

COMPUTER SCIENCE &  ENGINEERING 

SEMESTER-I 

B.E. II/IV - I Semester:

S.No	Syllabus Ref.No	SUBJECT	Scheme of Instruction		Scheme of Examination
			Periods per Week		Duration in Hrs	Maximum Marks
			L/T	D/P		Unit Exam	Sessionals
		THEORY
1	MAT 201	Mathematics -III	4		3	75	25
2	CS 201	Data Structures	4		3	75	25
3	CS 202	Discrete Structures	4		3	75	25
4	CS 203	LST	4		3	75	25
5	CS 204	Computer Architecture	4		3	75	25
6	EC 222	Basic Electronics	4		3	75	25
		PRACTICALS
1	CS 231	DS Lab		3	3	50	25
2	EC 242	Basic Electronics Lab		3	3	50	25

MAT 201 - MATHEMATICS - III
(Common to all Branches)
UNIT - I
Partial differential equations: Formation of partial-differential equation of first order - Lagrange's
solution. Standard types – Charpit’s & jacobi’s method of solution,partial differential equations of
higher order, Monge's method.
UNIT-ll
Fourier Series: Expansion of a function in Fourier series for a given range, half range sine and cosine
expansions, odd and even functions of Fourier series, change of interval, complex form of Fourier
Series.
UNIT - Ill
Partial differential equations: Solutions of wave equation, heat equation and Laplace’s equation by
the method of separation of variables and their use in problems of vibrating string, one and two
dimensional wave and heat flow and examples thereon.
UNIT -IV
Z-Transforms: Introduction. Basic theory of Z-Transforms. Z-Transforms of some standard
sequences. Existence of Z-Transforms, Linearity property, Translational Theorem, Scaling property,
Initial and Final value Theorems, Differentiation of Z-Transforms, Convolution Theorem, Solution of
Difference equations using Z-Transforms.
UNIT -V
Numerical Methods: Solution of linear system of equations. Gauss elimination method Gauss-Seidel
iterative method, ill conditioned equations and refinement of solutions, Interpolation, Lagrange
Interpolation, Newton’s divided difference Interpolation, Newton’s Forward and Backward
Interpolation formulas. Numerical differentiation and integration ( Trapezoidal and Simpson’s
formulas) Solution of differential equations, Runge-Kutta Method.
Suggested Reading :
1.E. Kreyszig , Advanced Engineering Mathematics, Wiley Eastern Ltd., 8th Edition, New Delhi,
2006.
2.R.K. Jain & S.R.K. Iyengar, Advanced Engineering Mathematics, Narosa Publications, 2005.
3.B.V.Ramana, Higher Engineering Mathematics, Core Engineering Series, Tata McGraw Hill
Publishing Company Ltd., New Delhi,2007.
4.B.S. Grewal, Higher Engineering Mathematics, Khanna Publications, 34th Edition, 1998.

---------------------------------------------------------------------------------------------------------------
CS 201 - DATA STRUCTURES
UNIT – I
Data Representation of Linear Lists: Formula-based representation, Linked representation, Indirect
representation, Simulating Pointers.
Complexity analysis, Sequential Search, Binary Search, Matrix operations
– add, Multiply,transpose. Arrays and Matrices.
UNIT - lI
Sorting Methods and Complexity Analysis: Bubble sort, Selection sort, Insertion sort, Quick sort,
Merge sort, Closet Pair of Points, Heap sort.
UNIT – III
Trees: Definitions and properties, representation of binary trees, operations. Binary tree traversal.
Binary Search Trees. AVL trees and operations on AVL trees.
UNIT - IV
Sorting : Merge sort. Quick sort. Selection sort, heap sort. Complexity analysis. Sequential search,
binary search. Various types of hashing.
UNIT - V
Graphs : Definitions and representation of graphs. Graph search methods. Applications. B-trees.
Operations on B- Trees. Applications.
Suggested Reading :
1.S. Sahani. Data Structures. Algorithms and applications in C++, McGraw Hill, 1998.
2.Cornen. Leiserson & Rivest, Introduction to Algorithms, Prentice Hall India, 1996.

--------------------------------------------------------------------------------------------------------

CS 202 - DISCRETE STRUCTURES
UNIT - I
Fundamentals of logic : Basic Connectives and Truth Tables, Logical Equivalence,
Logical Implication, Use of Quantifiers, Definitions and the Proof of Theorems.
Set Theory: Sets and Subsets, Set Operations, and the Laws of Set Theory, Counting and
Venn Diagrams.
Properties of the Integers: The well- ordering principle, Recursive definitions the
division algorithms, fundamental theorem of arithmetic.
Properties of the Integers: The well – ordering principal, Recursive definitions, the division
algorithms, fundamentals theorem of arithmetic.
UNIT – II
Relations and Functions : Cartesian Product, Functions onto Functions, Special
Functions, Pigeonhole Principle, Composition and Inverse Functions, Computational
Complexity.
Relations : Partial Orders, Equivalence Relations and Partitions.
Principle of inclusion and Exclusion : Principle of Inclusion and Exclusion,
Generalizations of the Principle, Derangements, Rock Polynomials, Arrangements with
Forbidden Positions.
UNIT – III
Generating Functions : Introductory examples, definition and examples, Partitions of
Integers, exponential generating function, summation operator.
Recurrence Relations: First - order linear recurrence relation, second - order linear
homogenous recurrence relation with constant coefficients, Non homogenous recurrence
relation, divide and conquer algorithms.
UNIT-IV
Algebraic Structures : Algebraic System - General Properties, semi groups, Monoids,
Homomorphism, Groups, Residue arithmetic, group codes and their applications.
UNIT-V
Graph Theory : Definitions and examples, sub graphs, complements and graph
Isomorphism, Vertex degree, Planar graphs, Hamiltonian paths and Cycles, Graph
Coloring.
Trees : Definitions, Properties and Examples, Rooted Trees, Spanning Trees and
Minimum Spanning Trees.
Suggested Reading :
I. Ralph P. Grimaldi, Discrete and Combinatorial Mathematics, 4th edition, 2003,
Pearson Eduction.
2. J.P. Tremblay, R. Manohar, Discrete Mathematical Structure with Applications to
Computer Science, McGraw Hill, 1987.
3. Joe L. Mott, A. Kandel, T.P. Baker, Discrete Mathematics for Computer &ientists &
Mathematicians, Prentice Hall N.J, 1986.

-----------------------------------------------------------------------------------------------------

CS 203 - LOGIC C AND SWITCHING THEORY
UNIT-I
Digital Computers and Information: Information representation, Computer Structure.
Number Systems: Binary Numbers, Octal and Hexadecimal Numbers, Number Ranges.
Arithmetic Operations: Conversion from Decimal to other bases.
Decimal Codes : BCD Addition. Alphanumeric Codes: ASCII Character Code, Parity Bit.
Binary Logic and Gates: Binary Logic, Logic Gates. Boolean Algebra: Basic Identities,
Algebraic Manipulation, Complement of a function.
Standard Forms: Miniterms and Maxterms, sum of products and products of sums.
UNIT-ll
Minimization of Switching Functions: Introduction, the map method, minimal functions and their
properties, the tabulation procedure, the prime implicant chart.
Nand and NOR Gates: Nand Circuits, Two-level Implementation, Multilevel NAND Circuits, NOR
Circuits. Exclusive or Gates: Odd Function, Parity Generation and Checking.
UNIT - Ill
Combinational Logic Design: Combinational Circuits, Design Topics: Design Hierarchy, Top-Down
design, Computer Aided Design. Hardware Description Languages, Logic Synthesis.
Analysis Procedure: Derivation of Boolean Functions, Derivation of the Truth Table, Logic
Simulation, Design Procedure, Decoders, Encoders, Multiplexers, Binary Adders, Binary Subtraction,
Binary Multipliers, HDL Representations – VHDL.
UNIT-IV
Sequential Circuits: Sequential circuit definitions, Latches, Flip Flops, sequential circuit analysis,
sequential circuit design, design with D Flip-Flops, designing with JK Flip-Flops, HDL representation
for sequential circuits – VHDL.
UNIT – V
Registers and Counters : Registers, Shift registers, Synchronous Binary counters,.Ripple counter.
Symmetric Networks : Properties of symmetric functions, Symmetric relay contact
networks, identification of symmetric functions.
Suggested Reading :
1. M. Moris Mano, Charles R. Kime, Logic and Computer Design Fundamentals,
2nd edition, Pearson Education Asia, 2001. .
2. ZVI Kohavi, Switching and Finite Automata Theory, 2nd edition, Tata McGraw
Hill, 1995.
3. H.T. Nagle, Introduction to Computer logic, Prentice Hall, 1975.

-----------------------------------------------------------------------------------------------------------

CS-204 COMPUTER ORGANIZATION AND ARCHITECTURE
UNIT-I
Register Transfer and Microoperations :Register transfer language, register Transfer,Bus and
memory Transfers. Arithmetic Microoperations: Binary Adder,Binary Adder-subtractor,Binary
Incrementer,Arithmetic Circuit. Logic Microoperations: List of Logic Microoperations,hardware
Implementation. Arithmetic Logic Shift Unit.
Basic Computer organization and Design: Instruction codes:Stored Program organization,Indirect
Address. Computer Registers: Common Bus System. Computer Instructions: Instruction Set
Completeness. Timining and Control,instruction Cycle: Fetch and Decode,Register Reference
Instructions. Memory reference Instructions:Example Instructions,Control Flow Chart.
Input-Output and Interrupt: Configuration,Instructions,Program interrupt Cycle.
Complete computer description.design od Basic Computer,C Basic of Acumulator Logic.
UNIT-II
Microprogrammed control : Control memory ,Address sequencing:Control Branching mapping
of Instruction,Subroutines.Microprogram
Example: Computer Configuration,Microinstruction Format,Symbolic Microinstructions. The Fetch
routine,Symbolic Microprogram,Binary Microprogram,Design of Control Unit: Microprogram
sequencer.
Central Processing Unit: General Register organization:Control World.
Stack Organaization:Register stack,memory stack,reverse polish Notation,Evaluation of
Expressions. Instuction Formats:Three Two,One,Zero Address structions,RISCInstructions.
Addressing Modes. Data Transfer and manipulation: Data Transfer instructions, data Manipulation
nstruction,Arithmetic Instructions,logical,Shift andBit Manipulation Instructions. Program Control:
status Bit Conditions,condtional Branch Instuctions subroutine Call and Return,Program
interrupt,Types of Interrupts,Reduced instruction Set Computer:CISC characteristics,RISC
characteristics,Overlapped register windows.
UNIT-III UPipeline and Vector processing: Parallel processing, pipelining Instruction pipeline, RISC Pipeline,
Vector processing: Vector Operations, Matrix Multiplication, Memory Interleaving, Super computers.
Array Processors: Attached Array Processor,SIMDArray Processor.
Computer Arithmetic : Addition And Substactor : With Signed magnitude Data,Implemntation and
Algorithm,Addition and substraction with 2’s Complement Data. Multiplication Algorithms: with
signed magnitude data,algorithm,Booths algorithm,Array multiplier . Division Algorithms: with
signed magnitude data,divide overflow,Algorithm. Floating Point Arithmetic Operations, decimal
Arithmetic Unit: BCD Adder, Subtractor.
UNIT-IV UI
nput-Output organization: Input _output Interface: I/O Bus and interface Modules, I/O Versus
memory Bus ,solated vs memory mapped I/O. Asynchronous data Transfer :Strobe Control,
Handshaking, Asynchronous Serial transfer, Asynchronous Communication Interface,asynchronous
Communication Interface .Modes of Transfer: Programmed I/O, Interrupt driven I/O.
Priority Interrupt: Daisy changing, parallel Priority Interrupt ,priority Encode. Direct Memory
Access: DMA Controller and Transfer. Input-Output processor (IOP): CPU-IOP Communication,
IBM 370 I/O Channel,Interl 8089-IOP.Serial Communication.
UNIT-V
Memory organization: Memory Hierarchy, Main Memory:RAM and ROM Chips, Address
map,Memory Connection to CPU. Auxillary memory:Disks and Tapes.
Associative memory:hardware organization, Match logic,read Operation and write Operation. Cache
Memory: Associative Mapping,Direct Mapping,Set- Associative Mapping,writing into cache
Initialization.Virtual memory:Address and memory Space,Address Mapping,Page Replacement.
Suggested Reading:
1.M.Morris Mano,Computer System Architecture,3rd edition,Pearson
Education Asia,2002.
2.William Stallings,Computer Organaization & Architecture,6th
Edition,Pearson Education Asia,2003.
3.V.Carl Hamacher,Z.G.Vranesic,S.G.Zaky, Computer Organaization,
McGraw Hill.

---------------------------------------------------------------------------------------------------
ES 222- BASIC ELECTRONICS
UNIT – I
Semi Conductor Theory: Energy levels, Intrinsic and Extrinsic Semiconductor, Mobility, Diffusion
and Drift current. Hall Effect, Characteristics pf P-N Junction diode, Parameters and Applications.
Rectifiers: Half wave and Full wave Rectifiers ( Bridge, center tapped ) with and without filters,
ripple, regulation and efficiency.
UNIT – II
Transistors : Bipolar and field effect transistors with their h-parameter equivalent circuits. Basic
amplifiers classification and their circuits( Qualitative treatment).
UNIT-III
Feedback Concepts: Properties of Negative Feedback Amplifier, Classification, Parameter
Applications.
Oscillators: LC Type and RC Type Oscillators and Crystal Oscillators ( Qualitative treatment only)
UNIT – IV
Operational Amplifiers – Basic Principal – Characteristic and Applications ( Summer Adder,
Integrator, Differentiator, Instrumentation Amplifier).
Digital System: Basic Logic Gates, half,Full Adder and Subtractors.
UNIT – V
Data Acquisition systems: Study of transducer ( LVDT, Straingauge, Temperature, Force).
Photo Electric Devices and Industrial Devices: Photo diode, Photo Transistor, LED, LCD, SCR,
TRIAC, DIAC, UJT Construction and Characteristics only.
Display Systems : Constructional details of C.R.O and Applications.
Suggested Reading :
1. Jacob Milman & C., Halkias, Electronic devices Eighth Edition, Reprinted, Mc Graw Hill,1985.
2. Ramakanth A. Gayakwad, Op-AMPS and Linear Integrated Circuits, 3rd edition, Prentice Hall
of India,1985
3. Mooris Mano, Digital design, 3rd edition, Prentice Hall of India,2002
4. Chooper, Electronic Measurement and Instrumentations.
5. S.Shalivahan, N. Suresh Kumar, A Vallavea Raj Electronic Devices and Circuits Tata McGraw
Hill, 2003