Book Image

Learn Q# Programming

By : Bhagvan Kommadi, Aneesh K Johny
Book Image

Learn Q# Programming

By: Bhagvan Kommadi, Aneesh K Johny

Overview of this book

<p>This book covers the fundamentals of quantum computing and programming with Microsoft’s Q# language. The reader will learn how to design, test and debug algorithms for different quantum applications.</p> <p>The primary focus of this book will be to give the audience an idea about how to get started with the concepts, different aspects, and theories of quantum computing operations, algorithms etc. Through this book, the developer will get a basic idea about the Microsoft Quantum Tool Kit and how to use the embedded Q# language. This will enable the reader to formalize and convert different real world problems to quantum algorithms and optimize them to use with a future quantum computer.</p> <p>By the end of the book, you would have successfully learned to create quantum programs of your own.</p>
Table of Contents (11 chapters)

Questions


  • Give an example where you can use composite Pattern.
  • For an array of 10 elements with random set of integers, identify max and min. Calculate the complexity of the algorithm.
  • To manage state of an object, which structural pattern is relevant ?
  • A window is subclassed to add scroll bar to make it scrollable window. Which pattern is applied in the above scenario ?
  • Find the complexity of binary tree search algorithm ?
  • Identify the sub matrices of 2x2 in a 3x3 matrix. What is the complexity of the algorithm that you have used ?
  • Explain with a scenario the difference between brute force and backtracking algorithms.
  • Rules Engine uses back tracking to identify the rules impacted by the change. Show an example where back tracking helps in identifying the impacted rules.
  • Draw a flow chart for the algorithm of calculation of profit-loss given cost price, selling price and quantity.
  • Write the pseudo code for an algorithm which compares the strings and identifies the substring within a string.