Scribd Logo
Upload

Welcome to Scribd!

  • Iit Madras

    Uploaded by

    pavan_mtech_nitt
    65 views2 pages
    The document summarizes two NPTEL video lecture courses: 1. A computer organization and architecture course from IIT Madras covering topics like processor activities, data path architecture, addressing modes, memory systems, I/O devices and buses over 33 lectures. 2. A data structures and algorithms course from IIT Delhi covering common data structures like stacks, queues, trees and graphs as well as sorting algorithms, hashing, priority queues and graph algorithms like breadth first search, depth first search and minimum spanning trees over 36 lectures.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document summarizes two NPTEL video lecture courses: 1. A computer organization and architecture course from IIT Madras covering topics like processor activities, data path architecture, addressing modes, memory systems, I/O devices and buses over 33 lectures. 2. A data structures and algorithms course from IIT Delhi covering common data structures like stacks, queues, trees and graphs as well as sorting algorithms, hashing, priority queues and graph algorithms like breadth first search, depth first search and minimum spanning trees over 36 lectures.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    65 views2 pages

    Iit Madras

    Uploaded by

    pavan_mtech_nitt
    The document summarizes two NPTEL video lecture courses: 1. A computer organization and architecture course from IIT Madras covering topics like processor activities, data path architecture, addressing modes, memory systems, I/O devices and buses over 33 lectures. 2. A data structures and algorithms course from IIT Delhi covering common data structures like stacks, queues, trees and graphs as well as sorting algorithms, hashing, priority queues and graph algorithms like breadth first search, depth first search and minimum spanning trees over 36 lectures.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    NPTEL VIDEO LECTURE [IIT - MADRAS] Courde Title: Computer Organization and Architecture By Prof. S.

    Raman ***************************************************************************** 1 - Introduction To Computing 2 - Introduction To System : Software 3 - Introduction To System : Hardware 4 - Processor Activities 5 - Processor As a State Machine 6 - Data Path Architecture 7 - Data Path Controller : Micro Programmed 8 - State Machine Design 9 - Controller Design: Microprogrammed and Hardwired 10 - Controller Design (Contd) 11 - Typical Micro Instructions 12 - Addressing Modes 13 - Problem Exercise 14 - Problem Exercise 15 - Introduction to memory system 16 - CPU - Memory Interaction 17 - Cache Organization 18 - Cache Organization 19 - Virtual Memory 20 - Virtual Memory 21 - Performance Calculation 22 - Segmentation 23 - Address Translation and Protection 24 - Programmed I/O 25 - Interrupt Driven I/O 26 - DMA : Direct Memory Access 27 - Device Service Routines 28 - Evolution Of I/O 29 - I/O Devices 30 - I/O Devices - Contd 31 - Buses 32 - Buses Contd 33 - Conclusion

    NPTEL VIDEO LECTURE [IIT - DELHI] Courde Title: Data Structures and Algorithms By Prof. Naveen Garg ***************************************************************************** 1 - Introduction to Data Structures and Algorithms 2 - Stacks 3 - Queues and Linked Lists 4 - Dictionaries 5 - Hashing 6 - Trees 7 - Tree Walks / Traversals 8 - Ordered Dictionaries 9 - Deletion 10 - Quick Sort 11 - AVL Trees 12 - AVL Trees 13 - Trees 14 - Red Black Trees 15 - Insertion in Red Black Trees 16 - Disk Based Data Structures 17 - Case Study: Searching for Patterns 18 - Tries 19 - Data Compression 20 - Priority Queues 21 - Binary Heaps 22 - Why Sorting 23 - More Sorting 24 - Graphs 25 - Data Structures for Graphs 26 - Two Applications of Breadth First Search 27 - Depth First Search 28 - Applications of DFS 29 - DFS in Directed Graphs 30 - Applications of DFS in Directed Graphs 31 - Minimum Spanning Trees 32 - The Union 33 - Prims Algorithm for Minimum Spanning Trees 34 - Single Source Shortest Paths 35 - Correctness of Dijkstras Algorithm 36 - Single Source Shortest Paths

    You might also like