Jump to content

Search the Community

Showing results for tags 'top10'.

  • Search By Tags

    Type tags separated by commas.
  • Search By Author

Content Type


Forums

  • Comment Card
    • Announcements
  • The Cafe
    • City Guide
    • IHOG: International House of Grads
    • The Lobby
  • Applying to Graduate School
    • The April 15th is this week! Freak-out forum.
    • Applications
    • Questions and Answers
    • Waiting it Out
    • Decisions, Decisions
    • The Bank
  • Grad School Life
    • Meet and Greet
    • Officially Grads
    • Coursework, Advising, and Exams
    • Research
    • Teaching
    • Writing, Presenting and Publishing
    • Jobs
  • The Menu
    • Applied Sciences & Mathematics
    • Arts
    • Humanities
    • Interdisciplinary Studies
    • Life Sciences
    • Physical Sciences
    • Professional Programs
    • Social Sciences

Find results in...

Find results that contain...


Date Created

  • Start

    End


Last Updated

  • Start

    End


Filter by number of...

Joined

  • Start

    End


Group


AIM


MSN


Website URL


ICQ


Yahoo


Jabber


Skype


Pronouns


Location


Interests


Program

Found 2 results

  1. Hey everyone here, I'll be applying to various universities this December onwards, I'll graduate next year in May. I plan to pursue a Masters degree in Statistics, and would realistically like to know my chances at one of the top 10 universities (ETH Zurich claiming top spot). Thanks! Here's my profile: Undergrad: IIT Guwahati (India) - Mechanical Engineering with a minor in Computer Science - CGPA 8.39/10 Profile: Indian, Male, 20y TOEFL: 116/120; GRE (expected): 170Q 162V 4W Relevant coursework: I have attached my course structure for MA101,102, 201 as well as the CS courses down in the attachments section since I didn't know how to filter stuff out. Here are the minor course (CSE) contents: Functions, relations, partial orders, recurrences, summations, generating functions, asymptotics Graphs: basic concepts Elementary Logic and proof techniques. Alphabets, Languages, Grammars Finite automata: regular expressions, regular languages Context free languages: pushdown automata Turing machines: recursively enumerable languages Chomsky hierarchy. Review of fundamental Data Structures Models of Computation: random access machines, space and time complexity measures, lower and upper bounds Design techniques: the greedy method, divide-and-conquer, dynamic programming, backtracking Sorting and Searching Graph algorithms Hashing: separate chaining, linear probing, quadratic probing Search Trees: binary search trees, AVL trees, B-trees NP-completeness. Boolean Algebra Minimisation and realisation of switching circuits Basic building blocks of combinational circuits: Multiplexer, De-multiplexer, Encoder, Decoder, Adder, Subtracter Design of synchronous sequential circuits: Flip-flops, Registers, Counters, Finite State Machines, State tables and diagrams, Excitation functions of memory elements.Instruction sets with various addressing modes Memory organisation: ROM, Cache, Main Memory CPU design: ALU, Control unit design: hardwired and microprogrammed I/O transfer: Program controlled, Interrupt controlled and DMA. Introduction to structure and organization of computer systems, operating systems, and networks Processes and threads and their scheduling, synchronization, deadlocks in concurrent processes Memory management basics, demand paging and virtual memory implementation File system design and implementation.Basics of digital communication, digital transmission of data, modulation Multiplexing Data link control with sliding window protocols, error control Local area networks, Ethernet, wireless networks Concepts of switched networks Internet addressing and routing algorithms Transport protocols, UDP, TCP, flow control, congestion control Application layer protocols such as DNS, SSL, Web. Introduction: software engineering principles, life cycle Requirement specification: styles, operational and descriptive Design: a brief concept on objects, data abstraction,inheritance, polymorphism, data encapsulation, software design using functional andobject oriented approaches, architectural, component-level and user interface design Brief introduction on database system (specially SQL, MySQL) Verification: testing, validation Software reuse: design patterns Software management Software Modeling: UML. Research experience: None, haven't released a paper in my undergraduate studies. This might be the weakest point on my profile along with the subpar CGPA (I think). Letters of recommendation: I'll probably get good letters from my BTech dissertation supervisor (reinforcement learning) and I have a good one from a company I interned at this summer (neural networks). Other than that I'll be able to get one from the Mech Dept professors. What do you guys think? Please let me know if I haven't mentioned anything important, I tried being as clear and open about it as possible. Thank you! ❤️ CS101.pdf CS110.pdf MA101.pdf MA102.pdf MA201.pdf
  2. I just got my GRE scores: AW 4.5, V 170, Q 170. I feel a bit bad about my writing score. The other two measures are great obviously, and the V much better than I expected. I will apply for a Econ PhD this fall, and aim at the top 10-15. I know it's tough to get accepted, but my GPA is strong and so are my letters. I'm only concerned about my writing score. Do you think I should retake the GRE? By doing so I'll most likely spoil my perfect scores in the other two sections. Fyi: I'm an international applicant. Not sure if this makes any difference...
×
×
  • Create New...

Important Information

By using this site, you agree to our Terms of Use and Privacy Policy.