442 Algorithm courses

Overview This comprehensive course on SQL NoSQL Big Data and Hadoop will deepen your understanding on this topic. After successful completion of this course you can acquire the required skills in this sector. This SQL NoSQL Big Data and Hadoop comes with accredited certification from CPD, 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? At the end of the course there will be an online written test, which you can take either during or after the course. After successfully completing the test you will be able to order your certificate, these are included in the price. Who is This course for? There is no experience or previous qualifications required for enrolment on this SQL NoSQL Big Data and Hadoop. It is available to all students, of all academic backgrounds. Requirements Our SQL NoSQL Big Data and Hadoop 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 Learning this new skill will help you to advance in your career. It will diversify your job options and help you develop new techniques to keep up with the fast-changing world. This skillset will help you to- Open doors of opportunities Increase your adaptability Keep you relevant Boost confidence And much more! Course Curriculum 14 sections • 130 lectures • 22:34:00 total length •Introduction: 00:07:00 •Building a Data-driven Organization - Introduction: 00:04:00 •Data Engineering: 00:06:00 •Learning Environment & Course Material: 00:04:00 •Movielens Dataset: 00:03:00 •Introduction to Relational Databases: 00:09:00 •SQL: 00:05:00 •Movielens Relational Model: 00:15:00 •Movielens Relational Model: Normalization vs Denormalization: 00:16:00 •MySQL: 00:05:00 •Movielens in MySQL: Database import: 00:06:00 •OLTP in RDBMS: CRUD Applications: 00:17:00 •Indexes: 00:16:00 •Data Warehousing: 00:15:00 •Analytical Processing: 00:17:00 •Transaction Logs: 00:06:00 •Relational Databases - Wrap Up: 00:03:00 •Distributed Databases: 00:07:00 •CAP Theorem: 00:10:00 •BASE: 00:07:00 •Other Classifications: 00:07:00 •Introduction to KV Stores: 00:02:00 •Redis: 00:04:00 •Install Redis: 00:07:00 •Time Complexity of Algorithm: 00:05:00 •Data Structures in Redis : Key & String: 00:20:00 •Data Structures in Redis II : Hash & List: 00:18:00 •Data structures in Redis III : Set & Sorted Set: 00:21:00 •Data structures in Redis IV : Geo & HyperLogLog: 00:11:00 •Data structures in Redis V : Pubsub & Transaction: 00:08:00 •Modelling Movielens in Redis: 00:11:00 •Redis Example in Application: 00:29:00 •KV Stores: Wrap Up: 00:02:00 •Introduction to Document-Oriented Databases: 00:05:00 •MongoDB: 00:04:00 •MongoDB Installation: 00:02:00 •Movielens in MongoDB: 00:13:00 •Movielens in MongoDB: Normalization vs Denormalization: 00:11:00 •Movielens in MongoDB: Implementation: 00:10:00 •CRUD Operations in MongoDB: 00:13:00 •Indexes: 00:16:00 •MongoDB Aggregation Query - MapReduce function: 00:09:00 •MongoDB Aggregation Query - Aggregation Framework: 00:16:00 •Demo: MySQL vs MongoDB. Modeling with Spark: 00:02:00 •Document Stores: Wrap Up: 00:03:00 •Introduction to Search Engine Stores: 00:05:00 •Elasticsearch: 00:09:00 •Basic Terms Concepts and Description: 00:13:00 •Movielens in Elastisearch: 00:12:00 •CRUD in Elasticsearch: 00:15:00 •Search Queries in Elasticsearch: 00:23:00 •Aggregation Queries in Elasticsearch: 00:23:00 •The Elastic Stack (ELK): 00:12:00 •Use case: UFO Sighting in ElasticSearch: 00:29:00 •Search Engines: Wrap Up: 00:04:00 •Introduction to Columnar databases: 00:06:00 •HBase: 00:07:00 •HBase Architecture: 00:09:00 •HBase Installation: 00:09:00 •Apache Zookeeper: 00:06:00 •Movielens Data in HBase: 00:17:00 •Performing CRUD in HBase: 00:24:00 •SQL on HBase - Apache Phoenix: 00:14:00 •SQL on HBase - Apache Phoenix - Movielens: 00:10:00 •Demo : GeoLife GPS Trajectories: 00:02:00 •Wide Column Store: Wrap Up: 00:05:00 •Introduction to Time Series: 00:09:00 •InfluxDB: 00:03:00 •InfluxDB Installation: 00:07:00 •InfluxDB Data Model: 00:07:00 •Data manipulation in InfluxDB: 00:17:00 •TICK Stack I: 00:12:00 •TICK Stack II: 00:23:00 •Time Series Databases: Wrap Up: 00:04:00 •Introduction to Graph Databases: 00:05:00 •Modelling in Graph: 00:14:00 •Modelling Movielens as a Graph: 00:10:00 •Neo4J: 00:04:00 •Neo4J installation: 00:08:00 •Cypher: 00:12:00 •Cypher II: 00:19:00 •Movielens in Neo4J: Data Import: 00:17:00 •Movielens in Neo4J: Spring Application: 00:12:00 •Data Analysis in Graph Databases: 00:05:00 •Examples of Graph Algorithms in Neo4J: 00:18:00 •Graph Databases: Wrap Up: 00:07:00 •Introduction to Big Data With Apache Hadoop: 00:06:00 •Big Data Storage in Hadoop (HDFS): 00:16:00 •Big Data Processing : YARN: 00:11:00 •Installation: 00:13:00 •Data Processing in Hadoop (MapReduce): 00:14:00 •Examples in MapReduce: 00:25:00 •Data Processing in Hadoop (Pig): 00:12:00 •Examples in Pig: 00:21:00 •Data Processing in Hadoop (Spark): 00:23:00 •Examples in Spark: 00:23:00 •Data Analytics with Apache Spark: 00:09:00 •Data Compression: 00:06:00 •Data serialization and storage formats: 00:20:00 •Hadoop: Wrap Up: 00:07:00 •Introduction Big Data SQL Engines: 00:03:00 •Apache Hive: 00:10:00 •Apache Hive : Demonstration: 00:20:00 •MPP SQL-on-Hadoop: Introduction: 00:03:00 •Impala: 00:06:00 •Impala : Demonstration: 00:18:00 •PrestoDB: 00:13:00 •PrestoDB : Demonstration: 00:14:00 •SQL-on-Hadoop: Wrap Up: 00:02:00 •Data Architectures: 00:05:00 •Introduction to Distributed Commit Logs: 00:07:00 •Apache Kafka: 00:03:00 •Confluent Platform Installation: 00:10:00 •Data Modeling in Kafka I: 00:13:00 •Data Modeling in Kafka II: 00:15:00 •Data Generation for Testing: 00:09:00 •Use case: Toll fee Collection: 00:04:00 •Stream processing: 00:11:00 •Stream Processing II with Stream + Connect APIs: 00:19:00 •Example: Kafka Streams: 00:15:00 •KSQL : Streaming Processing in SQL: 00:04:00 •KSQL: Example: 00:14:00 •Demonstration: NYC Taxi and Fares: 00:01:00 •Streaming: Wrap Up: 00:02:00 •Database Polyglot: 00:04:00 •Extending your knowledge: 00:08:00 •Data Visualization: 00:11:00 •Building a Data-driven Organization - Conclusion: 00:07:00 •Conclusion: 00:03:00 •Assignment -SQL NoSQL Big Data and Hadoop: 00:00:00

