<h2>This function will land up in infinite function call</h2>
Explanation:
first time when the function gets invoked,
f(6,8), so k=6 & n=8, inside the function it checks k==n, ie. 6==8, returns false, then one more if is available, so 6>8 is check for , once again it is false and else loop is executed, the function is called recursively using f(k-n,n), that is f(6-8,8), it means f(-2,8) is passed.
Second time,
if(-2==8) is false, so if(-2>8) is again false and function f(-10, 8) is called
if(-10==8) is false, so if(-10>8) is again false and function f(-18,8) is called
if(-18==8) is false, so if(-18>8) is again false and function f(-26,8) is called
So this goes recursively and ends in an infinite function call.
<span>each entry in an array of strings is actually a pointer to the first character of a string
Each indice in an array of strings (which are actually each actually an array of char) is actually a pointer to the first (0th) char of a string.
</span>
Answer:
To see who reads the file, open “Windows Event Viewer”, and navigate to “Windows Logs” → “Security”. There is a “Filter Current Log” option in the right pane to find the relevant events. If anyone opens the file, event ID 4656 and 4663 will be logged.
Answer:
D. nothing, as the alkyne would not react to an appreciable extent.
Explanation:
Nothing, as the alkyne would not react to an appreciable extent.