Skip to main content

AI Agents: What They Are and How They Will Change Work

Artificial intelligence has moved beyond simply answering questions and generating text. A new generation of AI systems—known as AI agents—is emerging with the ability to plan tasks, use tools, make decisions, and complete multi-step workflows with less human intervention. From managing emails and analyzing data to writing software and assisting customers, AI agents could significantly change how people work. What Are AI Agents? An AI agent is a software system that can perceive information, reason about a goal, take actions, and adapt based on the results. Traditional AI tools usually respond to a specific instruction. For example, you might ask an AI chatbot to summarize a document, and it provides a summary. An AI agent can go further. You could give an agent a goal such as: "Research three competitors, compare their pricing, summarize their main features, and prepare a report." The agent may then: 1) Understand the objective. 2) Break the task into smaller steps. 3) Searc...

Storing values in arrays

STORING VALUES IN ARRAYS
When we declare an array, we are just allocating space for its elements; no values are stored in 
the array. There are three ways to store values in an array. First, to initialize the array elements 
during declaration; second, to input values for individual elements from the keyboard; third, to 
assign values to individual elements. This is shown in below fig.
Figure: Storing values in an array

Initializing Arrays during Declaration
The elements of an array can be initialized at the time of declaration, just as any other variable. When an array is initialized, we need to provide a value for every element in the array. Arrays are initialized by writing,
type array_name[size]={list of values};
Note that the values are written within curly brackets and every value is 
separated by a comma. It is a compiler error to specify more values than there 
are elements in the array. When we write,
int marks[5]={90, 82, 78, 95, 88};
An array with the name marks is declared that has enough space to store five 
elements. The first element, that is, marks[0] is assigned value 90. Similarly, 
the second element of the array, that is marks[1], is assigned 82, and so on. 
This is shown in Fig below.
Fig : Initialization of array marks[5]

While initializing the array at the time of declaration, the programmer may omit the size of the array. For example,
int marks[]= {98, 97, 90};
The above statement is absolutely legal. Here, the compiler will allocate enough space for all the initialized elements. Note that if the number of values provided is less than the number of elements in the array, the un-assigned elements are filled with zeros. Figure below shows the 
initialization of arrays.
Fig : Initialization of array elements

Inputting Values from the Keyboard
An array can be initialized by inputting values from the keyboard. In this method, a while/do–while or a for loop is executed to input the value for each element of the array. For example, look at the code shown in Fig. Below
int i, marks[1 ];
for(i= ;i<1 ;i++)
scanf("%d", &marks[i]);
Figure: Code for inputting each element of the array
In the code, we start at the index i at 0 and input the value for the first element of the array. Since the array has 10 elements, we must input values for elements whose index varies from 0 to 9.

Assigning Values to Individual Elements
The third way is to assign values to individual elements of the array by using the assignment operator. Any value that evaluates to the data type as that of the array can be assigned to the individual array element. A simple assignment statement can be written as
marks[3] = 100;
Here, 100 is assigned to the fourth element of the array which is specified as marks[3].
Note that we cannot assign one array to another array, even if the two arrays have the same type and size. To copy an array, 
you must copy the value of every element of the first array into the elements of the second array. Figure below illustrates the code to copy an array.
 int i, arr1[1 ], arr2[1 ];
arr1[1 ]={ ,1,2,3,4,5,6,7,8,9};
for(i= ;i<1 ;i++)
arr2[i] = arr1[i];
Figure : Code to copy an array at the 
individual element level

The loop accesses each element of the first array and simultaneously assigns its value to the corresponding element of the second array. The index value i is incremented to access the next element in succession. Therefore, when this 
code is executed, arr2[0] = arr1[0], arr2[1] = arr1[1], arr2[2] = arr1[2], and so on.
We can also use a loop to assign a pattern of values to the array elements. For example, if we want to fill an array with 
even integers (starting from 0), then we will write the code as shown in below.
// Fill an array with even numbers
int i,arr[1 ];
for(i=0;i<10;i++)
arr[i] = i*2;
Figure: Code for filling an array with even numbers
In the code, we assign to each element a value equal to twice of its index, where the index starts from 0. So after executing this code, we will have arr[0]=0, arr[1]=2, arr[2]=4, and so on.

Popular posts from this blog

MEMORY MAPPED FILES

Memory-mapped files           Rather than retriving data files directly via the file system with every file access, data files can be paged into memory the same as process files, resulting in much faster retrieves ( except of course when page-faults occur. ) This is called as memory-mapping a file. Basic Mechanism * Basically a file is mapped to an address range within a process's virtual address space, and then paged in as required using the ordinary demand paging system. * Note that file matches are made to the memory page frames, and are not immediately written out to disk. ( This is the purpose of the "flush( )" system call, which may also be needed for stdout in some cases. See the time killer program for an example of this) * This is also why it is important to "close()" a file when one is done writing to it - So that the data can be safely flushed out to disk and so that the memory frames can be release for other purposes. * Some systems issue special sys...

how to improve your English vocabulary easily

Improving your English vocabulary is an essential skill for anyone who wants to communicate effectively in English. Whether you are a student, a professional, or a casual learner, having a strong vocabulary can make a significant difference in your language proficiency. However, building a robust English vocabulary may seem daunting, especially if English is not your native language. In this blog post, we will explore some effective ways to improve your English vocabulary easily. Read regularly One of the most effective ways to build your English vocabulary is by reading regularly. Reading exposes you to new words and phrases, which can help expand your vocabulary. Start with simple books, newspapers, or magazines and gradually move to more complex materials. You can also read online articles, blogs, or websites on topics that interest you. Make it a habit to look up any unfamiliar words and learn their meanings. Use flashcards Flashcards are an excellent tool for learning and memoriz...

Deadlock Characterisation

Deadlock Characterization Necessary Conditions: There are four conditions that are required to achieve deadlock: Mutual Exclusion  - At least one resource must be grip in a non-sharable mode; If any other process requests this resource, then that process must wait for the resource to be released. Hold and Wait  - A process must be concurrently gripping at least one resource and waiting for at least one resource that is presently being grip by some other process. No preemption  - Once a process is belonging a resource ( i.e. once its request has been allowed ), then that resource not be taken away from that process until the process freely releases it. Circular Wait -  A group of processes { P0, P1, P2, . . ., PN } must exist such that every P[ i ] is waiting for P[ ( i + 1 ) % ( N + 1 ) ]. ( Note that this situation implied the hold-and-wait condition, but it is easier to deal with the conditions if the four are considered individually. ) Resource-Allocation Graph In...