Sardar Ahmad
Sardar Ahmad is a Pakistani politician who was a member of the Provincial Assembly of Sindh from May 2013 to May 2018.
Sardar Ahmad | |
---|---|
Member of the Provincial Assembly of Sindh | |
In office 29 May 2013 – 28 May 2018 | |
Personal details | |
Born | Ajmer, India | 9 November 1933
Nationality | Pakistani |
Political party | Mutahida Quami Movement |
Early life and education
He was born on 9 November 1933 in Ajmer, India.[1]
He has a degree of Bachelor of Arts and a degree of Master of Arts from Sindh University.[1]
Political career
He was elected to the Provincial Assembly of Sindh as a candidate of Mutahida Quami Movement from Constituency PS-124 KARACHI-XXXVI in 2013 Pakistani general election.[2]
gollark: Of course.
gollark: I'm not entirely sure how, but it seems to construct a tree/maybe deterministic finite automaton/finite state machine/I don't know theoretical CS which matches anagrams and unmatches unanagrams.
gollark: ```pythonimport collectionsdef do_thing(s): if len(s) == 1: return { s[0]: True } out = {} for i, c in enumerate(s): without = s[:i] + s[i + 1:] things = do_thing(without) out[c] = things return outdef match(r, s): print(r) c = r for i, x in enumerate(s): print(x) try: c = c[x] if c == True: if i + 1 == len(s): return True # full match else: return False # characters remain except KeyError: return False # no match return False # incomplete matchentry = lambda a, b: match(do_thing(a.lower().replace(" ", "")), b.lower().replace(" ", ""))```Here is my entry (pending a port to osmarkslisp™️). This is definitely my entry.
gollark: I wish to use Mathematica in my code. Please install it. DO NOT READ, ubq.
gollark: I have a "great" way to do this which I think takes O(n²) space-time-beeite.
References
- "Welcome to the Website of Provincial Assembly of Sindh". www.pas.gov.pk. Retrieved 15 January 2018.
- "2013 Sindh Assembly election result" (PDF). ECP. Archived (PDF) from the original on 28 January 2018. Retrieved 28 January 2018.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.