How to Increase Your Power Base ?

Power is often defined as “the ability to control the choices which are made by others”. This definition is very accurate, because if you are able to do this, there are few limits to the things you can accomplish in this world. In today’s world, while the word “power” has become synonymous with greed, evil, or unjust control, the truth of the matter is that all of us want to increase our own personal power base. Indeed, increasing your own power base allows you to be less susceptible to others… Read More

How to Gain Skills to Influence people ?

Being able to influence people is not only an important part of management, but it is also an important part of being a leader. It is very difficult to manage or lead others if you are incapable of influencing them.  Skilled managers are adept at using a number of tactics to influence others. One of the tactics which they make use of is being able to reason with their staff, as well as their superiors. Additionally,  managers and leaders also use pressure tactics in order to influence those beneath them.… Read More

Multiple Intelligences – Gardner’s Theory

There are a number of theories for learning which have been developed over the course of the last 30 years. One of the most interesting of these theories is the multiple intelligence theory. This is a theory which was developed by Howard Gardner in 1983, and it basically deals with numerous aspects of developmental psychology, as well as cognitive psychology. Gardner spent a great deal of time interviewing many individuals, and they ranged from people who had suffered from strokes to geniuses, and those who were considered to be autistic.… Read More

Do you have the skills needed to influence ?

Before you begin to influence others, it is very important to know you strengths and weaknesses. Your greatest enemy is often the person you see when you stare into a mirror. By being aware of your own strengths and weaknesses, you have the foundation which can allow you to reach the heights of power. When you are aware of what you can and cannot do, you are less likely to overextend yourself.  One factor that separates successful people from those who are unsuccessful is that successful people have a deep… Read More

Why You Need Influence Skills ?

Influence is a type of persuasion. Often people are affected by other’s behavior, words, actions and presence to a certain degree. Thoughts and actions of people can be controlled or even altered by influencing them. An example of one of the most common types of influence is the peer pressure. With peer pressure, an individual will be convinced to carry out actions that are chosen by his peers even though he may not like, he will still do it because he feels such actions are necessary for maintaining a good… Read More

C Algorithms – Dijkstra’s Algorithm

This algorithm is a graph search algorithm that solves the shortest path problem for a graph. In the graph, the path between vertices has a cost or a length, so Dijkstra’s algorithm simply determines the path with the lowest cost between a vertex and another. The algorithm ends when the shortest path from a vertex to a destination vertex was discovered. How it works: 1) First thing to do is to set the distance value, which is 0 for the current node and infinity for the rest. 2) Set all… Read More

C Algorithms – Breadth-First Search (BFS)

Depth-first search (DFS) and breadth-first search (BFS) are two algorithms for traversing a graph. A breadth-first search (BFS) begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal. Example: In the case of BFS: If for DFS the traversal would be A, B, E, F, C, D, in the case of BFS it would be A, B, C, D, E, F. he BFS visits the nodes level by… Read More

C Algorithms – Depth-First Search (DFS)

Depth-first search (DFS) and breadth-first search (BFS) are two algorithms for traversing a graph. Graph traversal refers to the problem of visiting all the nodes in a graph in a particular manner. Each node may have to be visited more than once, and a root-like node that connects to all other nodes might not exist. Let us start first with DFS. DFS A Depth-first search (DFS) is a technique for traversing a finite undirected graph. DFS visits the child nodes before visiting the sibling nodes, that is, it traverses the… Read More

C Algorithms – Topological Sort

Let us say that the order relation that was defined the in introduction lesson was a partial one, for example: a1 < a0, a1 < a2 < a3. The problem is to determine a list of order, in which if ai < aj then ai will come before aj in the final sorted list . For example, our list could be : a1, a0, a2, a3 or a1, a2, a0, a3 or a1, a2, a3, a0 Any partial ordered list can be sorted topological. For a graph, a topological sort… Read More

C Algorithms – Graph Theory

