Questions without answers in Programming in Python

Let $G=(V,E)$ be a directed graph, and let $G^R$ denote the graph obtained by reversing all the edges of $G$.Which of the following statements is/are TRUE?If a vertex $v$...

There are $1000$ keys. Find the height (or the number of comparisons in the worst case) required in Binary Search.

Given the list '$\mathrm{L}=[1,2,3,4,5]$', what does '$\mathrm{L}[::-2]$ ' evaluate to?$[4,2]$ $[5,4,3,2,1]$ $[5,3,1]$ $[1,3,5]$