LEARNINGS OF THE WEEK (Jan. 26-30)
By: Frea Diane T. Bautista

This Week, we don't really have a lesson.
We were just busy doing our own web page.
Everyday, we edit it and upload the new one.
Thanks to the help of my classmates.

learnings of the week (lorebeth betinol)

We had tackled about making a webpage, and everyone is excited to make their own.

A web page or webpage 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.

Web pages may be retrieved from a local computer or from a remote web server. The web server may restrict access only to a private network, e.g. a corporate intranet, or it may publish pages on the World Wide Web. Web pages are requested and served from web servers using Hypertext Transfer Protocol (HTTP).

Web pages may consist of files of static text stored within the web server's file system (static web pages), or the web server may construct the (X)HTML for each web page when it is requested by a browser (dynamic web pages). Client-side scripting can make web pages more responsive to user input once in the client browser.


Creating a web page

To create a web page, a text editor or a specialized HTML editor is needed. In order to upload the created web page to a web server, traditionally an FTP client is needed.

The design of a web page is highly personal. A design can be made according to one's own preference, or a pre-made web template can be used. Web Templates let web page designers edit the content of a web page without having to worry about the overall aesthetics. Many people publish their own web pages using products like Geocities from Yahoo, Tripod, or Angelfire. These web publishing tools offer free page creation and hosting up to a certain size limit.

Other ways of making a web page is to download specialized software, like a Wiki, CMS, or forum. These options allow for quick and easy creation of a web page which is typically dynamic.

Learnings of the Week (Jan.19-23)

By: Frea Diane T. Bautista

Last week, we tackled about HTML and we wer told to make our own website.

But, what is HTML?

HTML stands for Hyper Text Markup Language. An HTML file is a text file containing small markup tags. The file must have an HTM or HTML extension. That markup tags tell the web browser how to display the page. HTML documents are text files made up of HTML elements. HTML elements are defined using HTML tags. HTML tags are used to mark-up HTML elements. It is surrounded by the two characters <>, the surrounding characters are called angle brackets. HTML tags normally come in pairs like and . 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 and the HTML tags are not case sensitive.
Hypertext Markup Language (HTML) in computer science, the standard text-formatting language since 1989 for documents on the interconnected computing network known as the World Wide Web. HTML documents are text files that contain two parts: content that is meant to be rendered on a computer screen; and markup or tags, encoded information that directs the text format on the screen and is generally hidden from the user. HTML is a subset of a broader language called Standard Generalized Markup Language (SGML), which is a system for encoding and formatting documents, whether for output to a computer screen or to paper.
Some tags in an HTML document determine the way certain text, such as titles, will be formatted. Other tags cue the computer to respond to the user's actions on the keyboard or mouse. For instance, the user might click on an icon (a picture that represents a specific command), and that action might call another piece of software to display a graphic, play a recording, or run a short movie. Another important tag is a link, which may contain the Uniform Resource Locator (URL) of another document. The URL can be compared to an address where a particular document resides. The document may be stored on the same computer as the parent document or on any computer connected to the World Wide Web. The user can navigate from document to document simply by clicking on these links. HTML also includes markups for forms that let the user fill out information and electronically send, or e-mail, the data to the document author, and initiate sophisticated searches of information on the Internet, or order goods and services.
The software that permits the user to navigate the World Wide Web and view HTML-encoded documents is called a browser. It interprets the HTML tags in a document and formats the content for screen display. Since HTML is an accepted standard, anyone can build a browser without concerning themselves with what form various documents will assume, unlike documents produced by typical word processors, which must be translated into a different format if another word processing application is used. Most sites on the World Wide Web adhere to HTML standards and, because HTML is easy to use, the World Wide Web has grown rapidly. HTML continues to evolve, however, so browsers must be upgraded regularly to meet the revised standards.

January 19 - 23, 2009

LEARNINGS OF THE WEEK
By: Cielito M. Cantero
IV - Rizal

This week??

This week we dont tackled anything.
I guess Sir Balbuena was so busy... =<

What we done this week?
We just check our test papers for the third grading periodical examination.
And don't learn new things about tle this week..

This week, we also have our recollection held at Molave Hotel..
January 20 was the exact date..

Maybe next week we will have to learn something about making web page.

The best thing is we're now off with programming.

yipeey!!

oOh yes!!

-------------------------------------------------------------------------------------

nkarelax jud me kron na week..

wheew..

sus,. lisod man gud au programming bah.

at last humana jud ang programming!!!!!

yeheey!! :]

Learnings of the week (Lorebeth Betinol)

January 12-16,2009

This week we had discussed all about arrays, and............ here it goes...............

***Single – Dimensional Arrays




Array is a collection of variables of the same data type that is referenced by a common name.


Array declaration

The general form for any 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.



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

int number[100] , answer [25];



array initialization

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

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

In computer science, an array^[1] is a data structure consisting of a group of elements that are accessed by indexing. In most programming languages each element has the same data type and the array occupies a contiguous area of storage.

