- Home
- C#-UI-Automation-Tutorial
- QTP-UFT-Tutorial
- Selenium
- Algorithms-Tutorials
- Software Testing
- Agile
- Software-Metrics
- Software-Effort-Estimation
- PMP
- UnitTest-CppUnit-C++
- ALM-Quality-Center
- SQL-Database-Designing
- Contact-Us

- Binary-Search-Java
- Hashmap
- Priority-Queue-Heap
- Big-O-Notation-Tutorial
- Count-repeating-words-in-a-list-or-an-ArrayList
- Fibonnaci-algorithm-java
- Determining-a-Prime-Number-in-Java
- Tree-Traversal-Add-Node
- Tree-Traversal-Java-In-Order
- Tree-Traversal-Java-Post-Order
- Tree-traversal-In-Java-Pre-Order
- Tree-Traversal-In-Java-Find-a-Node
- Bubble-Sort-Java
- Bubble-Sort
- Quick-Sort
- Sorted-Array-Common-Elements
- Uncommon-Elements-two-array
- No-Duplicate-Array-Java
- Reverse-Characters-Array
- Array-Common-elements-using-hash-map-single-pass
- Find-Duplicates-in-array
- Find-multiple-duplicates-in-an-array
- Create-a-linkedlist-inJava
- linkedlist-find-a-node
- LinkedList-DeleteNode-Java
- Linked-List-Remove-Duplicates
- Find-Node-From-End-of-a-Linked-List
- Reverse-Linked-List-Java
- Linked-List-Check-Palindrome
- Merge-two-linkedList-Java
- Insertion-Sort-Linked-List-Java
- Find-middle-of-linked-list-in-single-pass

A **priority queue** is a data structure in which ** items having highest priority are at the front of the queue** and items having lowest priority are at the back of the queue.

For example, say there is a software defect fixing process. The defect having the highest priority would be picked and fixed first.

In a **normal queue**, normally the first defect that would be entered would the one that would be picked for fixing (FIFO , first in first out , like cinema hall queue).

However, in Priority queue , the defect having highest priority would be picked.This is HPFO or Highest priority first out

In a queue of 11, 21, 55, 3, 88, 32 ,99 highest priority would be of 3 and it would leave first

**How is this implemented ?**

Priority queues are implemented using a data structure called a **Heap**

In a heap , each node has a value and two child nodes .

**The properties of a heap are:**

**Heap Property:** Value of a node is smaller than the children nodes

**Shape Property:** All levels of a heap is full, but for the last level. The last level is filled from left going to right.

**The Queue Property:** Elements can only be removed at the root node**The operations supported in a priority queue** are: *insert, find minimum , find maximum, delete minimum , delete maximum*

- Test Design Techniques
- Cause and Effect diagram
- State Transition Diagram
- Decision Tables
- Equivalence Partition
- Pairwise & Orthogonal Array Testing Tutorial
- Boundary Value
- All Pairs and Combinatorial testing

**QTP-UFT-Tutorial**

QTP-Keyword-View

Spy Tool

QTP-UFT-Object-Repository

QTP / UFT Automation Framework

Part 1

Part 2

Part 3

Part4

Part 5

Part 6

Part 7

- Using CppUnit for C++ Unit Testing
**Metrics**

Requirement churn metrics

Estimation Churn metrics

Defects per KLOC

Cyclomatic Complexity of Code metrics

CCCC tool for calculating Cyclomatic ComplexityDefect removal efficiency (DRE) metrics

Fault Density metrics

Defect Density Metrics

Copyright QA Friend Software Testing. All rights reserved.