1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
enot [183]
3 years ago
14

What accesses organizational databases that track similar issues or questions and automatically generate the details to the repr

esentative who can then relay them to the customer
Computers and Technology
1 answer:
Misha Larkins [42]3 years ago
6 0

Answer: Call scripting

Explanation:

A script refers to the computer language that has different commands in a file and can be executed without them being compiled.

Call scripting can be used in accessing organizational databases which track identical issues and then automatically generate the details to the representative who can then relay them to the customer.

You might be interested in
In computer science, what does it mean to interface?
Sati [7]

D, To communicate with a computer through a device or program :)

3 0
2 years ago
Write a method with the header public static void swapAdjacent(int[] values) that takes a reference to an array of integers valu
andreev551 [17]

Answer:

public static void swapPairs(int[] a){

   int len=a.length;

       if(len%2 ==0){

           for(int i=0; i<len; i=i+2){

               a[i]=a[i+1];

               a[i+1]=a[i];

               int[] b={a[i]+a[i+1]};

           }    

       }

       if(len%2 !=0){

           for(int j=0; j<len; j=j+2){

               a[j]=a[j+1];

               a[j+1]=a[j];

               a[len-1]=a[len-1];

               int[] b={a[j]+a[j+1]+a[len-1]};

           }

       }    

}

public static void printArray(int[] a){

   System.out.println(a);

}

3 0
3 years ago
You are asked to simulate a binary search algorithm on an array of random values.An array is the list of similar type of element
Alex Ar [27]

Answer:

Explanation:

Problem statement:

to simulate a binary search algorithm on an array of random values.

Binary Search: Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.

Input/output description

Input:

Size of array: 4

Enter array:10  20 30 40

Enter element to be searched:40

The Output will look like this:

Element is present at index 3

Algorithm and Flowchart:

We basically ignore half of the elements just after one comparison.

Compare x with the middle element.

If x matches with middle element, we return the mid index.

Else If x is greater than the mid element, then x can only lie in right half subarray after the mid element. So we recur for right half.

Else (x is smaller) recur for the left half.

The Flowchart can be seen in the first attached image below:

Program listing:

// C++ program to implement recursive Binary Search

#include <bits/stdc++.h>

using namespace std;

// A recursive binary search function. It returns

// location of x in given array arr[l..r] is present,

// otherwise -1

int binarySearch(int arr[], int l, int r, int x)

{

   if (r >= l) {

       int mid = l + (r - l) / 2;

       // If the element is present at the middle

       // itself

       if (arr[mid] == x)

           return mid;

       // If element is smaller than mid, then

       // it can only be present in left subarray

       if (arr[mid] > x)

           return binarySearch(arr, l, mid - 1, x);

       // Else the element can only be present

       // in right subarray

       return binarySearch(arr, mid + 1, r, x);

   }

   // We reach here when element is not

   // present in array

   return -1;

}

int main(void)

{ int n,x;

cout<<"Size of array:\n";

cin >> n;

int arr[n];

cout<<"Enter array:\n";

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

{ cin >> arr[i]; }

cout<<"Enter element to be searched:\n";

cin>>x;

int result = binarySearch(arr, 0, n - 1, x);

   (result == -1) ? cout << "Element is not present in array"

                  : cout << "Element is present at index " << result;

   return 0;

}

The Sample test run of the program can be seen in the second attached image below.

Time(sec) :

0

Memory(MB) :

3.3752604177856

The Output:

Size of array:4

Enter array:10  20 30 40

Enter element to be searched:40

Element is present at index 3

Conclusions:

Time Complexity:

The time complexity of Binary Search can be written as

T(n) = T(n/2) + c  

The above recurrence can be solved either using Recurrence T ree method or Master method. It falls in case II of Master Method and solution of the recurrence is Theta(Logn).

Auxiliary Space: O(1) in case of iterative implementation. In case of recursive implementation, O(Logn) recursion call stack space.

8 0
3 years ago
The directory "a" contains its subdirectory "b" and there is no other entry in the directory "a". You want to display "the conte
Svet_ta [14]

The answer assumes that the question is about which command help accomplish display directory contents in Unix-like operating systems.

Answer:

The command is <em>ls</em>.

Explanation:

The command <em>ls</em> (short for <em>list</em>) displays a variety of important information in different ways regarding any directory contents. Because of this, it is probably one of the most used commands in Unix-like operating systems.

Any directory can contain directories and files of different sizes, recently created/modified, attributes like permissions for being accessed, and, with this command, we can see all this information by size, chronologically, by owner, and/or by many more ways.  

In the question, we can accomplish to list that the directory "a" contains its sub-directory "b" and no other entry using the next line of code:

Command-line 1: \\ ls\; a (<em>the command "says": display content of a</em>)

Result: b

The result is only the directory <em>b </em>because there is no other entry in it.

To display more information regarding <em>b</em>, we can use the many options available for the command <em>ls</em>, like <em>-a</em> (all entries), <em>-d</em> (only directories), <em>-l</em> (long listing format), and so on, e.g. ls -a  A (display all entries in directory A, included hidden files).

6 0
3 years ago
Can someone smart help me
nalin [4]

Answer:

Answer

Explanation:

The only thing that is wrong with this code is the fact that the link is not completed (should be https://[link name].com/)

Other than that the code is fine

7 0
3 years ago
Other questions:
  • Consider the two computers A and B with the clock cycle times 100 ps and 150 ps respectively for some program. The number of cyc
    5·2 answers
  • The main differences between laptops and desktop computers other than size and portability.
    14·1 answer
  • What is the Windows command to see the IP configuration of the PC?
    15·1 answer
  • How has technology influenced space exploration?
    13·1 answer
  • A ___ is the basic collective unit of data in a computer.
    12·1 answer
  • Which of the following commands contains an error?
    8·1 answer
  • Programmers insert documentation called facts into the program code.? <br> a. True <br> b. False
    9·1 answer
  • What are the importance of switches in our electron device
    15·1 answer
  • (09 MC)How can understanding your own personality improve your relationships with others?
    8·1 answer
  • What mathematical equation was created by a founder of intel?.
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!