Do it in linear time complexity and do not use any functions of the string class in C++ like find(), erase()

Write a program using the stack for parenthesis matching. Explain what modifications would be needed to make the parenthesis matching algorithm check expressions with different kinds of parentheses such as (), ] and (}'s. Please write simple C programs to answer the question. Examine your codes with some examples. You should upload your runnable codes + report (single pdf) that explains your codes and results as a single zip file.

Write a small C++ program that defines a recursive function GCD based on the model of the Lisp function  (defun gcd (n m)"Returns the gcd of two numbers"  (let ((dividend n) (divisor m) (remainder 1))    (while (/= remainder 0)      (setq remainder (mod dividend divisor))      (setq dividend divisor)      (setq divisor remainder))    dividend)) In the main function, write a loop (while or do) that repeats the following actions: ask the user to enter two numbers, compute their GCD and output it, until the user enters 0 for one of the numbers.

I was hoping I could get help in describing the mountain

Can someone help me with this question in C++ and not any other programming language No library functions that leverage hash and maps can be used except to make it all lowercase  List sentence(s) with the maximum no. of occurrences of the word "the" in the entire file and also list the corresponding frequency. List sentence(s) with the maximum no. of occurrences of the word "of" in the entire file and also list the corresponding frequency. List sentence(s) with the maximum no. of occurrences of the word "was" in the entire file and also list the corresponding frequency. here is a link too the file its called tiny1 https://drive.google.com/file/d/1ariNN_rW9c3vijK1hvjObcQJafYQ2gzm/view?usp=sharing

Write a program in js to add key value pair in an object and print that Note that you must use dot notation

In Kotlin, Write a recursive function called myZip, with an expression body. MyZip takes two Lists and returns a List of Pairs in which each value may be any type (I suggest your start by thinking out how to represent this data type). The pairs consist of corresponding elements in the two lists (the first element of the first list and the first element of the second list, etc). The base case should be that either (or both) of the original lists has length 1, so that, if the lists have different length, the zipping stops when the first list runs out of values.

Write the code in python to define the function has_adjacent_repeats(mystr), which takes a string parameter and returns a boolean result.   - If mystr has at least one instance of adjacent characters being equal, return True   - Otherwise, return False Hint: You can iterate over the positive indices i for characters in mystr: 1, 2, 3, ...., len(mystr)-1 with a for loop. For each i, if the character at index i matches the character at index i - 1, return True. Otherwise, if no doubled character is found in the entire string, return False. For example: Test Result if not (has_adjacent_repeats("NOODLES") is True): print("error")   if not (has_adjacent_repeats("Bananas") is False): print("shwoopsie")   if not (has_adjacent_repeats("Hanoverr") is True): print("error")

Please help me fill in the blanks   The reverse of a string x, denoted rev(x), is the string obtained by writing x backwards. For example, if x = abbaaab then rev(x) = baaabba. If A is a subset of Σ*, the reverse of A, denoted rev(A), is the subset of Σ* consisting of all reverses of strings in A: rev(A)={rev(x) | x∈A} For example, rev({a,ab,aab}) = {a,ba,baa}. Suppose you are given a deterministic finite automaton M accepting a set A. Show how to construct a DFA N accepting rev(A). (Kozen would suggest putting pebbles on the final states of M and moving them backwards along transition edges.) Describe N formally (i.e. in terms of Q, δ, etc.) including the definition of acceptance. Hint: the subset construction will be helpful here. You can start with M = (Q, Σ, δ, s, F) and define the components of N in terms of the components of M. 1. DFA N = (Q_N​, Σ, δ_N​, s_N​, F_N​) where Q_N​ = ___ 2. DFA N = (Q_N​, Σ, δ_N​, s_N​, F_N​) where δ_N​ = ___ 3. DFA N = (Q_N​, Σ, δ_N​, s_N​, F_N​)…

Write a recursive C++ program that will output all the subsets of a set of n elements (without repeating any subsets).