OS & ST Syllabus

RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING, KURNOOL
(IV Semester CSE)
Course Category : Professional Core L T P C Exam 3 Hrs
Course Code : 20APC0506T 3 0 0 3 CIE 30 M
Course Title : Operating Systems SEE 70 M
COURSE OBJECTIVES:
The course is designed to
• Understand basic concepts and functions of operating systems
• Understand the processes, threads and scheduling algorithms.
• Provide good insight on various memory management techniques
• Expose the students with different techniques of handling deadlocks
• Explore the concept of file-system and its implementation issues
• Familiarize with the basics of the Linux operating system
• Implement various schemes for achieving system protection and security
UNIT-I:
Operating Systems Overview: Introduction, Operating system functions, Operating systems operations,
Computing environments, Open-Source Operating Systems
System Structures: Operating System Services, User and Operating-System Interface, systems calls,
Types of System Calls, system programs, Operating system Design and Implementation, Operating system
structure, Operating system debugging, System Boot.
UNIT-II:
Process Concept: Process scheduling, Operations on processes, Inter-process communication,
Communication in client server systems.
Multithreaded Programming: Multithreading models, Thread libraries, Threading issues, Examples.
Process Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms, Multiple processor
scheduling, Thread scheduling, Examples.
Inter-process Communication: Race conditions, Critical Regions, Mutual exclusion with busy waiting,
Sleep and wakeup, Semaphores, Mutexes, Monitors, Message passing, Barriers, Classical IPC Problems -
Dining philosophers problem, Readers and writers problem.
UNIT-III:
Memory-Management Strategies: Introduction, Swapping, Contiguous memory allocation, Paging,
Segmentation, Examples.
Virtual Memory Management: Introduction, Demand paging, Copy on-write, Page replacement, Frame
allocation, Thrashing, Memory-mapped files, Kernel memory allocation, Examples.
UNIT-IV:
Deadlocks: Resources, Conditions for resource deadlocks, Ostrich algorithm, Deadlock detection And
recovery, Deadlock avoidance, Deadlock prevention.
File Systems: Files, Directories, File system implementation, management and optimization.
Secondary-Storage Structure: Overview of disk structure, and attachment, Disk scheduling, RAID structure,
Stable storage implementation.
UNIT-V:
System Protection: Goals of protection, Principles and domain of protection, Access matrix, Access
control, Revocation of access rights.
System Security: Introduction, Program threats, System and network threats, Cryptography as a security,
User authentication, implementing security defenses, firewalling to protect systems and networks,
Computer security classification.
TEXT BOOKS:
1. Silberschatz A, Galvin P B, and Gagne G, Operating System Concepts, 9th edition, Wiley, 2016.
2. Tanenbaum A S, Modern Operating Systems, 3rd edition, Pearson Education, 2008.
(Topics: Inter-process Communication and File systems.)
REFERENCE BOOKS:
1. Tanenbaum A S, Woodhull A S, Operating Systems Design and Implementation, 3rd edition, PHI, 2006.
2. Dhamdhere D M, Operating Systems A Concept Based Approach, 3rd edition, Tata McGraw-Hill, 2012.
3. Stallings W, Operating Systems -Internals and Design Principles, 6th edition, Pearson Education, 2009
4. Nutt G, Operating Systems, 3rd edition, Pearson Education, 2004
COURSE OUTCOMES:
After completion of the course, students will be able to
• Realize how applications interact with the operating system
• Analyze the functioning of a kernel in an Operating system.
• Summarize resource management in operating systems
• Analyze various scheduling algorithms
• Examine concurrency mechanism in Operating Systems
• Apply memory management techniques in the design of operating systems
• Understand the functionality of the file system
• Compare and contrast memory management techniques.
• Understand deadlock prevention and avoidance.
• Perform administrative tasks on Linux based systems..
Online Learning Resources:
https://nptel.ac.in/courses/106/106/106106144/
http://peterindia.net/OperatingSystems.html
RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING, KURNOOL

