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. :)

CONDITIONAL STATEMENTS..

BY: MARY TRISHIA V. TABIGUE

. conditional statements, conditional expressions and conditional constructs are features of a programming language which perform different computations or actions depending on whether a programmer-specified condition evaluates to true or false

if...else Statement

Use the if statement to execute a statement if a logical condition is true. Use the optional elseif statement looks as follows: clause to execute a statement if the condition is false. An

if

(condition)

statement_1

[else

statement_2]

If condition evaluates to true, statement_1 is executed; otherwise, statement_2 is executed. statement_1 and statement_2 can be any statement, including further nested if statements.

You may also compound the statements using else if to have multiple conditions tested in sequence;

if (condition)

statement_1

[else if (condition_2)

statement_2]

..

[else if (condition_n_1)

statement_n_1]

[else

statement_n]

To execute multiple statements, use a block statement ({ ... }) to group those statements. In general, it is a good practice to always use block statements, especially in code involving nested if statements:

if (condition) {

statements_1

} else {

statements_2

}

switch Statement

A switch statement allows a program to evaluate an expression and attempt to match the expression's value to a case label. If a match is found, the program executes the associated statement. A switch statement looks as follows:

switch

(expression) {

case label_1:

statements_1

[break;]

case label_2:

statements_2

[break;]

...

default:

statements_def

[break;]

}

The optional break statement associated with each case clause ensures that the program breaks out of switch once the matched statement is executed and continues execution at the statement following switch. If break is omitted, the program continues execution at the next statement in the switch statement.

AGAIN.?! YEHEY.!!

by: mary trishia v. tabigue

I thought we will have a hard-time class today. :)

But I guess LUCK is with US.!!

We didn't have classes in Computer Programming because Sir Ernie is one of the teachers that will perform for the upcoming TEACHER's DAY. ^^

But still, we had our reportings in our assignments. :)

Still, we had enough knowledge for those problems, especially in answering them. :)

I LOVE THIS WEEK.!

by: mary trishia v. tabigue

I love this week.! because we have no regular classes. (yey.!)

Teachers and Students are so much busy preparing for the Regional Press Conference that will be held in our school.

