19785 Courses

Advanced Kibana training course description This training course is aimed at users who already have some experience with Kibana, who are looking to further their knowledge. What will you learn Lens Timelion Maps Custom Visualisations with Vega Canvas Filters and Controls Drilldown and Dashboards KQSL and ElasticQueries Scripted and RunTime Fields Alerts and Alarms Advanced Kibana training course details Who will benefit: Users who already have some experience with Kibana, who are looking to further their knowledge. Prerequisites: None Duration 1 day Advanced Kibana training course contents Topics Lens Visualisation types (tables,bars,charts) Category breakdown Adding multiple metrics Using formulas in metrics Labels Adding reference layer Limitations Visualise Library Timeseries, Metrics Different types of aggregations Maps GeoMapping Heat Maps Using ES index as data source Visualisation, tool tips Custom Visualisations with Vega Introduction to vega scripting Canvas Widgets and Texts Elasticsearch SQL Canvas Expressions Filters and Controls Dropdown filters Ad-hoc filters Searchbar filters Drilldown Dashboards Linking one dashboard to another KQSL and ElasticQueries Bool Query AND/OR Phrase Part match vs keyword search Wildcard search Scripted and RunTime Fields Creating ad-hoc calculated fields using scripts Performance issues Alerts and Alarms Query Based Formatting output Connector types(email,index,teams etc)

Mobile comms training course description A complete overview of mobile communications covering all the major technologies in a 2-day format. What will you learn GSM GPRS UMTS LTE Alternative mobile strategies Mobile comms training course details Who will benefit: Anyone involved in mobile communications. Prerequisites: None. Duration 2 days Mobile comms training course contents Introduction Telephony, RF, mobile and wireless technologies, distances, mobile phone generations, base stations, cells, frequencies, cell types, MSC, handoffs, channels, internetworking, the Internet, wireless Internet access. UK operators, worldwide operators. GSM What is it? Timeline, digitising voice, channels, GSM architecture, Abis, A, Um, MS, BTS, BSC, MSC, HLR, VLR, EIR, AuC. Radio link aspects, GSM signalling overview, signalling protocols, roaming, GSM call flows, authentication. IMEI. SIM cards. GPRS What it is, 2G to 3G, GPRS user features, GPRS network features, GPRS elements, GPRS architecture, overlay, SGSN, GGSN, GPRS ATTACH, GPRS protocol stack, GPRS timeslots, EDGE, GPRS classes, GPRS routing, GPRS packet format. UMTS and 3G What is 3G? IMT-2000, 3G proposals, what is UMTS? Speed comparison, evolution to 3G, CDMA, CDMA 2000, W-CDMA, UMTS components, UMTS infrastructure, RNC, Node B, network architecture, packet switched attach, mobility in 3G, HSDPA. LTE and 4G LTE architecture and principles, Physical layer, Air interface, E-UTRAN, Evolved packet core, service provision. Other wireless solutions Integration of services, Bluetooth, Blackberry, VoIP, Mobile IP, 802.11, WiFi, 802.16, WiMax, What is 5G?

A workshop on EMDR with clients who are Neurodivergent on 13th of May 2025.

Delve into the intricate world of 'Data Structure' with our comprehensive course, meticulously crafted for those who have a penchant for understanding the skeleton of software engineering. Data structures form the backbone of algorithmic efficiency, and mastering them is akin to holding the master key to software optimisation. Our course is a confluence of foundational knowledge and complex data structuring, ensuring that you emerge not only informed but also invigorated, ready to tackle any computational challenge thrown your way. Learning Outcomes Gain foundational understanding of different data structures and their implementations. Discover the intricate details of arrays, linked lists, stacks, and queues. Develop the ability to effectively utilise advanced structures like AVL trees and Fenwick trees. Master techniques for optimising algorithmic efficiency using suitable data structures. Enhance problem-solving skills related to data storage and retrieval. Why choose this Data Structure course? Unlimited access to the course for a lifetime. Opportunity to earn a certificate accredited by the CPD Quality Standards after completing this course. Structured lesson planning in line with industry standards. Immerse yourself in innovative and captivating course materials and activities. Assessments are designed to evaluate advanced cognitive abilities and skill proficiency. Flexibility to complete the Diploma in Data Structure at QLS Level 5 Course at your own pace, on your own schedule. Receive full tutor support throughout the week, from Monday to Friday, to enhance your learning experience. Who is this Data Structure course for? Individuals keen on deepening their computer science foundations. Software developers aiming to optimise their code. Students pursuing computer science and related disciplines. Competitive coders desiring an edge in algorithm competitions. Tech enthusiasts eager to understand the underpinnings of efficient programming. Career path Software Developer: £25,000 - £45,000 Algorithm Engineer: £40,000 - £60,000 Data Scientist: £35,000 - £55,000 Backend Developer: £28,000 - £50,000 Systems Architect: £45,000 - £70,000 Data Engineer: £30,000 - £55,000 Prerequisites This Diploma in Data Structure at QLS Level 5 does not require you to have any prior qualifications or experience. You can just enrol and start learning.This Diploma in Data Structure at QLS Level 5 was made by professionals and it is compatible with all PC's, Mac's, tablets and smartphones. You will be able to access the course from anywhere at any time as long as you have a good enough internet connection. Certification After studying the course materials, there will be a written assignment test which you can take at the end of the course. After successfully passing the test you will be able to claim the pdf certificate for £4.99 Original Hard Copy certificates need to be ordered at an additional cost of £8. Endorsed Certificate of Achievement from the Quality Licence Scheme Learners will be able to achieve an endorsed certificate after completing the course as proof of their achievement. You can order the endorsed certificate for only £115 to be delivered to your home by post. For international students, there is an additional postage charge of £10. Endorsement The Quality Licence Scheme (QLS) has endorsed this course for its high-quality, non-regulated provision and training programmes. The QLS is a UK-based organisation that sets standards for non-regulated training and learning. This endorsement means that the course has been reviewed and approved by the QLS and meets the highest quality standards. Please Note: Studyhub is a Compliance Central approved resale partner for Quality Licence Scheme Endorsed courses. Course Curriculum 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: Linked 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 Assignment Assignment - Diploma in Data Structure at QLS Level 5 04:00:00 Order your QLS Endorsed Certificate Order your QLS Endorsed Certificate 00:00:00

Enhance your financial skills in the oil & gas industry with EnergyEdge's courses on finance for non-finance professionals and petroleum fiscal regimes.

The course covers research design principles and all main quantitative evaluation methods: randomised experiments, instrumental variables, sharp and fuzzy regression discontinuity designs, regression methods, matching methods and longitudinal methods (before-after, difference-in-differences and synthetic controls).

The course covers research design principles and all main quantitative evaluation methods: randomised experiments, instrumental variables, sharp and fuzzy regression discontinuity designs, regression methods, matching methods and longitudinal methods (before-after, difference-in-differences and synthetic controls).

The course covers research design principles and all main quantitative evaluation methods: randomised experiments, instrumental variables, sharp and fuzzy regression discontinuity designs, regression methods, matching methods and longitudinal methods (before-after, difference-in-differences and synthetic controls).

The course covers research design principles and all main quantitative evaluation methods: randomised experiments, instrumental variables, sharp and fuzzy regression discontinuity designs, regression methods, matching methods and longitudinal methods (before-after, difference-in-differences and synthetic controls).

The course covers research design principles and all main quantitative evaluation methods: randomised experiments, instrumental variables, sharp and fuzzy regression discontinuity designs, regression methods, matching methods and longitudinal methods (before-after, difference-in-differences and synthetic controls).