HD12CSE: COMPUTER NETWORK

Chapter 1: Communication Networks and Services

Network functions and network topology, basics of message switching and cell switching.

Chapter 2: Application and Layered Architectures

Layering architecture, the OSI reference model, unified view of layers, protocols and overview of TCP/IP architecture, TCP/IP protocol.

Chapter 3: Telephone Network

Frequency division and time division multiplexing, synchronous optical network (SONET), SONET multiplexing, space division and time division circuit switches, Telephone integrated services digital network, network channel signaling and routing control.

Chapter 4: Peer-to-Peer Protocols

Peer-to-Peer protocols and service models, service models, end to end requirement adaptation functions, end-to-end versus hop by hop. ARO protocols, stop and wait back-N ARQ, selective repeat ARQ, transmission efficiency of ARQ protocols, sliding flow control, timing recovery for synchronous services, reliable stream service, data controls, HDLC data link control, point protocol, statistical multiplexing.

Chapter 5: Local Area Network

Multiple access communications, local area networks (LAN) structure, the medium control sub layer, random access, ALOHA, slotted ALOHA, CSMA/CD, scheduling approaches to medium access control, reservation systems, token passing rings, comparison of random access and scheduling medium access, IEEE 802.3 standards for 10 Mbps and 1000 Mbps LAN’s, repeaters and hubs, LAN transparent bridges, source routing, link state versus distance vector routing, shortest path algorithms, the Bellman-Ford algorithm, Dijkstra’s algorithm, other routing approaches.

Chapter 6: Packet Switching Networks

Network services and internal network operation, packet network topology, connectionless packet switching, virtual circuit packet switching, routing in packet networks, routing algorithm classification, routing tables, hierarchical routing, link state versus distance vector routing, shortest path algorithms, the Bellman-Ford algorithm, Dijkstra’s algorithm, other routing approaches.

Chapter 7: Frame Relay and Asynchronous Mode (ATM)

Frame relay protocol architecture, frame relay call control, user data transfer network function congestion control, ATM architecture, logical connection, ATM cells, transmission of ATM cells, ATM adaptation layers, ATM traffic management and QoS, FIFO and priority queues, congestion control, open loop control, closed loop control.

Chapter 8: TCP/IP

The Internet Protocol (IP), IP packet, IP addressing, subnet mask, classless interdomain routing (CIDR), address resolution, reverse address resolution, IP fragmentation and reassembly, ICMP, User Data gram Protocol (UDR), Transmission Control Protocol (TCP), TCP reliable stream services, TCP operation, TCP protocol, Dynamic Host Configuration Protocol (DHCP), mobile IP, IPv6, Internet routing protocols, routing information protocols, open shortest path first protocol, border gateway protocol, multicast routing, reverse path broadcasting, internet group management protocol, reverse path multicasting, distance vector multicast routing protocol.

BTCO7 : THEORY OF COMPUTATION

Chapter 1: Introduction Sets.

Chapter 2: Relations and Languages:

Sets, Relations and functions, Special types of binary relations, Finite and infinite sets, Three fundamental proof techniques, Closures and algorithms, Alphabets and languages, Finite representations of languages.

Chapter 3: Finite Automat:

Deterministic finite automata, Nondeterministic finite automata, Finite automata and regular expressions, Languages that are and are not regular, State minimization, Algorithmic aspects of finite automata.

Chapter 4: Context-Free Languages:

Context – Free grammars, Parse trees, Pushdown automata, Pushdown automata and context-free grammars, Languages that are and are not context – free, Algorithms for context-free grammars, Determinism and parsing,

Chapter 5: Turning machines:

The definitions of a turning machine, Computing with Turing machines, Computing with turning machines, Extensions of turning machines, Random access turning machines, Nondeterministic turning machines, Grammars, Numerical Functions.

Chapter 6: Undecidability:

The church – Turning thesis, Universal Turing machines, The halting problem, Unsolvable problems about turning machines, unsolvable problems about grammars, An unsolvable tiling problem , Properties of recursive languages.

Chapter 7: Computational Complexity:

The class, Problems, problems …… , Boolean Satisfiability , The Class NP.

Chapter 8: NP-Completeness: Polynomial –time reductions, Cook’s Theorem, More NP-complete problems, Coping with NP-completeness.