hw3

Question 12 kana.in pseudo code Full explain this question and text typing work only     We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line

Python Knapsack Problem: imagine you are carrying a knapsack with capacity to hold a total of weight C. You are selecting among n items with values A={a_1, a_2, ... , a_n} and associated weights W={w_1, w_2, ... , w_n}. Here the weights and values are all positive. You wish to maximize the total value of the items you select not exceeding the given weight capacity, example, maximize sum_{a in A} such that sum_{w in W} <= C.  Note that you can only select your items once.  Reformulate this as a bottom-up dynamic programming problem as follows. Define K_{i,j} as the highest possible value sum considering items 1 through i and total weight capacity j (j <= C). What is the base case i.e. K_{0,j} for all j and K_{i,0} for all i. What is the loop statement?

Complete the task using the return search algorithm: Task: The labyrinth is represented by a Boolean square matrix A8x8. The cell (i, j) is considered passable if the element ai, j is true and otherwise impassable. Write a program that checks if there is a path from adjacent horizontally and vertically passable cells of the maze, which starts in its upper left corner (0.0) and ends in its lower right corner (7.7). Operating instructions: 1) Compose a Boolean function Path (i, j), called with initial parameters (0,0); 2) If cell (i, j) is outside the matrix Path returns false; 3) If cell (i, j) coincides with (7,7) a path is found and Path returns true; 4) If cell (i, j) is impassable Path returns false (because it cannot exit the cell), otherwise (if the cell is passable) there is a path from it to cell (7,7), if there is a path from any of the cells adjacent to (i, j) next to cell (7,7). Adjacent cells per cell (i, j) are cells (i + 1, j), (i, j + 1), (i-1, j), (i, j-1).

Solve these questions

Make a 4x4 crossword puzzle for the picture below. Words that should be searchable are joy bob sun bow Letters that are searchable are f,k,s,s,b,j,o,u,b,o,b,n,x,y,w,y {'f', 'k', 's','s'} {'b', 'j', 'o','u'} {'b', 'o', 'b', 'n'} {'x', 'y', 'w', 'y'} Do not use the string library Call upon using the main function and all values will be stored in the class. There should be three menu options a search word, search letter and exit. Output word and letter if it exist and put not found it DNE. Use the given code as a template #include using namespace std; class Puzzle { private: char arr[4][4] public: // constructor Puzzle() { char arr[4][2] = {'f', 'k', 's','s'} {'b', 'j', 'o','u'} {'b', 'o', 'b', 'n'} {'x', 'y', 'w', 'y'} } ~Puzzle(){ } search(){ } void print_all() { for (int row = 0; row < n; row++) for (int column = 0; c…

Graph Theory: Graph theory in computer science uses a graphical matrix with nodes and edges to describe a data structure. These can be used for search trees, game theory, shortest path, and many other applications in math and computer science. An example of an application of a graph in computer science is the data structure used to hole the moves for a checkers game program. Each move can be represented by a node. The edges connecting the nodes are determined by the rules of the game, basically how to get to the node. This is a directed graph, because a player cannot take a move back. So the flow is always in one direction towards the end of the game. Cycles in a graph is when a node can go back to itself. This is not possible in this graph, because a move can only go to another position on the board. The only case where this would be correct is if a player were allowed to skip his turn, or move to the same spot that he is already in. A graph is said to be connected if there is a path…

Crossover    and    Mutation    The    two    main    operations    in    evolutionary    computing    are    crossover    and    mutation.    Crossover    works    like    this:    Randomly    choose    two    parents    from    the    population.    Let’s    say    these:    Parent    1:        T        F        T        F        T        T        F    Parent    2:        T        T        T        F        F        T        T    Those    two    parents    will    create    a    child    whose    DNA    is    related    to    the    parents’.    It    works    like    this:    for    each    of    the    seven    genes    in    the    chromosome,    we    will    randomly    pick    a    number    between    1    and    10    and    use    it    to    choose    which    parents’    value    the    child    will    get.    If    the    random    number    is    1    through    5,    we    will    use    Parent    1’s    included    value    for    the    child;    if    it    is    6…

Crossover    and    Mutation    The    two    main    operations    in    evolutionary    computing    are    crossover    and    mutation.    Crossover    works    like    this:    Randomly    choose    two    parents    from    the    population.    Let’s    say    these:    Parent    1:        T        F        T        F        T        T        F    Parent    2:        T        T        T        F        F        T        T    Those    two    parents    will    create    a    child    whose    DNA    is    related    to    the    parents’.    It    works    like    this:    for    each    of    the    seven    genes    in    the    chromosome,    we    will    randomly    pick    a    number    between    1    and    10    and    use    it    to    choose    which    parents’    value    the    child    will    get.    If    the    random    number    is    1    through    5,    we    will    use    Parent    1’s    included    value    for    the    child;    if    it    is    6…

