Categories
Important question

CS6401 Important Questions Operating Systems Regulation 2013 Anna University

CS6401 Important Questions Operating Systems

CS6401 Important Questions Operating Systems Regulation 2013 Anna University free download. Operating Systems Important Questions pdf free download.

Sample CS6401 important questions:

1. What is meant by Mainframe Systems?

Mainframe systems are the first computers developed to tackle many commercial and scientific applications. These systems are developed from the batch systems and then multiprogramming system and finally time sharing systems.

2. What is meant by Batch Systems?

In this, operators batched together jobs with similar needs and ran through the computer as a group .The operators would sort programs into batches with similar requirements and as system become available, it would run each batch.

3. What is meant by Multiprogramming?

Several users simultaneously compete for system resources (i.e) the job currently waiting for I/O will yield the CPU to another job which is ready to do calculations, if another job is waiting. Thus it increases CPU utilization and system throughput.

4. What is meant by Time-sharing Systems?

Time Sharing is a logical extension of multiprogramming .Here, CPU executes multiple jobs by switching among them, but the switches occur so frequently that the users can interact with each program while it is running.

5. What are the Components of a Computer System?

  • Application Programs
  • System Program
  • Operating System
  • Computer Hardware

6. What are the advantages of Multiprogramming?

  • Increased System Throughput
  • Increased CPU utilization

7. What are Multiprocessor System?

Multiprocessor systems have systems more than one processor for communication, sharing the computer bus, the memory, clock & peripheral devices.

8. What are the advantages of multiprocessors?

  • Increased throughput
  • Economy of scale
  • Increased reliability
Subject Name Operating Systems
Subject code CS6401
Regulation 2013

CS6401 Important Questions click here to download

CS6401 Syllabus click here


Operating Systems Notes click here


CS6401 Question Bank click here


 

Categories
r2013 notes

CS6401 Notes Operating Systems Regulation 2013 Anna University

CS6401 Notes Operating Systems

CS6401 Notes Operating Systems Regulation 2013 Anna University free download. Operating Systems Notes pdf free download.

OBJECTIVES CS6401 Notes:

The student should be made to:

  • Study the basic concepts and functions of operating systems.
  • Understand the structure and functions of OS.
  • Learn about Processes, Threads and Scheduling algorithms.
  • Understand the principles of concurrency and Deadlocks.
  • Learn various memory management schemes.
  • Study I/O management and File systems.
  • Learn the basics of Linux system and perform administrative tasks on Linux Servers.

OUTCOMES Operating Systems Notes:

At the end of the course, the student should be able to:

  • Design various Scheduling algorithms.
  • Apply the principles of concurrency.
  • Design deadlock, prevention and avoidance algorithms.
  • Compare and contrast various memory management schemes.
  • Design and Implement a prototype file systems.
  • Perform administrative tasks on Linux Servers.

TEXT BOOK CS6401 Notes:

1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, 9th Edition, John Wiley and Sons Inc., 2012.

REFERENCES CS6401 Notes:

1. William Stallings, “Operating Systems – Internals and Design Principles”, 7th Edition, Prentice Hall, 2011.

2. Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Addison Wesley, 2001.

3. Charles Crowley, “Operating Systems: A Design-Oriented Approach”, Tata McGraw Hill Education”, 1996.

4. D M Dhamdhere, “Operating Systems: A Concept-Based Approach”, Second Edition, Tata McGraw-Hill Education, 2007.

5. http://nptel.ac.in/.

Subject Name Operating Systems
Subject code CS6401
Regulation 2013

CS6401 Notes click here to download

CS6401 Syllabus click here


Operating Systems Important questions click here


CS6401 Question Bank click here


 

Categories
UG syllabus R 2013

CS6401 Syllabus Operating Systems Regulation 2013 Anna University

CS6401 Syllabus Operating Systems 

CS6401 Syllabus Operating Systems Regulation 2013 Anna University free download. Operating Systems Syllabus pdf free download.

UNIT I OPERATING SYSTEMS OVERVIEW CS6401 Syllabus

