Annotations in Java are metadata that provide information about the program but do not change its behavior. They can be used for compilation checks, runtime processing, or documentation generation. References: 1. @Override 2. @Deprecated /[ˈdep.rə.keɪt]/ Can be used on a field, method, constructor or class and indicates that this element it outdated and should not be used anymore.
Notes for the eclipse plugin development. References: Wizards and Dialogs Eclipse fragment projects - Tutorial Refer 1. New Project Creation Wizards Every plugin, fragment, feature and update site is represented by a single project in the workspace and allow PDE(Plugin Development Environment) to validate their manifest file(s). File > New > Project... > Plug-in Development Use a Plugin Project if we’re building new functionality. Use a Fragment Project if we need to modify an existing plugin without changing its core code. ...
See plus plus :) . Refer 0. Notes printf/snprintf Cheat Sheet {C / C++} Integer Data type Specifier Notes int8_t / signed char %hhd signed 8-bit uint8_t / unsigned char %hhu unsigned 8-bit int16_t / short %hd signed 16-bit uint16_t / unsigned short %hu unsigned 16-bit int32_t / long %ld signed 32-bit uint32_t / unsigned long %lu unsigned 32-bit int64_t / long long %lld signed 64-bit uint64_t / unsigned long long %llu unsigned 64-bit Floating point Data type Specifier Notes float %f 4-byte float double %f Arduino AVR: double = float long double %Lf depends on platform %e → scientific notation %g → auto select %f or %e Char / String Data type Specifier Notes char %c single character char* / String %s null-terminated string Pointer / Address Data type Specifier Notes void* %p memory address, hex Hex / Octal / Binary Data type Specifier Notes unsigned int %x / %X hexadecimal unsigned int %o octal Arduino only %b binary Flags, Width, Precision %-10d → left-justify, width 10 %010d → pad with zeros, width 10 %.2f → 2 decimal digits %*d → dynamic width Specific Notes uint32_t → %lu int32_t → %ld uint16_t → %u int16_t → %d or %hd uint8_t → %u or %hhu int8_t → %d or %hhd float → %f Use snprintf() with correctly sized buffer to avoid overflow Code Timming C++11 comes with some functionality in the chrono library to time our code to see how long it takes to run. e.g. #include <array> #include <chrono> // for std::chrono functions #include <cstddef> // for std::size_t #include <iostream> #include <numeric> // for std::iota const int g_arrayElements { 10000 }; class Timer { private: // Type aliases to make accessing nested type easier using Clock = std::chrono::steady_clock; using Second = std::chrono::duration<double, std::ratio<1> >; std::chrono::time_point<Clock> m_beg{ Clock::now() }; public: void reset() { m_beg = Clock::now(); } double elapsed() const { return std::chrono::duration_cast<Second>(Clock::now() - m_beg).count(); } }; void sortArray(std::array<int, g_arrayElements>& array) { // Step through each element of the array // (except the last one, which will already be sorted by the time we get there) for (std::size_t startIndex{ 0 }; startIndex < (g_arrayElements - 1); ++startIndex) { // smallestIndex is the index of the smallest element we’ve encountered this iteration // Start by assuming the smallest element is the first element of this iteration std::size_t smallestIndex{ startIndex }; // Then look for a smaller element in the rest of the array for (std::size_t currentIndex{ startIndex + 1 }; currentIndex < g_arrayElements; ++currentIndex) { // If we've found an element that is smaller than our previously found smallest if (array[currentIndex] < array[smallestIndex]) { // then keep track of it smallestIndex = currentIndex; } } // smallestIndex is now the smallest element in the remaining array // swap our start element with our smallest element (this sorts it into the correct place) std::swap(array[startIndex], array[smallestIndex]); } } int main() { std::array<int, g_arrayElements> array; std::iota(array.rbegin(), array.rend(), 1); // fill the array with values 10000 to 1 Timer t; sortArray(array); std::cout << "Time taken: " << t.elapsed() << " seconds\n"; return 0; } Command line Command line arguments are optional string arguments that are passed by the operating system to the program when it launch. Passing command line arguments: we simply list the command line arguments right after the executeable name. Using command line arguments: by using different form of main(): main(int argc, char* argv[]) / main(int argc, char** argv) argc: argument count, always be at least 1, because the first argument is always the name of the program itself. argv: is where the actual argument values are stored (think: argv = argument values) e.g. #include <iostream> #include <sstream> // for std::stringstream #include <string> int main(int argc, char* argv[]) { if (argc <= 1) { // On some operating systems, argv[0] can end up as an empty string instead of the program's name. // We'll conditionalize our response on whether argv[0] is empty or not. if (argv[0]) std::cout << "Usage: " << argv[0] << " <number>" << '\n'; else std::cout << "Usage: <program name> <number>" << '\n'; return 1; } std::stringstream convert{ argv[1] }; // set up a stringstream variable named convert, initialized with the input from argv[1] int myint{}; if (!(convert >> myint)) // do the conversion myint = 0; // if conversion fails, set myint to a default value std::cout << "Got integer: " << myint << '\n'; return 0; } Things that can impact the performance of the program: TBD Measuring performance: gather at least 3 results. the program runs in 10 seconds etc 1. Introduction C++ was developed as an extension to C. It adds man few features to the C language, and tis perhaps best through of as a superset of C. Step 1: Define the problem that you would like to solve ...
References: How to Find the Complexity of an Algorithm 1. Introduction Algorithmic complexity is a measure of the resources and algorithm requires about its input size. The two main types are: Time complexity: number of operations performed by an algorithm Space complexity: the amount of memory consumed 2. Time Complexity The time complexity of an algorithm quantifies the amount of time (operations) taken by an algorithm to run as a function of the length of the input It’s commonly expressed by Big-O notation Hierarchy of Time Complexities (Fastest to Slowest): (O(1)) - Constant: Fastest; performance is independent of input size. (O(\log n)) - Logarithmic: Very fast, typical for binary searches. (O(n)) - Linear: Efficient, grows proportionally to input. (O(n\log n)) - Linearithmic: Common for efficient sorting, like QuickSort. (O(n^{2})) - Quadratic: Acceptable for small input, common in nested loops. (O(2^{n})) or (O(n!)) - Exponential/Factorial: Generally only acceptable for very small inputs. 2.1. Constant Time - (O(1)) It takes the same amount of time regardless[rɪˈɡɑːrd.ləs] of input size. 2.2 Linear Time - (O(n)) [ˈlɪn.i.ɚ] ...
Java is a programming language created by James Gosling from Sun Microsystems (Sun) in 1991. Java allows to write a program and run it on multiple operating systems. References: Java Platform Standard Edition 8 Documentation Introduction to Java programming - Tutorial 1. Introduction to Java Oracle has two products implement Java SE: JDK (Java SE Development Kit): is a superset of JRE. JRE (Java SE Runtime Environment): provides the libraries, the Java Virtual Machine (JVM) and other components. 1.1. Development Process with Java Source code is first written in .java file. Those source files are then compiled into .class files by the Java compiler( javac). A .class file contains bytecodes(the machine language of the Java VM). The .class file will be run by Java tool as an instance of the Java VM. The Java virtual machine (JVM) is a software implementation of a computer that executes programs like a real machine. Because the Java VM is available on many different OS, the same .class files are capable of running on many OS too. ...
Explain how to use basic I/O. References: Basic I/O Reading and writing files in Java (Input/Output) - Tutorial 1. I/O Streams An I/O Stream represents and input source or an output destination. A stream is a sequence of data. input stream: is used to read data from source, once item at a time. outputs stream: is used to write data to a destination, once item |at a time. --stream--> 0101010101... ----------> java.io package ...
1. Introduce Modern applications are integrating with Large Language Models (LLMs) to build AI solution. The AI model’s response will be more context-ware if we provide it external source like databases, file systems, pictures ,… MCP provides a standard way to connect AI-powered applications with external data sources. 2. Model Context Protocol Components overview: MCP follows a client-server architecture, that included: MCP provides two transport channels, with many transport types: ...
This is where I study English grammar on my own every day. It’s a place where I not only improve my language skills but also discover new grammar rules. Step by step, I am working to become more confident in writing and communicating in English. The journey isn’t easy, but I believe that with patience and effort, I will continue to make progress. 1. Tenses Tenses indicate the time of an action or state of being expressed by a verb. ...
Refer1 Refer1 Introduction Abstract Class: The name of an abstract class, method is shown in italics. An abstract classifier can also be shown using the keyword {abstract} or «abstract» after or below the name. Static: Class (i.e. static) methods and fields are indicated by underlining Constant (i.e. final) fields are indicated via naming convention: constants should be in ALL_CAPS