EBooks for 6th Sem

These are some EBooks that I found just recently. I will keep uploading when I find more! :)

The EBooks include :

1 a. George Coulouris, Jean Dollimore and Tim Kindberg, “Distributed Systems Concepts and Design”, Fifth Edition

1 b. Distributed Systems : Principles, Algorithms, and Systems By Ajay D. Kshemkalyani and Mukesh Singhal

2. Jochen H. Schller, “Mobile Communications”, Second Edition (This is a reference book according to our syllabus. The syllabus actually recommends another book which I couldn't find - Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing” )

3. Alfred V Aho, Monica S. Lam, Ravi Sethi and Jeffrey D Ullman, “Compilers – Principles, Techniques and Tools”, 2 nd Edition

4. John G. Proakis and Dimitris G.Manolakis, “Digital Signal Processing – Principles, Algorithms & Applications”, Third Edition* (Syllabus recommends Fourth edition. Will update asap when I get hold of it. )

Sem 6 EBooks

Operating Systems Lecture Series

The series is good. You can refer about any of the syllabus topics that you want in this series.

Videos

Ebooks for Software Engineering, Networks, Design and Analysis of Algorithms, and Operating Systems

Some new edition Ebooks that might help

Sem 4 Ebooks

The above link has the following books :

1. "Software Engineering, A Practitioner's Approach" 7th Edition By Roger S. Pressman
2. "Introduction to The Design & Analysis of Algorithms" 3rd Edition By Anany Levitin
3. "Computer Networks : A Systems Approach" 5th Edition By Larry L. Peterson and Bruce S. Davie
4. "Operating Systems Concepts" 9th Edition By Abraham Silberschatz, Peter Baer Galvin, Greg Gagne.

Some Math Notes

Some math notes and materials that our Mam gave

Math Part 1

Math Part 2

Maximum Matching Bipartite Graph and Stable Marriage Problem

After seeing these videos. You can use Anany Levitin Book to help you further.

Below video explains Bipartite Graph and other families of graphs. Start seeing from 2:20

Complete matching and Maximum matching Bipartite Graphs

Funny Description of Stable Marriage Problem : 

DAA : Heuristics for TSP

And. Ignore the math.

DAA : Maximum Flow Problem

Ignore the Math.

Part 1 : Start from 42:10 , which is the start of maximum flow problem

Part 2 : Maximum flow problem continued