Thursday, 26 December 2013
Sunday, 22 December 2013
Thursday, 19 December 2013
Tuesday, 17 December 2013
Monday, 16 December 2013
Saturday, 14 December 2013
I Sem Advances In Operating System( 2012 syllabus)
Advances in
Operating Systems
Subject Code :
12SCS12 IA Marks : 50
No of Lecture
Hrs/Week : 4 Exam hours : 3
Total No of
Lecture Hours : 52 Exam Marks : 100
1. Introduction, Review Operating
Systems Strategies: User’ perspectives, technologies and examples of
Batch Systems, Timesharing
Systems, Personal computer systems, Embedded systems, and small
communicating computers; The
genesis of modern operating systems.
2. Using the Operating Systems
The programmer’s abstract machine; Resources; Processes and threads;
Writing concurrent programs.
3. Operating Systems Organization
Basic functions; General implementation considerations;
Contemporary OS kernels.
4. Design Strategies Design
considerations; Monolithic kernels; Modular organization; Microkernel;
Layered organizations; Operating
Systems for distributed system.
5. Real World Examples Linux,
Windows NT/2000/XP: Process descriptors, Thread descriptors, Thread
scheduling. Linux, Windows
NT/2000/XP: Kernel
6. Distributed Systems:
Networking; The Need for a Protocol Architecture; The TCP/IP Sockets; Linux
Networking; Client/Server
Computing; Distributed Message Passing; Remote Procedure Calls; Clusters;
Windows Vista Cluster Server;
Linux Clusters; Distributed Process Management; Process Migration;
Distributed Global States;
Distributed Mutual Exclusion; Distributed Deadlock.
Laboratory Work:
(The
following programs can be executed on any available and suitable platform)
1. Design, develop and execute a
program using any thread library to create the number of threads
specified by the user; each
thread independently generates a random integer as an upper limit, and then
computes and prints the number of
primes less than or equal to that upper limit along with that upper
limit.
2. Rewrite above program such
that the processes instead of threads are created and the number of child
processes created is fixed as
two. The program should make use of kernel timer to measure and print the
real time, processor time, user
space time and kernel space time for each process.
3. Design, develop and implement
a process with a producer thread and a consumer thread which make
use of a bounded buffer (size can
be prefixed at a suitable value) for communication. Use any suitable
synchronization construct.
4. Design, develop, and execute a
program to solve a system of n linear equations using Successive Over relaxation
method and n processes which use
Shared Memory API. 5. Design, develop, and execute a
program to demonstrate the use of
RPC.
Text Books:
1. Gary Nutt: Operating Systems,
3rd Edition, Pearson, 2004.
2. William Stallings: Operating
Systems: Internals and Design Principles, 6th Edition, Prentice Hall,
2008.
Reference Books:
1. Silberschatz, Galvin, Gagne:
Operating System Concepts, 8th Edition, Wiley, 2008
2. Andrew S. Tanenbaum, Albert S.
Woodhull: Operating Systems, Design and Implementation, 3rd
Edition, Prentice Hall, 2006.
3. Pradeep K Sinha: Distribute
Operating Systems, Concept and Design, PHI, 2007.
I Sem Computer Networks( 2012 syllabus)
SCHEME
OF TEACHING AND EXAMINATION FOR
M.TECH.
COMPUTER SCIENCE and ENGINEERING
(I
Sem)
Subject
Code
|
Name of the
Subject
|
Teaching
hours/week
|
Duration
of Exam in
Hours
|
Marks for
|
Total
Marks
|
||
Lecture
|
Practical
/Field
Work
/
Assignment/
Tutorials
|
I.A.
|
Exam
|
||||
12SCS11
|
Computer Networks
|
04
|
02#
|
03
|
50
|
100
|
150
|
12SCS12
|
Advances
in Operating
Systems
|
04
|
02*
|
03
|
50
|
100
|
150
|
12SCS13
|
Advances
in Database
Management Systems
|
04
|
02*
|
03
|
50
|
100
|
150
|
12SCS14
|
Computer
Systems
Performance Analysis
|
04
|
02#
|
03
|
50
|
100
|
150
|
12SCS15x
|
Elective – I
|
04
|
02
|
03
|
50
|
100
|
150
|
12SCS16
|
Seminar
|
--
|
03
|
--
|
50
|
--
|
50
|
Total
|
20
|
13
|
15
|
300
|
500
|
800
|
|
Elective I
12SCS151 Advances in Digital Image
Processing
12SCS152 Computer Graphics &
Visualization
12SCS153 Optical Networks
12SCS154 Embedded Systems
COMPUTER
NETWORKS
Subject Code:
12SCS11 I.A. Marks : 50
Hours/Week : 04
Exam Hours: 03
Total Hours : 52
Exam Marks: 100
1.
Review of Basic Concepts: Building a
Network; Requirements- Connectivity, Cost-Effective Resource Sharing,
Support for Common Services; Network Architecture- Layering and
Protocols, OSI Architecture, Internet
Architecture; Performance- Bandwidth and Latency, Delay× Bandwidth
Product, High-Speed Networks.
2.
Direct link networks: Hardware
Building Blocks-nodes, links; error Detection- Two-Dimensional Parity, Internet
checksum Algorithm, cyclic Redundancy Check; reliable Transmission-
Stop-and-Wait, Sliding Window, Concurrent
Logical Channels; Rings (802.5, FDDI) –Token Ring Media Access
Control, Token Ring Maintenance, FDDI.
3.
Packet Switching: Switching
and forwarding – Datagrams,Virtual Circuit Switching, Source Routing; Bridges
and
LAN Switches – Learning Bridges, Spanning Tree Algorithm, Broadcast
and Multicast, Limitations of Bridges; cell
switching (ATM) – Cells, Segmentation and Reassembly, Virtual Paths,
Physical Layers for ATM.
4.
Internetworking: Simple
internetworking (IP) – What Is an Internetwork?, Service Model, Global Address,
Datagram Forwarding in IP, Address Translation(ARP), Host
Configuration(DHCP), Error Reporting(ICMP), Virtual
Networks and Tunnels; Routing – Network as a Graph, distance
Vector(RIP), Link State(OSPF), Metrics, Routing for
Mobile Hosts, Global Internet – Subnetting, Classless Routing(CIDR),
Interdomain Routing(BGP), Routing Areas, IP
Version 6(IPv6).
5.
End –to-End Protocols: Simple
demultiplexer (UDP); Reliable byte stream (TCP) – End-to-End Issues, Segment
Format, Connection Establishment and Termination, Sliding Window
Revisited, Triggering Transmission, Adaptive
Retransmission, Record Boundaries, TCP Extensions, Alternative Design
Choices.
6.
Congestion Control and Resource Allocation: Issues in resource allocation – Network Model, Taxonomy,
Evaluation Criteria; Queuing discipline – FIFO, Fair Queuing; TCP
Congestion Control – Additive
Increase/Multiplicative Decrease, Slow Start, Fast Retransmit and Fast
Recovery; Congestion-Avoidance
mechanisms – DECbit, Random Early Detection (RED), Source-Based
Congestion Control.
7.
Applications: Traditional
applications – Electronic Mail (SMTP, MIME, IMAP), World Wide Web (HTTP), Name
Service (DNS), Network management (SNMP); Web services – Custom
APPLICATION Protocols (WSDL, SOAP), A
Generic application Protocol (REST).
Laboratory
Work:
Using
any Protocol Analyzer like Ethereal, perform the following experiments:
1. Capture the packets that are transmitted after clicking on the URL
of the web site of your college. Analyze
the packets at the highest level and prepare a brief report of your
analysis.
2. Analyze the data captured above at lower levels and demonstrate the
layering of the protocols.
3. Capture the packets in the LAN, & filter for a unique
subscriber
4. Capture the ARP packets and find the MAC addresses in the LAN in
your laboratory.
Using
either NS228/OPNET or any other suitable simulator, perform the following
experiments:
1. Simulate an Ethernet LAN using 10 node , change error rate and data
rate , and compare throughput
2. Simulate a three nodes point – to – point network with duplex links
between them. Set the queue size and
vary the bandwidth and find the number of packets dropped.
3. Simulate the transmission of ping messages over a network topology
consisting of 6 nodes and find the
number of packets dropped due to congestion.
4. Simulate an Ethernet LAN using n nodes and set multiple traffic
nodes and plot congestion window for
different source / destination.
Implement
the following in C/C++:
1. Write a program for distance vector algorithm to find suitable path
for transmission.
2. Write a program for error detecting code using CRC-CCITT (16-bit)
3. Write a program for congestion control using leaky bucket
algorithm.
TEXT
BOOKS:
1. Larry L. Peterson and Bruce S. David: Computer Networks – A Systems
Approach, 4th Edition, Elsevier,
2007.
REFERENCE
BOOKS:
1. Behrouz A. Forouzan: Data
Communications and Networking, 4th Edition, Tata McGraw Hill, 2006.
2. William Stallings: Data and
Computer Communication, 8th
Edition,
Pearson Education, 2007.
3. Alberto Leon-Garcia and Indra
Widjaja: Communication Networks -Fundamental Concepts and Key
Architectures, 2nd Edition Tata
McGraw-Hill, 2004.
Subscribe to:
Posts (Atom)