• Professional Development
  • Medicine & Nursing
  • Arts & Crafts
  • Health & Wellbeing
  • Personal Development

12 Educators providing Algorithm courses

Black's Academy

black's academy

London

AQA A level Mathematics 7357 AS level Mathematics 7356 GCSE higher level Mathematics 8300H GCSE foundation level Mathematics 8300F Edexcel A level Mathematics 9MA0 AS level Mathematics 8MA0 GCSE higher level Mathematics 1MA1H GCSE foundation level Mathematics 1MA1F OCR A level Mathematics H240 AS level Mathematics H230 GCSE higher level Mathematics J560 GCSE foundation level Mathematics Other courses IGCSE extended level Mathematics 0580 Scholastic Apititude Test (USA Exam) GED (USA Exam) All other exams Click on any of the above links to obtain free resources Book free diagnostic now blacksacademy symbol Director Peter Fekete Educational consultancy | Curriculum design | Courses for adults | Public speaking | Publications CONTACT a CONTENT OF THE REMOTE LEARNING SYSTEM * US GRADE 6 / UK GCSE GRADE 2–3 1. Addition and subtraction 2. Starting number sequences 3. Further number sequences part I 4. Multiplication to 8 x 8 5. Further number sequences part II 6. Multiplication to 12 x 12 7. Square numbers 8. Positive and negative numbers 9. Sums 10. Shapes and perimiters 11. Measurement and areas 12. Reading information 14. Understanding fractions 15. Decimals 16. Percentages 17. Long multiplication 18. Beginning algebra 19. Beginning probability 20. Beginning geometry 21. Properties of numbers 22. Telling the time 23. Geometry in three dimensions US GRADE 7 / UK GCSE GRADE 4 1. Deeper understanding of number 2. Combinations 3. Long division 4. Operations 5. Practical problems 6. Order and type of numbers 7. Measurement 8. Time and time management 9. Fractions 10. Organising information 11. Ratio and proportion 12. Probability 13. Angles 14. Visual reasoning 15. Bearings 16. Working in two dimensions 17. Working in three dimensions 18. Transformation geometry 19. Continuing algebra US GRADE 8 / UK GCSE GRADE 5–6 1. Patterns and pattern recognition 2. Lines, regions and inequalities 3. Mastering fractions 4. Types of number 5. More about triangles 6. Measurement and computation 7. Proportionality 8. Working with space 9. Indices 10. Further work with ratio 11. Investments 12. Further algebra 13. Quadrilaterals and polygons 14. Speed and displacement 15. Continuing with probability 16. Describing data US GRADE 9 / UK GCSE GRADE 6–7 1. Further proportionality 2. Congruency 3. The tricky aspects of algebra 4. Lines and equations 5. Basic formal algebra 6. Analysis and display of data 7. Graphing functions 8. Dimension and algebra 9. Algebraic fractions 10. Circle theorems 11. Algebraic factors 12. Simultaneous equations 13. Velocity and acceleration 14. Proportionality and scatter 15. Number puzzles US GRADE 10/ UK GCSE GRADE 7–8 1. Transpositions 2. Patterns and pattern recognition 3. Algebraic manipulations 4. Quadratics 5. Surds 6. Linear inequalities 7. Functions 8. Trigonometry 9. Systems of linear equations 10. Further presentation and analysis of data 11. Polynomial functions 12. Algebraic products 13. Finding roots 14. Intersection of lines and curves 15. Indices and index equations US GRADE 11/ UK GCSE GRADE 8–9 1. Completing the square 2. Venn diagrams 3. Coordinate geometry with straight lines 4. Further trigonometry 5. Transformations of curves 6. Modulus 7. Basic vectors 8. Quadratic inequalities 9. The quadratic discriminant 10. Arcs, sectors and segments 11. Circles, curves and lines 12. Probability and Venn diagrams 13. Functions, domains and inverses 14. Trigonometric functions 15. Recurrence relations 16. Further elementary vectors FREE LEGACY RESOURCES Business Studies, Economics, History, Mathematics, Philosophy, Sociology Business Studies PEOPLE AND ORGANISATIONS 1. Management structures and organisations 2. Leadership and management styles 3. Classical theory of motivation 4. Human relations school 5. Management by objectives 6. Workforce planning 7. Recruitment 8. Payment systems MARKETING 1. The economic problem 2. Money and exchange 3. Price determination 4. Determinants of demand 5. Market analysis 6. Marketing and the product life cycle 7. Objectives and marketing EXTERNAL INFLUENCES 1. Stakeholders 2. Business ethics 3. Market conditions 4. Business and the trade cycle 5. Business and technological change 6. Business and inflation 7. Business and exchange rates 8. Business and unemployment ACCOUNTING & FINANCE 1. Cash Flow Management 2. Costs, Profits & Breakeven Analysis 3. Budgeting & Variance Analysis 4. Sources of Finance 5. Profit & Loss Account 6. The Balance Sheet 7. Depreciation by the fixed-rate method 8. Reducing Balance Method 9. Stock Evaluation 10. Working Capital and Liquidity 11. Accounting Principles and Window Dressing 12. Costing and Management Accounting 13. Investors and the Corporate Life Cycle 14. Investment Appraisal: Average Rate of Return 15. Investment Appraisal: Payback Method 16. Investment Appraisal: Net Present Value 17. Investment Appraisal: Internal Rate of Return 18. Profitability Ratios 19. Liquidity Ratios 20. Efficiency and shareholder ratios 22. Gearing and Risk 23. Net Asset Value Economics MARKETS & MARKET FAILURE 1. The economic problem 2. Productive and allocative efficiency 3. Money and exchange 4. Price determination 5. The money market 6. Introduction to the labour market 7. The determinants of demand 8. Supply and elasticity of supply 9. Excess supply and excess capacity 10. Elasticity of demand 11. Market structures 12. Income and cross elasticity 13. Market failure 14. Factor immobility 15. Public and private goods 16. Merit and non-merit goods 17. Cost-benefit analysis 18. Competition policy 19. Market failure and government intervention History ANCIENT HISTORY 1. Prehistory of Greece 2. Mycenae, the Heroic Age c.1550—1125 BC 3. The Greek Middle Ages c.1125—c.700 BC 4. The Greek Tyrannies c. 650—510 BC 5. Sparta 6th and 7th centuries BC 6. Athens and Solon 7. The early inhabitants of Italy 8. The Etruscans 9. Early Roman History up to Tarquin GERMANY & EUROPE 1870—1939 1. Social Change from 1870 to 1914 2. Socialism in Europe 1870 to 1914 3. The Balance of Power in Europe 1870 4. Anti Semitism in Europe 1870 to 1914 5. The Structure of Wilhelmine Germany 6. Bismarck and the Alliance System 7. Weltpolitik 8. Colonial Rivalries 9. First and Second Moroccan Crises 10. The First World War triggers 11. The Causes of the First World War 12. Germany and the First World War 13. Military history of the First World War 14. The Treaty of Versailles 15. The Domestic Impact of the First World War 16. The German Revolution 17. The Weimar Republic 18. The Early Years of the Nazi Party 19. The Rise of the Nazi Party 20. The Establishment of the Nazi Dictatorship 21. Nazi Rule in Germany 1934 to 1939 22. The Economics of the Third Reich 23. Appeasement RUSSIA & EUROPE 1855—1953 1. Alexander II and the Great Reforms 2. Imperial Russia under Alexander III 3. Nicholas II and the 1905 revolution 4. Social and economic developments in Russia 5. Russia: the Great war and collapse of Tsarism 6. Provisonal Government & October Revolution 7. The Era of Lenin 8. The Development of Lenin's Thought 9. New Economic Policy and the Rise of Stalin 10. Stalin and the Soviet Union 1924 to 1953 11. Stalin and the Soviet Economy 12. Stalin and International Relations BRITAIN 1914—1936 1. The Great War and Britain 1914—15 2. Britain during the Great War, 1915—16 3. Lloyd George & the Great War, 1916—1918 4. Great Britain after the War, 1918—22 5. British Politics, 1922—25 6. Class Conflict & the National Strike, 1926 7. Britain & International Relations, 1925—29 8. Social Trends in Britain during the 1920s 9. Social Issues during the late 1920s 10. British Politics 1926—29; Election of 1929 11. Britain — the crisis of 1929 12. The Labour Government of 1929—31 13. Britain and economic affairs, 1931—33 14. Britain and Foreign Affairs, 1931—36 15. Social Conditions in Britain during the 1930s Advanced level Mathematics ALGEBRA & GEOMETRY 1. Simultaneous Equations 2. Polynomial Algebra 3. Cartesian Coordinates 4. The equation of the straight line 5. Intersection of lines and curves 6. Remainder and Factor Theorems 7. Functions 8. Quadratic Inequalities 9. Graphs of Inequalities 10. Indices 11. Polynomial Division 12. Velocity-Time Graphs 13. Tally Charts 14. Absolute and relative errors 15. Sequences and Series 16. Arithmetic Progressions 17. Proof by Contradiction 18. Geometric Progressions 19. The Cartesian Equation of the Circle 20. Transformations of graphs 21. Plane Trigonometry 22. Modulus 23. Trigonometric Functions 24. Inverse Trigonometric Functions 25. Linear Inequalities 26. Proportionality 27. Probability 28. Surds 29. Special Triangles 30. Quadratic Polynomials 31. Roots & Coefficients of Quadratics 32. Radian measure 33. Permutations and Combinations 34. Set Theory and Venn Diagrams 35. Sine and cosine rules 36. Elementary Trigonometric Identities 37. Roots and curve sketching 38. Graphs and roots of equations 39. Picards Method 40. Small Angle Approximations 41. Simultaneous equations in three unknowns 42. Linear relations and experimental laws 43. Conditional Probability 44. Pascal's Triangle and the Binomial Theorem 45. Index Equations and Logarithms 46. The Binomial Theorem for Rational Indices 47. Exponential Growth and Decay 48. Exponential and Natural Logarithm 49. Compound Angle Formulas 50. Sinusoidal functions 51. Vector Algebra 52. The Vector Equation of the Straight Line 53. The Scalar Product of Vectors 54. Axiom Systems 55. Introduction to Complex Numbers 56. The algebra of complex numbers 57. Complex Numbers and the Argand plane 58. De Moivres Theorem 59. Eulers formula 60. Further loci of complex numbers 61. Further graph sketching 62. Mathematical Induction 63. Proof of the Binomial Theorem 64. Polar Coordinates 65. Conic sections 66. Partial Fractions 67. First-order linear recurrence relations 68. Summation finite series with standard results 69. Method of differences 70. Trigonometric Equations 72. Series Expansion 73. Lagrange Interpolating Polynomial 74. Error in an interpolating polynomial 75. Abelian groups 76. Geometrical uses of complex numbers 77. Cyclic Groups 78. The Cayley-Hamilton Theorem 2x2 Matrices 79. Cayley Theorem 80. Determinants 81. Isomorphisms 82. Lagrange theorem 83. Properties of groups 84. Group structure 85. Subgroups 86. Homomorphisms 87. Matrix Algebra 88. Determinant and Inverse of a 2x2 matrix 89. Gaussian elimination 90. Matrix representation of Fibonacci numbers 91. Matrix groups 92. Inverse of a 3 x 3 Matrix 93. Singular and non-singular matrices 94. Properties of Matrix Multiplication 95. Induction in Matrix Algebra 96. Properties of Determinants 97. Permutation groups 98. First Isomorphism Theorem for Groups 99. Roots of Polynomials of Degree 3 100. Scalar Triple Product 101. Systems of Linear Equations 102. Matrix Transformations 103. Mappings of complex numbers 104. Cross product of two vectors 105. Vector planes 106. Eigenvalues and Eigenvectors CALCULUS 1. Introduction to the Differential Calculus 2. Stationary points and curve sketching 3. Applications of Differentiation 4. Differentiation from First Principles 5. The Trapezium Method 6. Integration 7. Direct Integration 8. Applications of integration to find areas 9. Graphs of Rational Functions 10. Derivatives of sine and cosine 11. Products, Chains and Quotients 12. Volumes of Revolution 13. Exponential and Logarithmic Functions 14. Integration by Parts 15. Parametric Equations 16. The Integral of 1/x 17. Integration by Substitution 18. Implicit Differentiation 19. Formation of a differential equation 20. Separation of variables 21. Integrals of squares of trig functions 22. Maclaurin Series 23. Techniques of Integration 24. Integrating Factor 25. The Newton-Raphson formula 26. Errors in Numerical Processes 27. Roots and Recurrence Relations 28. Derivatives of Inverse Trig. Functions 29. Second order homogeneous equations 30. Second order inhomogeneous equations 31. Implicit differentiation — second derivative 32. Integrands to inverse trigonometric functions 33. Integrands to logarithmic function 34. Integration of Partial Fractions 35. Logarithms and Implicit Differentiation 36. Implicit differentiation and MaClaurin series 37. Separation of variables by substitution 38. Trigonometric Substitutions for Integrals 39. Truncation Errors 40. Euler and Trapezoidal Method 41. Numerical methods for differential equations 42. Simpson Method 43. Proof of Simpson Formula 44. Richardson Extrapolation 45. Arc length of a curve in Cartesian coordinates 46. Arc length of a curve in Polar coordinates 47. Arc length of a curve: Parametric form 48. Curves in Euclidean space 49. Functions and continuity 50. The gradient of a scalar field 51. The derivatives of the hyperbolic functions 52. Hyperbolic Functions 53. Inverse Hyperbolic Functions 54. Hyperbolic Identities 55. Integrals with inverse hyperbolic functions 56. Reduction formulae 57. Simultaneous differential equations 58. Surface of Revolution 59. Vector differential calculus 60. Scalar Fields and Vector Functions STATISTICS & PROBABILITY 1. Central Tendency: Mean, Median and Mode 2. Standard Deviation 3. Cumulative Frequency 4. Discrete Random Variables 5. Mutually exclusive and independent events 6. The Binomial Distribution 7. The Normal Distribution 8. Standardised Normal Distribution 9. Regression Lines 10. Correlation 11. The Geometric Distribution 12. Hypothesis Testing — Binomial Distribution 13. Index Numbers 14. Time Series Analysis 15. Bayes Theorem 16. Confidence interval mean — known variance 17. The Central Limit Theorem 18. Pearsons product moment correlation 19. Spearmans Rank Correlation Coefficient 20. Hypothesis Testing — Normal Distribution 21. The Poisson Distribution 22. The Normal Approximation to the Binomial 23. The Normal Approximation to the Poisson 24. The Poisson Approximation to the Binomial 25. Type I and type II errors 26. Scalar multiples of a Poisson variable 27. Test for the Mean of a Poisson distribution 28. Random Number Sampling 29. Estimating Population Parameters 30. Random Samples and Sampling Techniques 31. The Concept of a Statistic 32. Hypothesis test for the population variance 33. Central Concepts in Statistics 34. Continuous Probability Distributions 35. Modeling: Chi squared goodness of fit 36. Chi squared test for independence 37. Degrees of Freedom 38. Difference Sample Means Unknown Variance 39. Moment generating functions 40. Probability generating functions 41. Linear Combinations of Random Variables 42. Maximum Likelihood Estimators 43. Wilcoxon signed rank test on median 44. Non-parametric significance tests 45. Single-sample sign test of population median 46. Paired-sample sign test on medians 47. Paired sample t-test for related data 48. Paired sample Wilcoxon signed rank test 49. Difference of two sample means 50. Pooled sample estimate 51. Testing the Sample Mean 52. The Uniform Distribution MECHANICS 1. Velocity-Time and Displacement-Time Graphs 2. Force diagrams 3. Representation of Forces by Vectors 4. Static Equilibrium 5. Equilibrium of coplanar forces 6. Weight and Free Fall 7. Normal Reaction and Friction 8. Newtons First and Second Laws 9. Relative Motion 10. Projectiles 11. Calculus and Kinematics 12. Motion of a Particle: Vector calculus form 13. Work 14. Energy Conversions 15. Gravitational potential and kinetic energy 16. Connected Particles 17. Moments 18. Linear momentum 19. Power 20. Hookes Law 21. Simple Harmonic Motion 22. Simple Harmonic Motion and Springs 23. Calculus, Kinematics in Three Dimensions 24. Sliding, toppling and suspending 25. Impulsive Tensions in Strings 26. Angular Velocity 27. Motion in a Horizontal Circle 28. Centre of Mass of a Uniform Lamina 29. Motion in a Vertical Circle 30. Motion under a Variable Force 31. Conservation of Angular Momentum 32. Centre of Mass of a Composite Body 33. Motion under a central force 34. Centre of Mass of a Uniform Lamina 35. Centre of Mass Uniform Solid of Revolution 36. Equilibrium of Rigid Bodies in Contact 37. Damped Harmonic Motion 38. Moment of Inertia 39. Impulse, elastic collisions in one dimension 40. Parallel and Perpendicular Axis Theorems 41. Motion described in polar coordinates 42. Simple pendulum 43. Compound pendulum 44. Stability and Oscillations 45. Vector calculus 46. Linear Motion of a Body of Variable Mass DISCRETE & DECISION 1. Algorithms 2. Introduction to graph theory 3. Dijkstra algorithm 4. Sorting Algorithms 5. Critical Path Analysis 6. Dynamic Programming 7. Decision Trees 8. The Maximal Flow Problem 9. The Hungarian algorithm 10. Introduction to Linear Programming 11. Simplex Method 12. Matching Problems 13. Game Theory 14. Minimum connector problem 15. Recurrence relations 16. Proofs for linear recurrence relations 17. Simulation by Monte Carlo Methods 18. Travelling and Optimal Salesperson Problems 19. The Travelling Salesperson Problem Philosophy INTRODUCTION TO PHILOSOPHY 1. The problem of evil 2. Introduction to Plato 3. Knowledge, belief and justification 4. Descartes Meditation I 5. Introduction to the problem of universals 6. Introduction to metaethics 7. Subjectivism versus objectivism 8. Aristotle's function argument 9. Natural Law Theory 10. Utilitarianism 11. The Nicomachaen Ethics of Aristotle 12. Virtue Ethics 13. Descartes Meditation II 14. Hume and empiricism 15. The paradox of induction 16. Hume's attack on Descartes 17. The Cosmological Argument 18. The Ontological Argument 19. The Teleological Argument 20. The Argument from religious experience 21. The Moral Argument 22. The argument from illusion 23. Materialism 24. Human Identity Sociology PERSPECTIVES & METHODOLOGY 1. Introduction to Marxism 2. Introduction to Durkheim 3. Weber: classes, status groups and parties 4. Introduction to patriarchy and gender roles 5. Mass culture theory 6. The Frankfurt school STRATIFICATION & DIVERSITY 1. Ethnic groups and discrimination 2. Race, Ethnicity and Nationalism 3. Social Inequality 4. Theories of Racism 5. Class structure 6. Modern Functionalism and Stratification 7. Social Mobility 8. Bottomore: Classes in Modern Britain 9. American exceptionalism ASPECTS OF SOCIETY 1. Definitions of Poverty 2. Theories of Poverty 3. Solutions to Poverty 4. Alienation 5. Leisure 6. Work and Technological Change 7. Conflict and Cooperation at Work 8. Attitudes to Work 9. Unemployment 10. Perspectives on Education 11. Education and Ethnicity 12. Education and Gender 13. The Family and Social Structure 14. The Family and Household Structure 15. Conjugal Roles 16. Marital Breakdown 17. Post War Education in Britain 18. British Social Policy 1945—1990

