Check some MCQs on space and time complexity here.- Time and space complexity analysis of recursive programs - using factorial.- Big O Notation, Gayle Laakman McDowell.- A beginner's guide to Big O notation.runestone.academy - Particularly for Big-O notation.- Measuring the efficiency of algorithms.- Algorithms Lecture 1 - Introduction to asymptotic notations.- Definition Of Big O Notation - Intro to Theoretical Computer Science.- Big-O notation in 5 minutes - The basics.- Time complexity of a computer program.Basic math operations (addition, subtraction, multiplication, division, exponentiation).Basic Data Structures: Arrays, Strings, Stacks, Queues.The syllabus for Foundation level is mentioned below: You can expect problems from the following topics to come in the exam. We strongly recommend you to solve these problems in the same duration of time as the duration of the exam before you take the data structures and algorithms exam.
For each level we have different Mock Tests. A Mock Test is an open assessment contest that will help you assess yourself for the certification exam after you are ready with the topics. We have also prepared a Mock Test for each level.
BASIC DATA STRUCTURES AND ALGORITHMS INTERVIEW QUESTIONS FREE
Please feel free to find out what suits best to you. While we do recommend these resources based on the inputs of our user community, we do not claim that these are the most authoritative Learning Resources about any topic in data structures and algorithms. The resources that we list here are references that we have collected over the internet and some of them from our own website. This section lists out the syllabus, the learning resources and Mock Tests to help you prepare for the data structures and algorithms Certification test.