Computer System Overview-Basic Elements, Instruction Execution, Interrupts, Memory Hierarchy, Cache Memory, Direct Memory Access, Multiprocessor and Multicore Organization. Operating system overview-objectives and functions, Evolution of Operating System.- Computer System Organization-Operating System Structure and Operations- System Calls, System Programs, OS Generation and System Boot.

UNIT II PROCESS MANAGEMENT Operating Systems Syllabus

Processes-Process Concept, Process Scheduling, Operations on Processes, Interprocess Communication; Threads- Overview, Multicore Programming, Multithreading Models; Windows 7 – Thread and SMP Management. Process Synchronization – Critical Section Problem, Mutex Locks, Semophores, Monitors; CPU Scheduling and Deadlocks.

UNIT III STORAGE MANAGEMENT CS6401 Syllabus

Main Memory-Contiguous Memory Allocation, Segmentation, Paging, 32 and 64 bit architecture Examples; Virtual Memory- Demand Paging, Page Replacement, Allocation, Thrashing; Allocating Kernel Memory, OS Examples.

UNIT IV I/O SYSTEMS Operating Systems Syllabus

Mass Storage Structure- Overview, Disk Scheduling and Management; File System Storage-File Concepts, Directory and Disk Structure, Sharing and Protection; File System Implementation- File System Structure, Directory Structure, Allocation Methods, Free Space Management, I/O Systems.

UNIT V CASE STUDY CS6401 Syllabus

Linux System- Basic Concepts;System Administration-Requirements for Linux System Administrator, Setting up a LINUX Multifunction Server, Domain Name System, Setting Up Local Network Services; Virtualization- Basic Concepts, Setting Up Xen,VMware on Linux Host and Adding Guest OS.

Subject Name Operating Systems
Subject code CS6401
Regulation 2013

CS6401 Syllabus click here to download

CS6401 Notes click here


Operating Systems Important questions click here


CS6401 Question Bank click here


 

Categories
question bank

CS6551 question bank Computer Networks Regulation 2013 Anna University

CS6551 question bank Computer Networks

CS6551 question bank Computer Networks Regulation 2013 Anna University free download. Computer Networks question bank free pdf download.

Sample CS6551 question bank:

Unit 1

PART A

1. Define Networks.

2. Define Internetworking and Intranetworking.

3. What is router or gateway?

4. Define routing.

5. What are Unicast, Multicast, and Broadcast?

6. What is Multiplexing and Demultiplexing?

7. What is Synchronous Time Division Multiplexing?

8. What is Frequency Division Multiplexing?

9. What is Statistical Multiplexing?

10. What are SAN, LAN, WAN and MAN?

11. List the three general classes of failure.

12. What are RRP and HHP?

13. Define Bandwidth and Latency.

14. What is transfer time?

15. Define frames.

16. What is Forward Error Detection?

17. What is Shanon’s Theorem?

18. What is Frequency Hopping?

19. What is Spread Spectrum?

20. What are Manchester encoding, Differential Manchester?

PART B

1. Explain about Network Architecture with neat sketch on it.

2. Explain about OSI Architecture with neat sketch on it.

3. Explain about Internet Architecture with neat sketch on it.

4. Explain about Network software.

5. Explain about Performance of computer network.

6. Explain about Framing and its types.

7. Explain about Error Detection.

8. Explain about Reliable transmission or Flow Control.

9. Explain about requirement of building a network.

10. Problems on Bandwidth and Latency.

UNIT 2

PART A

1. What is repeater?

2. What is Media Access Control?

3. What is Exponential backoff?

4. What is Orthogonal Frequency Division Multiplexing?

5. Define Signal to Noise Ratio.

6. What is Access Point?

7. What are Scanning and its four steps?

8. What is Bluetooth?

9. What is Piconet?

10. What is Gateway?

11. What are Switching and Bridging?

12. What is Virtual Circuit Switching?

13. Difference between Connectionless and Connection Oriented duplex.

14. What is hop by hop flow control?

15. What is Virtual Private Network?