Courses matching "Algorithm"

Show all 442

55337 Introduction to Programming

By Nexus Human

Duration 5 Days 30 CPD hours This course is intended for This course is intended for anyone who is new to software development and wants, or needs, to gain an understanding of programming fundamentals and object-oriented programming concepts. They will typically be high school students, post-secondary school students, or career changers, with no prior programming experience. They might want to gain an understanding of the core programming fundamentals before moving on to more advanced courses such as Programming in C#. Overview Explain core programming fundamentals such as computer storage and processing. Explain computer number systems such as binary. Create and use variables and constants in programs. Explain how to create and use functions in a program. Create and use decisions structures in a computer program. Create and use repetition (loops) in a computer program. Explain pseudocode and its role in programming. Explain the basic computer data structures such as arrays, lists, stacks, and queues. Implement object-oriented programming concepts. Create and use classes in a computer program. Implement encapsulation, inheritance, and polymorphism. Describe the base class library (BCL) in the .NET Framework. Explain the application security concepts. Implement simple I/O in a computer program. Identify application errors and explain how to debug an application and handle errors. Identify the performance considerations for applications. In this 5-day course, students will learn the basics of computer programming through the use of Microsoft Visual Studio 2022 and the Visual C# and Visual Basic programming languages. The course assumes no prior programming experience and introduces the concepts needed to progress to the intermediate courses on programming, Programming in C#. The focus will be on core programming concepts such as computer storage, data types, decision structures, and repetition by using loops. The course also covers an introduction to object-oriented programming covering classes, encapsulation, inheritance, and polymorphism. Coverage is also included around exception handling, application security, performance, and memory management. 1 - Introduction to Core Programming Concepts Computer Data Storage and Processing Application Types Application Lifecycle Code Compilation 2 - Core Programming Language Concepts Syntax Data Types Variables and Constants 3 - Program Flow Introduction to Structured Programming Concepts Introduction to Branching Using Functions Using Decision Structures Introducing Repetition 4 - Algorithms and Data Structures Understand How to Write Pseudocode Algorithm Examples Introduction to Data Structures 5 - Error Handling and Debugging Introduction to Program Errors Introduction to Structured Error Handling Introduction to Debugging 6 - Introduction to Object-Oriented Programming Introduction to Complex Structures Introduction to Structs Introduction to Classes Introducing Encapsulation 7 - More Object-Oriented Programming Introduction to Inheritance Introduction to Polymorphism Introduction to .NET and the Base Class Library 8 - Introduction to Application Security Authentication and Authorization Code Permissions on Computers Introducing Code Signing 9 - Core I/O Programming Using Console I/O Using File I/O 10 - Application Performance and Memory Management Value Types vs Reference Types Converting Types The Garbage Collector Additional course details: Nexus Humans 55337 Introduction to Programming training program is a workshop that presents an invigorating mix of sessions, lessons, and masterclasses meticulously crafted to propel your learning expedition forward. This immersive bootcamp-style experience boasts interactive lectures, hands-on labs, and collaborative hackathons, all strategically designed to fortify fundamental concepts. Guided by seasoned coaches, each session offers priceless insights and practical skills crucial for honing your expertise. Whether you're stepping into the realm of professional skills or a seasoned professional, this comprehensive course ensures you're equipped with the knowledge and prowess necessary for success. While we feel this is the best course for the 55337 Introduction to Programming course and one of our Top 10 we encourage you to read the course outline to make sure it is the right content for you. Additionally, private sessions, closed classes or dedicated events are available both live online and at our training centres in Dublin and London, as well as at your offices anywhere in the UK, Ireland or across EMEA.

