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
(a) Describe the steps involved in the process of decision making under uncertainty. (b) Explain the following principles of decision making: (i) Laplace, (ii) Hurwicz. (c

Q. Explain quick sort? Sort the given array using quick sort method. 24 56 47 35 10 90 82 31

What is binary search?   Binary search is most useful when list is sorted. In binary search, element present in middle of the list is determined. If key (the number to search)

Worst Fit method:- In this method the system always allocate a portion of the largest free block in memory. The philosophy behind this method is that by using small number of a ve

Assume a complete binary tree T with n nodes where each node has an item (value). Label the nodes of the complete binary tree T from top to bottom & from left to right 0, 1, ..., n

A list item stores pointers and an element to predecessor and successor. We call a pointer to a list item a handle . This looks simple enough, but pointers are so powerful tha

ST AC K is explained as follows : A stack is one of the most usually used data structure. A stack is also called a Last-In-First-Out (LIFO) system, is a linear list in

Determination of Time Complexity The RAM Model The random access model (RAM) of computation was devised through John von Neumann to study algorithms. In computer science,

What is a first-in-first-out data structure ? Write algorithms to perform the following operations on it – create, insertion, deletion, for testing overflow and empty conditions.

What are the Dynamic arrays Dynamic arrays are convenient for programmers since they can never be too small-whenever more space is needed in a dynamic array, it can simply be e