Abdullah Baghuth (0xCyberY)

0xCyberY

Geek Repo

Company:/dev/null

Location:127.0.0.1

Home Page:https://0xcybery.github.io

Twitter:@0xCyberY

Github PK Tool:Github PK Tool

Abdullah Baghuth's repositories

Sequential-allocation

a C program to simulate Sequential file allocation strategy.

Language:CStargazers:1Issues:0Issues:0

zphisher

Automated Phishing Tool

License:GPL-3.0Stargazers:1Issues:0Issues:0

A-race-condition

A race condition occurs when two or more threads can access shared data and they try to change it at the same time.

Language:CStargazers:0Issues:0Issues:0

BFS

C program to implement Breadth First Search(BFS). Breadth First Search is an algorithm used to search a Tree or Graph. BFS search starts from root node then traverses into next level of graph or tree, if item found it stops other wise it continues with other nodes in the same level before moving on to the next level. The algorithm can also be used for just Tree/Graph traversal, without actually searching for a value. This is what being done in the program below. The disadvantage of BFS is it requires more memory compare to Depth First Search(DFS).

Language:CStargazers:0Issues:0Issues:0

count-No.-of-pi-ni-pf-nf

A program to count no of positive integers negative integers positive fraction and negative fraction.

Language:LexStargazers:0Issues:0Issues:0

count-number-of-words-characters-spaces-and-lines-using-lex

count number of words characters spaces and lines using for a given file using lex.

Language:LexStargazers:0Issues:0Issues:0

Cryptography

Cryptography Algorithms

Stargazers:0Issues:0Issues:0

Enviroment-list

A program to show the environment list using c

Language:CStargazers:0Issues:0Issues:0

Evaluate-arithmetic-expression

A program to evaluate arithmetic expression involving opreation '+','-','*','/' ;

Language:YaccStargazers:0Issues:0Issues:0

File-Copy-using-command-line-arguments

C program for File Copy using command line arguments

Language:CStargazers:0Issues:1Issues:0

First-level-directory

a C program to simulate the Single level directory

Language:CStargazers:0Issues:0Issues:0

Ghostcat-CNVD-2020-10487

Ghostcat read file/code execute,CNVD-2020-10487(CVE-2020-1938)

Stargazers:0Issues:0Issues:0

Hello-World-in-lex

program to print hello world in lex

Language:LexStargazers:0Issues:0Issues:0

Identifier-a-string

program to Identifier a string using lex and yacc

Language:YaccStargazers:0Issues:0Issues:0

Limits-on-the-system

program to check the limits on the system using C

Language:CStargazers:0Issues:0Issues:0
Language:CStargazers:0Issues:0Issues:0

number-of-comment-line-

A lex program to print number of multiple comment line or single comment line in given file

Language:LexStargazers:0Issues:0Issues:0

number-of-printf-and-scanf-statements

A program to count number of printf and scanf statements

Language:LexStargazers:0Issues:1Issues:0

POSIX-defined-configration-option

POSIX-defined-configration-option using feature test macro

Language:CStargazers:0Issues:0Issues:0

process-communication-using-FIFO

C Program to demonstrate the inter process communication using FIFO.

Language:CStargazers:0Issues:1Issues:0

Producer-consumer-problem-semaphore-

a C program to implement the Producer & consumer problem (semaphore)

Language:CStargazers:0Issues:1Issues:0

Recognize-valid-variable

A program to Recognize valid variable , should start with letter followed by any number of letter or digit.

Language:YaccStargazers:0Issues:0Issues:0

Rename-file-using-vm-command

This program is used to rename the file using vm command and link(), unlink() in the code

Language:CStargazers:0Issues:1Issues:0

Simple-Or-Compound-lex

A lex program to check wither the given string is simple or compound

Language:LexStargazers:0Issues:1Issues:0

Simulate-Indexed-file-allocation-strategy

a C program to simulate Indexed file allocation strategy.

Language:CStargazers:0Issues:0Issues:0
Language:CStargazers:0Issues:0Issues:0

Simulate-Round-Robin-CPU-scheduling-algorithm

In Round Robin Scheduling, CPU is assigned to the process on the basis of FCFS for a fixed amount of time. This fixed amount of time is called as time quantum or time slice. After the time quantum expires, the running process is preempted and sent to the ready queue. Then, the processor is assigned to the next arrived process. It is always preemptive in nature.

Language:CStargazers:0Issues:0Issues:0
Language:CStargazers:0Issues:0Issues:0
Language:CStargazers:0Issues:0Issues:0
Language:LexStargazers:0Issues:0Issues:0