55337 Introduction to Programming
Delivered Online
£2,975

EC-Council Certified Ethical Hacker (CEH) v12

By Nexus Human

Duration 5 Days 30 CPD hours This course is intended for The Certified Ethical Hacking v12 course will significantly benefit security officers, auditors, security professionals, site administrators, and anyone who is concerned about the integrity of the network infrastructure. Overview Information security controls, laws, and standards. Various types of footprinting, footprinting tools, and countermeasures. Network scanning techniques and scanning countermeasures Enumeration techniques and enumeration countermeasures Vulnerability analysis to identify security loopholes in the target organization?s network, communication infrastructure, and end systems. System hacking methodology, steganography, steganalysis attacks, and covering tracks to discover system and network vulnerabilities. Different types of malware (Trojan, Virus, worms, etc.), system auditing for malware attacks, malware analysis, and countermeasures. Packet sniffing techniques to discover network vulnerabilities and countermeasures to defend against sniffing. Social engineering techniques and how to identify theft attacks to audit human-level vulnerabilities and social engineering countermeasures. DoS/DDoS attack techniques and tools to audit a target and DoS/DDoS countermeasures. Session hijacking techniques to discover network-level session management, authentication/authorization, and cryptographic weaknesses and countermeasures. Webserver attacks and a comprehensive attack methodology to audit vulnerabilities in webserver infrastructure, and countermeasures. Web application attacks, comprehensive web application hacking methodology to audit vulnerabilities in web applications, and countermeasures. SQL injection attack techniques, injection detection tools to detect SQL injection attempts, and countermeasures. Wireless encryption, wireless hacking methodology, wireless hacking tools, and Wi-Fi security tools. Mobile platform attack vector, android vulnerability exploitations, and mobile security guidelines and tools. Firewall, IDS and honeypot evasion techniques, evasion tools and techniques to audit a network perimeter for weaknesses, and countermeasures. Cloud computing concepts (Container technology, serverless computing), the working of various threats and attacks, and security techniques and tools. Penetration testing, security audit, vulnerability assessment, and penetration testing roadmap. Threats to IoT and OT platforms and defending IoT and OT devices. Cryptography ciphers, Public Key Infrastructure (PKI), cryptography attacks, and cryptanalysis tools. CEH provides an in-depth understanding of ethical hacking phases, various attack vectors, and preventative countermeasures. It will teach you how hackers think and act maliciously so you will be better positioned to setup your security infrastructure and defend against future attacks. An understanding of system weaknesses and vulnerabilities helps organizations strengthen their system security controls to minimize the risk of an incident. CEH was built to incorporate a hands-on environment and systematic process across each ethical hacking domain and methodology, giving you the opportunity to work towards proving the required knowledge and skills needed to achieve the CEH credential. You will be exposed to an entirely different posture toward the responsibilities and measures required to be secure. Now in its 12th version, CEH continues to evolve with the latest operating systems, tools, tactics, exploits, and technologies. 1 - Introduction to Ethical Hacking Information Security Overview Cyber Kill Chain Concepts Hacking Concepts Ethical Hacking Concepts Information Security Controls Information Security Laws and Standards 2 - 2 - Foot-printing and Reconnaissance Footprinting Concepts Footprinting through Search Engines Footprinting through Web Services Footprinting through Social Networking Sites Website Footprinting Email Footprinting Who is Footprinting DNS Footprinting Network Footprinting Footprinting through Social Engineering Footprinting Tools Footprinting Countermeasures 3 - Scanning Networks Network Scanning Concepts Scanning Tools Host Discovery Port and Service Discovery OS Discovery (Banner Grabbing/OS Fingerprinting) Scanning Beyond IDS and Firewall Draw Network Diagrams 4 - Enumeration Enumeration Concepts NetBIOS Enumeration SNMP Enumeration LDAP Enumeration NTP and NFS Enumeration SMTP and DNS Enumeration Other Enumeration Techniques Enumeration Countermeasures 5 - Vulnerability Analysis Vulnerability Assessment Concepts Vulnerability Classification and Assessment Types Vulnerability Assessment Solutions and Tools Vulnerability Assessment Reports 6 - System Hacking System Hacking Concepts Gaining Access Escalating Privileges Maintaining Access Clearing Logs 7 - Malware Threats Malware Concepts APT Concepts Trojan Concepts Virus and Worm Concepts Fileless Malware Concepts Malware Analysis Countermeasures Anti-Malware Software 8 - Sniffing Sniffing Concepts Sniffing Technique: MAC Attacks Sniffing Technique: DHCP Attacks Sniffing Technique: ARP Poisoning Sniffing Technique: Spoofing Attacks Sniffing Technique: DNS Poisoning Sniffing Tools Countermeasures Sniffing Detection Techniques 9 - Social Engineering Social Engineering Concepts Social Engineering Techniques Insider Threats Impersonation on Social Networking Sites Identity Theft Countermeasures 10 - Denial-of-Service DoS/DDoS Concepts DoS/DDoS Attack Techniques BotnetsDDoS Case Study DoS/DDoS Attack Tools Countermeasures DoS/DDoS Protection Tools 11 - Session Hijacking Session Hijacking Concepts Application Level Session Hijacking Network Level Session Hijacking Session Hijacking Tools Countermeasures 12 - Evading IDS, Firewalls, and Honeypots IDS, IPS, Firewall, and Honeypot Concepts IDS, IPS, Firewall, and Honeypot Solutions Evading IDS Evading Firewalls IDS/Firewall Evading Tools Detecting Honeypots IDS/Firewall Evasion Countermeasures 13 - Hacking Web Servers Web Server Concepts Web Server Attacks Web Server Attack Methodology Web Server Attack Tools Countermeasures Patch Management Web Server Security Tools 14 - Hacking Web Applications Web Application Concepts Web Application Threats Web Application Hacking Methodology Web API, Webhooks, and Web Shell Web Application Security 15 - SQL Injection SQL Injection Concepts Types of SQL Injection SQL Injection Methodology SQL Injection Tools Evasion Techniques Countermeasures 16 - Hacking Wireless Networks Wireless Concepts Wireless Encryption Wireless Threats Wireless Hacking Methodology Wireless Hacking Tools Bluetooth Hacking Countermeasures Wireless Security Tools 17 - Hacking Mobile Platforms Mobile Platform Attack Vectors Hacking Android OS Hacking iOS Mobile Device Management Mobile Security Guidelines and Tools 18 - IoT and OT Hacking IoT Hacking IoT Concepts IoT Attacks IoT Hacking Methodology IoT Hacking Tools Countermeasures OT Hacking OT Concepts OT Attacks OT Hacking Methodology OT Hacking Tools Countermeasures 19 - Cloud Computing Cloud Computing Concepts Container Technology Serverless Computing Cloud Computing Threats Cloud Hacking Cloud Security 20 - Cryptography Cryptography Concepts Encryption Algorithms Cryptography Tools Public Key Infrastructure (PKI) Email Encryption Disk Encryption Cryptanalysis Countermeasures Additional course details: Nexus Humans EC-Council Certified Ethical Hacker (CEH) v.12 training program is a workshop that presents an invigorating mix of sessions, lessons, and masterclasses meticulously crafted to propel your learning expedition forward. This immersive bootcamp-style experience boasts interactive lectures, hands-on labs, and collaborative hackathons, all strategically designed to fortify fundamental concepts. Guided by seasoned coaches, each session offers priceless insights and practical skills crucial for honing your expertise. Whether you're stepping into the realm of professional skills or a seasoned professional, this comprehensive course ensures you're equipped with the knowledge and prowess necessary for success. While we feel this is the best course for the EC-Council Certified Ethical Hacker (CEH) v.12 course and one of our Top 10 we encourage you to read the course outline to make sure it is the right content for you. Additionally, private sessions, closed classes or dedicated events are available both live online and at our training centres in Dublin and London, as well as at your offices anywhere in the UK, Ireland or across EMEA.

