Technology9

Learning Portal @T9

  • Cyber Attack : Brute Force

    A brute force attack is a trial-and-error method used by cybercriminals to crack passwords, encryption keys, or login credentials. This attack relies on the…

  • Cyber Attack : CFRS

    Cross-Site Request Forgery (CSRF) is a cyberattack that exploits the trust a web application has in a user’s browser. Also known as a “one-click…

  • Cyber attacks : Buffer Overflow

    Buffer overflow is one of the most infamous and longstanding vulnerabilities in computer security. It occurs when a program writes more data to a…

  • Cyber Attacks: DNS poisoning

    DNS (Domain Name System) poisoning, also known as DNS spoofing, is a type of cyberattack that compromises the DNS resolution process, redirecting users to…

  • Cyber Attacks : Whaling

    Whaling is a highly targeted phishing attack that focuses on high-ranking executives, such as CEOs, CFOs, or other influential individuals within an organization. Unlike…

  • Cyber Attack : Tailgating

    Tailgating, also known as “piggybacking,” is a physical security breach where an unauthorized individual gains access to restricted areas by following an authorized person.…

  • Cyber security Attacks : Phising

    Phishing is a deceptive cyberattack in which attackers impersonate legitimate entities to steal sensitive data, such as usernames, passwords, credit card details, or other…

  • Cyber security Attacks: DDOS

    A Distributed Denial of Service (DDoS) attack is a malicious attempt to disrupt the normal traffic of a targeted server, service, or network by…

  • Big Thetha

    Big Θ (Theta) notation is a mathematical concept used to describe the tight bound of an algorithm’s performance. Unlike Big O, which focuses on…

  • Graphs : Dijkstra Algorithm

    Dijkstra’s algorithm is a fundamental graph traversal technique used to find the shortest path from a single source node to all other nodes in…

  • Big Omega

    Big Ω (Omega) notation is a mathematical concept used to describe the best-case performance of an algorithm. It provides a lower bound on the…

  • Unbalanced tree

    An unbalanced tree is a binary tree where the height difference between the left and right subtrees of any node can become significant, leading…

  • Balanced Tree

    A balanced tree is a type of binary tree where the height difference between the left and right subtrees of any node is minimal,…

  • Graphs : DFS

    Depth-First Search (DFS) is a fundamental graph traversal algorithm that explores as far as possible along each branch before backtracking. It is widely used…

  • Graph : BFS

    Breadth-First Search (BFS) is a fundamental graph traversal algorithm that explores all vertices at the current depth level before moving to the next level.…

  • Graphs : Beelman Ford Algorithm

    The Bellman-Ford algorithm is a powerful graph-based algorithm used to find the shortest paths from a single source vertex to all other vertices in…

  • Big o notation

    Big O Notation is a mathematical concept widely used in computer science to describe the efficiency and scalability of algorithms. It provides a framework…

  • Graphs : A* Algorithm

    The A* algorithm is a widely used graph traversal and search algorithm, ideal for finding the shortest path between two nodes. It combines the…

  • UX Design: Cognitive Overhead

    Cognitive overhead refers to the mental effort required by users to understand, navigate, and interact with a digital product or service. In UX design,…

  • UX Design: Choice overload

    In UX design, choice overload, also known as decision fatigue, occurs when users are presented with an overwhelming number of options, resulting in confusion,…

  • UX Design: HF Wireframe

    In the realm of User Experience (UX) design, an HF (High-Fidelity) Wireframe is a detailed and interactive representation of a website or application. It…