The graph theory refers to the study of graphs. A graph is a mathematical object that captures the notion of connection. For example, you want to connect two or more dots that could be considered a graph. Leonhard Euler is the inventor of graph theory, as he tried to solve the known problem of the Seven Bridges of Konigsberg.The townspeople supposedly posed the question “Is it possible to take a walk through town, crossing each of the seven bridges just once, and ending up wherever you started?”A representation of the… Read More

C Algorithms – Gnome Sort

Gnome sort is an extremely simple sorting algorithm, very similar to insertion sort. Also, it is another comparison and exchange sort. You could say that it looks like bubble sort, and you would be right. How it works: In gnome sort, two adjacent elements are compared, and if they are in the wrong order, they are swapped. The comparison continues with the next element, and the same condition is checked, but the order is wrong, a swap takes place, and after the swap, the lower element is now compared to… Read More

C Algorithms – Comb Sort

Comb sort is a simple sorting algorithm which improves on bubble sort. The main idea for this type of algorithm is to eliminate the small values near the end of the list, as these slow down the sorting process. How it works: In comb sort, the main usage is of gaps. For example, in bubble sort the gap between two elements was 1 whilst here the gap starts out as a large value and shrinks until it reaches the value 1, when it practically becomes bubble sort. The shrink factor… Read More

C Algorithms – Bucket Sort

Bucket sort is a sorting algorithm that works by inserting the elements of the sorting array intro buckets, then, each bucket is sorted individually. The idea behind bucket sort is that if we know the range of our elements to be sorted, we can set up buckets for each possible element, and just toss elements into their corresponding buckets. We then empty the buckets in order, and the result is a sorted list. It is similar to radix sort. How it works: Initially we have to set up an array… Read More

C Algorithms – Quick Sort

Quick sort is a comparison sort developed by Tony Hoare. Also, like merge sort, it is a divide and conquer algorithm, and just like merge sort, it uses recursion to sort the lists. It uses a pivot chosen by the programmer, and passes through the sorting list and on a certain condition, it sorts the data set. How it works: A pivot is chosen from the elements of the data set. The list must be reordered in such a way that the elements with the value less than the pivot… Read More

What is Exploratory Testing

Is exploratory testing similar to an ad-hoc test or monkey testing?  Among software testers, there is admittedly, still some confusion with regard to the term "exploratory testing".  The confusions lie in its technicalities; An exploratory test is almost similar to monkey testing or an ad-hoc testing and these 3 testing methods are unscripted in their nature. The term ‘exploratory testing’ was first publicly used by Cem Kaner in the book “Testing Computer Software”. Another known pioneer of exploratory testing is James Bach.  The definition provided by Bach states that, “Any… Read More

C Algorithms – Merge Sort

Merge sort is another comparison based sorting algorithm. Also, it is a divide and conquer algorithm, which means the problem is split into multiple simplest problems and the final solution is represented by putting together all the solutions. How it works: The algorithm divides the unsorted list into two sub-lists of about half the size. Then sort each sub-list recursively by re-applying the merge sort and then merge the two sub-lists into one sorted list. Step by step example : Having the following list, let’s try to use merge sort… Read More

C Algorithms – Counting Sort

Counting sort is a sorting algorithm that is not based on comparison like most other methods. This method of sorting is used when all elements to be sorted fall in a known, finite and reasonably small range. How it works: The algorithm refers to finding for each element a[i] the number of elements from the array that are lower than it. Step by step example : Having the following list, let;s try to use counting sort to arrange the numbers from lowest to greatest: Unsorted list, the array A contains… Read More

C Algorithms – Heap Sort

Heapsort is a comparison based algorithm. It bases on building a heap tree from the data set, and then it removes the greatest element from the tree and adds it to the end of the sorted list. There are two ways to do this, either to add the highest value to the root of the tree, or as one of the left/right child with the greatest depth. How it works: The heap tree is built according to the data set. Then the greatest value is move to the root of… Read More

C Algorithms – Selection Sort

