Web Application Basics
| Institution | University |
| Course | BACHELOR OF COMPUTER... |
| Year | 1st Year |
| Semester | Unknown |
| Posted By | stephen oyake rabilo |
| File Type | |
| Pages | 98 Pages |
| File Size | 1.17 MB |
| Views | 1915 |
| Downloads | 0 |
| Price: |
Buy Now
|
Description
Web applications evolved from Web sites or Web systems. The first Web sites, created
by Tim Berners-Lee while at CERN (the European Laboratory for Particle Physics),
formed a distributed hypermedia system that enabled researchers to have access to
documents and information published by fellow researchers, directly from their computers. Documents were accessed and viewed with a piece of software called a
browser, a software application that runs on a client computer. With a browser, the user
can request documents from other computers on the network and render those documents
on the user’s display. To view a document, the user must start the browser and enter
the name of the document and the name of the host computer where it can be found.
The browser sends a request for the document to the host computer. The request is
handled by a software application called a Web server, an application usually run as a
service, or daemon, that monitors network activity on a special port, usually port 80.
The browser sends a specially formatted request for a document (Web page) to the
Web server through this network port. The Web server receives the request, locates the
document on its local file system, and sends it back to the browser; see Figure 2-1.
This Web system is a hypermedia system because the resources in the system are
linked to one another. The term Web comes from looking at the system as a set of
nodes with interconnecting links. From one viewpoint, it looks like a spider’s web.
The links provide a means to navigate the resources of the system. Most of the links
connect textual documents, but the system can be used to distribute audio, video, and
custom data as well. Links make navigation to other documents easy. The user simply
clicks a link in the document, and the browser interprets that as a request to load the
referenced document or resource in its place.
Below is the document preview.
INTRODUCTION TO COMPUTER NETWORKS
Exchange of information through the use of speech, signs or symbols is called
communication. When early humans started speaking, some 5,00,000 years ago,
that was the first mode of communication. Before we dive into modern
technologies that drive communication in contemporary world, we need to know
how humans developed better communication techniques to share knowledge with
each other.
31 Pages
182 Views
0 Downloads
1.06 MB
CMT 304 :DATA STRUCTURES & ALGORITHMS
Data Structures are the programmatic way of storing data so that data can be used efficiently.
Almost every enterprise application uses various types of data structures in one or the other way.
64 Pages
1747 Views
0 Downloads
3.57 MB
ALGORITHMS, FLOWCHARTS, DATA TYPES AND PSEUDOCODE
An algorithm is a representation of a solution to a problem. If a problem can be defined
as a difference between a desired situation and the current situation in which one is, then
a problem solution is a procedure, or method, for transforming the current situation to the
desired one. We solve many such trivial problems every day without even thinking about it, for example making breakfast, travelling to the workplace etc. But the solution to such problems requires little intellectual effort and is relatively unimportant. However, the solution of a more interesting problem of more importance usually involves stating the problem in an understandable form and communicating the solution to others. In the case where a computer is part of the means of solving the problem, a procedure, explicitly stating the steps leading to the solution, must be transmitted to the computer. This concept of problem solution and communication makes the study of algorithms important to computer science.
22 Pages
203 Views
0 Downloads
86.08 KB
Introduction to Data Structures
Computer System=Software+Hardware
Computer Software
Set of instructions that tells the hardware what to do, how to do it, and even when.
160 Pages
1637 Views
0 Downloads
693.46 KB
Data Structures and Algorithms in Java
Building data structures and algorithms requires that we communicate detailed instructions to a computer. An excellent way to perform such communication is
using a high-level computer language, such as Java. In this chapter, we provide an
overview of the Java programming language, and we continue this discussion in the
next chapter, focusing on object-oriented design principles. We assume that readers
are somewhat familiar with an existing high-level language, although not necessarily Java. This book does not provide a complete description of the Java language
(there are numerous language references for that purpose), but it does introduce all
aspects of the language that are used in code fragments later in this book.
1691 Views
0 Downloads
1.13 MB
CMT 211: Object Oriented Programming II
Java is an object-oriented, class-based, concurrent, secured and general-purpose
computer-programming language which is a widely used and a robust technology.
What is Java-Java is a programming language and a platform.
• It is a high level, robust, secured and object-oriented programming language.
• It is also a Platform: A platform is any hardware or software environment in which a program runs. Remember Operating Systems are softwares that runs on hardware platforms, But Os also acts as platforms on which applications runs.
1566 Views
0 Downloads
566.18 KB
Data Structures Singly and Doubly Linked Lists
Introduction
– Remember Linear List
• Array ( Done)
– Search, Modification,Insertion, Deletion
– Flow chart and Pseudo-codes
– Implementation
– Any Question
• Linked List ( Today)
• Stacks
• Queues
73 Pages
1516 Views
0 Downloads
173.23 KB
The BinaryTree ADT
A tree is a nonlinear data structure used to
represent entities that are in some hierarchical relationship
• Examples in real life:
• Family tree
• Table of contents of a book
• Class inheritance hierarchy in Java
• Computer file system (folders and
subfolders)
• Decision trees
• Top-down design
149 Pages
1559 Views
0 Downloads
1.03 MB
Introduction To Graph Data Structure
A set is a collection of non repeating objects.
• The objects in a set are called its elements or members.
• The elements in a set can be any types, including sets(set of sets)! The
members of a set do not even have to be of the same type. Fo
• forr example, a set can consist of numbers and names
37 Pages
1796 Views
0 Downloads
4.59 MB
Data Structure MCQ (Multiple Choice Questions)
Data Structure MCQ
1) How can we describe an array in the best possible way?
a. The Array shows a hierarchical structure.
b. Arrays are immutable.
c. Container that stores the elements of similar types
d. The Array is not a data structure
Hide Answer Workspace
Answer: c
Explanation: The answer is c because array stores the elements in a contiguous
block of memory of similar types. Therefore, we can say that array is a container
that stores the elements of similar types
58 Pages
1600 Views
0 Downloads
1.43 MB