Prafful & Naghmeh

Ready to sharpen your problem-solving skills with data structures and algorithms using JavaScript? This module offers practical guidance to help you tackle coding challenges and optimize your solutions.

Price##### RM2,400.00

HRDC Claimable, corporates only

Beginner

Full-Time

Classroom

2 Day

Upcoming Courses

Start Date

25 Apr 2024

Buy nowStart Date

16 May 2024

Buy nowStart Date

14 Jun 2024

Buy nowAspiring programmers and developers looking to strengthen their understanding of data structures and algorithms using JavaScript are perfect candidates for this module. Whether you're a beginner or have some coding experience, join us to enhance your skills.

Struggling to solve complex coding problems efficiently? This module provides effective solutions to help you master data structures and algorithms, enabling you to write more efficient and optimised code.

After attending, you'll gain a solid grasp of data structures and algorithms in JavaScript. Plus, you'll have the skills to approach coding challenges with confidence and optimise your solutions for better performance.

Ready to become a coding ninja? Enroll now and level up your problem-solving skills with data structures and algorithms!

What are algorithms and what is their importance ? What are data structures and what is their importance ? What is running time of an algorithms ? What is the algorithm for insertion sort and how it uses incremental approach ? What is divide and conquer algorithm paradigm ? How to analyze divide and conquer algorithms ? How to use divide and conquer in merge sort ? What is aymptotic notation ? What are linear and binary search algorithms ? How to find run times for the above algorithms in asymptotic notation ? What is recursion and how it works internally ? How to find asymptotic bounds from recursive eq ? What is a stack ? What operations can be performed on a stack ? How to implement those operations ? What is runtime complexities for the operations ? What is a queue ? What operations can be performed on a queue ? How to implement those operations ? What is runtime complexities for the operations ? What kind of problems can be solved using stacks and queues ? What is a linked list ? How to search, insert, delete an element in LL ? What are the time complexities for the operations ? What is a doubly linked list ? What is a binary tree and its types ? What is a binary search tree (BST) ? How to search, insert and delete an element in a BST ? Run time complexities for the BST operations ? Beta Testing, beta version second phase of testing after the completion of first phase comprising of unit testing, integration testing, and system testing. Load Testing Stress Testing Defect Logging and Tracking Failover Testing

What is a heap ? How to build a heap, insert and delete elements ? What is the heap sort algorithm ? How to calculate time complexity of heap sort ? What is the quicksort algorithm and how to implement it ? What is the time complexity of the algorithm ? What is the greedy approach of solving problems ? What are some problems where the greedy approach can be used Algorithms to some basic greedy problems: Activity selection problem, Task Scheduling problem and meetings in one room problem ?

What is dynamic programming (DP) ? What is memorization and the elements of DP ? What are some problems where the DP approach can be used ? Agorithms to some basic DP problems ? Assembly line scheduling problem ? Longest common subsequence problem ?

What is the backtracking approach to solving problems ? What are some problems where the backtracking approach can be used ? Algorithms to some basic backtrack problems ? Rat in a maze problem and queens problem ?

What is a graph - its types and basic properties ? What are the ways of graph respresntation ? What is Breadth first search (BFS) and Depth first search (DFS) ? How to implement BFS and DFS ? What are the time complexities of the above algorithms ? What is topological sorting algorithm ? How to implement topological sort ? What is a minimum spanning tree (MST) ? How do following algorithms to find MST work and how to implement them Prims, Kruskals ? What are the time complexities of the above algorithms ? What is the Single Source Shortest Path problem ? How do the following algorithms to find SSSP work and How to implement them: Bellman Ford Algorithm and Dijkstras Algorithm ? What are the time complexities of the above algorithms ?

Prafful & Naghmeh

**Prafful Daga**

Prafful is a highly experienced project management professional, developer & mentor offering an experience of 15+ years in various sectors of e-Governance, IT, IT-ES, Media, Mobile, Embedded, Web Development, Game Development & Digital Marketing with 2 years of International Experience in Tokyo, Japan.

He possesses excellent communication, technology and training skills summed up with proficiency in C & Embedded C, C++, OpenGL, WebGL, Unity3D, OpenCV, Java, J2ME, J2EE, Spring, Hibernate, Struts, Microservices, Android Studio, Angular, Google Analytics, Jquery, Javascript, HTML5, CSS3 & IoT.

Besides that, he also has hands-on experience of working with open source CMS like Joomla, Moodle, Drupal, Wordpress. Other than that, he has practical exposure of working in Windows, Macintosh, Android, Linux/Unix & virtual environments.

**Naghmeh Mohammadi**

Naghmeh is a well versed Software Engineer, who is passionate to teach, share and grow together. She helps bridge the gap between theoretical learning to practical learning needed for professionals.

In her past, she has equipped many software engineers with the knowledge of corporate and robust coding, helping them find better careers. She has worked with ‘Y-combinator’ startups, helping train and mentor students in hands-on coding bootcamps. She has contributed to employer goodwill programs, training employees in corporates and government sectors in learning technology efficiently.

Price##### RM2,400.00

HRDC Claimable, corporates only

Beginner

Full-Time

Classroom

2 Day