Which of the following functions DOES NOT have a memory leak? Select one: void func(string word) { int* ptr = new int[2]; ptr[0] = word.size(); delete ptr; } void func(string word) { int* ptr = new int; *ptr = word.size(); } void func(string word) { int* ptr = NULL; int len = word.size(); ptr = &len; cout << "Length of " << word << " is " << *len << endl; }

Can you fix the code please on the first picture shows the error output. // Corrected code #define _CRT_SECURE_NO_WARNINGS #include "LibraryManagement.h" #include "Books.h" #include "DigitalMedia.h" #include "LibraryConfig.h" #include #include #include #include // Include the necessary header for boolean data type // Comparison function for qsort to sort Digital Media by ID int compareDigitalMedia(const void* a, const void* b) { return ((struct DigitalMedia*)a)->id - ((struct DigitalMedia*)b)->id; } // initializing library struct Library initializeLibrary() { struct Library lib; lib.bookCount = 0; lib.ebookCount = 0; lib.digitalMediaCount = 0; // Initialize book array for (int i = 0; i < MAX_BOOK_COUNT; i++) { lib.books[i].commonAttributes.id = -1; // Set an invalid ID to mark empty slot } // Initialize ebook array for (int i = 0; i < MAX_EBOOK_COUNT; i++) { lib.ebooks[i].commonAttributes.id = -1; }...

Given the following pseudocode: function fun(n) { var outer_count=0; var inner_count=0; var sum = 0; for (var i=0; i 0, as an expression of normal arithmetic and n, what is the value of outer_count that counts the number of times the outer loop executes? Enter an expression Fun.1.inner: Assuming n EN and n> 0, as an expression of normal arithmetic and n, what is the value of inner_count that counts the number of times the inner loop executes? Enter an expression

Question 37 public static void main(String[] args) { Dog[] dogs = { new Dog(), new Dog()}; for(int i = 0; i>>"+decision()); } class Counter { private static int count; public static void inc() { count++;} public static int getCount() {return count;} } class Dog extends Counter{ public Dog(){} public void wo(){inc();} } class Cat extends Counter{ public Cat(){} public void me(){inc();} } The Correct answer: Nothing is output O 2 woofs and 5 mews O 2 woofs and 3 mews O 5 woofs and 5 mews O

Fix the errors and send the code please // Application allows user to enter a series of words // and displays them in reverse order import java.util.*; public class DebugEight4 { public static void main(String[] args) { Scanner input = new Scanner(System.in); int x = 0, y; String array[] = new String[100]; String entry; final String STOP = XXX; StringBuffer message = new StringBuffer("The words in reverse order are\n"); System.out.println("Enter any word\n" + "Enter + STOP + when you want to stop"); entry = input.next(); while(!(entry.equals(STOP))) { array[x] = entry; ++x; System.out.println("Enter another word\n" + "Enter " + STOP + " when you want to stop"); entry = input.next(); } for(y = x - 1; y > 0; ++y) { message.append(array[y]); message.append("\n"); } System.out.println(message) }

Is there any advantage to utilising vectors instead of arrays?

Develop a Java function that returns the index of a value in a sorted array. It should return -1 if the value does not exist in the array.

When you move the pointer too quickly, a phenomena known as submarineing happens when the cursor vanishes.

Rewrite the determineAdmission Fee function using a dictionary data structure such that it produces the same output when the program is run. #Determine an admission fee based on age group. def main(): print("Enter the person's age group ", end=""") ageGroup=input("(child, minor, adult, or senior): " print("The admission fee is", determineAdmission Fe def determineAdmission Fee(ageGroup): if ageGroup == "child": return 0 elif ageGroup == "minor": return 5 # age 6 to 17, 5ドル elif ageGroup == "adult": return 10 # age 18 to 64, 10ドル elif ageGroup == "senior": return 8 # age>= 65, 8ドル