Show Posts

This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.


Messages - mnsalim

Pages: 1 [2] 3 4 5
16
Faculty Sections / Re: Google unveils Nexus 4 phone wireless charger
« on: February 17, 2019, 03:36:10 PM »
Thank you very much for such an informative post. :)

17
Thank you very much for such an informative post. :)

18
Thank you very much for such an informative post. :)

19
Science and Information / Re: Global Temperatures Highest in 4000 Years
« on: February 17, 2019, 03:35:41 PM »
Thank you very much for such an informative post. :)

20
Thank you very much for such an informative post. :)

21
Thank you very much for such an informative post. :)

22
Thank you very much for such an informative post. :)

23
Thank you very much for such an informative post. :)

24
Thank you very much for such an informative post. :)

25
Thank you very much for such an informative post. :)

26
Thank you very much for such an informative post. :)

27
Thank you very much for such an informative post. :)

28
Thank you very much for such an informative post. :)

29
Teaching & Research Forum / Section/Group Creation in Moodle
« on: September 18, 2018, 06:43:21 PM »
Here is how you can create sections under a course:
From the left side panel on your dashboard go to

Menu-> My Courses -> Select your course->
Then go to

Participants -> Click on right side settings icon -> Groups -> In the bottom create groups.

You can create groups in two way: manually or automatic

If you face any problem then let me know.

30
Hal Burch conducted an analysis over spring break of 1999 and made an amazing discovery: there are only 16 types of programming contest problems! Furthermore, the top several comprise almost 80% of the problems seen at the IOI. Here they are:
Dynamic Programming
Greedy
Complete Search
Flood Fill
Shortest Path
Recursive Search Techniques
Minimum Spanning Tree
Knapsack
Computational Geometry
Network Flow
Eulerian Path
Two-Dimensional Convex Hull
BigNums
Heuristic Search
Approximate Search
Ad Hoc Problems
The most challenging problems are Combination Problems which involve a loop (combinations, subsets, etc.) around one of the above algorithms - or even a loop of one algorithm with another inside it. These seem extraordinarily tricky to get right, even though conceptually they are ``obvious''.

Pages: 1 [2] 3 4 5