Search or add a thesis

Advanced Search (Beta)
Home > Evolution of Education in Hunza, the Northern Areas of Pakistan: Views of Early Teachers of Hunza

Evolution of Education in Hunza, the Northern Areas of Pakistan: Views of Early Teachers of Hunza

Thesis Info

Author

Nazar, Aafiyat

Department

Institute for Educational Development, Karachi

Program

MEd

Institute

Aga Khan University

Institute Type

Private

City

Karachi

Province

Sindh

Country

Pakistan

Thesis Completing Year

2009

Thesis Completion Status

Completed

Subject

Education

Language

English

Added

2021-02-17 19:49:13

Modified

2024-03-24 20:25:49

ARI ID

1676727903084

Similar


This qualitative oral history study examines the views of twelve early teachers (who taught between 1945-1960) about the evolution of education in the semi-autonomous state of Hunza. The British Indian government founded a primary school in the state around 1912, while 17 Diamond Jubilee Schools were established in 1946 under the guidance and funding provided by Aga Khan III, the spiritual leader of Shia Imami Ismaili Muslims. This study sought to answer the question: How do the early teachers view evolution of education around the establishment of Diamond Jubilee Schools in Hunza? The findings revealed that prior to the establishment of formal school in Hunza, Khalifas traveled far and wide for religious education, which remained in their limited circle. During 1912-1945, teachers and children from influential families continued education in the first primary school. The period witnessed resistance to education due to various reasons and endeavours for mass education continued. The establishment of single-teacher DJ primary schools with grade 5 and below levels of teachers' education laid the foundation for mass education. The students in these shelter less and mobile schools shared the few books that schools had. Confusion about the value of education vis-a-vis subsistence economy (agriculture), anxiety due to various assumptions and poverty among the masses and ruling circles added to the challenges of low provisions for the schools. While subtle resistance continued, the communities contributed to the education by providing the schools with temporary base, constructing a few buildings and accommodating teachers. The teachers taught students to use local materials such as rocks and grass to facilitate the learning process. Education enabled some of the people to avail better opportunities in the teaching and army; resultantly, their views started changing. The study suggests undertaking similar studies in other contexts and search lessons that may be adapted for the future.
Loading...
Loading...

Similar Books

Loading...

Similar Chapters

Loading...

Similar News

Loading...

Similar Articles

Loading...

Similar Article Headings

Loading...

سفر ہے شرط۔۔۔

سفر ہے شرط۔۔۔۔

                                                                                                ڈاکٹرعارف حسین عارفؔ

دنیا کی سیر کرنا ، آنکھوں سے دیکھنا اور لفظوں میں دکھانا سب مختلف ہنر ہیں۔ جو شخص دنیا کی سیر کا حوصلہ رکھتا ہے وہ اپنی آنکھیں اور دل کھلا رکھے اور قلم رواں رکھے تو اس کا سفر نہ صرف اپنا سفر رہ جاتا ہے بلکہ وہ اپنے ساتھ ساتھ دوسروں کو بھی ،جو کبھی قیدِ مقام سے نہیں گزرے، اپنے ساتھ ساتھ لیے پھرتا ہے۔ سفر نامہ نگار کی یہی خوبی ہوتی ہے کہ وہ ایک افسانوی فضا قائم کر تے ہوئے داستانوی ماحول بناتے ہوئے ، قاری کو اس طرح اپنی گرفت میں لیتا ہے کہ اُس کے ذہن کی سکرین پر وہ تمام مناظر اپنا عکس لیے ساتھ ساتھ چلتے جاتے ہیں۔

ڈاکٹر الطاف یوسف زئی کا سفر نامہ’’ نیل کے سنگ‘‘ اس لحاظ سے ایک منفرد سفر نامہ ہے کہ جس میں داستانوی عنصر بھی پایا جاتا ہے اور افسانے کا اختصار بھی۔ انھوں نے چند صفحات میں ہی مصر کی ایسی سیر کرادی ہے کہ جو آدمی ایک مہینہ میں بھی شاید نہ کر سکتا ہو۔ تاریخ کی بھاری بھرکم کتابوں کو ہاتھ لگانے سے ڈر لگتا ہے اور پھر ان کا اسلوب بھی اتنا دل خراش ہوتا ہے کہ ایک آدھ صفحے کے بعد کتاب کو طاق پہ سجا دینا ہی مناسب لگتا ہے مگر الطاف صاحب نے سفرنامے کو اس طرح خوبصورت اسلوب اور دل کش پیرائے سے مزین کیا ہے کہ قاری ساتھ ساتھ سفر کرتا چلا جاتا ہے۔ سب سے بڑھ کر ان کے اسلوب میں جو بر محل اشعار اور احادیث اور اسلامی روایات کا استعمال ہے وہ ان کی علمیت کی خبر بھی دیتا ہے اور ساتھ ہی قاری کو ایک اسلامی اور ادبی روایت سے بھی...

Impact of Marketing Leadership Effectiveness on Change Management in Manufacturing Sector of Pakistan

