(2024). 2. Financial sector risks and resilience. [Link]
pdf
The Future of Trust: Unleashing the Power of Blockchain - OS Space. [Link]
future-of-trust-unleashing-the-power-of-blockchain/
What are the potential use cases for Chainlink in the financial industry?.
[Link]
financial-industry
Brahmi, Z., Mahyoob, M., Al-Sarem, M., Algaraady, J., Bousselmi, K., & Alblwi, A. (2024).
Exploring the Role of Machine Learning in Diagnosing and Treating Speech Disorders: A
Systematic Literature Review. Psychology Research and Behavior Management.
[Link]
Saxena, S., Shao, D., Nikiforova, A., & Thapliyal, R. (2022). Invoking blockchain technology in
e-government services: A cybernetic perspective. Digital Policy, Regulation and Governance,
24(3), 246-258.
Bitcoin valentýna. [Link]
Ahmed, F. (2018). An exploration of Naquib al-Attas’ theory of Islamic education as ta’dīb as
an ‘indigenous’ educational philosophy. [Link]
Trust Wallet now supports Celo (CELO) - Announcements - Trust Wallet.
[Link]
celo/377440?ref=[Link]
Li, C., Chen, X., Xie, J., & Xiao, J. (2021). Digital Currency, Commercial Banks, Impacts and
Outlooks. [Link]
General AI Archives - AI TV. [Link]
Devine, A., Spencer, A., Eldridge, S., Norman, R., & Feder, G. (2015). Cost-effectiveness of
Identification and Referral to Improve Safety (IRIS), a domestic violence training and support
programme for primary care: A modelling study based on a randomised controlled trial. BMJ
Open. [Link]
-, E. K. N., Mulumba, M. B., Musisi, B., & Nakatte, G. (2024). Assessing Nurse Educators'
Competencies for Adopting Blended Learning in the Skills Labs in Uganda's Public Nursing
Schools. RA Journal Of Applied Research. [Link]
An Expert Guide to First-Order Logic and Model Theory.
[Link]
model-theory/
Introduction to C Programming for Computer Engineering Students
1. C Programming Language
o Definition: A high-level, general-purpose programming language
developed by Dennis Ritchie in the early 1970s at Bell Labs.
o Features: Procedural language, portability, rich library support,
efficient and fast, close to hardware.
o Applications: Operating systems (e.g., UNIX), embedded systems,
system programming, game development.
2. Structure of a C Program
o Preprocessor Directives: Includes libraries, e.g.,
#include<stdio.h>.
o Main Function: The entry point of every C program (int main()).
o Statements and Expressions: Used for actions and calculations.
o Comments: // for single-line, /* */ for multi-line.
3. Basic Syntax
o Tokens: Basic building blocks such as keywords, identifiers,
constants, operators, and special symbols.
o Data Types: Primary (e.g., int, float, char), derived (e.g., arrays,
pointers), enumerated, and void types.
o Variable Declaration: Specifies the type and initial value of a
variable.
4. Control Structures
o Decision Making: if, if-else, else if, switch.
o Loops: for, while, do-while.
o Jump Statements: break, continue, goto.
5. Functions
o Definition: Reusable blocks of code designed to perform specific
tasks.
o Types: Built-in functions (e.g., printf, scanf) and user-defined
functions.
o Function Declaration: Informs the compiler about the function’s
name, return type, and parameters.
o Function Call: Executes the function’s code.
o Parameter Passing: Call by value and call by reference.
o Return Statement: Returns a value to the calling function.
6. Pointers and Memory Management
o Pointers: Variables that store the address of another variable.
o Dynamic Memory Allocation: Functions like malloc, calloc, and
free are used for memory management.
7. Arrays and Strings
o Arrays: Collection of elements of the same data type, indexed
starting at 0.
o Strings: Arrays of characters ending with a null character \0.
8. File Handling
o File Operations: Open (fopen), read/write (fscanf, fprintf), and
close (fclose).
o Modes: r, w, a, binary modes like rb and wb.
9. Common Errors in C Programming
o Syntax Errors, Runtime Errors, Logical Errors, and Memory
Leaks.
10. Best Practices
Use meaningful variable names, properly indent and format code, and
debug regularly.
Functions in C for Computer Engineering Students
1. Introduction to Functions
o Definition: Functions are blocks of reusable code that perform
specific tasks.
o Advantages: Modularizes code, allows reuse, simplifies
debugging, and improves readability.
2. Types of Functions
o Built-in (Library) Functions: Predefined functions provided by C
standard libraries (e.g., printf, scanf).
o User-defined Functions: Created by programmers to perform
specific tasks.
3. Structure of a Function
o Function Declaration: The prototype that informs the compiler
about the function's name, return type, and parameters.
o Function Definition: Contains the actual code to be executed.
o Function Call: Invokes the function to execute its code.
4. Parameter Passing
o Call by Value: Copies the actual value into function parameters.
o Call by Reference: Passes the address of the variable to the
function.
5. Return Statement
o Returns a value to the calling function; void functions do not return
a value.
6. Recursive Functions
o Functions that call themselves for repetitive tasks, e.g., factorial or
Fibonacci.
7. Inline Functions
o Functions expanded in-line during compilation to optimize
performance.
8. Scope and Lifetime of Variables
o Local Variables: Declared inside a function and destroyed after
execution.
o Global Variables: Accessible throughout the program.
Control Structures and Selection in C for Computer Engineering Students
1. Overview of Control Structures
o Dictate the flow of program execution, including sequential,
selection, iteration, and jump.
2. Selection Statements
o if Statement: Executes code if a condition is true.
o if-else Statement: Provides two paths of execution.
o else if Ladder: Evaluates multiple conditions sequentially.
o Nested if Statements: if within another if.
o switch Statement: Executes one block of code from multiple
options.
3. Comparison of if-else and switch
o Use if-else for complex conditions, and switch for matching multiple
constant values.
4. Best Practices in Selection Statements
o Keep conditions concise, avoid deep nesting, and use parentheses
for clarity.
5. Common Errors
o Missing break in switch, mismatched braces, and logical errors in
conditions.
Repetition in Computing (Loops)
1. Introduction to Repetition
o Repetition involves executing code multiple times, reducing
redundancy and automating tasks.
2. Types of Loops
o For Loops: Best for iterations with a predefined range.
o While Loops: Used when the number of iterations is unknown.
o Do-While Loops: Guarantees at least one execution of the loop.
3. Key Concepts in Loop Implementation
o Initialization, condition checking, increment/decrement, and
termination criteria.
4. Applications in Computer Engineering
o Hardware simulation, data processing, algorithm implementation,
and automation.
5. Performance Considerations
o Analyzing loop complexity (e.g., O(n)) and memory usage,
optimizing for performance.
6. Best Practices
o Avoid hardcoding conditions, use debugging tools, and limit nested
loops.
7. Common Pitfalls
o Off-by-one errors, infinite loops, and resource leaks.
Arrays in C for Computer Engineering Students
1. Introduction to Arrays
o Arrays are collections of elements of the same data type, stored in
contiguous memory locations.
2. Types of Arrays
o One-Dimensional Arrays: Linear sequences of elements.
o Two-Dimensional Arrays: Represented as grids or matrices.
o Multi-Dimensional Arrays: Used for complex simulations.
o Dynamic Arrays: Arrays created at runtime, offering flexible size
management.
3. Applications in Computer Engineering
o Data storage, image processing, memory representation, and
algorithm design.
4. Operations on Arrays
o Traversal: Iterating through array elements.
o Insertion and Deletion: Adding/removing elements at specific
positions.
o Searching and Sorting: Linear search, binary search, bubble sort,
etc.
5. Performance Considerations
o Efficient indexing (O(1) access), resizing issues, and memory
usage.
6. Best Practices
o Always check bounds, initialize arrays properly, and optimize
memory usage.
7. Common Errors
o Segmentation faults, off-by-one errors, and memory leaks.
