Scribd
Upload
42 views3 pages

Course Structure & Syllabus of Bachelor of Technology (B.Tech)

The document outlines the course structure and syllabus for the 8th semester of a Bachelor of Technology degree in Computer Science. It includes details on two courses: Advanced Operating Systems and Design & Analysis of Algorithms. For Advanced Operating Systems, topics include computer architecture, operating system functions, information management, process management, inter-process communication, deadlocks, memory management, security, parallel processing, and Unix as a case study. For Design & Analysis of Algorithms, topics include algorithm development, data structures, probability, heuristics, recursion, shortest paths problems, sorting, searching, arithmetic expressions, and sets.

Uploaded by

anup
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
42 views3 pages

Course Structure & Syllabus of Bachelor of Technology (B.Tech)

The document outlines the course structure and syllabus for the 8th semester of a Bachelor of Technology degree in Computer Science. It includes details on two courses: Advanced Operating Systems and Design & Analysis of Algorithms. For Advanced Operating Systems, topics include computer architecture, operating system functions, information management, process management, inter-process communication, deadlocks, memory management, security, parallel processing, and Unix as a case study. For Design & Analysis of Algorithms, topics include algorithm development, data structures, probability, heuristics, recursion, shortest paths problems, sorting, searching, arithmetic expressions, and sets.

Uploaded by

anup
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

COURSE STRUCTURE & SYLLABUS OF

BACHELOR OF TECHNOLOGY (B.TECH)

In

COMPUTER SCIENCE

Course Structure

Fourth Year

Eighth Semester

Paper Name of the Subject


Code
BECO6 Advance Operating System
BECO7 Design & Analysis of Algorithm
BECO8 Elective-II
BECO9 Project
BECO6P Advance Operating System

BECO6: ADVANCE OPERATING SYSTEM

1. COMPUTER ARCHITECTURE:
4 GL Program , 3GL (HLL)Program,

2. OPERATING SYSTEM FUNCTIONS:


What is an Operating Systems?, Different Services of the Operating System, Uses of System Calls, The
Issue of Protability, The Kernel

3. INFORMATION MANAGEMENT:
The file System, Device Driver (DD), Terminal I/O.

4. PROCESS MANAGEMENT:
What is Process , Evolution of Multiprogramme, Process States, Process Control Block (PCB), Create,
Kill, Dispatch a Process,

5. INTER- PROCESS COMMUNICATION:


The Producer –Consumer Problems.

6. DEADLOCKS:
Deadlock Prerequisites, Deadlock Strategies,

7. MEMORY MANAGEMENT (MM):


Paging, Segmentation, Virtual Memory Management Systems,

8. OPERATING SYSTEMS: SECURITY AND PROTECTION:


Security Threats, Security Design Principles, Protection Mechanisms, Encryption, Security in
Distributed Environment.

B.Tech (VIII sem) computer 213


9. PARALLEL PROCESSING:
Operating Systems for Parallel Processes, Case Study: Mach

10. OPERATING SYSTEMS IN DISTRIBUTED PROCESSING:


Lan Environment and Protocols,

11. UNIX: A CASE STUDY:


Overview of UNIX, UNIX File System, Data Structure for Process / Memory Management, Executing
and Terminating a Program in UNIX, Using the System (Booting and Login), Memory Management,
Terms and Concepts Introduced,Test Questions.

BECO7: DESIGN & ANALYSIS OF ALGORITHM

1. INTRODUCTION

2. THE BASIC STEPS IN THE DEVELOPMENT OF AN ALGORITHM


The Problem-Solving Aspect, Implementation Of Algorithms, Program Verification, The Efficiency
Of Algorithms, The Order Notation

3. SOME DATA STRUCTURE


Stacks and queues, trees, binary trees, heaps and heapsort, graphs, hashing.

4. ELEMENTARY NOTIONS FROM PROBABILITY AND STATISTICS


Probability, Axioms Of Probability, Discrete Probability Distributions, Bayes's Theorem, District
Random Variables, Statistics,Linearity, Arithmetic Series

5. HEURISTICS: TRAVELING SALESPERSON PROBLEM


Traveling Saleperson Problem, Efficiency Considerations

6. BRANCH AND BOUND PROBLEM


The Method, Lc-Search, Control Abstractions For Lc-Search, Properties Of Lc-Search, Bounding, Lc
Branch-And-Bound

7. RECURSION AND BACKTRACK PROGRAMMING


Introduction, When Not To Use Recursion, Two Examples Of Recursive Programs, Backtrack
Programming, The Eight Queens Problem, The Stable Marriage Problem, The Optimal Selection
Problem
8. SHORTEST PATHS PROBLEM
Unweighted Shortest Paths, Dijkstra’s Algorithm, Acyclic Graphs, Prim’s Algorithm, Kruskal’s
Algorithm

9. SORTING
General Background, Efficiency Consideration, Efficiency Of Sorting, Exchange Sorts, Quicksort,
Efficiency Of Quick Sort, Binary Tree Sorts, Heapsort, Insertion Sorts, Shell Sort

10. SEARCHING
Basic Search Techniques, Algorithmic Notation, Sequential Searching, Efficiency Of Sequential
Searching, Reordering A List For Maximum Search Efficiency, Indexed Sequential Search, Binary
Search, Interpolation Search

11. ARITHMETIC AND LOGICAL EXPRESSIONS


The General Method, Evaluation And Interpolation, Interpolation

12. SETS AND SOME BASIC SET ALGORITHMS


Sets, Relations, Functions, Sets And Disjoint Set Union

B.Tech (VIII sem) computer 214


*******************

B.Tech (VIII sem) computer 215

You might also like

pFad - Phonifier reborn

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

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy