MA6566 DISCRETE MATHMATICS syllabus

ANNA UNIVERSITY CSE SYLLABUS
5TH SEM CSE
REGULATION 2013
OBJECTIVES:
To extend student’s Logical and Mathematical maturity and ability to deal with abstraction and to introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems.

UNIT I LOGIC AND PROOFS
Propositional Logic – Propositional equivalences - Predicates and Quantifiers – Nested Quantifiers – Rules of inference - Introduction to proofs – Proof methods and strategy.

UNIT II COMBINATORICS
Mathematical induction – Strong induction and well ordering – The basics of counting – The
pigeonhole principle – Permutations and combinations – Recurrence relations – Solving linear recurrence relations – Generating functions – Inclusion and exclusion principle and its applications.

UNIT III GRAPHS
Graphs and graph models – Graph terminology and special types of graphs – Matrix representation of graphs and graph isomorphism – Connectivity – Euler and Hamilton paths.

UNIT IV ALGEBRAIC STRUCTURES
Algebraic systems – Semi groups and monoids - Groups – Subgroups – Homomorphism’s – Normal subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and Fields.

UNIT V LATTICES AND BOOLEAN ALGEBRA
Partial ordering – Posets – Lattices as posets – Properties of lattices - Lattices as algebraic systems – Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra.

TOTAL (L: 45+T:15): 60 PERIODS

OUTCOMES:
At the end of the course, students would:
Have knowledge of the concepts needed to test the logic of a program.
Have an understanding in identifying structures on many levels.
Be aware of a class of functions which transform a finite set into another finite set which relates to input and output functions in computer science.
Be aware of the counting principles.
Be exposed to concepts and properties of algebraic structures such as groups, rings and fields.

TEXT BOOKS:
1. Kenneth H.Rosen, "Discrete Mathematics and its Applications", 7 th Edition, Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2011.
2. Tremblay J.P. and Manohar R, "Discrete Mathematical Structures with Applications to Computer Science", Tata Mc Graw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.

REFERENCES:
1. Ralph.P.Grimaldi., "Discrete and Combinatorial Mathematics: An Applied Introduction", 4th Edition, Pearson Education Asia, Delhi, 2007.
2. Thomas Koshy., "Discrete Mathematics with Applications", Elsevier Publications, 2006.
3. Seymour Lipschutz and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines, Tata Mc Graw Hill Pub. Co. Ltd., New Delhi, 3 rd Edition, 2010.

CS6401 Operating System Syllabus

CS6401 OPERATING SYSTEMS SYLLABUS

REGULATION 2013

COMMON FOR 4TH SEMESTER CSE AND IT

Subject Credit : 3

OBJECTIVES:

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.

UNIT I OPERATING SYSTEMS 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, 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

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

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

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.

TOTAL: 45 PERIODS

OUTCOMES:

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:

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

REFERENCES:

1. William Stalling

s, “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/.

Seaech by google keywords:

Annauniversity 2013 regulation os syllabus,

Anna university os syllabus

Operating system syllabus

Cs6401 Syllabus

Cs6401 operating system syllabus

Cse 4th sem Syllabus

CS6402 Design and Analysis of Algorithm Syllabus

CS6402 DESIGN AND ANALYSIS OF ALGORITHMS  SYLLABUS
REGULATION 2013
COMMON FOR 4TH SEMESTER CSE AND IT

Subject Credit : 3

OBJECTIVES:

The student should be made to:

Learn the algorithm analysis techniques.
Become familiar with the different algorithm design techniques.
Understand the limitations of Algorithm power.

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

UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER
Brute Force - Closest-Pair and Convex-Hull Problems-Exhaustive Search - Traveling Salesman Problem - Knapsack Problem - Assignment problem. Divide and conquer methodology – Merge sort – Quick sort – Binary search – Multiplication of Large Integers – Strassen’s Matrix Multiplication-Closest-Pair and Convex-Hull Problems.

UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE
Computing a Binomial Coefficient – Warshall’s and Floyd’ algorithm – Optimal Binary Search Trees – Knapsack Problem and Memory functions. Greedy Technique– Prim’s algorithm- Kruskal's Algorithm - Dijkstra's Algorithm-Huffman Trees.

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

UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER
Limitations of Algorithm Power-Lower-Bound Arguments-Decision Trees-P, NP and NP-Complete Problems--Coping with the Limitations - Backtracking – n-Queens problem – Hamiltonian Circuit Problem – Subset Sum Problem-Branch and Bound – Assignment problem – Knapsack Problem – Traveling Salesman Problem- Approximation Algorithms for NP – Hard Problems – Traveling Salesman problem – Knapsack problem.

TOTAL: 45 PERIODS

OUTCOMES:
At the end of the course, the student 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 BOOK:
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third Edition, Pearson Education, 2012.

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. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson Education,
2009. Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer, 2008.
4. http://nptel.ac.in/

Anna University CSE syllabus semester wise 2013

As per the Anna university CSE department regulation 2013 is given below or you may download is as a pdf or docx by clicking on the link below

Anna University CSE syllabus Semester wise regulation 2013:
Semester 1
(As per Anna University CSE Syllabus Regulation 2013)
THEORY
1. HS6151       Technical English – I
2. MA6151     Mathematics – I
3. PH6151       Engineering Physics – I
4. CY6151      Engineering Chemistry – I
5. GE6151      Computer Programming
6. GE6152      Engineering Graphics

PRACTICALS

7. GE6161      Computer Practices Laboratory
8. GE6162      Engineering Practices Laboratory
9. GE6163     Physics and Chemistry Laboratory - I

Semester 2
(As per Anna University CSE Syllabus Regulation 2013)

THEORY

1. HS6251        Technical English – II
2. MA6251       Mathematics – II
3. PH6251         Engineering Physics – II
4. CY6251        Engineering Chemistry – II
5. CS6201         Digital Principles and System Design
6. CS6202         Programming and Data Structures I

PRACTICALS

7. GE6262         Physics and Chemistry Laboratory - II
8. CS6211          Digital Laboratory

Second Year Semester 3
(As per Anna University CSE Syllabus Regulation 2013)

THEORY

1. MA6351        Transforms and Partial Differential Equations
2. CS6301          Programming and Data Structure II
3. CS6302          Database Management Systems
4. CS6303          Computer Architecture
5. CS6304          Analog and Digital Communication
6. GE6351         Environmental Science and Engineering

PRACTICAL

7. CS6311        Programming and Data Structure Laboratory II
8. CS6312         Database Management Systems Laboratory
9. CS6212         Programming and Data Structures Laboratory I

Semester 4
(As per Anna University CSE Syllabus Regulation 2013)
THEORY

1. MA6453       Probability and Queueing Theory
2. CS6551         Computer Networks
3. CS6401          Operating Systems
4. CS6402          Design and Analysis of Algorithms
5. EC6504         Microprocessor and Microcontroller
6. CS6403        Software Engineering

PRACTICAL

7. CS6411       Networks Laboratory
8. CS6412       Microprocessor and Microcontroller Laboratory
9. CS6413        Operating Systems Laboratory

Third year Semester 5
(As per Anna University CSE Syllabus Regulation 2013)

THEORY

1. MA6566       Discrete Mathematics
2. CS6501         Internet Programming
3. CS6502        Object Oriented Analysis and Design
4. CS6503        Theory of Computation
5. CS6504         Computer Graphics

PRACTICAL

6. CS6511          Case Tools Laboratory
7. CS6512          Internet Programming Laboratory
8. CS6513         Computer Graphics Laboratory

Semester 6
(As per Anna University CSE Syllabus Regulation 2013)

THEORY

1. CS6601         Distributed Systems 3
2. IT6601          Mobile Computing
3. CS6660         Compiler Design
4. IT6502         Digital Signal Processing
5. CS6659         Artificial Intelligence
6. Elective I

PRACTICAL

7. CS6611       Mobile Application Development Laboratory
8. CS6612       Compiler Laboratory
9. GE6674       Communication and Soft Skills - Laboratory Based

Fourth year Semester 7
(As per Anna University CSE Syllabus Regulation 2013)

THEORY

1. CS6701        Cryptography and Network Security
2. CS6702        Graph Theory and Applications
3. CS6703        Grid and Cloud Computing
4. CS6704        Resource Management Techniques
5. Elective II
6. Elective III

PRACTICAL

7. CS6711     Security Laboratory
8. CS6712     Grid and Cloud Computing Laboratory

Semester 8
(As per Anna University CSE Syllabus Regulation 2013)

THEORY

1. CS6801      Multi – Core Architectures and Programming
2. Elective IV
3. Elective V

PRACTICAL

4. CS6811       Project Work.

Whatsapp Like Button

வாட்ஸ் அப் - ல் லைக் பட்டன் வசதி வழங்கப்பட உள்ளதாக தகவல் வெளியாகியுள்ளது. அதேப்போல் கணினி பதிப்பான வாட்ஸ் அப் வெப் - ம் தற்போது மேம்படுத்தப்பட்டுள்ளது.
செல்பேசியில் பயன்படுத்தும் வாட்ஸ் அப் செயலி மூலம் எழுத்து, படம், காணொளி ஆகிய வடிவில் செய்திகளை அனுப்பலாம்.
இது தற்போது உலகளவில் அதிகமாக பயன்படுத்தப்படும் செய்தி தொடர்பு செயலியாக ஸ்மார்ட் போன்களில் வலம் வருகிறது.
கடந்த ஜனவரி மாதம் முதல், வாட்ஸ் அப் செயலியானது கணினியில் பயன்படுத்தக்கூடிய வசதியை வழங்கியது. ஆனால், செல்பேசியில் உள்ள வசதிகள் அனைத்தும் கணினி பதிப்பில் பயன்படுத்த முடியாத நிலையில் இருந்தது.
தற்போது, வாட்ஸ் அப் தனது கணினி பதிப்பை மேம்படுத்தியுள்ளது.
அதன் படி, ஸ்டேடஸ் மாற்றலாம், ஃப்ரபைல் படத்தை மாற்றியமைக்கலாம். அரட்டையை நீக்கலாம், ஆவணப்படுத்தலாம், குழுவை நிர்வகிக்கலாம்.
வாட்ஸ் அப்பில் லைக் பட்டன்
கூடுதல் தகவலாக, வாட்ஸ் அப்பில் பார்த்து படித்த செய்தியை படிக்காததாக குறிக்கவும் வகையில் வசதிகளை மேம்படுத்த உள்ளதாக கூறப்படுகிறது. அதேப்போல், லைக் பட்டன் வசதியையும் வழங்க உள்ளதாகவும் கூறப்படுகிறது.