Scribd Logo
Upload

Welcome to Scribd!

  • Technical Pointers

    Uploaded by

    CowboysOfDallas
    10 views1 page
    The document discusses TCP states, DNS, special characters, bit shifting, power of 2 binary representations, recursive functions, sorting algorithms like mergesort, insertion sort, bubble sort, and quick sort. It also mentions avoiding the worst case for quicksort and different inter-process communication methods like message passing, shared memory.

    Original Description:

    Technical Pointers

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses TCP states, DNS, special characters, bit shifting, power of 2 binary representations, recursive functions, sorting algorithms like mergesort, insertion sort, bubble sort, and quick sort. It also mentions avoiding the worst case for quicksort and different inter-process communication methods like message passing, shared memory.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views1 page

    Technical Pointers

    Uploaded by

    CowboysOfDallas
    The document discusses TCP states, DNS, special characters, bit shifting, power of 2 binary representations, recursive functions, sorting algorithms like mergesort, insertion sort, bubble sort, and quick sort. It also mentions avoiding the worst case for quicksort and different inter-process communication methods like message passing, shared memory.

    Copyright:

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

    1.

    TCP State

    DNS : Tinyurl TCP connection

    Special Characters

    Bit shift

    Power of 2 Bin rep of 2 recursive

    2 2 2 3 (index bin search)

    Stable -> mergesort, insertion, bubble sort Quick sort how to avoid worst case (i, < i+1) Heap quick -> inplace

    What are different types of inter process communication methods

    Message passing (send receive) Shared memory

    You might also like