2254 Code courses in Belfast delivered On Demand

Data Structure Level 5 is yet another 'Teacher's Choice' course from Teachers Training for a complete understanding of the fundamental topics. You are also entitled to exclusive tutor support and a professional CPD-accredited certificate in addition to the special discounted price for a limited time. Just like all our courses, this Data Structure Level 5 and its curriculum have also been designed by expert teachers so that teachers of tomorrow can learn from the best and equip themselves with all the necessary skills. Consisting of several modules, the course teaches you everything you need to succeed in this profession. The course can be studied part-time. You can become accredited within 9 hours studying at your own pace. Your qualification will be recognised and can be checked for validity on our dedicated website. Why Choose Teachers Training Some of our features are: This is a dedicated website for teaching 24/7 tutor support Interactive Content Affordable price Courses accredited by the UK's top awarding bodies 100% online Flexible deadline Entry Requirements No formal entry requirements. You need to have: Passion for learning A good understanding of the English language Be motivated and hard-working Over the age of 16. Certification CPD Certification from The Teachers Training A Successfully completing the MCQ exam of this course qualifies you for a CPD-accredited certificate from The Teachers Training. You will be eligible for both PDF copy and hard copy of the certificate to showcase your achievement however you wish. You can get your digital certificate (PDF) for £4.99 only Hard copy certificates are also available, and you can get one for only £10.99 You can get both PDF and Hard copy certificates for just £12.99! The certificate will add significant weight to your CV and will give you a competitive advantage when applying for jobs. Unit 01: Introduction Module 01: Promo Video 00:02:00 Module 02: Data Structure Introduction 00:05:00 Module 03: Computational Complexity Analysis 00:13:00 Unit 02: Arrays Module 01: Static and Dynamic Arrays 00:12:00 Module 02: Dynamic Arrays Source Code 00:07:00 Unit 03: Liked List Module 01: Singly and Doubly Linked Lists 00:15:00 Module 02: Doubly Linked Lists Source Code 00:10:00 Unit 04: Stack Module 01: Stack 00:12:00 Module 02: Stack Implementation 00:04:00 Module 03: Stack Source Code 00:04:00 Unit 05: Queues Module 01: Queues (Part-1) 00:06:00 Module 02: Queues (Part-2) 00:06:00 Module 03: Queue Source Code 00:04:00 Unit 06: Priority Queues (PQs) Module 01: Priority Queues (PQs) with an interlude on heaps 00:13:00 Module 02: Turning Min PQ into Max PQ 00:06:00 Module 03: Adding Elements to Binary Heap 00:10:00 Module 04: Removing Elements from Binary Heap 00:14:00 Module 05: Priority Queue Binary Heap Source Code 00:16:00 Unit 07: Union Find Module 01: Disjoint Set 00:06:00 Module 02: Kruskal's Algorithm 00:06:00 Module 03: Union and Find Operations 00:11:00 Module 04: Path Compression Union Find 00:07:00 Module 05: Union Find Source Code 00:08:00 Unit 08: Binary Search Trees Module 01: Binary Trees and Binary Search Trees (BST) 00:13:00 Module 02: Inserting Element into a Binary Search Tree (BST) 00:06:00 Module 03: Removing Element from a Binary Search Tree (BST) 00:14:00 Module 04: Tree Traversals 00:12:00 Module 05: Binary Search Source Code 00:13:00 Unit 09: Fenwick Tree Module 01: Fenwick Tree Construction 00:06:00 Module 02: Point Updates 00:05:00 Module 03: Binary Indexed Tree 00:14:00 Module 04: Fenwick Tree Source Code 00:06:00 Unit 10: Hash Tables Module 01: Hash Table 00:17:00 Module 02: Separate Chaining 00:08:00 Module 03: Separate Chaining Source Code 00:12:00 Module 04: Open Addressing 00:11:00 Module 05: Linear Probing 00:14:00 Module 06: Quadratic Probing 00:09:00 Module 07: Double Hashing 00:15:00 Module 08: Removing Element Open Addressing 00:08:00 Module 09: Open Addressing Code 00:15:00 Unit 11: Suffix Array Module 01: Introduction 00:03:00 Module 02: The Longest Common Prefix (LCP) Array 00:03:00 Module 03: Using SA/LCP Array to Find Unique Substrings 00:05:00 Module 04: Longest Common Substring (LCS) 00:11:00 Module 05: Longest Common Substring (LCS) Full Example 00:07:00 Module 06: Longest Repeated Substring (LRS) 00:05:00 Unit 12: AVL Trees Module 01: Balanced Binary Search Trees (BBSTs) 00:09:00 Module 02: Inserting Elements into an AVL Tree 00:10:00 Module 03: Removing an AVL Tree 00:09:00 Module 04: AVL Tree Source Code 00:17:00 Unit 13: Indexed Priority Queue Module 01: Indexed Priority Queue (Part-1) 00:25:00 Module 02: Indexed Priority Queue Source Code 00:09:00 Unit 14: Sparse Tables Module 01: Sparse Table 00:26:00 Module 02: Sparse Table Source Code 00:07:00

