Which of the following statements about federal student loans is true?

I’m so lost. which username do i do.

koban [17]

Answer:

the username you feel like using

5 0

2 years ago

Read 2 more answers

How can i fix this, if i log in my acc it keeps saying wrong nickname or pass. even though my email and pass is correct

Oksanka [162]

Answer:

미안해요. 나는 우리가 단지 부동일 중 하나를 모르지만 그것을 해결하는 방법을 모른다!.

8 0

2 years ago

3.29 LAB: Login name Write a program that creates a login name for a user, given the user's first name, last name, and a four-di

romanna [79]

Answer:

In C++:

#include <iostream>

using namespace std;

int main(){

string fname,lname; int num;

cout<<"Firstname: "; cin>>fname;

cout<<"Lastname: "; cin>>lname;

cout<<"4 digits: "; cin>>num;

string login = lname;

if(lname.length()>=5){

login = lname.substr(0, 5); }

login+=fname.substr(0,1)+to_string(num%100);

cout<<login;

return 0;

}

Explanation:

See attachment for explanation where I used comments to explain each line

Download cpp

4 0

2 years ago

Array Challenge Have the function ArrayChallenge (arr) take the array of numbers stored in arr and return the string true if any

vampirchik [111]

Answer:

The code is given as follows,

Explanation:

Code:

#include <stdio.h>

#include <string.h>

int n; //to store size of array

char* ArrayChallenge(int arr[]) //function returns string true or false

{

int i, j;

int sum = 0;

for(i = 0; i < n; i++)

{

sum = sum + arr[i]; //count sum

}

for(i = 0; i < n; i++)

{

for(j = i+1; j < n; j++) //loop for every two elements in array

{

if(arr[i]*arr[j] > 2*sum) //check if proudct of two elements > 2 times sum

{

printf("\n%d x %d = %d, 2xSum = %d\n", arr[i], arr[j], arr[i]*arr[j], 2*sum);

return "true"; //If proudct of two elements > 2 times sum. return true

}

return "false"; // If proudct of two elements < 2 times sum. return false

}

int main()

{

printf("\nEnter size of array: ");

scanf("%d", &n); //read size of array

int A[n]; //array of size n

printf("\nEnter array elements: ");

int i;

for(i = 0; i < n; i++)

{

scanf("%d", &A[i]); //read array from stdin

}

printf("%s\n",ArrayChallenge(A)); //ccall function and print answer

return 0;

}

6 0

3 years ago

Create a short document titled "Guide to web searches" that Sergio can give to users of the facility he supervises. The document

Studentka2010 [4]

Answer:

Jobs Seeker's

Web Search Guide

Sergio Escobar

PERFORMING A SEARCH:

All search engines will have a search field in which you are able to enter your search terms,

criteria, keywords, or even a website.

Search terms are the keywords a search engine will use to try to find the most relevant search

results.

If you’re looking for general information, just enter the name of the topic you’re

interested in into the search field.

So, if you’re looking for work, you can use the search terms ‘employment’ and ‘jobs’.

The search engine will return you a list of web pages that include the words

‘employment’ and ‘jobs’.

IF you’re looking for more specific information, you can narrow your search results by

using more specific search terms.

So, if you wanted employment opportunities in Phoenix, AZ, you could use the search terms:

‘local’, ‘employment’, ‘jobs’ and ‘Phoenix’.

Once you’ve entered your search terms and selected the search or go button, the search

engine will provide you with a list oF search results.

Depending on your search, you could get thousands or even millions of search results. This is

because search engines will usually list every single web page on the Internet that used those

search terms somewhere on a web page.

(However, the most current and/ or relevant results should be at the top of the list.)

Searching Strategy:

Using Boolean Operators:

use AND,OR,NOT between the words

ex: LOCAL AND JOBS

JOBS NOT IN NEWYORK

Proximity Operators:

With some search engines you can use proximity operators such as OpenText's NEAR operators or Webcrawler's ADJecent or the FOLLOWED BY operator.

With each of these operators, word order is important.

For example: if you place square brackets such as [local jobs] causes a hit if they are found within 100 words of each other.

Truncation (*)

You can use truncation on most search engines.

That is, you can use the asterisk (*) operator to end a root word.

For example: searching for comput* will find computer, computing, and computer jobs.

Note: the asterisk can not be the first or second letter of a root word.

Wildcard (?)

You can find words that share some but not all characters using the question mark (?) operator.

For example: Com?er J?b will find Computer Jobs and Computer Job.

Note: the ? can not be the first character in the search.

You may also use combinations of truncation (*) and single character wildcard (?) in your searches.

Conclusion:

These are just a few of the strategies and new tools trainers can use to make working on the web more productive.

As trainers continue to use the web they will soon see the next generation of web "knowledge tools" begin to emerge.

These will include multidimensional tools that are created to manage data on the web using factors such as "virtual neighborhoods of information,

" "organic structuring," and "mental model based searching and flying mechanisms" .

These are tools which are intended to make the world wide web more manageable for the user.

Let us now go back to my original statement...that the goals of search strategies and engines should be to increase your efficiency

and effectiveness when looking for information on the web.

Only you can decide which search/knowledge management strategies and tools actually improve your productivity.

It is my hope that this article helps you with making these decisions.

8 0

3 years ago