Programming & Computer Science Answers

Part Assignment 2 – Functions, Arrays and Pointers
Due Date: 02 August 2014 no later than 17:00 through BlackBoard
Instruction: Zip your .cpp file and attached (your zip file can have any name)
INSTRUCTIONS:
No use of Global variables is allowed and you should implement good programming practices when declaring array size. You should also make use of pointers to access arrays throughout the program
You are required to assist Mr Dzingwa with the program that will assist him sell items from his Spaza shop easily.
The items are categorised and each category has its own price.
Category
Item
Price
AAA A
Fruits
To be set by the Owner
B
Vegetable
To be set by the Owner
C
Bakery
To be set by the Owner
D
Sweets
To be set by the Owner
Guideline
You program should start by asking the Owner to provide the numbers of the available items per category. This should be accomplished by a function called setItemNums. Next, the program should ask the owner to provide prices for the items in each category a

I have an ASP website with thousands of articles comes from SQL database.
In the ASP web page the code that pulls out\shows the article is: <%=the_article%> only.

Is there a code to insert iFrame in each article?
For example: I want every 10 lines of the article to show a banner, that means that if an article is of 35 lines, Than the banner should show up 3 times, after line 10, 20 and line 30.

. Create an application that displays a series of at least four survey questions; the survey can be on any social or political topic you want, and each question should have at least three possible numeric-choice answers. At the end of the survey, use a dialog box to ask whether the user wants to (1) enter another set of responses to the same set of questions or (2) quit. Continue to accept sets of responses until the user chooses to quit, and then display the results of the survey for each question indicate how many users choose the first option, second option and so on

using JOptionpane

1) Describe, in pseudo-code, an O(n + m)-time algorithm for computing all the connected components of an undirected graph G with n vertices and m edges.

2) Say that an n-vertex directed acyclic graph G is compact if there is some way of numbering the vertices of G with the integers from 0 to n - 1 such that G contains the edge (i; j) if and only if i < j, for all i; j in [0; n - 1]. Give an O(n^2)-time algorithm for detecting if G is compact.

3) Computer networks should avoid single points of failure, that is, network nodes that can disconnect the network if they fail. We say a connected graph G is biconnected if it contains no vertex whose removal would divide G into two
or more connected components. Give an O(n + m)-time algorithm for adding at most n edges to a connected graph G, with n >= 3 vertices and m >= n - 1 edges to guarantee that G is biconnected.