1. Write pseudocode to swap two adjacent elements by adjusting only the links (and not the data) using following data structures [10 Points] a. Singly linked list b. Doubly linked list

Problem 1 - hashing we would like to use initials to locate an individual. for instance, mel should locate the person mark e. lehr. note: this is all upper case. generate a hash function for the above using the numbers on your telephone. you know, each letter has a number associated with it, so examine your telephone keypad. generate 512 random 3 letter initials and take statistics on a linked list array size 512 to hold this information report how many have no elements, 1 element, 2 elements, does this agree with the hashing statistics distribution?

Consider jasper’s balance sheet. which shows how to calculate jasper’s net worth?

How does a vaccine prevent sickness and individual?