Sub: Digital Communication

UNIT I (PCM & DELTA MODULATION SYSTEMS)

Theory
Practical aspects of sampling: Natural and flat top sampling, Nyquist criterion, Uniform and Non-uniform
quantization. PCM and delta modulation, Signal to quantization noise ratio in PCM and delta modulation.
DPCM, ADM, Matched filter detection.

UNIT II (BASE BAND TRANSMISSION)

Theory
Multiplexing: TDM, FDM, difference between FDM and TDM, Line coding (RZ, NRZ): Polar, Bipolar,
Manchester, AMI. Inter symbol interference, Pulse shaping, , Raised cosine spectrum.
DIGITAL MODULATION TECHNIQUES: Geometric interpretation of signals, Orthogonalisation. ASK,
BPSK, BFSK, QPSK, MSK modulation techniques and coherent detection of these techniques.

UNIT III (INFORMATION THEORY AND CODING)

Theory
amount of information, Average Information, Entropy, Information rate, Increase in Average information
per bit by coding, Shannon’s Theorem and Shannon’s bound, Capacity of a Gaussian Channel, BW-S/N
trade off. Coding and decoding of Information, Hamming code, single Parity-Bit Code, Linear Block Code,
Cyclic code & convolution code.

Sub: Digital Electronics Circuits

UNIT –I
Theory
Review of Number Systems & Logic Gates, Non Functional Properties of Logic gates: Minimization
Techniques: Using Boolean identities
Practical
1. Study of AND, OR, NOT gates and comparison with discrete components.
2. Design of different types of gates using Universal logic gates.
(a) AND gate (b) OR gate (c) NOT gate (d) EX-OR gate (e) EX-NOR gate.
3. De-Morgan’s Theorem.

UNIT-II
Theory
Karnaugh Map, Map entered variables, Quine-McCluskey method. Combinational Circuits: Adder,
Subtractor, Encoder, Decoder, Tristate, Multiplexer, Demultiplexer, Parity checker & generator.
Practical
Practice
1. Half adder and full adder circuits.
2. Multiplexer/ Demultiplexer combinational logic circuit.

UNIT-III
Theory
Fundamental concepts of sequential logic: Introduction, Synchronous and Asynchronous operation, Latches,
Flip Flops,
Practical
Practice
1.Study Of S-R Flip Flop
2. Study Of J-K Flip Flop.
 Sub: Object Oriented Programming in Java
UNIT – I (OOP’s Fundamentals and Introduction to programming in Java)
Theory
Structured V/s object oriented approaches, Data abstraction information hiding and encapsulation, Objects
and classes Introduction to programming in Java: Bytecode and virtual machine. Program Elements:
Primitive data types, variables, assignment, arithmetic, short circuit logical operators, arrays. Decision and
control statements.
Practical
Practice
S.No. Name of Practical
1 Programs based on variables, assignment, arithmetic &
logical operators.
2 Programs based on conditional Statements.
3 Programs based on looping statements.
4 Implementation of the methods using java programs.

UNIT – II (Objects, Classes and OOPs Programming Concepts)

Theory
Objects and classes: Objects, constructors, returning and passing objects as parameter. Nested and inner
classes. Single and Multilevel Inheritance, Extended classes, Access Control, usage of super. Overloading
and overriding methods. Abstract classes. Using final with inheritance. Polymorphism, single and multilevel
inheritances. Package and Interfaces: Defining package, concept of CLASSPATH, access protection,
importing package. Defining and implementing interfaces.
Practical
S.No. Name of Practical
1 Programs related to essentials of object oriented programming:
a. Classes & Objects
b. Access Specifiers
c. Constructor
d. Returning and passing objects as
parameter
e. Nested and inner classes
2 Programs based on the Polymorphism concept.
3 Programs based on the Inheritance (super class - sub class) concept.

UNIT – III (Packages, Interfaces and Exception Handling)