EC-Council Certified Ethical Hacker (CEH) v12
Delivered Online
£3,495

CompTIA Security+

By Nexus Human

Duration 5 Days 30 CPD hours This course is intended for This course is designed for people who are seeking to launch a career in cybersecurity. Overview Assess the security posture of an enterprise environment and recommend and implement appropriate security solutions; Monitor and secure hybrid environments, including cloud, mobile, and IoT; Operate with an awareness of applicable laws and policies, including principles of governance, risk, and compliance; Identify, analyze, and respond to security events and incidents. CompTIA Security+ is a global certification that validates the baseline skills necessary to perform core security functions and is the first security certification a candidate should earn. CompTIA Security+ establishes the core knowledge required of any cybersecurity role and provides a springboard to intermediate-level cybersecurity jobs. Lesson 1: Summarize Fundamental Security Concepts Security Concepts Security Controls Lesson 2: Compare Threat Types Threat Actors Attack Surfaces Social Engineering Lesson 3: Explain Cryptographic Solutions Cryptographic Algorithms Public Key Infrastructure Cryptographic Solutions Lesson 4: Implement Identity and Access Management Authentication Authorization Identity Management Lesson 5: Secure Enterprise Network Architecture Enterprise Network Architecture Network Security Appliances Secure Communications Lesson 6: Secure Cloud Network Architecture Cloud Infrastructure Embedded Systems and Zero Trust Architecture Lesson 7: Explain Resiliency and Site Security Concepts Asset Management Redundancy Strategies Physical Security Lesson 8: Explain Vulnerability Management Device and OS Vulnerabilities Application and Cloud Vulnerabilities Vulnerability Identification Methods Vulnerability Analysis and Remediation Lesson 9: Evaluate Network Security Capabilities Network Security Baselines Network Security Capability Enhancement Lesson 10: Assess Endpoint Security Capabilities Implement Endpoint Security Mobile Device Hardening Lesson 11: Enhance Application Security Capabilities Application Protocol Security Baselines Cloud and Web Application Security Concepts Lesson 12: Explain Incident Response and Monitoring Concepts Incident Response Digital Forensics Data Sources Alerting and Monitoring Tools Lesson 13: Analyze Indicators of Malicious Activity Malware Attack Indicators Physical and Network Attack Indicators Application Attack Indicators Lesson 14: Summarize Security Governance Concepts Policies, Standards, and Procedures Change Management Automation and Orchestration Lesson 15: Explain Risk Management Processes Risk Management Processes and Concepts Vendor Management Concepts Audits and Assessments Lesson 16: Summarize Data Protection and Compliance Concepts Data Classification and Compliance Personnel Policies Additional course details: Nexus Humans CompTIA Security Plus Certification (Exam SY0-601) training program is a workshop that presents an invigorating mix of sessions, lessons, and masterclasses meticulously crafted to propel your learning expedition forward. This immersive bootcamp-style experience boasts interactive lectures, hands-on labs, and collaborative hackathons, all strategically designed to fortify fundamental concepts. Guided by seasoned coaches, each session offers priceless insights and practical skills crucial for honing your expertise. Whether you're stepping into the realm of professional skills or a seasoned professional, this comprehensive course ensures you're equipped with the knowledge and prowess necessary for success. While we feel this is the best course for the CompTIA Security Plus Certification (Exam SY0-601) course and one of our Top 10 we encourage you to read the course outline to make sure it is the right content for you. Additionally, private sessions, closed classes or dedicated events are available both live online and at our training centres in Dublin and London, as well as at your offices anywhere in the UK, Ireland or across EMEA.