Learn Azure Serverless Computing in a weekend with Azure Functions. This course covers core concepts such as serverless functions, event-driven applications, Azure Service Bus, database interaction, email sending, monitoring, transaction management, integrations, and more! Gain valuable and in-demand skills in Microsoft Azure's Serverless Computing.

Students who complete PVOL202 will be able to: Define the purpose of the National Electrical Code (NEC®) and NEC® terminology for PV equipment Determine procedures for proper installation of equipment and conductors, including minimum requirements for working space Examine methods for PV wire management and determine where expansion fittings are required Describe and identify electrical services, including split-phase and three-phase Wye (Y) and Delta (∆) Evaluate electrical service details to collect and record during solar site evaluation Identify options for NEC®-compliant PV system interconnection to the utility grid and determine whether a supply side, load side, or additional service connection is appropriate Identify code-compliant methods for connecting an inverter to an existing AC feeder Calculate PV module voltage based on temperature to ensure compatibility with system components and NEC® Section 690.7, and explore other options for maximum PV system DC voltage calculations Identify NEC® requirements and sizing of disconnects and overcurrent protection devices (OCPDs) in grid-direct PV systems Define inverter grounding configurations Evaluate inverter choices and system configurations, including string inverters, central inverters, and module level power electronics (MLPE) Identify requirements for equipment grounding, equipment grounding conductors (EGC), and grounding electrode conductors (GEC), and size the conductors according to the NEC® Identify common causes of ground-faults and arc-faults Describe ground-fault and arc-fault protection devices Describe benefits and appropriate locations of surge protection devices (SPD) Demonstrate the use of sun charts and perform calculations to determine row spacing and minimize inter-row shading Identify how Codes detailing access for first responders impact PV array roof layout Examine fire classifications that affect racking and module selection Detail NEC rapid shutdown requirements and options for implementation Identify load and structural considerations for low- and steep-slope roof-mounted PV systems Calculate wind uplift force and select appropriate lag bolts Review issues related to planning, design, and installation of ground-mount PV arrays Review PV system circuit terminology, definitions, and conductor types Calculate minimum overcurrent protection device (OCPD) size and conductor ampacity using appropriate adjustment and correction factors Calculate voltage drop and verify system operation within acceptable limits Examine requirements for PV system labeling Calculate the maximum and minimum number of modules per PV source circuit, and number of PV source circuits per inverter Determine size of residential grid-direct PV system based on site and customer-specific considerations including the number and wiring layout of modules, conductor and OCPD sizes, and the AC interconnections Determine the size of a large, multiple inverter, grid-direct PV system based on site and customer-specific considerations, including the quantity and layout of modules and inverters and the AC interconnection Define large-scale PV and review associated NEC® allowances and requirements Describe importance of Data Acquisition Systems (DAS) Identify common DAS equipment and hardware Review DAS design, installation, and commissioning processes and common problems associated with DAS Show how reports can be generated and utilized to remotely assess health of system

Learn how JSON works and how you can use JSON data via JavaScript in your web applications and web site

Gain the solid skills and knowledge to kickstart a successful career and learn from the experts with this

MySQL: Learn how to use MySQL and PHP to build reports and work with databases for web applications