Overview

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,^[2] or table.^[3]

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.

[edit] Properties

Arrays permit constant time (O(1)) random access to individual elements, which is optimal, but moving elements requires time proportional to the number of elements moved. On actual hardware, the presence of e.g. caches can make sequential iteration over an array noticeably faster than random access — a consequence of arrays having good locality of reference because their elements occupy contiguous memory locations — but this does not change the asymptotic complexity of access. Likewise, there are often facilities (such as memcpy) which can be used to move contiguous blocks of array elements faster than one can do through individual element access, but that does not change the asymptotic complexity either.

Memory-wise, arrays are compact data structures with no per-element overhead. There may be a per-array overhead, e.g. to store index bounds, but this is language-dependent. It can also happen that elements stored in an array require less memory than the same elements stored in individual variables, because several array elements can be stored in a single word; such arrays are often called packed arrays.

LEARNINGS OF THE WEEK (Jan. 12-16)

By: Frea Diane T. Bautista

Last week, we tackled about arrays. We, Batch 1, have an activity about our last topic which is "ARRAYS".

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

Array declaration The general form for any 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. Array Initialization Arrays can give initial values during the declaration. This is called array initialization. int Array1[5]={25,5,7,11,163}

Array[0] = 25
Parts of the Array:
Where:
Array – array name
[0] – subscript or index
25 – array element
ARRAY DECLARATION
This is the general form for any declaration:



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.



int number[100] , answer [25];

Learnings of the Week!! (Jan 12-16)

Steffany Queen P. Bigoy

This week, we have discussed all about ARRAY. Honestly, i found it so difficult. :c

Heres's the summary of our lessons.

Array is a collection of variables of the same data type that is referenced by a common name.

Consider the illustration below…

#include main()
{
int array[4]={25,5,7,11,163};
clrscr();
printf(“%d %d %d %d %d”, array[0], array[1], array[2],array[3],array[4]);
getch();
}

Output:
25 5 7 11 163

Array declaration

The general form for any 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.

Array declaration

lThe two declarations for arrays number and answer can be combined into a single declaration:
int number[100] , answer [25];

Array Initialization

lArrays can give initial values during the declaration. This is called array initialization..
int Array1[5]={25, 5, 7, 11, 163};

After we had discussed it, we then have our activities. Ü

January 12 - 16, 2009

LEARNINGS OF THE WEEK
By: Cielito M. Cantero
IV - Rizal


The students were very busy this week. Because this week was the time for us to take our third periodical examination.

We took the T.L.E examination January 16.

It was really really HARD...
I
I still get confused every time I trace the program...

I spend lot of the time in analyzing the program...

For me, programming is one of hardest lesson I've ever took...

And also, we have some reviews about our past lessons before the day of the test come.

We also discussed about array this week. To understand more about array, read below.


Array is a collection of variables of the same data type that is referenced by a common name.

Consider the illustration below…

#include main()
{
int array[4]={25,5,7,11,163};
clrscr();
printf(“%d %d %d %d %d”, array[0], array[1], array[2],array[3],array[4]);
getch();
}

Output:
25 5 7 11 163

Array declaration

The general form for any 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.



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

int number[100] , answer [25];



array initialization

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

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

-------------------------------------------------------------------------------------------------

