SYLLABUS

COMPUTER NETWORK

UNIT I:
Introduction: Network Types, LAN, MAN, WAN, Network Topologies Reference models- The OSI
Reference Model- the TCP/IP Reference Model - A Comparison of the OSI and TCP/IP
Reference
Models, OSI Vs TCP/IP, Lack of OSI models success, Internet History.
Physical Layer –Introduction to Guided Media- Twisted-pair cable, Coaxial cable, and Fiber
optic cable
and unguided media: Wireless-Radio waves, microwaves, infrared.

UNIT II:
Data link layer: Design issues, Framing: fixed size framing, variable size framing, flow control,
error
control, error detection and correction codes, CRC, Checksum: idea, one’s complement internet
checksum, services provided to Network Layer, Elementary Data Link Layer protocols: simplex
protocol, Simplex stop and wait, and Simplex protocol for Noisy Channels.
Sliding window protocol: One bit, Go back N, Selective repeat-Stop and wait for protocol, Data
link layer in
HDLC: configuration and transfer modes, frames, control field, point-to-point protocol (PPP):
framing
transition phase, multiplexing, multi link PPP.

UNIT – III:
Media Access Control: Random Access: ALOHA, Carrier sense multiple access (CSMA), CSMA
with
Collision Detection, CSMA with Collision Avoidance, Controlled Access: Reservation, Polling,
Token
Passing, Channelization: frequency division multiple Access(FDMA), time division multiple
access(TDMA), code division multiple access(CDMA).
Wired LANs: Ethernet, Ethernet Protocol, Standard Ethernet, Fast Ethernet(100 Mbps), Gigabit
Ethernet,
10 Gigabit Ethernet.

UNIT – IV:
The Network Layer Design Issues – Store and Forward Packet Switching-Services Provided to
the
Transport layer- Implementation of Connectionless Service-Implementation of Connection
Oriented
Service- Comparison of Virtual Circuit and Datagram Networks, Routing Algorithms-The
Optimality
principle-Shortest path, Flooding, Distance vector, Link state, Hierarchical, Congestion Control
algorithms-General principles of congestion control, Congestion prevention polices, Approaches
to
Congestion Control-Traffic Aware Routing- Admission Control-Traffic Throttling-Load Shedding.
Traffic
Control Algorithm-Leaky bucket & Token bucket.
Internet Working: How networks differ- How networks can be connected- Tunnelling,
internetwork
routing-, Fragmentation, network layer in the internet – IP protocols-IP Version 4 protocol-IPV4
Header
Format, IP addresses, Class full Addressing, CIDR, NAT-, Subnets-IP Version 6-The main IPV6
header,
Transition from IPV4 to IPV6, Comparison of IPV4 & IPV6- Internet control protocols-
ICMP-ARPDHCP

UNIT –V:
The Transport Layer: Transport layer protocols: Introduction-services- port number-User data
gram
protocol-User datagram-UDP services-UDP applications-Transmission control protocol: TCP
servicesTCP features- Segment- A TCP connection- windows in TCP- flow control-Error control,
Congestion
control in TCP.
Application Layer –- World Wide Web: HTTP, Electronic mail-Architecture- web based mail-
email
security- TELENET-local versus remote Logging-Domain Name System: Name Space, DNS in
Internet ,-
Resolution-Caching- Resource Records- DNS messages- Registrars-security of DNS Name
Servers,
SNMP.

⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔
DAA

UNIT I:
Introduction: Algorithm Definition, Algorithm Specification, performance Analysis, Performance
measurement, asymptotic notation, Randomized Algorithms.

UNIT II:
Divide and Conquer: General Method, Defective chessboard, Binary Search, finding the
maximum and
minimum, Merge sort, Quick sort.
The Greedy Method: The general Method, knapsack problem, minimum-cost spanning Trees,
Optimal
Merge Patterns, Single Source Shortest Paths.

UNIT III:
Dynamic Programming: The general method, multistage graphs, All pairs-shortest paths,
optimal Binary
search trees, 0/1 knapsack, The traveling salesperson problem.

UNIT IV:
Backtracking: The General Method, The 8-Queens problem, sum of subsets, Graph coloring,
Hamiltonian cycles, knapsack problem.