But this will not last long. :(

(how sad)

Next week will be a challenging week I suppose.

Classes will resume and mid-boggling subjects will be ON again.

FUNCTIONS. FUNCTIONS.

by: Mary Trishia V. Tabigue

This week, we discussed FUNCTION and FUNCTION CALL.

The function call is the one that calls the function in doing it's specified tasks.

Also, we discussed actual and formal parameters.

And, to test wahat we've understood, we had a series of computer activities regarding these lessons.

LEARNINGS OF THE WEEK

by: Mary Trishia V. Tabigue

OMG.! QUIZ.?

gosh. it whirrled my mind. tsk3.

I made the WRONG program. a VERY wrong one.

hehe. :(

so sad. because, I think only some of my classmates got the right program.

How I hope I could also get that SOMETIME. :)

I'm really practicing alot now at home. :)

WISH of LUCK to me.!

ArrAys..

LEARNINGS OF THE WEEK

BY: Sharra Mae S. Tagaro IV- Rizal

This week we had a short discussion of arrays.

*ARRAYS-it is a collection of variables of the same data type that is referenced by a common name.

The general form for an array declaration is as follows:

type array_name[size];

Where:
*type is any valid data type in Turbo C which declares the type of values that array will hold. *array_name is a valid variable name which will name the array.
*size defines how many elements the array will hold.

l

l->The two declarations for arrays number and answer can be combined into a single declaration:

–

int number[100] , answer [25];

->Arrays can give initial values during the declaration.This is called array initialization.

int Array1[5]={25,5,7,11,163};

And by the way...we had already taken our third periodical exam..That's all!

Learnings of the Week (ROLLORATA)

[ ARRAY ]

In computer science, array programming languages (also known as vector or multidimensional languages) generalize operations on scalars to apply transparently to vectors, matrices, and higher dimensional arrays.

• An array is a variable name that is associated with a number of adjacent locations in RAM.
• If the name of the variable is, for example, StudentQuizScores, individual values within the array are accessed via an array index, or just index using a syntax something like:

   StudentQuizScores[i]
  

  which means the i-th element/value in the array "StudentQuizScores".
• The array name plus index notation is treated just like a regular variable in the programming syntax. E.g.,

   StudentQuizScores[i] = StudentQuizScores[i] + Quiz4Score;
  

• Depending on the particular programming language, the index associated with the very first element in an array might have the value 1 or 0 (most modern ones use 0).

Recursion

LEARNINGS OF THE WEEK
BY: Sharra Mae S. Tagaro IV- Rizal

This week, we had a brief discussion of recursion:

*RECURSION- defined as the repetitive process by which a function calls itself. It is also termed as the CIRCULAR DEFINITION. Recursion is also a programming technique where a routine performs its task by delegating part of it to another instance of itself.

For example in this program segment:

Factorial (int n)

{

If (n==1||n==0) return 1;

else return (n * factorial (n-1));

}

In this program segment, it illustrates a function containing a call to it. The lines else return (n * factorial (n-1)); contains the function call for the factorial function.

The parts of the recursive function include the Base Case. The base case can be found in the “if clause”. It contains the condition that should be satisfied at one point of execution to terminate the repetitive process done be the recursive function. And the other part of the recursive function is the General Case. The general case can be located on the “else-clause”. It contains the function call of the recursive function to itself.

The Direct Recursion is a recursive functions that can call itself through a function call directly inside the body of the function. While the second type of recursion is the indirect recursion. The Indirect Recursion is a recursive functions that can call another function outside its function.

And we had an activity in programming about it...that's all!^-^,.

Learnings of the Week (ROLLORATA)

RECURSION <---

Recursion is a programming technique that allows the programmer to express operations in terms of themselves. In C++, this takes the form of a function that calls itself. A useful way to think of recursive functions is to imagine them as a process being performed where one of the instructions is to "repeat the process". This makes it sound very similar to a loop because it repeats the same code, and in some ways it is similar to looping. On the other hand, recursion makes it easier to express ideas in which the result of the recursive call is necessary to complete the task. Of course, it must be possible for the "process" to sometimes be completed without the recursive call. One simple example is the idea of building a wall that is ten feet high; if I want to build a ten foot high wall, then I will first build a 9 foot high wall, and then add an extra foot of bricks. Conceptually, this is like saying the "build wall" function takes a height and if that height is greater than one, first calls itself to build a lower wall, and then adds one a foot of bricks.

Learnings of the Week (ROLLORATA)

ITERATIVE STATEMENTS Ü

Three types of iterative statement are provided: the for-statement providing definite iteration and the while- and repeat-statements providing indefinite iteration.

Iteration may be performed over an arithmetic progression of integers or over any finite enumerated structure. Iterative statements may be nested. If nested iterations occur over the same enumerated structure, abbreviations such as for x, y in X do may be used; the leftmost identifier will correspond to the outermost loop, etc.

Early termination of the body of loop may be specified through use of the `jump' commands breakcontinue. and

Definite Iteration

for i := expr_1 to expr_2 by expr_3 do : ->

The expressions in this for loop must return integer values, say b, e and s (for `begin', `end' and `step') respectively. The loop is ignored if either s>0 and b>e, or s<0 s="0" k="0,">0) or b + k.s>e (for e<0).>

If the required step size is 1, the above may be abbreviated to:

for i := expr_1 to expr_2 do : ->

for x in S do : ->

Each of the elements of the finite enumerated structure S will be assigned to x in succession, and each time the statements will be executed.

Indefinite Iteration

while boolexpr do statements end while : ->

Check whether or not the Boolean expression has the value {true}; if it has, execute the statements. Repeat this until the expression assumes the value {false}, in which case statements following the end while; will be executed.