304 Computer Science & Engineering (CSE) courses

The Computer Science and Programming Diploma course covers the fundamental theories of Algorithm Analysis. If you want to explore the concepts and methods that make a good programmer, then the course is designed for you. Programming is all about how to solve a problem. Programming theory is not confined to a single language; rather it applies to all programming languages. By understanding the right programming theory, you will be able to analyse a problem and also able to find out the probable solution. The course teaches you these Programming theories covering Algorithm analysis, Binary Number System, Arrays and their Advantages, the process of analysing a problem, Nodes and their Importance, various sorting algorithms and their comparisons, and more. Upon completion, you will be able to understand the core theories of computer science. What Will I Learn? Understand the Fundamental Theories of Algorithm Analysis Be able to Compare Various Algorithms Understand When to use Different Data Structures and Algorithms Understand the Fundamentals of Computer Science theory Requirements A Willingness to Learn New Topics! No Prior Experience or Knowledge is Needed! Module: 01 Kurt Anderson - 1 Introduction FREE 00:01:00 Kurt Anderson - 2 Binary System FREE 00:11:00 Kurt Anderson - 3 Complexity Introduction 00:02:00 Kurt Anderson - 4 Math Refresher Logarithmic Functions 00:11:00 Kurt Anderson - 5 Math Refresher Factorial Functions.TS 007 00:03:00 Kurt Anderson - 6 Math Refresher Algebraic Expressions.TS 00:03:00 Kurt Anderson - 7 n-notation 00:19:00 Kurt Anderson - 8 Big O 00:13:00 Kurt Anderson - 9 Big O Real World Example 00:10:00 Module: 02 Kurt Anderson - 10 How is Data Stored 00:09:00 Kurt Anderson - 11 Fixed Arrays 00:20:00 Kurt Anderson - 12 Circular Arrays 00:08:00 Kurt Anderson - 13 Dynamic Arrays 00:16:00 Kurt Anderson - 14 Array Review 00:08:00 Kurt Anderson - 15 Array Real World Examples 00:06:00 Kurt Anderson - 16 Linked List 00:12:00 Kurt Anderson - 16 Nodes 00:04:00 Kurt Anderson - 17 Linked List Run Times 00:15:00 Kurt Anderson - 18 Doubly Linked Lists 00:08:00 Kurt Anderson - 19 Tail Pointer 00:05:00 Module: 03 Kurt Anderson - 20 Linked List Real World Examples 00:03:00 Kurt Anderson - 20 Stack Example 00:11:00 Kurt Anderson - 21 Linked List Review 00:04:00 Kurt Anderson - 22 Stacks 00:10:00 Kurt Anderson - 23 Queues 00:09:00 Kurt Anderson - 24 Queue Examples 00:10:00 Kurt Anderson - 25 Queue and Stack Run Times 00:06:00 Kurt Anderson - 26 Stack and Queues Real World Examples 00:07:00 Kurt Anderson - 27 Sorting Algorithm Introdcution 00:02:00 Kurt Anderson - 28 Bubble Sort 00:10:00 Kurt Anderson - 29 Selection Sort 00:10:00 Module: 04 Kurt Anderson - 30 Insertion Sort 00:09:00 Kurt Anderson - 31 Quick Sort 00:15:00 Kurt Anderson - 32 Quick Sort Run Times 00:10:00 Kurt Anderson - 33 Merge Sort 00:12:00 Kurt Anderson - 34 Merge Sort Run Times 00:08:00 Kurt Anderson - 35 Stable vs Nonstable 00:07:00 Kurt Anderson - 36 Sorting Algorithm Real World Examples 00:04:00 Kurt Anderson - 37 Basics of Trees 00:08:00 Kurt Anderson - 38 Binary Search Tree 00:09:00 Kurt Anderson - 39 BST Run Times 00:08:00 Module: 05 Kurt Anderson - 40 Tree Traversals 00:13:00 Kurt Anderson - 41 Tree Real World Examples 00:05:00 Kurt Anderson - 42 Heap Introduction 00:04:00 Kurt Anderson - 43 Heap Step by Step 00:12:00 Kurt Anderson - 44 Heap Real World Examples 00:07:00 Kurt Anderson - 45 Thank You 00:01:00

This concise and comprehensive course takes you through the basic and advanced topics of Ansible, explaining all the concepts clearly and thoroughly. You will not only master the concepts but also learn how to use Ansible with cloud services and containers.

Learn to apply sentiment analysis to your problems through a practical, real-world use case.

Learn to program with Python 3, visualize algorithms and data structures, and implement them in Python projects

Build a 3D endless runner game with Unity and C# and create a hyper casual runner game for mobile and PC

Learn Blender 3D modeling, animation, UV mapping, and texture painting; build game assets; and learn 3D Game Development with Unity

Build modern, flexible, and extensible APIs with GraphQL and Apollo

Get to grips with Java design patterns and write robust and extensible software

Master Angular and Dart (AngularDart) and build high-performance, flexible, and dynamic web apps

Computer Science GCSE Syllabus The GCSE Computer Science Tutor Syllabus is designed to provide tutors in England with a comprehensive framework for teaching the GCSE Computer Science curriculum effectively. This syllabus aims to equip tutors with the necessary knowledge and skills to support students in their understanding and application of core computer science concepts.  Module 1: Introduction to Computer Science - Overview of computer science and its relevance in today's world - Understanding the components of a computer system - Introduction to algorithms and problem-solving techniques - Exploration of programming languages and their uses Module 2: Computer Hardware - Understanding the main components of a computer system, including CPU, memory, and storage devices - Exploring input and output devices and their functionalities - Understanding the role of operating systems and software in computer systems Module 3: Software Development - Introduction to programming concepts and languages (e.g., Python or Java) - Understanding variables, data types, and operators - Building algorithms and logical reasoning skills - Introduction to flowcharts and pseudocode - Implementation of simple programs and debugging techniques Module 4: Data Representation - Understanding binary, hexadecimal, and denary number systems - Representation of text, images, and sound using binary - Introduction to data compression and encryption techniques Module 5: Computer Networks - Understanding the basics of computer networks, including LAN, WAN, and the Internet - Introduction to network topologies, protocols, and security - Exploring the impact of digital communication on society Module 6: Cybersecurity and Ethical Issues - Understanding the importance of cybersecurity and data protection - Introduction to common threats and vulnerabilities - Exploring ethical issues related to computer science, such as privacy and intellectual property rights Module 7: Algorithms and Programming Techniques - Advanced programming concepts, including conditionals, loops, and functions - Introduction to sorting and searching algorithms - Exploring data structures, such as arrays and lists Module 8: System Architecture - Understanding the structure and function of a CPU - Introduction to memory hierarchy and cache - Exploring the Von Neumann architecture and its limitations Module 9: Computational Thinking and Problem Solving - Advanced problem-solving techniques using computational thinking - Introduction to algorithms for complex problems - Exploring algorithmic efficiency and optimization techniques Module 10: Exam Preparation and Revision - Reviewing key concepts covered throughout the syllabus - Practicing past exam questions and providing guidance on exam techniques - Supporting students with exam preparation strategies Please note that the duration and depth of each module can vary depending on the level of expertise required and the specific needs of the learners. Additionally, it's important to adapt the curriculum to the learners' proficiency levels, whether they are A Level/GCSE students or adult learners with different experience levels.