Write the pseudocode of the function SEARCH_MUSIC_GENRE (head, genre) that receives as input arguments the head of the list of playlists and the name of a music genre (e.g. Pop, Rock, Blues, etc). If a node with that music genre exists in the main list, the function SEARCH_MUSIC_GENRE (head, s) must return the memory address of the first element of the corresponding playlist. If a node with that music genre does not exist in the main list, the value NULL must be returned.

Write the pseudocode of the function SEARCH_MUSIC_GENRE (head, genre) that receives as input arguments the head of the list of playlists and the name of a music genre (e.g. Pop, Rock, Blues, etc). If a node with that music genre exists in the main list, the function SEARCH_MUSIC_GENRE (head, s) must return the memory address of the first element of the corresponding playlist. If a node with that music genre does not exist in the main list, the value NULL must be returned.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 12VE

See similar textbooks

Similar questions

write the pseudocode of the function SEARCH_MUSIC_GENRE (head, genre) that receives as input arguments the head of the list of playlists and the name of a music genre (e.g. Pop, Rock, Blues, etc). If a node with that music genre exists in the main list, the function SEARCH_MUSIC_GENRE (head, s) must return the memory address of the first element of the corresponding playlist. If a node with that music genre does not exist in the main list, the value NULL must be returned.
The return address of a function can be displayed via a series of commands. Keep in mind that any changes you make to the stack must not impede the return of the procedure to its caller
Write a C code segment for a node declaration named Enroll. Then, write a function segment that display the information by using head pointer containing the first node
It is possible to show the return address of a function by executing a set of instructions in sequence. Be mindful that any changes you make to the stack must not hinder the procedure's ability to restore control to the entity that called it.
IN C PROGRAMMING LANGUAGE: Please write a pointer version of strncpy() named pstr_ncpy(char *dest, char *src, int n) which copies n characters from src and copies them into dest.
IN C PROGRAMMING LANGUAGE: Please write a pointer version of strncmp() named pstr_ncmp(char *s, char *t, int n) which compares the first n characters.
3. lookup_friends_heights This function takes a friends database (a list of dictionaries, like the previous functions) and a list of friends names, and it returns a list of heights for the specified friends. If a given friend's name is not present in the friends database, we put a None in the corresponding slot. We assume that there will be at most one friend with a given name in the list. You may want to use nested for-loops for this function. Sample calls should look like this. >>> lookup_friends_heights([{"name":"todd","height":170},{"name": "sarah", "height":165},{"name":"dweezil", "height":175}], ["dweezil", "sarah"]) [175, 165] >>> lookup_friends_heights([{"name": "todd","height":170},{"name": "sarah","height":165},{"name": "dweezil", "height":175}], %3D ["sarah", "elíza", "dweezil"]) [165, None, 175]
3. lookup_friends_heights This function takes a friends database (a list of dictionaries, like the previous functions) and a list of friends names, and it returns a list of heights for the specified friends. If a given friend's name is not present in the friends database, we put a None in the corresponding slot. We assume that there will be at most one friend with a given name in the list. You may want to use nested for-loops for this function. Sample calls should look like this. >>> lookup_friends_heights([{"name":"todd","height":170},{"name": "sarah","height":165},{"name":"dweezil","height":175}], ["dweezil", "sarah"]) [175, 165] >>> lookup_friends_heights([{"name": "todd","height":170},{"name": "sarah","height":165},{"name": "dweezil", "height":175}], ["sarah", "elíza", "dweezil"]) [165, None, 175]
In c programming without pointer and function Problem Statement A matrix is a 2D array of numbers arranged in rows and columns. We give you a Matrix of N rows and M columns. Now your task is to do this operation on this matrix: If the value matches with the current row and column number then add 3 with the value. If the value matches with only the current row number then add 2 with the value. If the value matches with only the current column number then add 1 with the value. Input Format The first line contains N is the number of rows in this matrix and M is the number of columns in this matrix The second line contains a 2D array Arr[i][j]. Constraints 1 <= N, M <= 10 0 <= Arr[i][j] <= 100 Output Format Print the matrix after the operation is done. Sample Input 0 3 31 1 11 1 11 1 1 Sample Output 0 4 3 3 2 1 1 2 1 1
3. lookup_friends_heights This function takes a friends database (a list of dictionaries, like the previous functions) and a list of friends names, and it returns a list of heights for the specified friends. If a given friend's name is not present in the friends database, we put a None in the corresponding slot. We assume that there will be at most one friend with a given name in the list. You may want to use nested for-loops for this function. Sample calls should look like this. >>» lookup_friends_heights([{"name":"todd", "height":170},{"name":"sarah","height":165}, {"name":"dweezil","height":175}], ["dweezil", "sarah"]) [175, 165] >>> lookup_friends_heightsC[{"name":"todd","height":170},{"name":"sarah","height":165}, {"name":"dweezil","height":175}], ["sarah", "eliza", "dweezil"]) [165, None, 175] 4. class definition for Friend For the next version of the friends database (coming soon!), we want to use classes rather than dictionaries. Define a Friend class , where each Friend object…
C codeblocks Only write a function that receives an array, its size and a value to search for (define your function in the same way as the given function prototype). The function should return the index of the searched element in the array. If the element is not found, it should return -1. If the array has more than one element of that same value, it should return the value -2. The array is not necessarily sorted and should not be sorted in the function. #include <stdio.h>#include <stdlib.h>int searchIt(int arr[], int size, int value);int main() {int a[]={1,2,3,4,5};printf("%d", searchIt(a,5,3));return 0;}//Your answer starts here. For example: Test Result int a[]={1,2,3,4,5}; printf("%d", searchIt(a,5,3)); 2 int b[]={3,2,5,7,10,2,4}; printf("%d", searchIt(b,7,2)); -2 int c[]={-1,0,234,43,2,1,4,5}; printf("%d", searchIt(c,8,99)); -1
Please Help me with This Problem Language = C++ Write a Menu Driven C++ program that creates a two-dimensional array/Matrix of size n X m where nrepresent the students and m represent the subjects and initialize it with user. The program should dofollowing Tasks using Menu, the menu operations are implemented using functions:a) Total_Marks: Calculates total/sum of the values in the specified row (student).b) Avg_Subject: Calculates Average of the values in the specified column (subject).c) Stud_Highest: Finds highest value in the specified row of the array and return that subjectname.d) Stud_Lowest: Finds lowest value in the specified row of the array and return that subject name.