16. Draw the sketch of IPv4 packet header.

17. What are TTL and MTU?

18. What is payload?

19. What are Class A , Class B and Class C?

20. What is Tunneling?

Subject Name Computer Networks
Subject code CS6551
Regulation 2013

CS6551 question Bank click here to download

Computer Networks Syllabus click here


CS6551 notes click here


Computer Networks Important questions click here


 

 

Categories
Important question

CS6551 Important questions Computer Networks Regulation 2013 Anna University

CS6551 Important questions Computer Networks

CS6551 Important questions Computer Networks Regulation 2013 Anna University free download. Computer Networks Important questions free pdf download.

Sample CS6551 Important questions:

1.What are the three criteria necessary for an effective and efficient network?

The most important criteria are performance, reliability and security. Performance of the network depends on number of users, type of transmission medium,the capabilities of the connected h/w and the efficiency of the s/w.Reliability is measured by frequency of failure, the time it takes a link to recover from the failure and the network’s robustness in a catastrophe.Security issues include protecting data from unauthorized access and viruses.

2.Group the OSI layers by function.

The seven layers of the OSI model belonging to three subgroups.network support layers: Consisting of Physical, data link and network layers and theydeal with the physical aspects of moving data from one device to another.User support layers: Consists of Session, presentation and application layers and they allow interoperability among unrelated software systems.The transport layer ensures end-to-end reliable data transmission

3. What are the features provided by layering?

It decomposes the problem of building a network into more manageable components.

Rather than implementing a monolithic piece of software that does everything implement several
layers, each of which solves one part of theproblem.

It provides more modular design. To add some new service, it is enough to modify the functionality at one layer, reusing the functions provided at all the other layers.

4. What are the two interfaces provided by protocols?

Service interface
Peer interface
Service interface-defines the operations that local objects can perform on the protocol.
Peer interface-defines the form and meaning of messages exchanged between protocol peers to implement the communication service.

 

Subject Name Computer Networks
Subject code CS6551
Regulation 2013

CS6551 important questions click here to download

Computer Networks Syllabus click here


CS6551 notes click here


 

CS6551 question bank click here


 

Categories
r2013 notes

CS6551 Notes Computer Networks Regulation 2013 Anna University

CS6551 Notes Computer Networks

CS6551 Notes Computer Networks Regulation 2013 Anna University free download. Computer Networks Notes free pdf download.

Applications CS6551 Notes

Most people know the Internet through its applications: the World Wide Web, email, streaming audio and video, chat rooms, and music (file) sharing. The Web, for example, presents an intuitively simple interface. Users view pages full of textual and graphical objects, click on objects that they want to learn more about, and a corresponding new page appears. Most people are also aware that just under the covers, each selectable objection a page is bound to an identifier for the next page to be viewed. This identifier, called aUniform Resource Locator (URL), is used to provide a way of identifying all the possiblepages that can be viewed from your web browser.

There are a variety of different classes of video applications. One class of video applicationis videoon- demand, which reads a preexisting movie from disk and transmitsit over the network. Another kind of application is videoconferencing, which is in someways the more challenging (and, for networking people, interesting) case because it hasvery tight timing constraints

Although they are just two examples, downloading pages from the Web and participatingin a video conference demonstrate the diversity of applications that can be builton top of the Internet, and
hint at the complexity of the Internet’s design. Starting from the beginning, and addressing one problem at time, the rest of this book explains howto build a network that supports such a wide range
of applications.

 

Subject Name Computer Networks
Subject code CS6551
Regulation 2013

CS6551 Notes click here to download

Computer Networks Syllabus click here


Computer Networks Important questions click here


CS6551 question bank click here


 

Categories
UG syllabus R 2013

CS6551 Syllabus Computer Networks Regulation 2013 Anna University

CS6551 Syllabus Computer Networks

CS6551 Syllabus Computer Networks Regulation 2013 Anna University free download. Computer Networks Syllabus free pdf download.

OBJECTIVES CS6551 Syllabus:

The student should be made to:

Understand the division of network functionalities into layers.

