Leah jones is the it manager at rock solid outfitters, a medium-sized supplier of outdoor climbing and camping gear. steve allen, the marketing director, has asked leah to develop a special web-based promotion. as steve described it to leah, rock solid will provide free shipping for any customer who either completes an online survey form or signs up for the rock solid online newsletter. additionally, if a customer completes the survey and signs up for the newsletter, rock solid will provide a $10 merchandise credit for orders of $100 or more. leah has asked you to develop a decision table that will reflect the promotional rules that a programmer will use. she wants you to show all possibilities, and then to simplify the results to eliminate any combinations that would be unrealistic or redundant.

leah jones, the it manager at rock solid outfitters, thinks you did a good job on the decision table task she assigned to you.

now she wants you to use the same data to develop a decision tree that will show all the possibilities for the web-based promotion described in part 1 of the case.

she also wants you to discuss the pros and cons of decision tables versus decision trees.

Write a modular program (no classes yet, just from what you learned last year), that allows two players to play a game of tic-tac-toe. use a two-dimensional char array with 3 rows and 3 columns as the game board. each element of the array should be initialized with an asterisk (*). the program should display the initial board configuration and then start a loop that does the following: allow player 1 to select a location on the board for an x by entering a row and column number. then redisplay the board with an x replacing the * in the chosen location. if there is no winner yet and the board is not yet full, allow player 2 to select a location on the board for an o by entering a row and column number. then redisplay the board with an o replacing the * in the chosen location. the loop should continue until a player has won or a tie has occurred, then display a message indicating who won, or reporting that a tie occurred. player 1 wins when there are three xs in a row, a column, or a diagonal on the game board. player 2 wins when there are three ox in a row, a column, or a diagonal on the game board. a tie occurs when all of the locations on the board are full, but there is no winner. input validation: only allow legal moves to be entered. the row must be 1, 2, or 3. the column must be 1, 2 3. the (row, column) position entered must currently be empty (i.e., still have an asterisk in it).

Convert 11001110(acdd notation) into decimal

People should never use telepresence when virtually meeting with a group of co-workers. true false