Sultana Yesmin

Sultana Yesmin Boishakhi (Bengali: সুলতানা ইয়াসমিন বৈশাখী) (born: 13 August 1989) is a Bangladeshi cricketer who plays for the Bangladesh national women's cricket team.[1][2][3] She is a wicketkeeper and right-handed batsman. At club and division level she has played for the Khulna Division Women.[4]

Sultana Yesmin
Personal information
Full nameSultana Yesmin Boishakhi
Born (1989-08-13) 13 August 1989
Bangladesh
BattingRight-hand bat
RoleWicket-keeper
International information
National side
ODI debut (cap 11)26 November 2011 v Ireland
Last ODI24 September 2013 v South Africa
T20I debut (cap 20)5 April 2013 v India
Career statistics
Competition WODI WT20I
Matches 6 1
Runs scored 17
Batting average 3.40
100s/50s 0/0 0/0
Top score 11
Balls bowled
Wickets
Bowling average
5 wickets in innings
10 wickets in match
Best bowling
Catches/stumpings 4/5 0/–
Source: ESPN Cricinfo, 10 February 2014

Early life and background

Yesmin was born on August 13, 1989 in Bangladesh.

Career

ODI career

Yesmin made her ODI career against the Ireland women's cricket team on November 26, 2011.

T20I career

Yesmin made her T20I career against the India women's cricket team on April 5, 2013.

Asian games

Yesmin was a member of the team that won a silver medal in cricket against the China national women's cricket team at the 2010 Asian Games in Guangzhou, China.[5][6]

Sultana Yesmin
Medal record
Women's Cricket
Representing  Bangladesh
Asian Games
2010 GuangzhouTeam
gollark: Please also give me write access to the repo.
gollark: Oh, right, array indexing.
gollark: ```python# parsita-based pseudocode syntax parserfrom stmt import *from parsita import *from parsita.util import constantdef compose(f, g): return lambda x: f(g(x))def map_expr(x): start, end = x if end == "": return start return Op([start, end[1]], end[0])def map_unop_expr(x): return Op(x[1], x[0])def aliases(name, aliases): p = lit(name) for alias in aliases: p |= (lit(alias) > (lambda _: name)) return pclass ExprParser(TextParsers): ε = lit("") IntLit = reg("\-?[0-9]+") > compose(IntLit, int) StrLit = "'" >> reg("[^']*") << "'" > StrLit # TODO escapes (not in "spec" but could be needed) FloatLit = reg("\-?[0-9]+\.[0-9]+") > compose(FloatLit, float) Identifier = reg("[a-zA-Z_]+[a-zA-Z_0-9]*") > Var BracketedExpr = "(" >> Expr << ")" UnaryOperator = lit("NOT") Start = FloatLit | StrLit | IntLit | BracketedExpr | (UnaryOperator & Expr > map_unop_expr) | Identifier # avoid left recursion problems by not doing left recursion # AQA pseudocode does not appear to have a notion of "operator precedence", simplifying parsing logic nicely BinaryOperator = aliases("≤", ["<="]) | aliases("≠", ["!="]) | aliases("≥", [">="]) | lit("DIV") | lit("MOD") | lit("AND") | lit("OR") | reg("[+/*\-=<>]") End = (BinaryOperator & Expr) | ε Expr = (Start & End) > map_exprparse = ExprParser.Expr.parsex = parse("1+2+3 != 6 AND NOT 4 AND x + y")if isinstance(x, Failure): print(x.message)else: print(x.value)```
gollark: <@332271551481118732> Expression parsing is done, I think.
gollark: I wonder if AQA pseudocode *does* have operator precedence. We may need to harvest exam papers.

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.