Theory
Exception Handling: Exception handling fundamentals, Exception types, uncaught exceptions, try, catch and
multiple catch statements. Usage of throw, throws and finally. String Handling: String constructors, special
string operations, character extraction, searching and comparing strings, string Buffer class. Applet: Applet
Fundamentals, using paint method and drawing polygons.
Practical
S.No. Name of Practical
1 Programs based on Packages and Interfaces.
2 Programs based on Exception Handling (try & catch
statements, throws and finally statements).
3 Programs based on string operations.
4 Programs related to web browser using Java Applet.

Sub: Design and Analysis of Algorithms

UNIT – I (Introduction to algorithms, Basics of Searching and Sorting)
Theory
Introduction: Basics of Algorithms, Models of Computation: space and time complexity measures, lower
and upper bounds, Abstract Data Type, Complexity analysis and measures, The Running Time of a
Program, Use of the Big-Oh, small o, Big-omega and small omega notation, Study and analysis of basic
sorting algorithms like Heap Sort, Radix Sort, Bucket Sort and Merge sort.

Practical
S.No. Name of Practical
1 Perform recursive binary and linear search.
2 Sort a given set of elements using Heap sort technique.
3 Sort a given set of elements using Merge sort technique.
4 Sort a given set of elements using Insertion sort technique.
5 Sort a given set of elements using Quick sort technique.

UNIT-II(Graph Algorithm, Searching Algorithm and Greedy Method)

Theory
Graph Algorithms: connectivity, strong connectivity, biconnectivity, Graph traversals, topological sort,
shortest paths, minimum spanning trees, network flow; The disjoint set union problem; String matching;
order statistics. Searching algorithm (Depth and Breadth first search in graphs), divide-and-conquer,
Backtracking Algorithm. Greedy Method: Knapsack Problem.

Practical (1 Credit)
S.No. Name of Practical
1 Check whether a graph is connected using Depth first technique.
2 Sort a given set of elements using Selection sort technique.
3 From a given vertex in a weighted connected graph, find shortest paths to other vertices
using Dijkstra’s algorithm.
4 Find minimum cost spanning tree of a given undirected graph using Kruskal’s algorithm.

5 Print all the nodes reachable from a given starting node in a digraph using Breadth first
search technique.

UNIT-III (Dynamic Programming, Problem Analysis, NP Completeness)

Theory
Dynamic Programming: Matrix Chain Multiplication, Longest Common Subsequence and 0/1 Knapsack
Problem. Branch and Bound: Travelling Salesman Problem and Lower Bound Theory. Pattern Matching
Algorithms: KMP Matcher and Boyer Moors Algorithms.
NP-Hard and NP-complete problems, Introduction to approximate algorithms and Randomized
algorithms.

Sub: Human Computer Interaction

UNIT – I (Introduction of User Interface and Design Process)
Theory
Importance of user Interface – definition, importance of good design. Benefits of good design. A brief
history of Screen design. The graphical user interface – popularity of graphics, the concept of direct
manipulation, graphical system, Characteristics, Web user – Interface popularity, characteristics- Principles
of user interface. Design process – Human interaction with computers, importance of human characteristics
human consideration, Human interaction speeds, understanding business junctions.

UNIT – II (Screen Designing)

Theory
Design goals – Screen planning and purpose, organizing screen elements, ordering of screen data and
content – screen navigation and flow – Visually pleasing composition – amount of information – focus and
emphasis – presentation information simply and meaningfully – information retrieval on web – statistical
graphics – Technological consideration in interface design. Windows – New and Navigation schemes
selection of window

UNIT – III (Software tools, Interaction models and Metaphors)

Theory
Components – text and messages, Icons– Multimedia, colors, uses problems, choosing colors. Software tools
– Specification methods, interface – Building Tools. Interaction Devices – Keyboard and function keys,
pointing devices, speech recognition digitization and generation, image and video displays, drivers.
Interaction models and metaphors: Use of abstract metaphors for describing interface behavior, Use of
metaphors to support user understanding, Dialog input and output techniques and purposes , Screen layout
issues.

Sub: Theory of Computation

