Search our library of All subjects All levels questions

Top answers

All subjects

All levels

Write pseudocode for the binary search algorithm and state, with an explanation, it's worst case complexity in big-O notation

procedure binarySearch(A[], start, end, item): if start <= end: i = ceil((start + end) / 2)
if A[i] = item: return i if A[i] > item: return binarySearch(A[], i + 1, end, item) if...

Answered by Yagna B. • Computing tutor

1441 Views

State the main features of a tree

It is a dynamic hierarchical data structure, it has a node at the top of the tree called root ode ad each node can have children nodes and the lines joining the nodes are called branches. A node that has ...

Answered by Zifeng L. • Computing tutor

3245 Views

What is the difference between HTML, CSS and JavaScript

HTML, CSS and JavaScript are the building blocks of the internet which are used to build all the websites around. HTML, or Hyper Text Markup Language, defines the layout of a webpage (where the headings g...

Answered by Domantas J. • Computing tutor

2535 Views

Simplify the following Boolean expression: ¬(AvB) v ¬(CvD) v ¬A^(BvC) v (¬A^A)

(This question is easier to display on a whiteboard or written down)(¬A^¬B) v (¬C^¬D) v (¬A^B) v (¬A^C) v 0 [De Morgan's Law, Distributive Law, Inverse Law]¬A v (¬C^¬D) v (¬A^C) [Absorbtion Law]¬A v (¬C^¬...

Answered by Nikesh P. • Computing tutor

5287 Views

How do I make simplifying Boolean algebra easier?

Understanding how to simplify Boolean algebra is as simple as learning a set of rules, when you look at each rule individually it may not make complete sense but after putting all the rules together in en...

Answered by Jamie S. • Computing tutor

2538 Views