Selection sort, also called naive (selection) sort, is an in-place comparison sort. It may look pretty similar to insertion sort, but it performs worse. It is a quite simple sorting algorithm, and may perform better than more complicated algorithms in particular cases, for example in the ones where the auxiliary memory is limited. How it works: First it finds the smallest number in the array and exchanges it with the element from the first position, then it finds the second smallest number and exchanges it with the element from the… Read More

C Algorithms – Radix Sort

Radix sort is a sorting algorithm that sorts the data, integers for example, by splitting the numbers into individual digits and comparing the individual digits sharing the same significant position. Also, a positional notation is required, because instead of integers there could be strings of characters or floating point numbers. The radix sort can be classified into 2 types: LSD (least significant digit) or MSD (most significant digit). The LSD sorting type begins from the least significant digit to the most significant digit and the MSD works the other way… Read More

C Algorithms – Shell Sort

Shell sort is a generalization of the Insertion Sort, it sorts subsequences that become increasingly higher, until it is reached the value n – the total number of elements. Each subsequence i is determined by a number h_i called increment. Also, the increments must satisfy the following condition: h_t > h_t-1 > h_t-2 > … > h_2 > h_1 Step by step example : Having the following list, let’s try to use shell sort to arrange the numbers from lowest to greatest: Unsorted list: 16, 4, 3, 13, 5, 6,… Read More

C Algorithms – Insertion Sort

Insertion sort is a simple comparison sorting algorithm, that considers at a step k, the elements of the array A[0,k-1] are already sorted out, and the element on the k position will be inserted that way that after the insertion, the elements A[0,k] are sorted out. Inserting the k element in the A[0,k-1] sequence requires a few steps: the element must be retained in a temporal variable; moving all the elements from the A[0,k-1] array that are greater than A[k] with a position to the right (this presumes a run… Read More

C Algorithms – Bubble Sort

Bubble sort is a simple sorting algorithm, which compares repeatedly each pair of adjacent items and swaps them if they are in the incorrect order. At the first run, the highest element of the list ends on the last place of the sorted list, and then, at the following run, the next highest element ends on one position lower than the previous element and so on. The initial list is finally sorted, when at a run, no swaps occur. Even though it’s one of the simplest sorting algorithms, it’s almost… Read More

C Algorithms – The Problem of Sorting the Elements

In this tutorial, I will talk a little about the classification, stability and complexity of each algorithm, more regarding this you can read a little bit lower of this article. Then, the advantages or disadvantages of each algorithm are shown, which should give you the big picture of each algorithm. In the end there is a conclusion to sum things up or maybe to emphasis certain things. Sorting the elements is an operation that is encountered very often in the solving of problems. For this reason, it is important for… Read More

How to Close a Project Properly

Properly closing a given project is very similar to many of the other processes which are commonly associated with project management. The reason I say this is because there are both outputs and inputs which are connected to the closing of the project, along with the tools and methods which are used to make sure it is done smoothly. Ending a Project Properly There are a number of inputs which are used in the closing of a project, and most of these inputs are utilized for the purpose of validating… Read More

Using the Gantt Chart for Project Management

What is the Gantt Chart? The Gantt Chart is basically a bar chart which is used in the field of project management for showcasing the project management schedule. A Gantt chart will generally showcase both the starting date for a project, as well as the end date, and it will also feature various elements which are connected to the project. Terminal elements typically featured on the Gantt chart, and summary elements may be added as well. These two elements are responsible for comprising the work breakdown structure for the project.… Read More

Software for Project Management

There are a variety of different software programs that are used in the field of project management, and they often fall under different categories. For example, some of the software which project managers and their teams may use include budget management software, scheduling software, and resource allocation software. These are just a few of the different software types which are used, and they are most often useful when it comes to handling large projects which are very complex. While project management software packages carry out a variety of different tasks,… Read More

Work Breakdown Structure (WBS)

No matter how well the PM plans out their project, in most situations, things will not go exactly as planned. The entire project team must take the time to develop the plan, and this task should not simply be left up to the project manager. What this ensures is that the experience of the entire team should always be considered, and each person must be committed and feel as though they have an ownership in the project. Having said that, one thing that good project teams should always consider developing… Read More