Description Are you interested to learn how to build user interface? Do you work as a user interface designer? If so, take a look at our React 16 and Redux Training course. Its precise contents will help you in understanding all you need to know about React 16 and Redux effectively. React 16 is an updated JavaScript library works to build user interface in different stage. It provides you with effective mental model so that you can build astonishing user interface efficiently. The React 16 and Redux Training course is designed to teach you the basic functions of React 16. It instructs you how to develop apps providing the knowledge with portals, context API, errors boundaries, and the use of less code to write. The course also introduces you to the important features of React such as user-friendly DOM to build UI design, different algorithm to test without starting a headless browser, and different framework for the development. However, the aim of the course is to teach you the core concepts of React to make you an efficient UI designer. Assessment: This course does not involve any MCQ test. Students need to answer assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Once the answers are submitted, the instructor will check and assess the work. Certification: After completing and passing the course successfully, you will be able to obtain an Accredited Certificate of Achievement. Certificates can be obtained either in hard copy at a cost of £39 or in PDF format at a cost of £24. Who is this Course for? React 16 and Redux Training is certified by CPD Qualifications Standards and CiQ. This makes it perfect for anyone trying to learn potential professional skills. As there is no experience and qualification required for this course, it is available for all students from any academic background. Requirements Our React 16 and Redux Training is fully compatible with any kind of device. Whether you are using Windows computer, Mac, smartphones or tablets, you will get the same experience while learning. Besides that, you will be able to access the course with any kind of internet connection from anywhere at any time without any kind of limitation. Career Path After completing this course you will be able to build up accurate knowledge and skills with proper confidence to enrich yourself and brighten up your career in the relevant job market. Getting Started VS Code Setup FREE 00:03:00 How to get source code for each lecture 00:01:00 Create React App using create-react-app cli 00:02:00 Creating Nested React Elements 00:08:00 Creating Nested Elements in React 00:08:00 How React uses React Elements to Create Virtual DOM 00:01:00 What is DOM 00:03:00 What is Virtual DOM 00:05:00 Create Nested Components in React 00:05:00 Creating Components in React 00:06:00 Adding Props Validations in React Component 00:03:00 Create Nested Components in React 00:05:00 Create State in React Component 00:08:00 Update State using events and custom methods 00:08:00 Iterate Array and render the components 00:06:00 Pass function as props from Parent to Child Componenty 00:09:00 Convert React Components to JSX 00:09:00 Module Summary 00:01:00 Data Flow in React Components State in React Component 00:05:00 Shallow Merging with setState 00:06:00 Use props, PropTypes and defaultProps in React Component 00:06:00 Communicate with Parent and Child Component 00:07:00 Module Summary 00:01:00 Component LifeCycle Methods in React What are LifeCycle Methods in React Component 00:01:00 Types and Phases of LifeCycle Methods 00:04:00 LifeCycle Mounting Methods in Action 00:09:00 LifeCycle Updating Methods in Action 00:07:00 Error Handling with componentDidCatch 00:08:00 Hacker news App - Building Components Setup React Application 00:03:00 Add Bootstrap to React Application 00:01:00 Create Mock Restful API with Json-Server 00:07:00 Send HTTP Request in React using axios 00:06:00 Iterate Array and render the components 00:06:00 Add Bootstrap Card to render List Items 00:07:00 Creating Header Component 00:06:00 Error Handling with Custom ErrorMessage Component 00:07:00 Adding Loading Spinner 00:04:00 React Context API Introduction to React Context API 00:04:00 React Context API in Action 00:16:00 Create Reducer to update the State in React Context 00:09:00 Create new Action to Handle Errors 00:02:00 Working with Forms in React Creating Controlled Component 00:03:00 Adding State to the Form 00:06:00 Save new record by sending Http Request 00:14:00 Creating Reusable Component for Input FormControl 00:07:00 Adding Form Validations in React and Bootstrap 00:08:00 Add Routing in React using React-Router Add Link Navigations using React-Router 00:04:00 Redirect after submitted new Record 00:01:00 Creating NotFound Component 00:02:00 Creating new Component to Edit the Record 00:14:00 State Management with Redux Setting up Redux into React application 00:10:00 Connect React Component to Redux 00:07:00 Delete the Record from the ReduxStore 00:07:00 Add Record to ReduxStore 00:05:00 Consuming Http Rest API using Async Action Creators Create Async Action to fetch records from the API 00:07:00 Create Async Action to delete records from the API 00:01:00 Create Async Action to add new Record 00:01:00 Async Action to fetch single record 00:09:00 Async Action to update the Link 00:04:00 Integrating React and Redux with Firebase Creating Database on Firebase 00:04:00 Fetching data from firebase collection in react component 00:12:00 Delete document from firebase collection with react 00:04:00 Add document in firebase collection with react 00:03:00 Update document from firebase collection 00:12:00 Firebase Authentication with React and Redux User Registration in React and Firebase 00:09:00 Logout User 00:15:00 User Login with Firebase and React 00:04:00 Apply Authentication on private Routes 00:07:00 Display error notification in React 00:06:00 Deploy React Application to Firebase 00:05:00 Bonus: ES6 crash course var scoping 00:04:00 understanding let 00:01:00 Examples of const 00:01:00 More use cases of let and const 00:04:00 Introduction to Arrow functions 00:02:00 Examples on Arrow functions 00:03:00 Destructring Objects 00:04:00 Destructring Arrays 00:03:00 Destructring Function Arguments 00:02:00 Course Certification Order your Certificate 00:00:00

