All categories

3 years ago

Which searching method requires that the list be sorted?

Computers and Technology

1 answer:

cricket20 [7]3 years ago

8 0

Answer:

Binary Search

Explanation:

Binary search is a search which we can apply on sorted list. This search compares the search element with the middle element of the list. If it is greater than the middle element then again we apply search on right list

if it is less that the list then it will apply search on left list. This process happens recursively until you find the search element.

In Worst and average Case Performance :0(nlogn)

You might be interested in

Which of the following can be used to replace internal network addresses with one or more different addresses so the traffic tha

love history [14]

Answer:

A Proxy Server

Explanation:

In data communication and computer networks, proxy servers are intermediaries or a gateway that sits between the user and the internet. The users are therefore separated from the web they browse. The proxy servers then provide filters and firewalls.

7 0

3 years ago

Why did England establish the Sugar Act?

Iteru [2.4K]

Answer:

The Revenue Act of 1764, also known as the Sugar Act, was the first tax on the American colonies imposed by the British Parliament. Its purpose was to raise revenue through the colonial customs service and to give customs agents more power and latitude with respect to executing seizures and enforcing customs law.

Explanation:

Hope this helps- Good luck ^w

4 0

3 years ago

What may happen if a large number of computer users are trying to access a web site at the same time as you ?

Ber [7]

It Will Say " Too Many People At A Time Trying To Get In " And It Will Say Wait .

6 0

3 years ago

I NEED THIS NOW!! :((

Finger [1]

which feature of a database allows a user to locate a specific record using keywords?

search

6 0

3 years ago

Read 2 more answers

Create a program which will input data into a pipe one character at a time. Count the number of characters as they are written i

LenKa [72]

Answer:

#include<stdio.h>

#include<stdlib.h>

#include<fcntl.h>

#include<unistd.h>

#define BUFSIZE 16

int main(){

//pipe descriptors

char msg[BUFSIZE];

char buf[BUFSIZE];

int pipefd[2];

if(pipe(pipefd) == -1){

//pipe creation error

perror("pipe");

exit(EXIT_FAILURE);

}

//pipe creation successfull

//write four messages

sprintf(msg , "apple");

write(pipefd[1], msg, BUFSIZE);

printf("Written %s\n", msg);

sprintf(msg , "boy");

write(pipefd[1], msg, BUFSIZE);

printf("Written %s\n", msg);

sprintf(msg , "cat");

write(pipefd[1], msg, BUFSIZE);

printf("Written %s\n", msg);

sprintf(msg , "dog");

write(pipefd[1], msg, BUFSIZE);

printf("Written %s\n", msg);

//read

read(pipefd[0], buf, BUFSIZE);

printf("Read: %s\n", buf);

read(pipefd[0], buf, BUFSIZE);

printf("Read: %s\n", buf);

read(pipefd[0], buf, BUFSIZE);

printf("Read: %s\n", buf);

read(pipefd[0], buf, BUFSIZE);

printf("Read: %s\n", buf);

close(pipefd[0]);

close(pipefd[1]);

return 0;

}

(b)

#include<stdio.h>

#include<stdlib.h>

#include<fcntl.h>

#include<unistd.h>

#include<wait.h>

#define BUFSIZE 16

int main(){

//pipe descriptors

char msg[BUFSIZE];

char buf[BUFSIZE];

int pipefd[2];

if(pipe(pipefd) == -1){

//pipe creation error

perror("pipe");

exit(EXIT_FAILURE);

}

//pipe creation successfull

//write four messages

if(fork() == 0){

//this is child

//close unused write end

close(pipefd[1]);

read(pipefd[0], buf, BUFSIZE);

printf("This is child process reading first message. Content is %s\n", buf);

read(pipefd[0], buf, BUFSIZE);

printf("This is child process reading second message. Content is %s\n", buf);

read(pipefd[0], buf, BUFSIZE);

printf("This is child process reading third message. Content is %s\n", buf);

read(pipefd[0], buf, BUFSIZE);

printf("This is child process reading fourth message. Content is %s\n", buf);

close(pipefd[0]);

//exit from child

exit(EXIT_SUCCESS);

}

//this is parent process

//close unused read end

close(pipefd[0]);

sprintf(msg , "apple");

printf("This is parent process. Writing first message into pipe\n");

write(pipefd[1], msg, BUFSIZE);

sprintf(msg , "boy");

printf("This is parent process. Writing second message into pipe\n");

write(pipefd[1], msg, BUFSIZE);

sprintf(msg , "cat");

printf("This is parent process. Writing third message into pipe\n");

write(pipefd[1], msg, BUFSIZE);

sprintf(msg , "dog");

printf("This is parent process. Writing fourth message into pipe\n");

write(pipefd[1], msg, BUFSIZE);

close(pipefd[1]);

//wait for child

wait(NULL);

return 0;

}

(c)

#include<stdio.h>

#include<stdlib.h>

#include<fcntl.h>

#include<unistd.h>

#include<sys/wait.h>

#include<sys/types.h>

#include<signal.h>

typedef struct sigaction Sigaction;

unsigned long long size = 0;

void alarmhandler(int sig){

//alarm fired writing blocked

printf("Write blocked after %llu characters\n", size);

exit(EXIT_SUCCESS);

}

int main(){

//pipe descriptors

int pipefd[2];

if(pipe(pipefd) == -1){

//pipe creation error

perror("pipe");

exit(EXIT_FAILURE);

}

//install handler

sigset_t mask , prev;

sigemptyset(&mask);

sigaddset(&mask , SIGALRM);

sigprocmask(SIG_BLOCK , &mask , &prev);

Sigaction new_action;

sigemptyset(&new_action.sa_mask);

new_action.sa_flags = SA_RESTART;

new_action.sa_handler = alarmhandler;

sigaction(SIGALRM , &new_action , NULL);

sigprocmask(SIG_SETMASK , &prev, NULL);

while(1){

//print size on multiple of 4

if(size != 0 && size % 1024 == 0){

printf("%llu characters in pipe\n", size);

}

//reset previous alarm

alarm(0);

//set new alarm for 5 seconds

alarm(5);

//write to pipe one character

write(pipefd[1], "A", sizeof(char));

size++;

}

return 0;

}

Explanation:

Output for a, b, c are pasted accordingly

4 0

3 years ago