Type of qualitative method, Data Structure & Algorithms

Type of Qualitative Method:

Different  qualitative methods are suitable for different  types of study. Quite often we can  combine  qualitative and quantitative  methods. Many scholars claim that the two  approaches are complementary and cannot be used  in isolation from each other. According  to this  view no method is  entirely  qualitative or quantitative. However the  techniques  can be either quantitative or qualitative. Figure below illustrates this points further.

1785_Type of Qualitative Method.png

As we can  see in figure the methods  from left to right  become more  quantitative and  use more quantitative  techniques. Historical review group discussions and case studies are mostly qualitative  research methods. These  qualitative methods use relatively more  qualitative techniques  such as conversation and  in depth semi structured interviews.

Posted Date: 2/12/2013 1:32:58 AM | Location : United States







Related Discussions:- Type of qualitative method, Assignment Help, Ask Question on Type of qualitative method, Get Answer, Expert's Help, Type of qualitative method Discussions

Write discussion on Type of qualitative method
Your posts are moderated
Related Questions
Deletion in a RBT uses two main processes, namely, Procedure 1: This is utilized to delete an element in a given Red-Black Tree. It involves the method of deletion utilized in

The Euclidean algorithm is an algorithm to decide the greatest common divisor of two positive integers. The greatest common divisor of N and M, in short GCD(M,N), is the largest in

Q. Give the algorithm for the selection sort. Describe the behaviours of selection sort when the input given is already sorted.

Prim's algorithm employs the concept of sets. Rather than processing the graph by sorted order of edges, this algorithm processes the edges within the graph randomly by building up


Records are mapped onto a computer store by simply juxtaposing their elements. The address of a component (field) r relative to the origin address of the record r is named the fiel

B i n a ry Search Algorithm is given as follows 1. if (low > high) 2.     return (-1) 3. mid = (low +high)/2; 4. if ( X = = a [mid]) 5.      return (mid); 6.

what''s queue ?

This algorithm inputs 3 numbers, every number goes through successive division by 10 until its value is less than 1. An output is produced which comprise the number input and a val

reverse the order of elements on a stack S using two additional stacks using one additional stack