The First Class' Schedule

284 views
Skip to first unread message

scrt nsit

unread,
Jun 7, 2013, 2:53:04 AM6/7/13
to scrt...@googlegroups.com
Hello,

The first class is scheduled for Wednesday 12/06/13. 

10:00am- 12:00 noon-
Vaibhav Mittal will hold the first technical class.

1:00pm- 3:00pm-
Sarvagya Mukhi will tell about The Royal Bank of Scotland's interview process. The Dos and Don'ts. 
We will have the first Aptitude paper and the first Case study.

for any query mail at dcut...@gmail.com

Thank You

scrt nsit

unread,
Jun 7, 2013, 3:46:04 AM6/7/13
to scrt...@googlegroups.com, scrt...@googlegroups.com

The schedule for the class is the 110 connecting block. 

siddharth rajpal

unread,
Jun 15, 2013, 10:37:55 AM6/15/13
to scrt nsit

Hello, 

The next class in on 17/6/13 at 10am, first we have Vaibhav Mittal's class followed by Anura Gupta's non-technical class. Please be on time.


Here is a summary of the class that took place on 12th June, 2013 and the references you will needing.

  • What are Algorithms?

  • The C Programming Language - Kernighan & Ritchie

  • Introduction to Algorithms - 3rd Edition - CLRS

    • First 3 chapters were covered.

    • Do read the analysis and the pseudo code from the book.

    • Do the questions in between the text and at the end of the chapter.

  • Linear Search

    • Wiki

    • C Code

    • Write linear search in recursive fashion.

  • Binary Search

    • Wiki

    • Topcoder Article

    • C Code

    • Write binary search in recursive fashion.

    • Write binary search using the inbuilt function present in the library of the programming language of your choice.

    • Modify the binary search algorithm to return the -(1 + insertion point) in case the key is not found in the array.

      • Eg. A = {1, 2, 4, 6, 7, 9, 51}, key = 8

      • key 8 is not present in the array A and should be inserted after 7 and before 9 to maintain the sorted property of the array. 

      • Hence insertion point = 5

      • Return value = -(1 + insertion point) = -(1 + 5) = -6

    • Currently the binary search algorithm returns any index pos such that A[pos] = key given duplicates in array A.

      • Modify the binary search algorithm to return the lowest index pos in case multiple key values are present in array A.

        • Eg. A = {1, 2, 4, 4, 5, 6, 6, 7, 8, 8, 8, 9, 51}, key = 8

        • Return value = 8

      • Modify the binary search algorithm to return the highest index pos in case multiple key values are present in array A.

        • Eg. A = {1, 2, 4, 4, 5, 6, 6, 7, 8, 8, 8, 9, 51}, key = 8

        • Return value = 10

  • Use Google to find more about

    • In-place sort

    • Comparison sort

    • Stable sort

    • Online/Offline 

  • Insertion Sort

  • Selection Sort

  • Bubble Sort

  • Merge Sort

  • Find out the sort library function in the programming language of your choice and find the algorithm used to implement it.

  • Inversion Count

Some online judges for competitive programming. 

Other resources

Websites worth mentioning

It came to my notice that USACO is down currently. Instead of that, you can go to Codechef and solve top 10 easy problems sorted by decreasing number of accepted submissions. Refer to FAQ in case you face problems. Take help from your friends in case you are stuck. 


**First years** You are advised to go through all the links. 

**Second years** You are advised to spend more time on GeeksForGeeks.


Before the next class revise/complete C language. 

Study about Arrays, Linked lists, Stacks, Queues. 


Thank You



--
You received this message because you are subscribed to the Google Groups "scrt nsit" group.
To unsubscribe from this group and stop receiving emails from it, send an email to scrt-nsit+...@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.
 
 

Reply all
Reply to author
Forward
0 new messages