UNIT – I (Automata Theory and Formal Language)
Theory
Automaton, Finite Automaton, Transition Systems, Properties of Transition Functions, String Operation
with Finite Automaton, Nondeterministic Finite State Machine, Relation between DFA and NDFA. Mealy
and Moore Models Formal Language: Basic Definitions and Examples about languages, Definition of
Grammar, Derivations, Chomsky Classification of Languages.

UNIT – II (Regular Sets and Grammar and Context-Free Languages)

Theory
Regular Sets and Grammar: Regular Expressions, Finite Automata and Regular Expressions, Pumping
Lemma for Regular sets, Application of Pumping Lemma, Closure Properties of Regular Sets, Regular sets
and Regular Grammar. Context-Free Languages: Context-free Languages and Derivation trees, Ambiguity
in Context-free Grammars, Simplification of Context-free Grammars, Normal Forms for Context-free
Languages, Pumping Lemma for Context-free Languages.

UNIT – III (Pushdown Automata and Turing Machines)

Theory
Pushdown Automata (PDA): Definition of PDA, Acceptance by PDA, Pushdown Automata and Context-
free Languages. Turning Machines: Definition, Turning machine Model, Representation and Language
Acceptability by Turning Machines, Design of Turning machines.

Sub: Optimization Techniques

UNIT-I Introduction
Theory
Introduction: Need for optimization and historical development, classification and formulation of
optimization problem, classical optimization methods, differential calculus, Lagrangian theory.
UNIT-II Unconstrained Optimization techniques
Theory
Unconstrained Optimization Techniques: one-variable optimization techniques -Bracketing methods,
Region-elimination methods, Point-estimation method, Gradient based methods. Multi-variable
optimization: Unidirectional search, Direct search methods, Gradient-based methods.
UNIT-III Constrained Optimization Techniques
Theory
Constrained Optimization Techniques: Kuhn-Tucker (KT) conditions, Transformation methods -
Methods of multipliers and Penalty function method, Direct search methods for Constrained optimization,
Linearized search techniques, Sensitivity analysis, Feasible direction method, Gradient project method,
Generalized reduced gradient method.
 Sub: Web Development Techniques
UNIT-I (Internet Principles, Web Applications)
Theory
Internet Principles - Basic web concepts - client/server model Internet protocols and applications.
Introduction about WWW, Web Applications, Web Browsers, HTML: Introduction of HTML, HTML
Elements, HTML Basic Tags, HTML Formatting, HTML Entities, HTML Links, HTML Frames, HTML
Tables, HTML Lists, HTML Forms, HTML Images. Cascaded Style Sheet: CSS Introduction, Syntax,
Setting Background, Text, Font, Border, Margin, Padding, List, Dimension, Classification, Positioning,
Pseudo-class, Pseudo-element, CSS Media Types, External, Internal and Inline style sheet.
Practice
S.No. Name of Practical
1 Designing a static web page using HTML.
2 Designing a dynamic webpage using DHTML using different style sheets.

UNIT-II (Java Scripts)

Theory
Java Scripts: Variables declaration, If...Else statement, Switch statement, Operators statement, Popup
Boxes, Functions, For Loop, While Loop, Break Loops, For...In, Events, Try...Catch, Throw on error. Java
Script Objects: Introduction, String, Date, Array, Boolean, Math, JS Browser, JS Cookies, Validation,
Animation, Image Maps, Timing, Create Object.
Practice
S.No. Name of Practical
1 Programs on Working with AWT
2 Programs on different layouts in Java
3 Programs using Java Applets
4 Program in Java Script.
UNIT-III (PHP)
Theory
Introduction of PHP, Installation, Syntax, Variables, strings, operators, control structures, arrays,
functions, forms, GET & POST methods. Advance Operations: Date, Include, File & File Upload,
Cookies & Session Handling, Error & Exception Handling, Filtering, Database Connectivity.
Practice
S.No. Name of Practical
1 Basic Implementation in PHP and exception Handling.

2 Program of Database connectivity in PHP.

3 Program for GET method.

4 Program for POST method.