General Discussions

BST Operations

Find the BST code with: Insertion Deletion Traversals (in, pre and post) Here: Github Link

General Discussions

Hashing Ebooks

A quick ebook on hashing! Get a quick read and all the details here: Hashing

General Discussions

Stack and Heap Memory

Originally posted on PH Bytes:
Stack Memory Heap Memory Memory allocated is in LIFO fashion No specific order. Is random. Allocation and de-allocation of memory is automatic Allocation and de-allocation of memory is manual Locality of reference is excellent Locality of reference is adequate Memory allocated is of fixed size and is not flexible Resizing…

General Discussions

Hired/Fired Challenge

An afternoon coding challenge conducted at KLE TU. More details can be found here: Knit Activities  

General Discussions

Knit Arena

Originally posted on PH Bytes:
You can reach us here Knit Arena

General Discussions

M/M/1 Queue

Queueing theory provides a mathematical basis for understanding and predicting the behavior of communication networks. Basic Model: We can understand above model with below mentioned parameters: Inter-arrival time distribution Service time distribution Number of servers Queueing disciplines Number of buffers Common Notion: A/B/m Where: ‘m’ is the number of servers A and B can be… Continue reading M/M/1 Queue

General Discussions

Tests

Originally posted on PH Bytes:
PH Bytes View original post

General Discussions

Stack and Heap Memory

Stack Memory Heap Memory Memory allocated is in LIFO fashion No specific order. Is random. Allocation and de-allocation of memory is automatic Allocation and de-allocation of memory is manual Locality of reference is excellent Locality of reference is adequate Memory allocated is of fixed size and is not flexible Resizing is possible Space is efficiently… Continue reading Stack and Heap Memory

General Discussions

Singly/Doubly Linked Lists

Singly Linked List Doubly Linked List Node has data and next pointer Node has data and (next + previous) pointers Allows one way traversal of list Allows two way traversal of list Less memory per node More memory per node Can be used when memory needs to be saved and search is not required Can… Continue reading Singly/Doubly Linked Lists