CompTIA Security+
Delivered Online + more
£2,475

Artificial Intelligence in Game Development- Tic Tac Toe AI

By Packt

Artificial intelligence & Javascript 2D Game Development - MinMax algorithm - "Computer vs You" Tic Tac Toe AI game

Artificial Intelligence in Game Development- Tic Tac Toe AI
Delivered Online On Demand9 hours 35 minutes
£101.99

Machine Learning and Data Science with Python: A Complete Beginners Guide

By Packt

This course will be mainly focusing on machine learning algorithms. Throughout this course, we are preparing our machine to make it ready for a prediction test.

Machine Learning and Data Science with Python: A Complete Beginners Guide
Delivered Online On Demand10 hours 19 minutes
£93.99

Quantum Algorithms for Computational Finance

By Qureca

About the course “Quantum Computing for Finance” is an emerging multidisciplinary field of quantum physics, finance, mathematics, and computer science, in which quantum computations are applied to solve complex problems. “Quantum Algorithms for Computational Finance” is an advanced course in the emerging field of quantum computing for finance. This technical course will develop an understanding in quantum algorithms for its implementation on quantum computers. Through this course, you will learn the basics of various quantum algorithms including: Grover’s and Rudolf’s algorithm, Quantum amplitude Estimation (QAE) algorithm envisioned as a quadratic speed-up over Classical Monte-Carlo simulations, Combinatorial optimization algorithms namely Quantum Approximate Optimization Algorithm (QAOA), and Variational Quantum Eigensolver (VQE), and Quantum-inspired optimization algorithms – Simulated Coherent Ising Machine (Sim-CIM), and Simulated Bifurcation Algorithm (SBA). This course is meant for all those learners who want to explore the long-term employability of quantum computing in finance, assuming that you are familiar with the concepts of quantitative and computational finance. In addition, the course contains several Python based programming exercises for learners to practice the algorithms explained throughout the course. This course is the second part of the specialised educational series: “Quantum Computing for Finance”. What Skills you will learn Ability to perform quantum arithmetic operations and simulations. An understanding of the Quantum Amplitude Estimation algorithm and its variants. The computational and modelling techniques for option pricing and portfolio optimization on a quantum computer. The skills for a career in quantum finance including Quantum Algorithmic Research, Quantitative Asset Management and Trading, financial engineering, and risk management, using quantum computing technology. Course Prerequisites All potential learners must have prior knowledge or familiarity with basic quantum algorithms/basic quantum programming. Before enrolling this course, we recommend all learners to complete the first course “Introduction to Quantitative and Computational Finance” of the series “Quantum Computing for Finance”, if they have no previous experience with the concepts of quantitative and computational finance. Duration The estimated duration to complete this course is approximately 6 weeks (~4hrs/week). Course assessment To complete the course and earn the certification, you must pass all the quizzes at the end of each lesson by scoring 80% or more on each of them. Instructors QuantFiQuantFi is a French start-up research firm formed in 2019 with the objective of using the science of quantum computing to provide solutions to the financial services industry. With its staff of PhD's and PhD students, QuantFi engages in fundamental and applied research in in the field of quantum finance, collaborating with industrial partners and universities in seeking breakthroughs in such areas as portfolio optimisation, asset pricing, and trend detection.