UNIT V:
NP-Hard and NP-Complete problems: Basic concepts, non-deterministic algorithms, NP - Hard
and
NP-Complete classes, Cook’s theorem

⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔
DWDM

UNIT I:
Data Warehousing and Online Analytical Processing: Data Warehouse: Basic concepts, Data
Warehouse Modelling: Data Cube and OLAP, Data Warehouse Design and Usage, Data
Warehouse
Implementation, Introduction: Why and What is data mining, What kinds of data need to be
mined and
patterns can be mined, Which technologies are used, Which kinds of applications are targeted.

UNIT II:
Data Pre-processing: An Overview, Data Cleaning, Data Integration, Data Reduction, Data
Transformation and Data Discretization.

UNIT III:
Classification: Basic Concepts, General Approach to solving a classification problem, Decision
Tree
Induction: Attribute Selection Measures, Tree Pruning, Scalability and Decision Tree Induction,
Visual
Mining for Decision Tree Induction.

UNIT IV:
Association Analysis: Problem Definition, Frequent Item set Generation, Rule Generation:
Confident
Based Pruning, Rule Generation in Apriori Algorithm, Compact Representation of frequent item
sets, FPGrowth Algorithm.

UNIT V:
Cluster Analysis: Overview, Basics and Importance of Cluster Analysis, Clustering techniques,
Different
Types of Clusters; K-means: The Basic K-means Algorithm, K-means Additional Issues,
Bi-secting K
Means,

⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔
AI

UNIT I:
Introduction to artificial intelligence: Introduction ,history, intelligent systems, foundations of AI,
applications, tic-tac-tie game playing, development of AI languages, current trends in AI.

UNIT II:
Problem solving: state-space search and control strategies: Introduction, general problem
solving,
characteristics of problem
Search Strategies: exhaustive searches, heuristic search techniques, iterative-deepening A*,
constraint
satisfaction

UNIT III:
Logic concepts: Introduction, propositional calculus, proportional logic, natural deduction
system,
axiomatic system, semantic tableau system in proportional logic, predicate logic

UNIT IV:
Knowledge representation: Introduction, approaches to knowledge representation, knowledge
representation using semantic network, extended semantic networks for KR
Advanced knowledge representation techniques: Introduction, conceptual dependency theory,
script
structure.

UNIT V:
Expert system and applications: Introduction phases in building expert systems, expert system
versus
traditional systems, rule-based expert systems blackboard systems truth maintenance systems,
application
of expert systems, list of shells and tools.

⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔⛔
DLD

UNIT I: Digital Systems and Binary Numbers

Digital Systems, Binary Numbers, Octal and Hexadecimal Numbers, Complements of
Numbers, Signed Binary Numbers, Arithmetic addition and subtraction, 4-bit codes: BCD,
EXCESS 3, alphanumeric codes, 9’s complement, 2421, etc..

UNIT II: Concept of Boolean algebra

Basic Theorems and Properties of Boolean algebra, Boolean Functions, Canonical and
Standard Forms, Minterms and Maxterms.Gate level Minimization
Map Method, Three-Variable K-Map, Four Variable K-Maps. Products of Sum
Simplification, Sum of Products Simplification, Don’t – Care Conditions, NAND and NOR
Implementation, ExclusiveOR Function.

UNIT III: Combinational Logic

Introduction, Analysis Procedure, Binary Adder–Subtractor, Binary Multiplier, Decoders,
Encoders, Multiplexers, Demultiplexers, Priority Encoder, Code Converters, Magnitude
Comparator, HDL Models of Combinational Circuits.
Realization of Switching Functions Using PROM, PAL and PLA.

UNIT IV: Synchronous Sequential Logic

Introduction to Sequential Circuits, Storage Elements: Latches, Flip‐Flops, RS- Latch Using
NAND and NOR Gates, Truth Tables. RS, JK, T and D Flip Flops, Truth and Excitation
Tables, Conversion of Flip Flops.

UNIT V: Registers and Counters

Registers, Shift Registers, Ripple Counters, Synchronous Counters, Ring Counter, Johnson
Counter