Be familiar with the components required to build different types of networks

Be exposed to the required functionality at each layer

Learn the flow control and congestion control algorithms

UNIT I FUNDAMENTALS & LINK LAYER Computer Networks Syllabus

Building a network – Requirements – Layering and protocols – Internet Architecture – Network software – Performance ; Link layer Services – Framing – Error Detection – Flow control

UNIT II MEDIA ACCESS & INTERNETWORKING CS6551 Syllabus

Media access control – Ethernet (802.3) – Wireless LANs – 802.11 – Bluetooth – Switching and bridging – Basic Internetworking (IP, CIDR, ARP, DHCP,ICMP )

UNIT III ROUTING CS6551 Syllabus

Routing (RIP, OSPF, metrics) – Switch basics – Global Internet (Areas, BGP, IPv6), Multicast – addresses – multicast routing (DVMRP, PIM)

UNIT IV TRANSPORT LAYER Computer Networks Syllabus

Overview of Transport layer – UDP – Reliable byte stream (TCP) – Connection management – Flow control – Retransmission – TCP Congestion control – Congestion avoidance (DECbit, RED) – QoS – Application requirements

UNIT V APPLICATION LAYER CS6551 Syllabus

Traditional applications -Electronic Mail (SMTP, POP3, IMAP, MIME) – HTTP – Web Services – DNS – SNMP

TOTAL: 45 PERIODS

OUTCOMES CS6551 Syllabus:

At the end of the course, the student should be able to:

Identify the components required to build different types of networks

Choose the required functionality at each layer for given application

Identify solution for each functionality at each layer

Trace the flow of information from one node to another node in the network

TEXT BOOK CS6551 Syllabus:

1. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Fifth Edition, Morgan Kaufmann Publishers, 2011.

REFERENCES Computer Networks Syllabus:

1. James F. Kurose, Keith W. Ross, “Computer Networking – A Top-Down Approach Featuring the Internet”, Fifth Edition, Pearson Education, 2009.

2. Nader. F. Mir, “Computer and Communication Networks”, Pearson Prentice Hall Publishers, 2010.

3. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, Mc Graw Hill Publisher, 2011.

4. Behrouz A. Forouzan, “Data communication and Networking”, Fourth Edition, Tata McGraw – Hill, 2011.

Subject Name Computer Networks
Subject code CS6551
Regulation 2013

CS6551 Syllabus click here to download

CS6551 notes click here


Computer Networks Important questions click here


CS6551 question bank click here


 

Categories
question bank

Ma6453 Question Bank PROBABILITY AND QUEUEING THEORY Regulation 2013 Anna University

Ma6453 Question Bank PROBABILITY AND QUEUEING THEORY

Ma6453 Question Bank PROBABILITY AND QUEUEING THEORY Regulation 2013 Anna University free download. PROBABILITY AND QUEUEING THEORY Question Bank free download.

Sample Ma6453 Question Bank:

1. (a) Derive Pollaczck – Khintchine formula for the average number of customers in the M/G/I queuing system (16)
Or
(b) (i) Write a short note on open queueing network. (8)
(ii) Patients arrive at a clinic in a poisson fashion at the rate of 3 per hour. Each arriving patients has to pass through two sections. The assistant in the first section take 15 minutes per patient and the doctor in the second section takes nearly 6 minutes per patient. It the service times in the two sections are approximately exponential, find the probability that there are 3 patients in the first sections and 2 patients in the second section. Find also average number of patients in the clinic and the average waiting time of a patient. (8)

2. (a) (i) Explain Markovian Birth Death process and obtain the expressions for steady state probabilities. (8)
(ii) A supermarket has two girls attending to sales at the counters. If the service time for each customer is exponential with mean 4 min and if people arrive in poisson fashion at the rate of 10 per hour. What is the probability that a customers has to wait for service? (8)
Or
(b) (i) A small mail – business has one telephone line and a facility for call waiting for two additional customers. Orders arrive at the rate of one per minute and each order requires 2 minutes and 30 seconds to take down the particulars.
What is the expected number of calls waiting in the queue? What is the mean waiting time I n the queue? (8)