Quantum Algorithms for Computational Finance
Delivered Online On Demand
£800

Total NTP and PTP for engineers

5.0(3)

By Systems & Network Training

NTP and PTP training course description This course looks at timing and synchronization as provided by NTP and PTP. Hands on sessions primarily involve using Wireshark to analyse the protocols. What will you learn Recognise the importance of timing and synchronisation. Explain how NTP works. Explain how PTP works. NTP and PTP training course details Who will benefit: Anyone using NTP or PTP but particularly relevant for those in the broadcast industry. Prerequisites: TCP/IP foundation for engineers Duration 1 day NTP and PTP training course contents Introduction Clock drift. Timing and synchronization. Importance in computing. Importance in broadcasting. NTP NTP versions, v0 to v4. Architecture. The intersection algorithm. Accuracy. Clock strata, Stratum 0, 1, 2 and 3. Protocol modes. Hands on NTP configuration More NTP NTP packet header. Timestamps. Variables in the header. Clock synchronization algorithm. SNTP. The Windows Time service. Hands on Wireshark and NTP analysis. PTP PTP v2, IEEE 1588. Architecture. Accuracy. Synchronization with PTP. Offset and delay. Hands on Analysing PTP packet flows. More PTP Ordinary clocks, boundary clocks, masters and grandmasters. PTP specific switch types. Hardware time stamping. SMPTE ST2059-2. PTP packet header. PTP domains. Best master clock algorithm. Hands on More Wireshark and PTP.