Correct answer will be upvoted else downvoted. Computer science.    example of a chainword is the accompanying triple:    a line of m lowercase Latin letters;    the main clue: an arrangement of fragments with the end goal that the letters that compare to each portion spell a word from the word reference;    the subsequent clue: one more succession of portions with the end goal that the letters that relate to each section spell a word from the word reference.    Note that the successions of portions don't really need to be unmistakable.    Two occasions of chainwords are considered unique on the off chance that they have various strings, diverse first clues or distinctive second clues.    Count the number of various examples of chainwords. Since the number may be really huge, output it modulo 998244353.    Input    The primary line contains two integers n and m (1≤n≤8, 1≤m≤109) — the number of words in the word reference and the number of letter cells.    Every one of the following n…

Part A – Develop the algorithms The challenge in the project is developing algorithms that accomplishes basic operations over an array of integer numbers. The three operations are: Find the minimum (smallest) value that appears in the array Find the maximum (largest) value that appears in the array Determine the number of unique values that appear in the array Develop an algorithm for each of those tasks. The algorithms should work for any size of array. If the array is empty (i.e., doesn't include any elements/values) the algorithm should output a zero. Keep in mind that like any computational problem there are several approaches to achieve a solution. For this programming checkpoint your will need to utilize loops and conditional statements. Write the pseudocode or flowchart for the algorithm and store it in a file (file format can be text, pdf or doc) with the name arrayUtilSteps. Part B - Implement the class The goal for this part is to implement a class with the…

Mini-Case Google’s PageRank: Google’s PageRank is an algorithm that attempts to inform you where people are coming from when they land on your website and which sources are the most frequent. Note that, as its name suggests, a page rank is an index estimated page by page; it’s not an overall website assessment. Think of the Internet as a big network (duh), where the links aren’t all equal. Just as with people, some of your connections are “more important” (in achieving whatever goals) than others. With clickstreams, if you’re getting a lot of web traffic, is it coming from somewhere impressive like Amazon or from Joe’s-Shoes-and-Tshirts.com? The algorithm weights the more important (more connected) links more than the less important (less connected) links. Say you’re trying to determine the rank of your home page. You figure that’s a good start, and customers can navigate more precisely once they’re in your domain. The ranking model begins by checking all the incoming links to the…

Correct answer will be upvoted else Multiple Downvoted. Computer science. Berland local ICPC challenge has quite recently finished. There were m members numbered from 1 to m, who contended on a problemset of n issues numbered from 1 to n.    Presently the article is going to happen. There are two issue creators, every one of them will tell the instructional exercise to precisely k back to back errands of the problemset. The creators pick the section of k continuous errands for themselves autonomously of one another. The sections can correspond, meet or not cross by any means.    The I-th member is keen on paying attention to the instructional exercise of all continuous errands from li to ri. Every member consistently decides to pay attention to just the issue creator that tells the instructional exercises to the most extreme number of assignments he is keen on. Leave this greatest number alone artificial intelligence. No member can pay attention to both of the creators, regardless of…

help fin the corret ansewr fo this

topic: Divide and conquerCreating decagons There are 1000 points in the plane, no three of them on the same line. Devise an algorithm to construct 100 decagons with their vertices at these points. The decagons need not be convex, but each of them has to be simple, i.e., its boundary should not cross itself, and no two decagons may have a common point.

Boolean Satisfaction Problem Boolean Satisfiability Problem (SAT) (https://en.wikipedia.org/wiki/Boolean_satisfiability_problem) is one of the most important problems in Computer Science. SAT is a problem that has NP-Complete complexity, where the only way to solve the problem is to try all the possibilities and check which one is correct. [LO 1, LO 2, LO 3 & LO 4,] Briefly describe how you used Backtracking to solve the Boolean Satisfiability Problem. Note that your solution must have exponential complexity. [LO 1, LO 2, LO 3 & LO 4,] Briefly explain how you use Strongly Connected Component (SCC) to solve the special case of the Boolean Satisfiability Problem, namely 2-SAT (https://en.wikipedia. org/wiki/2-SAT) . This solution has linear complexity.   Solve the Subparts A&B thank u NOTE LO1: Explain fundamental concept of analysis arithms.  LO2: Apply algorithm techniques and methods. LO3: Solve a problem using specific algorithm. LO4: Compare several algorithm design…

neural networks Program to generate random numbers from 11 to 21 as class 1 and generate random numbers from 9 to 55 as class append them to the lists. Take 8 data in each list and plot it.

Algorithm Design and Analysis

profile-image Time remaining: 00 : 09 : 49 Computer Science Design a greedy algorithm according to the scenario below and answer the following question (We don't need a code here just a complete explanation considering the facts below) We have an L feet long tree which has n branches. We have a list of branch's height [h1, h2, h3, ..., hn] where hi

Self Grouping Program

Computer Science Algorithms Hints Master Method Use recursion tree to give you the intuition Formulate a hypothesis and use Induction or Strong Induction to prove it Use change of variables to simpilify the recurrence

code in python   GAME SEARCH   One of the biggest areas of research in modern Artificial Intelligence is in making computer players for popular games. Make your own four depth binary tree. Solve the decision tree by applying gaming theory of your own choice (either apply Minimax or Alpha beta pruning etc. or any other technique), make a choice of your own values ranging from 0 to 50:    The game will be two player game, one will be user and other will be AI agent    Name and design of levels must be distinct for each student‟s game binary tree

euclids algorithm tracing