Subject Name PROBABILITY AND QUEUEING THEORY
Subject code MA6453
Regulation 2013

MA6453 question bank click here to download

PROBABILITY AND QUEUEING THEORY Syllabus click here


MA6453 Notes click here


PROBABILITY AND QUEUEING THEORY Important questions click here

Categories
Important question

Ma6453 Important questions PROBABILITY AND QUEUEING THEORY Regulation 2013 Anna University

Ma6453 Important questions PROBABILITY AND QUEUEING THEORY

Ma6453 Important questions PROBABILITY AND QUEUEING THEORY Regulation 2013 Anna University free download. PROBABILITY AND QUEUEING THEORY Important questions free download.

Sample Ma6453 Important questions:

1. Find the mean and variance of the following distributions:
Binomial, Poisson( Refer B: page no:179,183)

2. Find the mean and variance of the following distributions :
Geometric and Exponential(Refer B : page no:185,212)

3. Prove that Poisson distribution is the limiting form of
Binomial distribution. (Refer B: page no : 181)

4. Each of the 6 tubes of a radio set has a life length (in yrs) which may be considered as a RV that follows a weibull distribution with parameters α = 25 and β = 2. If these tubes function independently of one another, what is the probability that no tube will have to be replaced during the first 2 months of service? (Refer C: page no : 2.82)

5.It is known that the probability of an item produced by a certain
machine will be defective is 0.05. If the produced items are sent to the market in packets of 20, fine the no. of packets containing at least, exactly and atmost 2 defective items in a consignment of 1000 packets using (i) Binomial distribution (ii) Poisson approximation to binomial distribution. (Refer C: page no : 2.28)

6. The daily consumption of milk in excess of 20,000 gallons is
approximately exponentially distributed with θ = 3000. The city has a
daily stock of 35,000 gallons. What is the probability that of two days
selected at random, the stock is insufficient for both days.
(Refer C: page no : 2.74)

Subject Name PROBABILITY AND QUEUEING THEORY
Subject code MA6453
Regulation 2013

MA6453 Important questions click here to download

PROBABILITY AND QUEUEING THEORY Syllabus click here


MA6453 Notes click here


MA6453 question bank click here

Categories
r2013 notes

Ma6453 notes PROBABILITY AND QUEUEING THEORY Regulation 2013 Anna University

Ma6453 notes PROBABILITY AND QUEUEING THEORY

Ma6453 notes PROBABILITY AND QUEUEING THEORY Regulation 2013 Anna University free download. PROBABILITY AND QUEUEING THEORY notes free download.

OBJECTIVE Ma6453 notes:

To provide the required mathematical support in real life problems and develop probabilistic models which can be used in several areas of science and engineering.

OUTCOMES PROBABILITY AND QUEUEING THEORY notes:

The students will have a fundamental knowledge of the probability concepts.

Acquire skills in analyzing queueing models.

It also helps to understand and characterize phenomenon which evolve with respect to time in a probabilistic manner.

TEXT BOOKS Ma6453 notes:

1. Ibe. O.C., “Fundamentals of Applied Probability and Random Processes”, Elsevier, 1st Indian Reprint, 2007.

2. Gross. D. and Harris. C.M., “Fundamentals of Queueing Theory”, Wiley Student edition, 2004.

REFERENCES PROBABILITY AND QUEUEING THEORY notes:

1. Robertazzi, “Computer Networks and Systems: Queueing Theory and performance evaluation”, Springer, 3rd Edition, 2006.

2. Taha. H.A., “Operations Research”, Pearson Education, Asia, 8th Edition, 2007.

3. Trivedi.K.S., “Probability and Statistics with Reliability, Queueing and Computer Science.

Subject Name PROBABILITY AND QUEUEING THEORY
Subject code MA6453
Regulation 2013

MA6453 Notes click here to download

PROBABILITY AND QUEUEING THEORY Syllabus click here


PROBABILITY AND QUEUEING THEORY Important questions click here


MA6453 question bank click here