huhuhu..
la jud koy nasabtan miskan unsaon...
how sad... :-(

LEARNINGS OF THE WEEK (Jan. 5-9)
By: Frea Diane T. Bautista

This week, we have discussed about Recursion.

Recursion in computer science is a way of thinking about and solving problems. It is, in fact, one of the central ideas of computer science. ^[1] Solving a problem using recursion means the solution depends on solutions to smaller instances of the same problem. ^[2]

"The power of recursion evidently lies in the possibility of defining an infinite set of objects by a finite statement. In the same manner, an infinite number of computations can be described by a finite recursive program, even if this program contains no explicit repetitions." ^[3]

Most high-level computer programming languages support recursion by allowing a function to call itself within the program text. Imperative languages define looping constructs like “while” and “for” loops that are used to perform repetitive actions. Some functional programming languages do not define any looping constructs but rely solely on recursion to repeatedly call code. Computability theory has proven that these recursive only languages are mathematically equivalent to the imperative languages, meaning they can solve the same kinds of problems even without the typical control structures like “while” and “for”.

Examples of recursively defined procedures (generative recursion)

Factorial

A classic example of a recursive procedure is the function used to calculate the factorial of an integer.

Function definition: 0 \\ \end{cases}" src="http://upload.wikimedia.org/math/9/6/7/967ff33812b62076e5de85fe7fb40b83.png">

Pseudocode (recursive):
function factorial is: input: integer n such that n >= 1 output: [n × (n-1) × (n-2) × … × 1] 1. if n is 0, return 1 2. otherwise, return [ n × factorial(n-1) ] end factorial

A recurrence relation is an equation that relates later terms in the sequence to earlier terms^[6].
Recurrence relation for factorial:
b_n = n * b_n-1
b₀ = 1

Computing the recurrence relation for n = 4:
b4 = 4 * b3 = 4 * 3 * b2 = 4 * 3 * 2 * b1 = 4 * 3 * 2 * 1 * b0 = 4 * 3 * 2 * 1 * 1 = 4 * 3 * 2 * 1 = 4 * 3 * 2 = 4 * 6 = 24

Example Implementations:

Scheme (recursive)	C (recursive)
;; Input: Integer n such that n >= 0 (define (fact n) (if (= n 0) 1 (* n (fact (- n 1)))))	//INPUT: n is an integer such that n >= 0 int fact(int n) { if (n == 0) return 1; else return n * fact(n - 1); }

Learnings (lorebeth)

January 10,2009

We had discussed about recursion, even though it is hard to understand but still I'm trying my best.


Recursion defined

The repetitive process by which a functions calls itself is called recursion or circular definition.
This is a way of defining something in terms of itself.
A function is said to be recursive if a statement in the body of the function calls the function that contains it.


Parts of the Recursive function

Base Case
This is the part of the recursive function that is found on the if clause. This contains the condition that should be satisfied at one point of execution to terminate the repetitive process done by the recursive function.

General Case
This is the part of the recursive function that is found on the else-clause. This contains the function call of the recursive function to itself.


Recursion in computer science is a way of thinking about and solving problems. It is, in fact, one of the central ideas of computer science. ^[1] Solving a problem using recursion means the solution depends on solutions to smaller instances of the same problem. ^[2]

"The power of recursion evidently lies in the possibility of defining an infinite set of objects by a finite statement. In the same manner, an infinite number of computations can be described by a finite recursive program, even if this program contains no explicit repetitions." ^[3]

Most high-level computer programming languages support recursion by allowing a function to call itself within the program text. Imperative languages define looping constructs like “while” and “for” loops that are used to perform repetitive actions. Some functional programming languages do not define any looping constructs but rely solely on recursion to repeatedly call code. Computability theory has proven that these recursive only languages are mathematically equivalent to the imperative languages, meaning they can solve the same kinds of problems even without the typical control structures like “while” and “for”.

January 5 - 9, 2009

LEARNINGS OF THE WEEK
By: Cielito M. Cantero
IV - Rizal


This week we discussed about 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 also have an activity regarding the lesson...

hehe,. =)

Learnings of the Week!!

Steffany Queen P. Bigoy

RECURSION.Well, we have activities regarding the recursion. Mr. Balbuena teaches this lesson well, but in our the activity given, we have encountered some difficulties in running our program. God! napaka-hirap talaga 'nun.

Here's some of our discussions:

Recursion is repetitive process by which a function calls itself. It is also termed as the circular.

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.

For example in this program segment:
Factorial (int n)
{
If (n==1n==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.

Most high-level computer programming languages support recursion by allowing a function to call itself within the program text. Imperative languages define looping constructs like “while” and “for” loops that are used to perform repetitive actions. Some functional programming languages do not define any looping constructs but rely solely on recursion to repeatedly call code. Computability theory has proven that these recursive only languages are mathematically equivalent to the imperative languages, meaning they can solve the same kinds of problems even without the typical control structures like “while” and “for”....Ü

LEARNINGS OF THE WEEK (Dec.29 - Jan.2)
By: Frea Diane T. Bautista

Its still our christmas vacation this week. And this thursday, we're going to face the start of new year!

Welcome year of the ox!

Happy New Year!

Welcome 2009!

And next week, we'll going to start our classes for 2009!

Happy Vacation!:)

Learnings- Lorebeth

December 29-January 2, 2009

Christmas is finished but it's a Happy 100x New year guys.....................

Lets welcome the 2009 which is the year of the OX with a big S.M.I.L.E.

Opps! Vacation will be finish and say "hello" to class.

I just read this one:

Auto-increment and Auto-decrement Operators
- instead of using  i = i+1 use equivalent statement  i++
- similarly j = j-1 can be written as j--
- similarly a = a+b can be written as a += b
- similarly c = c-d can be written as c -= d
- similar compact forms for * / and % exist
- this results in shorter (and often faster) code

learnings

3rd grading has started…

We started the week with an assignment in programming about iterative statements.

Each group was given different problems that must be reported by group also the next day.

We we’re so nervous because we don’t know how to answer our problem. But thanks to our classmates, we solve our problem because of their help.

Luckily, I’m not the one who was chosen to report our problem…yipeey!!

Learnings (lorebeth betinol)

Bakit hindi ako maka post ????

Learnings of the Week!!

Steffany Queen P. Bigoy

Well, i thought of not writing anymore

'learning of the week', since this week is our vacation week. !!

But i love to greet everybody a

Merry Christmas and advance Happy New Year. !

By the way, 2008 is ending up so I hope

everybody will have a nice and happy new year. Ü

And, we are going to face the 2009 or the year of the ox.

Do you know what's an ox like?

If not, just look at it.

i hope this year will have a good fortune for everybody.!

So Godbless and Take care.!