Miss Universe Malaysia 2014

Miss Universe Malaysia 2014 was the 52nd edition of the Miss Universe Malaysia pageant which was held at the Setia City Convention Centre on December 19, 2013 where the current winner Carey Ng was crowned her successor Sabrina Benett from Perak. All seventeen contestants from different states will compete for the crown. Sabrina was represented Malaysia at the Miss Universe 2014.[2]

Miss Universe Malaysia 2014
Date19 December 2013
PresentersJason Godfrey • Sarimah Ibrahim • Ben Ibrahim[1]
EntertainmentNatalia Tang Ling • Z Chen • Benjamin Toong
VenueSetia City Convention Centre, Shah Alam, Malaysia
Entrants19
Placements10
WinnerSabrina Beneett
 Perak
CongenialityLivonia Ricky
 Sarawak
PhotogenicLalitha Monisha
 Sabah

Placements

[3]

Final Results Contestants
Miss Universe Malaysia 2014
1st Runner-Up
  •  Sabah - Lalitha Monisha
2nd Runner-Up
3rd Runner-Up
4th Runner-Up
Top 10

Special awards

[4]

Awards Contestants
Miss Radiant Skin
Miss Elegant
Miss Best Body
Miss Photogenic
  •  Sabah - Lalitha Monisha
Miss Congeniality
Miss My Dentist Winning Smile
Malaysia Choice

Judges

[5]

  • Wan Ahmad Wan Abas
  • Reshmonu
  • Carmen Soo
  • Andrew Tan
  • Sazzy Falak
  • Dr Daniel Yap
  • Miko Au

Contestants

Official 19 Finalists of Miss Universe Malaysia 2014.[6][7][8]

No.ContestantAge Height EthnicityHometown Occupation Notes
1Cheryll Ho[9]205 ft 7 in (1.70 m)ChinesePerakPart-time Model
2Cynthia Chan[10]245 ft 7 12 in (1.71 m)ChineseMelakaCorporate Communication Executive
3Denise Th'ng[11]195 ft 7 23 in (1.72 m)ChinesePerakBusiness StudentTop 10
4Elaine Wong[12]22[5 ft 8 12 in (1.74 m)ChineseSarawakBusiness & Commerce StudentTop 10
5Foong Tsin[13]255 ft 9 12 in (1.77 m)ChineseKuala LumpurInvestment Banking ExecutiveTop 10
6Hema Gayathiry[14]235 ft 10 in (1.78 m)IndianSelangorPetroleum Engineering Student
7Jean Lim[15]235 ft 9 23 in (1.77 m)ChineseSelangorManagement & Marketing StudentTop 10
8Karina Grewal[16]255 ft 7 in (1.70 m)IndianSelangorLaw Graduate4th Runner-up
9Kausalya Ida[17]255 ft 7 in (1.70 m)IbanSarawakLaw Student2nd Runner-up
10Kim Goh[18]235 ft 7 12 in (1.71 m)ChinesePenangAccounting Student
11Lalitha Monisha[19]215 ft 10 in (1.78 m)IndianSabahLaw Graduate1st Runner-up
12Livonia Ricky Guing[20]225 ft 7 12 in (1.71 m)BidayuhSarawakCulinary Science Student
13Lyn Lim[21]245 ft 7 in (1.70 m)ChinesePenangPsychology Student3rd Runner-up
14Nicole Aldeth[22]225 ft 6 in (1.68 m)IndianSelangorCreative Design Student
15Patricia Lee[23]245 ft 5 23 in (1.67 m)ChineseNegeri SembilanMember Services Management
16Ramona Kanapathy[24]235 ft 7 12 in (1.71 m)ChindianPerakMass Communication Student
17Sabrina Beneett[25]235 ft 10 12 in (1.79 m)IndianPerakPsychology & Communication StudentWinner
18Shangkharee Nadarajan[26]235 ft 9 in (1.75 m)ChinesePenangMedical StudentTop 10
19Vivian Cheah[27]235 ft 9 12 in (1.77 m)ChineseSelangorArchitectural Designer

Crossovers

gollark: ... also array literals, bee their bad docs.
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.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.