Posts
Showing posts from August, 2015
IIIT Delhi - Computer Science Teachers Workshop Day 2
- Get link
- X
- Other Apps
Revised Schedule for Day 3 - Open Session
- Get link
- X
- Other Apps
IIIT Delhi Workshop for Computer Science Teachers Day 3 Revised Schedule Note: New Members are also WELCOME DAY DATE: SATURDAY, 22nd AUGUST, 2015 TIME SESSION 9:30 -10:45 Intro to graphs and trees 10:45-11:00 Break 11:00-11:30 CS as a Discipline and what is done at University by Prof. Pankaj Jalote and Prof.Dheeraj Sanghi 11:30-11:50 Best practices in schools - A brif presentation 11:50-12:10 Projects - discussion on the compilation of projects 12:10-12:30 Contests for school students -Codechef 12:30 - 1:00 Open discussion (on what can be done for improving CS Education in schools) 01:00-01:30 Lunch 01:30 onwards Round of IIIT Delhi and See Programmes at Esya
Problems of Day 1
- Get link
- X
- Other Apps
Problems Day 1: Session 1 Problem 1: You are given an m-bit message. Assume this is at locations 0 to m-1 in an array M. Write a program to compute the Hamming code corresponding to this message in an array S. Problem 2: You are given an n×n system of linear equations (n equations in n variables). Write a program to solve this system using Gaussian elimination (the method discussed in class). Session 2 Problem 1: Propose an O(n) time algorithm to find the largest element in every contiguous subarray of size k. For example: If the array is: {12, 1, 78, 90, 57, 89, 56} and k = 3. The answer will be: 78, 90, 90, 90, 89 In this case, we find the maximum of elements with indices: (0,1,2), (1,2,3), (2,3,4), (3,4,5) and so on ... The important point to note is that the time complexity should be independent of k. You can use auxiliary data structures such as stacks and queues. Problem 2: Assume that I have an unsorted array with n elements. Each element is an integer between 0 and ...
IIIT Delhi - Computer Science Teachers Workshop Day 1
- Get link
- X
- Other Apps