The major theme of this paper is exploration of new dimensions of marketing leadership effectiveness. These dimensions are discussed in theoretical perspective but the main contribution of this research is their empirical testing. The four intellects namely business, spiritual, emotional as well as political intelligence of marketing leaders are taken for measuring marketing leadership effectiveness and their impact on change management is analysed. The data was collected from manufacturing sector of Pakistan from the marketing leaders who are involved in the process of change management through purposive sampling technique. The sample size for current study was 200. Reliability of items is checked through Cronbach’s Alpha test. Results of correlation and regression analysis of study found positive and it is concluded that four selected intellects can act as measures of marketing leadership effectiveness which help in managing change successfully in organizations. This research has significant implications for industry experts as they can judge the ability of marketing managers while assigning them leadership role after measuring the four intellects as proposed in this research. For academia point of view, researchers who are interested to measure marketing leadership effectiveness can gain insight from present research.

Distinguishability Parameters in Graphs

The idea of “distinguishing the vertices of a graph from one another” goes back to the work by Entringer and Gassman [36] and Sumner [81], where the authors posed a problem: which graphs have property that “there is one-to-one correspondence between vertices and their neighbourhoods”. The vertices of such graphs can be distinguished by their neighbourhoods. The idea has demonstrated its fundamental nature through a wide variety of applications associated to graphs in theory of networks, communication, robot navigation, programming a robot in manipulating objects to name a few. Later work on distinguishability parameters of graphs has used ideas different from the work of Sumner. The following approaches to the problem have found more attention than others. In the distance-based approach, each vertex of a connected graph Γ is distinguished from every other vertex of Γ by labeling a subset M of V (Γ) and using the distances between the vertices of Γ and those of M to construct a one-to-one function on V (Γ). The minimum cardinality of set M is called the metric dimension of Γ. In the symmetry breaking approach, we choose a set of vertices of Γ which has only the trivial automorphism in its stabilizer (only the trivial automorphism fixes the vertices in S). Another idea in symmetry breaking approach is that we choose a set D of vertices and color them with the minimum number of colors. In both of the ideas, the automorphism group of graph Γ is destroyed and we are assured that every vertex of graph can be distinguished. The minimum cardinality of set S is called the fixing number of Γ and the minimum number of colors required to color the vertices of set D is called the distinguishing number of Γ. In the location-domination approach, we choose a dominating set L of a graph Γ such that every vertex of Γ outside the dominating set is uniquely distinguished by its neighborhood within the dominating set. In the covering code approach, we find a set of vertices whose neighborhoods uniquely overlap at any vertex of graph Γ. The brief details of our contributions to this area are as follows: We define a new distinguishability parameter ‘fixed number’ of graphs that gives us the minimum number of vertices with random choice such that fixing those vertices destroys the automorphism group of the graph. We extend the study of weak total resolving set, weak total metric dimension and weak total resolving number of graphs. We also study well-known distinguishingability parameters locating-dominating sets for functigraphs and locating-dominating sets, identifying codes and distinguishing number for non-zero component graphs associated to finite vector space. A set of vertices S of a graph Γ is called a fixing set of Γ, if only the trivial automorphism of Γ fixes every vertex in S. The fixing number of a graph is the smallest cardinality of a fixing set. The fixed number of a graph Γ is the minimum number γ, such that every subset of vertices of Γ with cardinality γ is a fixing set of Γ. A graph Γ is called a γ-fixed graph, if its fixing number and fixed number are both γ. We study the fixed number of a graph and give a construction of a graph of higher fixed number from a graph of lower fixed number. We find bound on γ in terms of the diameter of a distance-transitive γ-fixed graph. A resolving set of vertices M ⊆ V (Γ) is called a weak total resolving set of Γ, if for each vertex σ ∈ M (symbols σ, ρ are used to represent the vertices of a graph) and for each ρ ∈ V (Γ) \ M, there is one element in M \ {σ} that resolves σ and ρ. The smallest cardinality of a weak total resolving set is called the weak total metric dimension of Γ. In this thesis, we extend the study of weak total resolving sets. We give some characterization and realization results on weak total metric dimension and weak total resolving number. We find weak total metric dimension of tree graph. We also define randomly weak total γ-dimensional graph and study its properties. We find weak total resolving sets and weak total metric dimension of functigraphs of some families of graphs. A subset L of the vertices of a graph Γ is called a locating-dominating set of Γ if for every two distinct vertices σ, ρ ∈ V (Γ) \ L, we have ∅ 6= NΓ(σ) ∩ L 6= NΓ(ρ) ∩ L 6= ∅. The location-domination number of Γ is the minimum cardinality of a locating-dominating set in Γ. Let Γ1 and Γ2 be the disjoint copies of a graph Γ and η : V (Γ1) → V (Γ2) be a function. A functigraph FΓ η consists of vertex set V (Γ1) ∪ V (Γ2) and edge set E(Γ1) ∪ E(Γ2) ∪ {σρ : ρ = η(σ)}. We study the variation of location-domination number in passing from Γ to FΓ η and find its sharp lower and upper bounds. We also study the location-domination number of functigraphs of complete graphs for all possible definitions of function η. We also obtain the location-domination number of functigraphs of a family of spanning subgraphs of complete graphs. We investigate the problem of covering the vertices of non-zero component graphs associated to finite vector spaces as introduced by Das [33], such that we can uniquely identify any vertex by examining the vertices that cover it. We use locating-dominating sets and identifying codes, which are closely related concepts for this purpose. We find the location-domination number and the identifying number of the graph and study the exchange property for locatingdominating sets and identifying codes. We extend the study of properties of automorphisms of non-zero component graphs associated to finite vector spaces. We prove that the symmetric group of basis vectors is isomorphic to the automorphism group of the graph. We find the distinguishing number of the graph for both of the cases, when number of field elements are 2 and more than 2.