Font size
WorksheetsMy Reviewer ft. ICT 107
Total questions: 77
Worksheet time: 1hrs 17mins
Kind of data that a variable can assume, hold or take on in a programming language
Data Structure
Data
Data Type
Algorithm
An arrangement of data in a computer's memory or on a disk.
A kind of data that a variable can assume, hold or taken on in a programming language and for which operations are automatically provided
Types of Data Types
Examples of Primitive Data Types except;
String
Array
Integer
Float
It is a data structure that are not defined by the programming language. These are created by the programmer.
Primitive
Non-Primitive
Linear
Algorithm
Known as user-defined data structures
A predifined data which are supported by the programming language.
Examples of Linear except;
String
Array
Stack
Queue
LinkedList
Two types of Non-Primitive Data type
Example of Non-Linear
Tree and Graph
Array and Stack
String and Integer
Queue and LinkedList
What's ADT stands for?
These are data types which can be constructed in a program using it's programming language's primitive data types and other composite types.
Abstract Data Type
Algorithm
Data structure
Composite Data Type
A mathematical model for a certain class of data structure
Abstract Data Type
Composite Data Type
Algorithms
Data Type
Provides First-in, first-out access
Provides last-in, first-out access
An example of Composite Data Type
Manipulates the data in these structures in various ways, such as searching for a particular data item and sorting the data. A finite sequence of instructions
Two types of Algorithms
It is not a program
A linear data structures that can be accessed only at one of its end for sorting and retrieving data
Works like the line in flag ceremony
Queue in the British word for (a)
A queue representation which is one-dimensional array/vector is used, hence the size is static
A queue representation used modes with fields INFO and LINK
Deletion form empty queue causes?
Insertion onto full queue causes?
There is no need to move the elements. As well as cells are considered arranged in circle
I byte is equal to how many bits?
3
4
2
1
1 bit is equal to how many nibbles?
4
1
2
3
An operation used to add an element to the top of the stack
(Insertion)
An operation used to remove an element from the top of the stack
An operation used to search an element
(array address)
An operation used to return an object from the top of the stack
(Last element of the stack)
An operation that inserts the specified element into the queue. If not successful it throws an exception
An operation that inserts the sepcified element into the queue. If not successful it returns false
add()
offer()
Remove()
Add()
Returns and removes the head of the queue. Throws exception if the queue is empty
Remove()
remove()
Element()
peek()
Returns the head of the queue. Throws exception if the queue is empty
element()
peek()
remove()
poll()
Returns the head of the queue. Returns null if the queue is empty
poll()
peek()
add()
remove()
Returns and removes the head of the queue. Returns null if the queue is empty
poll()
element()
remove()
peek()
Enumerate the Basic Queue Operations
A basic Queue Operation that includes add() and offer()
A Basic Queue Operation that includes remove() and poll() operations
First line syntax of Stack
Import java.utilstack;
import java util.stack;
Import java.util.Stack;
import java.util.Stack;
First line syntax of Queue
Import java.utilQueue;
import.java.util.Queue;
import java.util.Queue;
import java util.Queue;
Java syntax
public class Filename
Public class filename;
public class filename;
public class filename
Queue syntax with LinkedList
import java.util.Queue;
import java.util.LinkedList;
import java.util.Queue
import java.util.LinkedList;
import java.util.Queue;
import java.util.LinkedList
Import java.util.queue;
import java.util.linkedlist;
Queue syntax with Priority Queue
Import java.util.Queue;
Import java.util.PriorityQueue;
import java.util.Queue;
import java.util.PriorityQueue;
Import java.util.Queue;
Import java.util.PriorityQueue;
Java first line syntax with BufferedReader
import java.util.BufferedReader
import java.io.*;
import java.io*;
import java.util.BufferedReader;
BufferedReader body syntax
Scanner body syntax
Java first line syntax with Scanner
import java.util.Scanner;
import java.io.*;
import java.Util.scanner;
import java.util.Scanner
Widely used programming methodology
Programming language that implements OOD
Popular approaches of OOD(Object Oriented Design)
It is an extension of procedural programming but slightly different approach in writing computer program
Process of implementing structured design
Dividing a problem into smaller sub-problems. Also known as top-down, bottom-up design, stepwise refinement and modular programming. Also referred to as Procesural programming.
Core concepts behind OOP;
Two Major Types of OOP Applications
Attempt to mimic real-world activities to improve
processes for the user to understand the real-world operations involving each
process.
Type of applications allow user to interact with
the program in graphical environment
In OOP terminology, it is a term that describes a group or collection of objects with
common properties.
Describes what attributes its objects will have and
what those objects will be able to do
These are the characteristics that define an object; they are properties of the object.
It can be defined as a template/blueprint that describes the
behavior/state that the object of its type supports:
Have states and behaviors.
basically a behavior.
Three principles of OOP
Is the final important concept in OOP terminology which literally means “many
forms”. It describes the feature of the languages that allows the same word or
symbol to be interpreted correctly in different situations based on the context.
A contract between a class and the outside world.
A namespace for organizing classes and interfaces in a logical manner
Is a self-contained block of program code that carries out some action,
similar to the procedure in a procedural program (Structured Program)
It is where the logics are written, data is manipulated and all the actions
are executed. Also, it is basically a behavior.
Version type of Tiger
Code Name for Java SE 6 Edition
JDK Beta code name
