Showing posts with label modulewise notes. Show all posts
Showing posts with label modulewise notes. Show all posts

Design and Analysis of Algorithms - Lecture Notes and Slides Free Download

Lecture notes as doc files and ppt slides for design and analysis of algorithms for free download.

Module I 

Introduction and Complexity
What is an algorithm – Properties of an Algorithm, Development of an algorithm, Pseudo-code Conventions, Recursive Algorithms – Performance Analysis - Space and Time Complexity –Asymptotic Notations – ‘Oh’, ‘Omega’, ‘Theta’, Worst, Best and Average Case Complexity, Running Time Comparison, Common Complexity Functions -Recurrence Relations – Solving Recurrences using Iteration and Recurrence Trees – Example Problems – Profiling - Amortized Complexity.

 Module II 

Divide and Conquer - Control Abstraction, Finding Maximum and Minimum, Costs associated element comparisons and index comparisons, Binary Search, Divide and Conquer Matrix Multiplication, Stressen’s Matrix Multiplication, Quick Sort, Merge Sort. – Refinements.

Module III 

Greedy Strategy - Control Abstraction, General Knapsack Problem, Minimum Cost Spanning Trees – PRIM’s Algorithm, Kruskal’s Algorithm, Job sequencing with deadlines.
Dynamic Programming - Principle of Optimality, Multistage Graph Problem, Forward Approach, Backward Approach, All-Pairs Shortest Paths, Traveling Salesman Problem.

Module IV

 Backtracking – State Space Tree - Fixed Tuple and Variable Tuple Formulation - Control Abstraction – Generating Function and Bounding Function - Efficiency of the method - Monte Carlo Method – N-Queens Problem, Sum of Subsets.
Branch and Bound Techniques – FIFO, LIFO, and LC Control Abstractions, 15-puzzle.

Module V

Sophisticated Algorithms - Approximation Algorithms – Planar Graph Coloring, Vertex cover - String Matching Algorithms – Rabin Karp algorithm - Topological Sort - Deterministic and Non-Deterministic Algorithms.

Lower Bound Theory - Comparison Trees for Searching and Sorting, lower bound on comparison based algorithms, Sorting, Selection  & Merging; Oracles and Adversary Arguments –Merging,Basic concepts of randomized algorithm-Las Vagas algorithm for search.

Module 5 - Lowerbound slides ppt

Computer Networks Modulewise Short Notes Free PDF and Doc Download

Welcome. I have uploaded some short notes (lecture notes) and slides for CN (Computer networks). Computer Networks is a subject taught for Computer Science and Engineering Branches and Information technology Branches. The notes for Computer networks are available for download. There are different notes from different sources. We have also included slideshows (slides). The note full set is complete. You can compare and study. Computer networks slides are specially mentioned as slides. MGU (MG university) Computer networks syllabus is available here.

Module 1:

Network requirements, Network Architecture, Layering and Protocols, OSI Architecture, Internet Architecture, Performance - bandwidth and latency, Delay bandwdith product, high speed networks.

Note Full Set


Other notes:


Module 2:

Direct Link network, hardware Building Block, Framing - Byte Oriented protocol, Bit oriented protocol, Clock based framing, Reliable transmission- stop and wait, sliding windows, Ethernet (802.3)- physical properties, Access protocol, wireless-bluetooth, wifi, Wimax


Other notes:

Module 3:

Packet switching-switching and forwarding-Datagram,  virtual circuit switching, source routing bridges and LAN switches - Learning bridges, Spanning tree algorithms, Broadcast and multicast, Limitations of bridges, simple internetworking - service model, global address, datagram forwarding in IP, address translation, Routing - network as graph, distance vector, link state, matrix.

Other notes:


Module 4

End to End protocol, simple de-multiplexer, reliable byte stream, TCP - Issues, segment format,connection establishment and termination, sliding window revisited, triggering transmission,, adaptive retransmission, RPC- fundamentals, TCP congestion control, - additive increase, slow start, fast retransmit and fast recovery, congestion avoidance mechanism, DEC bit, Randomearly detection bit, source based congestion avoidance.

Other notes:


Module 5

Applications -WWW, Email, name service, network management, web services custom application protocol, generic application protocol, overlay networks - peer to peer networks.


Other notes: