Articles by "Cse 4th sem 2017 R"
Showing posts with label Cse 4th sem 2017 R. Show all posts

0

Anna University CS8493 Operating Systems(OS) 2017 Regulation Notes, Question Banks, Two Marks with Answers, Previous Year Question Papers and Syllabus.


CS8493 Operating Systems
CS8493 OPERATING SYSTEMS

UNIT I OPERATING SYSTEM OVERVIEW:
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:
Processes - Process Concept, Process Scheduling, Operations on Processes, Inter-process Communication; CPU Scheduling - Scheduling criteria, Scheduling algorithms, Multiple-processor scheduling, Real time scheduling; Threads- Overview, Multithreading models, Threading issues; Process Synchronization - The critical-section problem, Synchronization hardware, Mutex locks, Semaphores, Classic problems of synchronization, Critical regions, Monitors; Deadlock - System model, Deadlock characterization, Methods for handling deadlocks, Deadlock prevention, Deadlock avoidance, Deadlock detection, Recovery from deadlock.

UNIT III STORAGE MANAGEMENT:
Main Memory – Background, Swapping, Contiguous Memory Allocation, Paging, Segmentation, Segmentation with paging, 32 and 64 bit architecture Examples; Virtual Memory – Background, Demand Paging, Page Replacement, Allocation, Thrashing; Allocating Kernel Memory, OS Examples

UNIT IV FILE SYSTEMS AND I/O SYSTEMS:
Mass Storage system – Overview of Mass Storage Structure, Disk Structure, Disk Scheduling and Management, swap space management; File-System Interface - File concept, Access methods, Directory Structure, Directory organization, File system mounting, File Sharing and Protection; File System Implementation- File System Structure, Directory implementation, Allocation Methods, Free Space Management, Efficiency and Performance, Recovery; I/O Systems – I/O Hardware, Application I/O interface, Kernel I/O subsystem, Streams, Performance.

UNIT V CASE STUDY:
Linux System - Design Principles, Kernel Modules, Process Management, Scheduling, Memory Management, Input-Output Management, File System, Inter-process Communication; Mobile OS - iOS and Android - Architecture and SDK Framework, Media Layer, Services Layer, Core OS Layer, File System.
 

2017 Regulation
Notes:
CS8493 Operating Systems Notes - Click here

Question Bank:
CS8493 Operating Systems QBank - Click here 1 | Click here 2 | Click here 3

Two Marks:
CS8493 Operating Systems 2Marks - Click here 1 | Click here 2

Previous Year Question Paper:
AprilMay 2019 - Click here


Join with us and get an instant update if we have uploaded new study materials.



Continue reading

0

Anna University CS8451 Design And Analysis Of Algorithms(DAA) 2017 Regulation Notes, Question Banks, Important 2 marks and 13 marks questions with answers, Previous Year Question Papers and Syllabus.


CS8451 Design And Analysis Of Algorithms
CS8451 DESIGN AND ANALYSIS OF ALGORITHMS

OBJECTIVES:
  • To understand and apply the algorithm analysis techniques.
  • To critically analyze the efficiency of alternative algorithmic solutions for the same problem.
  • To understand different algorithm design techniques.
  • To understand the limitations of Algorithmic power.

UNIT I INTRODUCTION:
Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types – Fundamentals of the Analysis of Algorithmic Efficiency –Asymptotic Notations and their properties. Analysis Framework – Empirical analysis - Mathematical analysis for Recursive and Non-recursive algorithms - Visualization

UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER:
Brute Force – Computing an – String Matching - Closest-Pair and Convex-Hull Problems - Exhaustive Search - Travelling Salesman Problem - Knapsack Problem - Assignment problem. Divide and Conquer Methodology – Binary Search – Merge sort – Quick sort – Heap Sort - Multiplication of Large Integers – Closest-Pair and Convex - Hull Problems.

UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE:
Dynamic programming – Principle of optimality - Coin changing problem, Computing a Binomial Coefficient – Floyd‘s algorithm – Multi stage graph - Optimal Binary Search Trees – Knapsack Problem and Memory functions. Greedy Technique – Container loading problem - Prim‘s algorithm and Kruskal's Algorithm – 0/1 Knapsack problem, Optimal Merge pattern - Huffman Trees.

UNIT IV ITERATIVE IMPROVEMENT:
The Simplex Method - The Maximum-Flow Problem – Maximum Matching in Bipartite Graphs, Stable marriage Problem.

UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER:
Lower - Bound Arguments - P, NP NP- Complete and NP Hard Problems. Backtracking – n-Queen problem - Hamiltonian Circuit Problem – Subset Sum Problem. Branch and Bound – LIFO Search and FIFO search - Assignment problem – Knapsack Problem – Travelling Salesman Problem - Approximation Algorithms for NP-Hard Problems – Travelling Salesman problem – Knapsack problem.

OUTCOMES:

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

  • Design algorithms for various computing problems.
  • Analyze the time and space complexity of algorithms.
  • Critically analyze the different algorithm design techniques for a given problem.
  • Modify existing algorithms to improve efficiency.

TEXT BOOKS:
  1. Anany Levitin, ―Introduction to the Design and Analysis of Algorithms‖, Third Edition, Pearson Education, 2012.
  2. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms/ C++, Second Edition, Universities Press, 2007.

REFERENCES:
  1. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, ―Introduction to Algorithms‖, Third Edition, PHI Learning Private Limited, 2012..
  2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, ―Data Structures and Algorithms‖, Pearson Education, Reprint 2006.
  3. Harsh Bhasin, ―Algorithms Design and Analysis‖, Oxford university press, 2016.
  4. S. Sridhar, ―Design and Analysis of Algorithms‖, Oxford university press, 2014.
  5. http://nptel.ac.in/

2017 Regulation
Notes:
CS8451 Design And Analysis Of Algorithms Notes - Click here

Question Bank:
CS8451 Design And Analysis Of Algorithms QBank - Click here 1 | Click here 2 | Click here 3 | Click here 4 | Click here 5

Two Marks with Answers:
CS8451 Design And Analysis Of Algorithms 2Marks - Click here 1 | Click here 2 | Click here 3 | Click here 4

Important 2 marks and 13 marks questions with answers:
CS8451 Design And Analysis Of Algorithms 2Marks - Click here 1 | Click here 2

Previous Year Question Paper:
AprilMay 2019 - Click here
AprilMay 2018 - Click here
NovDec 2017 - Click here
AprilMay 2017 - Click here
MayJune 2016 - Click here




Join with us and get an instant update if we have uploaded new study materials.



Continue reading

0

Anna University CS8491 Computer Architecture(CA) 2017 Regulation Notes, Question Banks, 2 Marks and 13 marks with Answers, Previous Year Question Papers and Syllabus.


CS8491 Computer Architecture
CS8491 COMPUTER ARCHITECTURE

UNIT I BASIC STRUCTURE OF A COMPUTER SYSTEM:
Functional Units – Basic Operational Concepts – Performance – Instructions: Language of the Computer – Operations, Operands – Instruction representation – Logical operations – decision making – MIPS Addressing.

UNIT II ARITHMETIC FOR COMPUTERS:
Addition and Subtraction – Multiplication – Division – Floating Point Representation – Floating Point Operations – Subword Parallelism

UNIT III PROCESSOR AND CONTROL UNIT:
A Basic MIPS implementation – Building a Datapath – Control Implementation Scheme – Pipelining – Pipelined datapath and control – Handling Data Hazards & Control Hazards – Exceptions.

UNIT IV PARALLELISIM:
Parallel processing challenges – Flynn‘s classification – SISD, MIMD, SIMD, SPMD, and Vector Architectures - Hardware multithreading – Multi-core processors and other Shared Memory Multiprocessors - Introduction to Graphics Processing Units, Clusters, Warehouse Scale Computers and other Message-Passing Multiprocessors.

UNIT V MEMORY & I/O SYSTEMS:
Memory Hierarchy - memory technologies – cache memory – measuring and improving cache performance – virtual memory, TLB‘s – Accessing I/O Devices – Interrupts – Direct Memory Access – Bus structure – Bus operation – Arbitration – Interface circuits - USB.
 

2017 Regulation
Notes:
CS8491 Computer Architecture Notes - Click here 1 | Click here 2

Question Bank:
CS8491 Computer Architecture QBank - Click here 1 | Click here 2 | Click here 3 | Click here 4 | Click here 5 | Click here 6

Two Marks:
CS8491 Computer Architecture 2Marks - Click here 1 | Click here 2 | Click here 3 | Click here 4 | Click here 5 | Click here 6

Important 2 marks and 13 marks questions with answers:
CS8451 Design And Analysis Of Algorithms 2 Marks and 13 Marks - Click here

Previous Year Question Paper:
AprilMay 2019 - Click here
MayJune 2016 - Click here
AprilMay 2015 - Click here
MayJune 2013 - Click here
AprilMay 2011 - Click here
AprilMay 2010 - Click here



Join with us and get an instant update if we have uploaded new study materials.



Continue reading
Subscribe to: Posts (Atom)