Industry-relevant training in Business, Technology, and Design
Fun games to boost memory, math, typing, and English skills
Explore our curated collection of courses designed to help you learn and grow
Computer Architecture This course trains students to use tools like Icarus Verilog, GNU Toolchain, and GTKWave for labs. Students write Armv8-A AArch64 assembly, simulate using Arm Education Core, analyze instruction encoding, implement pipeline stages, resolve RAW hazards, handle control hazards, and estimate Power, Performance, and Area metrics effectively.
Pavan
A Numerical Techniques course for Electrical Engineering students focuses on solving mathematical problems using numerical methods. Key topics include error analysis, interpolation, numerical integration, solving systems of linear equations, algebraic equations, and ordinary differential equations, providing essential tools for engineering problem-solving and analysis.
Pavan
Advanced programming encompasses a deeper understanding and application of programming concepts beyond the basics.
Abraham
Computer organization describes the hardware components and their interconnections, while computer architecture defines the attributes visible to the programmer, such as instruction sets and data types.
Abraham
Computer organization describes the hardware components and their interconnections, while computer architecture defines the attributes visible to the programmer, such as instruction sets and data types.
Abraham
Computer organization describes the hardware components and their interconnections, while computer architecture defines the attributes visible to the programmer, such as instruction sets and data types.
Abraham
Discrete mathematics is the study of mathematical structures that are fundamentally countable or distinct, as opposed to continuous. It forms the foundation for computer science and is crucial for understanding algorithms, data structures, and computational logic
Abraham
Discrete mathematics is the study of mathematical structures that are fundamentally countable or distinct, as opposed to continuous. It forms the foundation for computer science and is crucial for understanding algorithms, data structures, and computational logic
Abraham
Discrete mathematics is the study of mathematical structures that are fundamentally countable or distinct, as opposed to continuous. It forms the foundation for computer science and is crucial for understanding algorithms, data structures, and computational logic
Abraham
Design and analysis of algorithms is a field of computer science focused on creating efficient and effective problem-solving procedures (algorithms) and analyzing their performance.
Abraham
Design and analysis of algorithms is a field of computer science focused on creating efficient and effective problem-solving procedures (algorithms) and analyzing their performance. It involves understanding how to develop algorithms that are both correct and optimal in terms of time and space complexity
Abraham
This course will cover basic concepts in the design and analysis of algorithms. Asymptotic complexity, O() notation Sorting and search Algorithms on graphs: exploration, connectivity, shortest paths, directed acyclic graphs, spanning trees Design techniques: divide and conquer, greedy, dynamic programming Data structures: heaps, union of disjoint sets, search trees Intractability
Abraham
No courses available. Try selecting a different combination.