Notes, summaries, assignments, exams, and problems for Computers

Instructions:

1. Refer to the files using a relative path.
2. Save all files, including the HTML file, before using this feature.

Value 1

Value 2

Add Minus Divide Multiply

Submit

Understanding Algorithms

A programming algorithm is a computer procedure, much like a recipe, that tells your computer precisely what steps to take to solve a problem or reach a goal.

Evolution of Data Management

Early data management systems include file and database systems that were designed prior to the relational database in the 1970s. These include:

• Flat File Data Management
• Hierarchical Data Management Systems
• Network Data Management Systems

Database Generations & Models

1. Flat File Data Model

An organized set of data stored in a long-term storage medium, such as a disk or magnetic tape.

2. Hierarchical Data Model

Files are related in a parent/child manner, with each child file having at most one parent file.

3. Network Data Model

Made of data... Continue reading "Data Management Fundamentals: Databases, Algorithms, & Distributed Systems" »

Firewalls lay the foundation for network security. One of the most effective steps an organization can take to ensure network security is to install firewalls. A firewall can effectively enforce general security guidelines, such as disallowing audio streaming, controlling Internet access, or providing a virtual blockade from unknown network traffic. A firewall can be implemented as a software application or a hardware device and is designed to handle a number of crucial security tasks:

• Firewalls restrict network traffic between networks.
• Firewalls provide a chokepoint—a single point of entry or exit.
• Firewalls can record network activity.

Because firewalls play such an important role within a network and are usually placed in the most vulnerable... Continue reading "Understanding Firewalls: Essential for Network Security" »

Types definition

#include <stdbool.h>

#include <stdlib.h>

Struct Definition

typedef int tItemL;
typedef struct tNode* tPosL; //Ptr to tNode
struct tNode {
tItemL data;
tPosL next;
tPosL prev;
};
typedef tPosL tList;

Prototypes

void createEmptyList(tList *L);
bool createNode(tPosL* p);
bool insertItem(tItemL d, tPosL p, tList *L);
void updateItem(tItemL d, tPosL p, tList* L);
tPosL findItem(tItemL d,tList L);
bool isEmptyList(tList L);
tItemL getItem(tPosL p, tList L);
tPosL first(tList L);
tPosL last(tList L);
tPosL previous(tPosL p, tList L);
tPosL next(tPosL p,tList L);
void deleteAtPosition(tPosL p , tList *L);
void deleteList(tList *L);

Function Definitions

#include "doubly_linked_list.h"
bool isEmptyList(tList L) { return (L == NULL); }
void... Continue reading "Doubly Linked List Implementation in C" »

Custom HashTable Implementation in Java

This document provides a robust implementation of a HashTable in Java, demonstrating core concepts like load factors, capacity management, and collision handling.

Class Definition

public class HashTable1 implements IHashTable {
    private Entry1 table[];
    private int size;
    private final float loadFactor;
    private int threshold;
    private final int DEFAULT_INITIAL_CAPACITY = 12;
    private final float DEFAULT_LOAD_FACTOR = 0.75f;

    public HashTable1() {
        loadFactor = DEFAULT_LOAD_FACTOR;
        threshold = DEFAULT_INITIAL_CAPACITY;
        table = new Entry1[DEFAULT_INITIAL_CAPACITY];
    }

    public HashTable1(int initialCapacity, float loadFactor) {
        if (initialCapacity

Data Link Control and Error Control Mechanisms

Error Control Techniques

Efficient data transmission involves acknowledging successful data receipt and handling errors. When a station has both data and an acknowledgment to send, they are combined into one frame to optimize communication. If only an acknowledgment is available, a separate frame (RR or RNR) is sent. In cases where data is ready but no new acknowledgment is needed, the last sent acknowledgment sequence number is repeated within the data frame.

Error control relies on several key mechanisms:

• Error Detection: Techniques like checksums or CRCs identify erroneous frames, which are then discarded.
• Positive Acknowledgment: The receiver sends a positive acknowledgment (ACK) to confirm successful

5. Readiness to Notice (means be ready prepared)

The current state of the interlanguage system (when you're studying your first SLA). What the L is ready to notice (or attend to) due to his/her internal structures or mechanisms (some Ls are going to be more able than others to noticing structures). Pieneman’s Multidimensional Model (word order acquisition in L2 German or emergence of questions in L2 English). Acquisition of word in German. EX: Capacity to place adverbs at the beginning of sentences before. Capacity to place the verb at the end of the sentence in some structures. EX. Prediction about what the L can notice: what is to be noticed refers to the next thing to be acquired: adverbs at the beginning of sentences -> verbs at the... Continue reading "Factors Affecting Second Language Acquisition: Readiness to Notice and Task Demands" »

{ "titl":"Presidency University Websit", "tag": [ "HTM", "CS", "JavaScrip", "Bootstra", "AngularJ", "jQuer" ], "conten":"

Essential Concepts in Information Security

Threat vs. Threat Agent: Key Distinctions

The word “threat” usually stands for a category of things that pose a potential danger. Viruses, worms, and other types of malware, for example, are threats. A “threat agent,” by contrast, is a specific threat, or a specific type of virus, worm, or other malware. For example, the Blaster Worm is a threat agent.

Vulnerability vs. Exposure in Security Systems

Vulnerability is a fault within the system, such as software package flaws, unlocked doors, or an unprotected system port. It leaves things open to an attack or damage.

Exposure is a single instance when a system is open to damage. Vulnerabilities can in turn be the cause of exposure.

Infrastructure Protection

THE WEB:

1. WEB1.0, WEB 2.0, WEB 3.0:

-WEB 1.0 or the read-only web: In the 1990s, information on the Internet was only for reading. It was a network of documents and people could not interact with the content. For example, they couldn’t give their opinions, ask for information or register as users. In addition, the information online was not updated very frequently. Almost everything that people used online was also part of the World Wide Web (www).

WEB 2.0 or the social network:

This was developed during the first decade of the 21st century. In this new web, information became bidirectional. Users could not only receive information, but also create and share it. New services appeared and became popular, such as email, chats, videoconferences,... Continue reading "Evolution of the Web and Information Management" »