Building COVID-19 statistics tracking applications with SwiftUI with this intermediate-level course. Anyone who wants to learn iOS development and build beautiful iOS applications will benefit from this course. The instructor goes in-depth and covers the advanced concepts, which will give you the confidence to build your own apps in a very effective way.

This comprehensive Rust-focused course is perfect for individuals seeking in-depth knowledge and expertise in the fields of systems programming, concurrency, and web development. Through practical examples, code-along, and expert theory, you will master Rust and become proficient in building efficient and scalable programs for various applications.

Overview This comprehensive course on Data Structures Complete Course will deepen your understanding on this topic. After successful completion of this course you can acquire the required skills in this sector. This Data Structures Complete Course 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 Data Structures Complete Course. It is available to all students, of all academic backgrounds. Requirements Our Data Structures Complete Course 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 14 sections • 55 lectures • 09:02:00 total length •Module 01: Promo Video: 00:02:00 •Module 02: Data Structure Introduction: 00:05:00 •Module 03: Computational Complexity Analysis: 00:13:00 •Module 01: Static and Dynamic Arrays: 00:12:00 •Module 02: Dynamic Arrays Source Code: 00:07:00 •Module 01: Singly and Doubly Linked Lists: 00:15:00 •Module 02: Doubly Linked Lists Source Code: 00:10:00 •Module 01: Stack: 00:12:00 •Module 02: Stack Implementation: 00:04:00 •Module 03: Stack Source Code: 00:04:00 •Module 01: Queues (Part-1): 00:06:00 •Module 02: Queues (Part-2): 00:06:00 •Module 03: Queue Source Code: 00:04:00 •Module 01: Priority Queues (PQs) with an interlude on heaps: 00:13:00 •Module 02: Turning Min PQ into Max PQ: 00:06:00 •Module 03: Adding Elements to Binary Heap: 00:10:00 •Module 04: Removing Elements from Binary Heap: 00:14:00 •Module 05: Priority Queue Binary Heap Source Code: 00:16:00 •Module 01: Disjoint Set: 00:06:00 •Module 02: Kruskal's Algorithm: 00:06:00 •Module 03: Union and Find Operations: 00:11:00 •Module 04: Path Compression Union Find: 00:07:00 •Module 05: Union Find Source Code: 00:08:00 •Module 01: Binary Trees and Binary Search Trees (BST): 00:13:00 •Module 02: Inserting Element into a Binary Search Tree (BST): 00:06:00 •Module 03: Removing Element from a Binary Search Tree (BST): 00:14:00 •Module 04: Tree Traversals: 00:12:00 •Module 05: Binary Search Source Code: 00:13:00 •Module 01: Fenwick Tree Construction: 00:06:00 •Module 02: Point Updates: 00:06:00 •Module 03: Binary Indexed Tree: 00:14:00 •Module 04: Fenwick Tree Source Code: 00:06:00 •Module 01: Hash Table: 00:17:00 •Module 02: Separate Chaining: 00:08:00 •Module 03: Separate Chaining Source Code: 00:12:00 •Module 04: Open Addressing: 00:11:00 •Module 05: Linear Probing: 00:14:00 •Module 06: Quadratic Probing: 00:09:00 •Module 07: Double Hashing: 00:15:00 •Module 08: Removing Element Open Addressing: 00:08:00 •Module 09: Open Addressing Code: 00:15:00 •Module 01: Introduction: 00:03:00 •Module 02: The Longest Common Prefix (LCP) Array: 00:03:00 •Module 03: Using SA/LCP Array to Find Unique Substrings: 00:05:00 •Module 04: Longest Common Substring (LCS): 00:11:00 •Module 05: Longest Common Substring (LCS) Full Example: 00:07:00 •Module 06: Longest Repeated Substring (LRS): 00:05:00 •Module 01: Balanced Binary Search Trees (BBSTs): 00:09:00 •Module 02: Inserting Elements into an AVL Tree: 00:10:00 •Module 03: Removing an AVL Tree: 00:09:00 •Module 04: AVL Tree Source Code: 00:17:00 •Module 01: Indexed Priority Queue (Part-1): 00:25:00 •Module 02: Indexed Priority Queue Source Code: 00:09:00 •Module 01: Sparse Table: 00:26:00 •Module 02: Sparse Table Source Code: 00:07:00

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.