Learnings of the Week (Rollorata)

UPLOAD !

File uploaded. Urgh. This week we are busy editing and uploading our very first webpage.

I find this activity quite hard because of numerous html tags. but i am also excited creating my webpage cuz i will be able to express and show my creativity and technical mind. Oh. GTG!

gotta upload na. hehe. :))

Web page....HTML....

LEARNINGS OF THE WEEK

BY: Sharra Mae S. Tagaro IV- Rizal

This week, our teacher discussed to us how to make a web page using HTML. We started making our very own web page this week. I am so excited and interested in making such because I can really use a lot of imagination and creativity..=)
I learned that:
->Web page is a resource of information that is suitable for the World Wide Web and can be accessed through a web browser . This information is usually in HTML or XHTML format, and may provide navigation to other web pages via hypertext links.
->HTML stands for Hyper Text Markup Language.
->An HTML file is a text file containing small markup tags. The markup tags tell the Web browser how to display the page. An HTML file must have an htm or html file extension.An HTML file can be created using a simple text editor just like notepad.

->When you save an HTML file, you can use either the .htm or the .html extension.
->You can easily edit files using a WYSIWYG (what you see is what you get) editor like Frontpage, Claris Home Page or Adobe PageMill instead of writing your markup tags in a plain text file.
->But if you want to be skillful Web developer, we strongly recommend that you use a plain text editor to learn your primer HTML.

HTML Elements
*HTML documents are text files made up of HTML elements.
*HTML elements are defined using HTML tags.
HTML Tags
*HTML tags are used to mark-up HTML elements. HTML tags are surrounded by the two characters <>.
*The surrounding characters are called angle brackets.
*The first tag in a pair is the start tag, the second tag is the end tag. The text between the start and end tags is the element content.
*HTML tags are not case sensitive: means the same as .
*If you want to prepare yourself for the next generations of HTML, you should start using lowercase tags.
*The World Wide Web Consortium(W3C) recommends lowercase tags in their HTML 4 recommendation, and XHTML (the next generation HTML) demands lowercase tags.

Tag Attributes
*Tag attributes can provide additional information about the HTML elements in your page.

There are a lot of variety of tags that you can use in making your web page nice and creative.That's all!☺

Learnings of the Week (ROLLORATA)

4TH QUARTER, in we go!

Well, we're now off with programming. oyea!

next stop, --> web page design.

hhhm. i think i could do well this quarter. yes! have a positive outlook in life. hehe. Ü

this morning, Sir ernie introduced to us the basics of web page design.

Web page design is a process of conceptualization, planning, modeling, and execution of electronic media content delivery via Internet in the form of technologies (such as markup languages) suitable for interpretation and display by a web browser or other web-based graphical user interfaces (GUIs).

We have to do our very first web page and that would be uploaded tomorrow. i hope i could create a wonderful theme. :]

looking forward for new ideas. ciao!

ARRAYS.

by: mary trishia v. tabigue

Most programming languages have a built-in array data type, although what is called an array in the language documentation is sometimes really an associative array. Conversely, the contiguous storage kind of array discussed here may alternatively be called a vector, list or table.
Some programming languages support array programming (e.g., APL, newer versions of Fortran) which generalises operations and functions to work transparently over arrays as they do with scalars, instead of requiring looping over array members.
Multi-dimensional arrays are accessed using more than one index: one for each dimension. Multidimensional indexing reduced to a lesser number of dimensions, for example, a two-dimensional array with consisting of 6 and 5 elements respectively could be represented using a one-dimensional array of 30 elements.
Arrays can be classified as fixed-sized arrays (sometimes known as static arrays) whose size cannot change once their storage has been allocated, or dynamic arrays, which can be resized.

RECURSIONS.

by: mary trishia v. tabigue

An essential ingredient of recursion is there must be a "termination condition"; i.e. the call to oneself must be conditional to some test or predicate condition which will cease the recursive calling. A recursive program must cease the recursion o n some condition or be in a circular state, i.e. an endless loop which will "crash" the system.

In a computer implementation of a recursive algorithm, a function will conditionally call itself. When any function call is performed, a new complete copy of the function's "information" (parameters, return addresses, etc.. ) is placed into general dat a and/or stack memory. When a function returns or exits, this information is returned to the free memory pool and the function ceases to actively exist. In recursive algorithms, many levels of function calls can be initiated resulting in many copies of th e function being currently active and copies of the different functions information residing in the memory spaces. Thus recursion provides no savings in storage nor will it be faster than a good non-recursive implementation. However, recursive code will o ften be more compact, easier to design, develop, implement, integrate, test, and debug.

ITERATIVE STATEMENTS.*

by: mary trishia v. tabigue

Iterative statements repeated execution of list of statements, depending on the value of a boolean expression.

Syntax:

while ( ) {

}

As long as the boolean expression is true, the statement list is executed repeatedly.

When the boolean expression is false, the statement list is skipped, and execution continues with the statement following the while statement.

Style: The statement list should be indented.

example:

#include

using namespace std;

int main () {

int Entry;

int Counter;

cout << "Enter a positive integer: ";

cin >> Entry;

Counter = 1;

while (Counter <= Entry) {

cout << "Iteration " <<>

Counter = Counter + 1;

}

return 0;

}

Program output:

>iterative
Enter a positive integer: 4
Iteration 1 of 4
Iteration 2 of 4
Iteration 3 of 4
Iteration 4 of 4

X'MAS. :)

by: mary trishia v. tabigue

I LOVE HOLIDAYS SO MUCH.!

hehe. :)

a pause. a break.

oye.! I'm gonna enjoy this time not minding programming issues.

hehe.

I'd settle with those later. :)