Total NTP and PTP for engineers
Delivered in Internationally or OnlineFlexible Dates
£967

Graph Theory Algorithms

4.7(160)

By Janets

Register on the Graph Theory Algorithms today and build the experience, skills and knowledge you need to enhance your professional development and work towards your dream job. Study this course through online learning and take the first steps towards a long-term career. The course consists of a number of easy to digest, in-depth modules, designed to provide you with a detailed, expert level of knowledge. Learn through a mixture of instructional video lessons and online study materials. Receive online tutor support as you study the course, to ensure you are supported every step of the way. Get a digital certificate as a proof of your course completion. The Graph Theory Algorithms is incredibly great value and allows you to study at your own pace. Access the course modules from any internet-enabled device, including computers, tablet, and smartphones. The course is designed to increase your employability and equip you with everything you need to be a success. Enrol on the now and start learning instantly! What You Get With The Graph Theory Algorithms Receive a e-certificate upon successful completion of the course Get taught by experienced, professional instructors Study at a time and pace that suits your learning style Get instant feedback on assessments 24/7 help and advice via email or live chat Get full tutor support on weekdays (Monday to Friday) Course Design The course is delivered through our online learning platform, accessible through any internet-connected device. There are no formal deadlines or teaching schedules, meaning you are free to study the course at your own pace. You are taught through a combination of Video lessons Online study materials Certification After the successful completion of the final assessment, you will receive a CPD-accredited certificate of achievement. The PDF certificate is for £9.99, and it will be sent to you immediately after through e-mail. You can get the hard copy for £15.99, which will reach your doorsteps by post. Who Is This Course For: The course is ideal for those who already work in this sector or are an aspiring professional. This course is designed to enhance your expertise and boost your CV. Learn key skills and gain a professional qualification to prove your newly-acquired knowledge. Requirements: The online training is open to all students and has no formal entry requirements. To study the Graph Theory Algorithms, all your need is a passion for learning, a good understanding of English, numeracy, and IT skills. You must also be over the age of 16. Course Content Module 01: Introduction Introduction 00:14:00 Module 02: Common Problem Common Problem 00:10:00 Module 03: Depth First Search Depth First Search 00:11:00 Module 04: Breadth First Search Breadth First Search 00:08:00 Module 05: Breadth First Search Shortest Path on a Grid Breadth First Search Shortest Path on a Grid 00:17:00 Module 06: Trees Storage and Representation of Trees 00:10:00 Beginner Tree Algorithms 00:10:00 Rooting Tree 00:05:00 Center(s) of a Tree 00:06:00 Isomorphisms in Trees 00:11:00 Isomorphisms in Trees Source Code 00:10:00 Lowest Common Ancestor 00:17:00 Module 07: Topological Sort Topological Sort 00:14:00 Shortest and Longest Paths on DAGs 00:10:00 Khan's Algorithm 00:13:00 Module 08: Dijkstra Dijkstra's Shortest Path Algorithm Source Code 00:09:00 Dijkstra's Shortest Path Algorithm 00:25:00 Module 09: Bellman-Ford Algorithm Bellman-Ford Algorithm 00:15:00 Module 10: Floyd-Warshall Algorithm Floyd-Warshall Algorithm 00:16:00 Floyd-Warshall Algorithm Source Code 00:09:00 Module 11: Bridge and Algorithm Points Algorithm to Find Bridges and Articulation Points 00:20:00 Algorithm to Find Bridges and Articulation Points Source Code 00:09:00 Module 12: Tarjan Algorithm Tarjan's Algorithm for Finding Strongly Connected Components 00:17:00 Tarjan's Algorithm for Finding Strongly Connected Components Source Code 00:07:00 Module 13: Travelling Salesman Problem (TSP) Travelling Salesman Problem (TSP) with Dynamic Programming 00:21:00 Travelling Salesman Problem (TSP) with Dynamic Programming Source Code 00:14:00 Module 14: Eulerian Paths and Circuits Existence of Eulerian Paths and Circuit 00:10:00 Finding Eulerian Paths and Circuits 00:16:00 Eulerian Paths Source Code 00:08:00 Module 15: Prim's Minimum Spanning Tree Algorithm Prim's Minimum Spanning Tree Algorithm (Lazy Version) 00:15:00 Prim's Minimum Spanning Tree Algorithm ( Eager Version) 00:15:00 Prim's Minimum Spanning Tree Algorithm Source Code ( Eager Version) 00:09:00 Module 16: Network Flow Max Flow Ford-Fulkerson Method 00:13:00 Max Flow Ford-Fulkerson Method Source Code 00:17:00 Network Flow: Unweighted Bipartite Graph Matching 00:11:00 Network Flow: Mice and Owls 00:08:00 Network Flow: Elementary Math 00:11:00 Network Flow: Edmond-Karp Algorithm Source Code 00:06:00 Network Flow: Edmond-Karp Algorithm Source Code 00:10:00 Network Flow: Capacity Scaling 00:10:00 Network Flow: Capacity Scaling Source Code 00:06:00 Network Flow: Dinic's Algorithm 00:12:00 Network Flow: Dinic's Algorithm Source Code 00:09:00 Frequently Asked Questions Are there any prerequisites for taking the course? There are no specific prerequisites for this course, nor are there any formal entry requirements. All you need is an internet connection, a good understanding of English and a passion for learning for this course. Can I access the course at any time, or is there a set schedule? You have the flexibility to access the course at any time that suits your schedule. Our courses are self-paced, allowing you to study at your own pace and convenience. How long will I have access to the course? For this course, you will have access to the course materials for 1 year only. This means you can review the content as often as you like within the year, even after you've completed the course. However, if you buy Lifetime Access for the course, you will be able to access the course for a lifetime. Is there a certificate of completion provided after completing the course? Yes, upon successfully completing the course, you will receive a certificate of completion. This certificate can be a valuable addition to your professional portfolio and can be shared on your various social networks. Can I switch courses or get a refund if I'm not satisfied with the course? We want you to have a positive learning experience. If you're not satisfied with the course, you can request a course transfer or refund within 14 days of the initial purchase. How do I track my progress in the course? Our platform provides tracking tools and progress indicators for each course. You can monitor your progress, completed lessons, and assessments through your learner dashboard for the course. What if I have technical issues or difficulties with the course? If you encounter technical issues or content-related difficulties with the course, our support team is available to assist you. You can reach out to them for prompt resolution.