(CSE)
Course Category : Professional Elective - II L T P C Exam 3 Hrs
Course Code : 20APE0506 3 0 0 3 CIE 30 M
Course Title : SOFTWARE TESTING SEE 70 M
Course Objectives:
• Introduce the fundamentals of various testing methodologies.
• Describe the principles and procedures for designing test cases.
• Teach debugging methods.
Course Outcomes:
After completion of the course, students will be able to
• Understand the basic testing procedures.
• Develop reliable software
• Design test cases for testing different programming constructs
• Test the applications by applying different testing methods and automation tools
UNIT I Introduction Lecture 8Hrs

Introduction: Purpose of Testing, Dichotomies, Model for Testing, Consequences of Bugs, Taxonomy of
Bugs.
Flow graphs and Path testing: Basics Concepts of Path Testing, Predicates, Path Predicates and
Achievable Paths, Path Sensitizing, Path Instrumentation, Application of Path Testing.
Case Study: SELENIUM Test Cases
UNIT II Flow Testing Lecture 9Hrs

Transaction Flow Testing: Transaction Flows, Transaction Flow Testing Techniques.
Dataflow testing: Basics of Dataflow Testing, Strategies in Dataflow Testing, Application of Dataflow
Testing.
UNIT III Domain Testing Lecture 9Hrs

Domain Testing: Domains and Paths, Nice & Ugly Domains, Domain testing, Domains and Interfaces
Testing, Domain and Interface Testing, Domains and Testability.
UNIT IV Logic Based Testing Lecture 8Hrs

Paths, Path products and Regular expressions: Path Products & Path Expression, Reduction Procedure,
Applications, Regular Expressions & Flow Anomaly Detection. Logic Based Testing: Overview, Decision
Tables, Path Expressions, KV Charts, and Specifications.
UNIT V Graph Matrices and Application Lecture 8Hrs

State, State Graphs and Transition Testing: State Graphs, Good & Bad State Graphs, State Testing,
Testability Tips.
Graph Matrices and Application: Motivational Overview, Matrix of Graph, Relations, Power of a Matrix,
Node Reduction Algorithm, Building Tools.
Textbooks:
1. Boris Beizer, “Software testing techniques”, Dreamtech, second edition, 2002.
Reference Books:
1. Brian Marick, “The craft of software testing”, Pearson Education.
2. Yogesh Singh, “Software Testing”, Camebridge
3. P.C. Jorgensen, “Software Testing” 3rd edition, Aurbach Publications (Dist.by
SPD).
4. N.Chauhan, “Software Testing”, Oxford University Press.
5. P.Ammann&J.Offutt, “Introduction to Software Testing” , Cambridge Univ.
Press.
6. Perry, “Effective methods of Software Testing”, John Wiley, 2nd Edition, 1999.
Online Learning Resources:

http://www.nptelvideos.in/2012/11/software-engineering.html
https://onlinecourses.nptel.ac.in/noc16_cs16/preview
https://nptel.ac.in/courses/117105135

OS & ST Syllabus

Uploaded by

Copyright:

Available Formats

OS & ST Syllabus

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

OS & ST Syllabus

Uploaded by

Copyright:

Available Formats

RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING, KURNOOL

(IV Semester CSE)

Course Category : Professional Core L T P C Exam 3 Hrs

Course Code : 20APC0506T 3 0 0 3 CIE 30 M

Course Title : Operating Systems SEE 70 M

RAYALASEEMA UNIVERSITY COLLEGE OF ENGINEERING, KURNOOL

Course Title : SOFTWARE TESTING SEE 70 M

UNIT I Introduction Lecture 8Hrs

UNIT II Flow Testing Lecture 9Hrs

UNIT III Domain Testing Lecture 9Hrs

UNIT IV Logic Based Testing Lecture 8Hrs

UNIT V Graph Matrices and Application Lecture 8Hrs

Online Learning Resources:

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.