The course is crafted to help you understand not only the role and impact of recommender systems in real-world applications but also provide hands-on experience in developing complete recommender systems engines for your customized dataset using projects. This learning-by-doing course will help you master the concepts and methodology of Python.

Register on the Easy to Advanced Data Structures 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 an e-certificate as proof of your course completion. The Easy to Advanced Data Structures 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 Easy to Advanced Data Structures 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 Upon successful completion of the course, you will be able to obtain your course completion e-certificate free of cost. Print copy by post is also available at an additional cost of £9.99 and PDF Certificate at £4.99. 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 Easy to Advanced Data Structures, 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 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 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:06: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 05: Longest Common Substring (LCS) Full Example 00:07: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 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.

Learn to build highly sophisticated deep learning and Computer Vision applications with PyTorch

Discrete Maths Teaching 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 Discrete Maths Teaching 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 19 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 website 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 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. Sets Introduction to Sets 00:01:00 Definition of Set 00:09:00 Number Sets 00:10:00 Set Equality 00:09:00 Set-Builder Notation 00:10:00 Types of Sets 00:12:00 Subsets 00:10:00 Power Set 00:05:00 Ordered Pairs 00:05:00 Cartesian Products 00:14:00 Cartesian Plane 00:04:00 Venn Diagrams 00:03:00 Set Operations (Union, Intersection) 00:15:00 Properties of Union and Intersection 00:10:00 Set Operations (Difference, Complement) 00:12:00 Properties of Difference and Complement 00:07:00 De Morgan's Law 00:08:00 Partition of Sets 00:16:00 Logic Introduction 00:01:00 Statements 00:07:00 Compound Statements 00:13:00 Truth Tables 00:09:00 Examples 00:13:00 Logical Equivalences 00:07:00 Tautologies and Contradictions 00:06:00 De Morgan's Laws in Logic 00:12:00 Logical Equivalence Laws 00:03:00 Conditional Statements 00:13:00 Negation of Conditional Statements 00:10:00 Converse and Inverse 00:07:00 Biconditional Statements 00:09:00 Examples 00:12:00 Digital Logic Circuits 00:13:00 Black Boxes and Gates 00:15:00 Boolean Expressions 00:06:00 Truth Tables and Circuits 00:09:00 Equivalent Circuits 00:07:00 NAND and NOR Gates 00:07:00 Quantified Statements - ALL 00:08:00 Quantified Statements - THERE EXISTS 00:07:00 Negations of Quantified Statements 00:08:00 Number Theory Introduction 00:01:00 Parity 00:13:00 Divisibility 00:11:00 Prime Numbers 00:08:00 Prime Factorisation 00:09:00 GCD & LCM 00:17:00 Proof Intro 00:06:00 Terminologies 00:08:00 Direct Proofs 00:09:00 Proofs by Contrapositive 00:11:00 Proofs by Contradiction 00:17:00 Exhaustion Proofs 00:14:00 Existence & Uniqueness Proofs 00:16:00 Proofs by Induction 00:12:00 Examples 00:19:00 Functions Intro 00:01:00 Functions 00:15:00 Evaluating a Function 00:13:00 Domains 00:16:00 Range 00:05:00 Graphs 00:16:00 Graphing Calculator 00:06:00 Extracting Info from a Graph 00:12:00 Domain & Range from a Graph 00:08:00 Function Composition 00:10:00 Function Combination 00:09:00 Even and Odd Functions 00:08:00 One to One (Injective) Functions 00:09:00 Onto (Surjective) Functions 00:07:00 Inverse Functions 00:10:00 Long Division 00:16:00 Relations Intro 00:01:00 The Language of Relations 00:10:00 Relations on Sets 00:13:00 The Inverse of a Relation 00:06:00 Reflexivity, Symmetry and Transitivity 00:13:00 Examples 00:08:00 Properties of Equality & Less Than 00:08:00 Equivalence Relation 00:07:00 Equivalence Class 00:07:00 Graph Theory Intro 00:01:00 Graphs 00:11:00 Subgraphs 00:09:00 Degree 00:10:00 Sum of Degrees of Vertices Theorem 00:23:00 Adjacency and Incidence 00:09:00 Adjacency Matrix 00:16:00 Incidence Matrix 00:08:00 Isomorphism 00:08:00 Walks, Trails, Paths, and Circuits 00:13:00 Examples 00:10:00 Eccentricity, Diameter, and Radius 00:07:00 Connectedness 00:20:00 Euler Trails and Circuits 00:18:00 Fleury's Algorithm 00:10:00 Hamiltonian Paths and Circuits 00:06:00 Ore's Theorem 00:14:00 The Shortest Path Problem 00:13:00 Statistics Intro 00:01:00 Terminologies 00:03:00 Mean 00:04:00 Median 00:03:00 Mode 00:03:00 Range 00:08:00 Outlier 00:04:00 Variance 00:09:00 Standard Deviation 00:04:00 Combinatorics Intro 00:03:00 Factorials 00:08:00 The Fundamental Counting Principle 00:13:00 Permutations 00:13:00 Combinations 00:12:00 Pigeonhole Principle 00:06:00 Pascal's Triangle 00:08:00 Sequence and Series Intro 00:01:00 Sequence 00:07:00 Arithmetic Sequences 00:12:00 Geometric Sequences 00:09:00 Partial Sums of Arithmetic Sequences 00:12:00 Partial Sums of Geometric Sequences 00:07:00 Series 00:13:00