Graph Theory Algorithms
Delivered Online On Demand8 hours 34 minutes
£25

Computer Science: Graph Theory Algorithms

5.0(10)

By Apex Learning

Overview This comprehensive course on Computer Science: Graph Theory Algorithms will deepen your understanding on this topic. After successful completion of this course you can acquire the required skills in this sector. This Computer Science: Graph Theory Algorithms comes with accredited certification, which will enhance your CV and make you worthy in the job market. So enrol in this course today to fast track your career ladder. How will I get my certificate? You may have to take a quiz or a written test online during or after the course. After successfully completing the course, you will be eligible for the certificate. Who is This course for? There is no experience or previous qualifications required for enrolment on this Computer Science: Graph Theory Algorithms. It is available to all students, of all academic backgrounds. Requirements Our Computer Science: Graph Theory Algorithms is fully compatible with PC's, Mac's, Laptop, Tablet and Smartphone devices. This course has been designed to be fully compatible with tablets and smartphones so you can access your course on Wi-Fi, 3G or 4G. There is no time limit for completing this course, it can be studied in your own time at your own pace. Career Path Having these various qualifications will increase the value in your CV and open you up to multiple sectors such as Business & Management, Admin, Accountancy & Finance, Secretarial & PA, Teaching & Mentoring etc. Course Curriculum 17 sections • 44 lectures • 08:37:00 total length •Promo: 00:03:00 •Introduction: 00:14:00 •Common Problem: 00:10:00 •Depth First Search: 00:11:00 •Breadth First Search: 00:08:00 •Breadth First Search Shortest Path on a Grid: 00:17:00 •Storage and Representation of Trees: 00:10:00 •Beginner Tree Algorithms: 00:10:00 •Rooting Tree: 00:05:00 •Center(s) of a Tree: 00:06:00 •Isomorphisms in Trees: 00:11:00 •Isomorphisms in Trees Source Code: 00:10:00 •Lowest Common Ancestor: 00:17:00 •Topological Sort: 00:14:00 •Shortest and Longest Paths on DAGs: 00:10:00 •Khan's Algorithm: 00:13:00 •Dijkstra's Shortest Path Algorithm: 00:25:00 •Dijkstra's Shortest Path Algorithm Source Code: 00:09:00 •Bellman-Ford Algorithm: 00:15:00 •Floyd-Warshall Algorithm: 00:16:00 •Floyd-Warshall Algorithm Source Code: 00:09:00 •Algorithm to Find Bridges and Articulation Points: 00:20:00 •Algorithm to Find Bridges and Articulation Points Source Code: 00:09:00 •Tarjan's Algorithm for Finding Strongly Connected Components: 00:17:00 •Tarjan's Algorithm for Finding Strongly Connected Components Source Code: 00:07:00 •Travelling Salesman Problem (TSP) with Dynamic Programming: 00:21:00 •Travelling Salesman Problem (TSP) with Dynamic Programming Source Code: 00:14:00 •Existence of Eulerian Paths and Circuit: 00:10:00 •Finding Eulerian Paths and Circuits: 00:16:00 •Eulerian Paths Source Code: 00:08:00 •Prim's Minimum Spanning Tree Algorithm (Lazy Version): 00:15:00 •Prim's Minimum Spanning Tree Algorithm ( Eager Version): 00:15:00 •Prim's Minimum Spanning Tree Algorithm Source Code ( Eager Version): 00:09:00 •Max Flow Ford-Fulkerson Method: 00:13:00 •Max Flow Ford-Fulkerson Method Source Code: 00:17:00 •Network Flow: Unweighted Bipartite Graph Matching: 00:11:00 •Network Flow: Mice and Owls: 00:08:00 •Network Flow: Elementary Math: 00:11:00 •Network Flow: Edmond-Karp Algorithm: 00:06:00 •Network Flow: Edmond-Karp Algorithm Source Code: 00:10:00 •Network Flow: Capacity Scaling: 00:10:00 •Network Flow: Capacity Scaling Source Code: 00:06:00 •Network Flow: Dinic's Algorithm: 00:12:00 •Network Flow: Dinic's Algorithm Source Code: 00:09:00

Computer Science: Graph Theory Algorithms
Delivered Online On Demand8 hours 37 minutes
£12

Data Science & Machine Learning With Python

4.7(160)

By Janets

Discover the power of data science and machine learning with Python! Learn essential techniques, algorithms, and tools to analyze data, build predictive models, and unlock insights. Dive into hands-on projects, from data manipulation to advanced machine learning applications. Elevate your skills and unleash the potential of Python for data-driven decision-making.

Data Science & Machine Learning With Python
Delivered Online On Demand4 weeks
£25