All categories

3 years ago

How to change default search engine in internet explorer 11?

1 answer:

5 0

1.Open Internet Explorer.
2.In the top right corner of your browser, click the down arrow in the search box.
3.Click Find More Providers.
4.Click Google.
5.Check the box next to "Make this my default search provider.
6."Click Manage Search Providers.
7.Click Add.

hope this helps :D

You might be interested in

With a(n) ______, a search engine will show ads that have the keyword typed exactly as the searcher used, but may also have othe

allsm [11]

Answer:

modified broad match.

Explanation:

A Search engine is an internet resource or service that searches for keywords or categories specified by the end user and then displays (shows) a list of website which matches or have informations similar to the query. Some examples of popular search engines are Goo-gle, Bing, Yahoo, etc.

At the retrieving stage of a web search, the search engine queries its database using a retrieval algorithm to extract the necessary and related terms to the search. After obtaining the search terms, the stored web addresses that are related to the search is then displayed.

There are different types of matching techniques used in configuring a search engine and these includes;

I. Exact match.

II. Phrase match.

III. Broad match.

IV. Modified broad match

When a modified broad match is used, the search engine shows adverts that have the keyword typed exactly as the searcher used, but may also include other words within the search term.

Hence, the name modified because it avail users other options by including other words within the search.

5 0

3 years ago

The producer thread will alternate between sleeping for a random period of time and inserting a random integer into the buffer.

Llana [10]

Answer:

// Producer Thread

void *producer(void *param) {

buffer_item item;

while (true) {

item = rand() % 100;

sem_wait(&empty);

pthread_mutex_lock(&mutex);

if (insert_item(item))

printf("Can't insert item\n");

else

printf("Producer %d: produced %d\n", *((int*)param), item);

pthread_mutex_unlock(&mutex);

sem_post(&full);

}

// Consumer Thread

void *consumer(void *param) {

while (true) {

buffer_item item = NULL;

if (in > 0)

item = buffer[in - 1];

sem_wait(&full);

pthread_mutex_lock(&mutex);

if (remove_item(&item))

printf("Can't remove item\n");

else

printf("Consumer %d: consumed %d\n", *((int*)param), item);

pthread_mutex_unlock(&mutex);

sem_post(&empty);

}

Explanation:

An outline of the producer and consumer threads appears as shown above.

3 0

3 years ago

Importance of taking correct body measurement....

drek231 [11]

Taking correct body measurements is of key importance especially to models and future models. So that they remember about the leftover weight in their body from thanksgiving , now when they take correct body measurements , they are aware and will counter such things to be better.

6 0

3 years ago

Write an application that determines whether the first two files are located in the same folder as the third one. The program sh

marissa [1.9K]

Answer:

The program in Python is as follows:

fname1 = input("Filepath 1: ").lower()

fname2 = input("Filepath 2: ").lower()

fname3 = input("Filepath 3: ").lower()

f1dir = ""; f2dir = ""; f3dir = ""

fnamesplit = fname1.split("/")

for i in range(len(fnamesplit)-1):

f1dir+=fnamesplit[i]+"/"

fnamesplit = fname2.split("/")

for i in range(len(fnamesplit)-1):

f2dir+=fnamesplit[i]+"/"

fnamesplit = fname3.split("/")

for i in range(len(fnamesplit)-1):

f3dir+=fnamesplit[i]+"/"

if f1dir == f2dir == f3dir:

print("Files are in the same folder")

else:

print("Files are in the different folder")

Explanation:

The next three lines get the file path of the three files

fname1 = input("Filepath 1: ").lower()

fname2 = input("Filepath 2: ").lower()

fname3 = input("Filepath 3: ").lower()

This initializes the directory of the three files to an empty string

f1dir = ""; f2dir = ""; f3dir = ""

This splits file name 1 by "/"

fnamesplit = fname1.split("/")

This iteration gets the directory of file 1 (leaving out the file name)

for i in range(len(fnamesplit)-1):

f1dir+=fnamesplit[i]+"/"

This splits file name 2 by "/"

fnamesplit = fname2.split("/")

This iteration gets the directory of file 2 (leaving out the file name)

for i in range(len(fnamesplit)-1):

f2dir+=fnamesplit[i]+"/"

This splits file name 3 by "/"

fnamesplit = fname3.split("/")

This iteration gets the directory of file 3 (leaving out the file name)

for i in range(len(fnamesplit)-1):

f3dir+=fnamesplit[i]+"/"

This checks if the file directories hold the same value

This is executed, if yes

if f1dir == f2dir == f3dir:

print("Files are in the same folder")

This is executed, if otherwise

else:

print("Files are in the different folder")

5 0

3 years ago

In your own words, describe the structure and function of both the stack and queue data structure and discuss how they are diffe

Kobotan [32]

Answer:

Following are the answer to this question:

Explanation:

Stack:

The stack data structure is used to create method, parsing, analysis of expression, and tracking. This data type uses the LIFO system, which stands from the Last In First Out. This data structure operates on the top side. In this data structure, it performs two methods, that are "push() and pop()" method and the time complexity of the stack data structure O(1).

Example of Stack:

import java.util.*;//import package

public class Main //defining class Main

{

public static void main (String[] ag)//defining main method

{

ArrayDeque<Character> stack = new ArrayDeque<Character>();//creating Character array ArrayDeque

stack.push('A'); //add value in stack

stack.push('B');//add value in stack

stack.push('B'); //add value in stack

System.out.println("First Insert:"+stack); //print value stack.pop();//remove value from stack

System.out.println("After removing element: "+stack); //print value stack.push('B'); //add value in stack

stack.pop();//remove value from stack

System.out.println("final value: "+stack); //print value

}

Output:

First Insert:[B, B, A]

After removing element: [B, A]

final value: [B, A]

Queue:

The queue data structure is an abstract type, it is similar to the stacks data structure. It is open at both ends when opposed to lines. It follows the FIFO method, which stands for the First-In-First-Out method, At one end data is inserted and at the other end, it deletes the data and the time complexity of the queue data structure O(1).

Example of Queue:

import java.util.*;//import package

public class Main//defining a class queue

{

public static void main(String[] ars)//defining main method

{

LinkedList<Integer> que= new LinkedList<Integer>();//defining integer array LinkedList

for (int i = 0; i < 5; i++)//defining fo loop to add value in queue

{

que.add(i); //use add method to insert value

}

System.out.println("Queue value: "+ que); //print queue value

int remove= que.remove(); //remove value from the queue System.out.println("after removing value from queue: "+ remove);//removing element from queue

System.out.println(que); //after removing the element print value

}

Output:

Queue value: [0, 1, 2, 3, 4]

after removing value from queue: 0

[1, 2, 3, 4]

6 0

3 years ago