Category: c

Tree Slide for Data Structure And Algorithm

Topics Covered

  1. Concept and Definition
  2. Binary Tree
  3. Introduction and application
  4. Operation
  5. Types of Binary Tree
    1. Complete
    2. Strictly
    3. Almost Complete
  6. Huffman algorithm
  7. Binary Search Tree
    1. Insertion
    2. Deletion
    3. Searching
  8. Tree Traversal
    1. Pre-order traversal
    2. In-order traversal
    3. Post-order traversal

I’ve prepared a slide for Tree chapter 6 for Data Structure and Algorithm. Please do check and for further queries please leave a comment below

Tree – Data Structure from Ashim Lamichhane

Priority queue

A priority queue is a collection of elements such that each element has been assigned a priority and the order in which elements are deleted and processed comes from the following rules:

  • An element of higher priority is processed before any element of lower priority.
  • If two elements has same priority then they are processed according to the order in which they were added to the queue.

The best application of priority queue is observed in CPU scheduling.

  • The jobs which have higher priority are processed first.
  • If the priority of two jobs is same this jobs are processed according to their
    position in queue.
  • A short job is given higher priority over the longer one.

Continue reading “Priority queue”

Bsc CSIT C programming Course Material

So I’ve made some lecture slides and programs and made it all publicly available and kept in github  The syllabus is written on markdown file so any one can copy the raw version of it.
Anyone can contribute to this project. All the students can get rich course material in this repository.

Course Synopsis: This course contains the concepts of programming methodology using C. Goal: This course is designed to familiarize students to the techniques of programming in C.

Continue reading “Bsc CSIT C programming Course Material”