UCEST 105 - Lab Cycle 6
Learning Objective
Learn various computational approaches to problem solving
Read the blog and understand the concepts before doing the programs1.Implement string matching using Brute force method
2.Implement subset sum problem using Brute force method
3.Implement a password cracking program to crack a password with 3 letters.
4.Find the maximum element in a an array using Divide and Conquer Method
5.Implement Mergesort using Divide and Conquer Method.
5.Implement Mergesort using Divide and Conquer Method.
6.Use divide and conquer to find the majority element in an array, where the majority element appears more than n/2 times. Divide the array into two halves, find the majority element in each half, and combine the results to identify if there is a majority element in the entire array.(University Question)
7.Generate Fibonacci sequence using Dynamic Programming. ( use memorization technique)
8.Implement the task completion problem using Greedy Approach.
9.Estimate the value of pi using Monte Carlo method of randomized algorithm.
10.Solve the 'n' hat problem using the randomized algorithm approach.
11.Write a program to play a sticks game in which there are 16 sticks. Two players take turns to play the game. Each player picks one set of sticks (needn’t be adjacent) during his turn. A set contains 1, 2, or 3 sticks. The player who takes the last stick is the loser. The number of sticks in the set is to be input.
12.Suppose you're on a game show, and you are given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what is behind the doors, opens another door, say No. 3, which has a goat. He then asks, "Do you want to pick door No. 2?"Is it to your advantage to switch your choice?
Comments
Post a Comment