Register on the Data Structure 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 Data Structure course 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 Data Structure Course 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 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 Data Structure course, 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 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:06: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 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.

This comprehensive deep learning course with Python will start with the basics and work up to advanced topics such as using different frameworks in Python to solve real-world problems and building artificial neural networks with TensorFlow and Keras.

This beginner's course exclusively delivers Python programming from basic to advanced. You will learn Python concepts in real-life programming examples by building real-world applications. Learn the syntax of Python language and understand the logic behind the programming process to create your Python programs successfully and master Python coding.

Duration 2 Days 12 CPD hours This course is intended for Business Analysts, Technical Managers, and Programmers Overview This intensive training course helps students learn the practical aspects of the R programming language. The course is supplemented by many hands-on labs which allow attendees to immediately apply their theoretical knowledge in practice. Over the past few years, R has been steadily gaining popularity with business analysts, statisticians and data scientists as a tool of choice for conducting statistical analysis of data as well as supervised and unsupervised machine learning. What is R ? What is R? ? Positioning of R in the Data Science Space ? The Legal Aspects ? Microsoft R Open ? R Integrated Development Environments ? Running R ? Running RStudio ? Getting Help ? General Notes on R Commands and Statements ? Assignment Operators ? R Core Data Structures ? Assignment Example ? R Objects and Workspace ? Printing Objects ? Arithmetic Operators ? Logical Operators ? System Date and Time ? Operations ? User-defined Functions ? Control Statements ? Conditional Execution ? Repetitive Execution ? Repetitive execution ? Built-in Functions ? Summary Introduction to Functional Programming with R ? What is Functional Programming (FP)? ? Terminology: Higher-Order Functions ? A Short List of Languages that Support FP ? Functional Programming in R ? Vector and Matrix Arithmetic ? Vector Arithmetic Example ? More Examples of FP in R ? Summary Managing Your Environment ? Getting and Setting the Working Directory ? Getting the List of Files in a Directory ? The R Home Directory ? Executing External R commands ? Loading External Scripts in RStudio ? Listing Objects in Workspace ? Removing Objects in Workspace ? Saving Your Workspace in R ? Saving Your Workspace in RStudio ? Saving Your Workspace in R GUI ? Loading Your Workspace ? Diverting Output to a File ? Batch (Unattended) Processing ? Controlling Global Options ? Summary R Type System and Structures ? The R Data Types ? System Date and Time ? Formatting Date and Time ? Using the mode() Function ? R Data Structures ? What is the Type of My Data Structure? ? Creating Vectors ? Logical Vectors ? Character Vectors ? Factorization ? Multi-Mode Vectors ? The Length of the Vector ? Getting Vector Elements ? Lists ? A List with Element Names ? Extracting List Elements ? Adding to a List ? Matrix Data Structure ? Creating Matrices ? Creating Matrices with cbind() and rbind() ? Working with Data Frames ? Matrices vs Data Frames ? A Data Frame Sample ? Creating a Data Frame ? Accessing Data Cells ? Getting Info About a Data Frame ? Selecting Columns in Data Frames ? Selecting Rows in Data Frames ? Getting a Subset of a Data Frame ? Sorting (ordering) Data in Data Frames by Attribute(s) ? Editing Data Frames ? The str() Function ? Type Conversion (Coercion) ? The summary() Function ? Checking an Object's Type ? Summary Extending R ? The Base R Packages ? Loading Packages ? What is the Difference between Package and Library? ? Extending R ? The CRAN Web Site ? Extending R in R GUI ? Extending R in RStudio ? Installing and Removing Packages from Command-Line ? Summary Read-Write and Import-Export Operations in R ? Reading Data from a File into a Vector ? Example of Reading Data from a File into A Vector ? Writing Data to a File ? Example of Writing Data to a File ? Reading Data into A Data Frame ? Writing CSV Files ? Importing Data into R ? Exporting Data from R ? Summary Statistical Computing Features in R ? Statistical Computing Features ? Descriptive Statistics ? Basic Statistical Functions ? Examples of Using Basic Statistical Functions ? Non-uniformity of a Probability Distribution ? Writing Your Own skew and kurtosis Functions ? Generating Normally Distributed Random Numbers ? Generating Uniformly Distributed Random Numbers ? Using the summary() Function ? Math Functions Used in Data Analysis ? Examples of Using Math Functions ? Correlations ? Correlation Example ? Testing Correlation Coefficient for Significance ? The cor.test() Function ? The cor.test() Example ? Regression Analysis ? Types of Regression ? Simple Linear Regression Model ? Least-Squares Method (LSM) ? LSM Assumptions ? Fitting Linear Regression Models in R ? Example of Using lm() ? Confidence Intervals for Model Parameters ? Example of Using lm() with a Data Frame ? Regression Models in Excel ? Multiple Regression Analysis ? Summary Data Manipulation and Transformation in R ? Applying Functions to Matrices and Data Frames ? The apply() Function ? Using apply() ? Using apply() with a User-Defined Function ? apply() Variants ? Using tapply() ? Adding a Column to a Data Frame ? Dropping A Column in a Data Frame ? The attach() and detach() Functions ? Sampling ? Using sample() for Generating Labels ? Set Operations ? Example of Using Set Operations ? The dplyr Package ? Object Masking (Shadowing) Considerations ? Getting More Information on dplyr in RStudio ? The search() or searchpaths() Functions ? Handling Large Data Sets in R with the data.table Package ? The fread() and fwrite() functions from the data.table Package ? Using the Data Table Structure ? Summary Data Visualization in R ? Data Visualization ? Data Visualization in R ? The ggplot2 Data Visualization Package ? Creating Bar Plots in R ? Creating Horizontal Bar Plots ? Using barplot() with Matrices ? Using barplot() with Matrices Example ? Customizing Plots ? Histograms in R ? Building Histograms with hist() ? Example of using hist() ? Pie Charts in R ? Examples of using pie() ? Generic X-Y Plotting ? Examples of the plot() function ? Dot Plots in R ? Saving Your Work ? Supported Export Options ? Plots in RStudio ? Saving a Plot as an Image ? Summary Using R Efficiently ? Object Memory Allocation Considerations ? Garbage Collection ? Finding Out About Loaded Packages ? Using the conflicts() Function ? Getting Information About the Object Source Package with the pryr Package ? Using the where() Function from the pryr Package ? Timing Your Code ? Timing Your Code with system.time() ? Timing Your Code with System.time() ? Sleeping a Program ? Handling Large Data Sets in R with the data.table Package ? Passing System-Level Parameters to R ? Summary Lab Exercises Lab 1 - Getting Started with R Lab 2 - Learning the R Type System and Structures Lab 3 - Read and Write Operations in R Lab 4 - Data Import and Export in R Lab 5 - k-Nearest Neighbors Algorithm Lab 6 - Creating Your Own Statistical Functions Lab 7 - Simple Linear Regression Lab 8 - Monte-Carlo Simulation (Method) Lab 9 - Data Processing with R Lab 10 - Using R Graphics Package Lab 11 - Using R Efficiently