program to convert decimal number into roman number
program of prime number
program to print total number of times a given number exist from 1 to 100
program to compare two given matrices
I've uploaded solutions of the C++ Programs Manual i had uploaded before. See that manual and find your solutions in my uploads.
For my c++ programming tutorials. Visit http://uolbscs.com/my-tutorials/
OR my website at www.uolbscs.com
I've uploaded solutions of the C++ Programs Manual i had uploaded before. See that manual and find your solutions in my uploads.
For my c++ programming tutorials. Visit http://uolbscs.com/my-tutorials/
OR my website at www.uolbscs.com
I've uploaded solutions of the C++ Programs Manual i had uploaded before. See that manual and find your solutions in my uploads.
For my c++ programming tutorials. Visit http://uolbscs.com/my-tutorials/
OR my website at www.uolbscs.com
I've uploaded solutions of the C++ Programs Manual i had uploaded before. See that manual and find your solutions in my uploads.
For my c++ programming tutorials. Visit http://uolbscs.com/my-tutorials/
OR my website at www.uolbscs.com
I have written the code but cannot complete the assignment please help.pdfshreeaadithyaacellso
I have written the code but cannot complete the assignment please help me to complete.
Please don't just copy other s answers as your own.
// Insertion sort
/*
#include <ctime>
#include <iostream>
using namespace std;
void insertionSort(int arr[], int n) {
int i, key, j;
for (i = 1; i < n; i++) {
key = arr[i];
j = i - 1;
// Move elements of arr[0..i-1], that are greater than key, to one position ahead of their current
position
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
}
int main() {
int n;
cout << "Enter the size of the array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int num = sizeof(arr) / sizeof(arr[0]);
clock_t start, end;
double timetaken;
start = clock();
insertionSort(arr, num);
end = clock();
cout << "Sorted array: \n";
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
timetaken = ((double) (end - start)) / CLOCKS_PER_SEC;
cout << "Time taken : " << fixed << timetaken << "s" << endl;
return 0;
}
*/
// Shell Sort
/*
#include <ctime>
#include <iostream>
using namespace std;
int shellSort(int arr[], int n) {
for (int gap = n/2; gap > 0; gap /= 2) {
for (int i = gap; i < n; i += 1) {
int temp = arr[i];
int j;
for (j = i; j >= gap && arr[j - gap] > temp; j -= gap)
arr[j] = arr[j - gap];
arr[j] = temp;
}
}
return 0;
}
void printArray(int arr[], int n) {
for (int i=0; i<n; i++)
cout << arr[i] << " ";
}
int main() {
int n;
cout << "Enter the size of the array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int num = sizeof(arr) / sizeof(arr[0]);
clock_t start, end;
double timetaken;
start = clock();
shellSort(arr, num);
end = clock();
cout << "\nArray after sorting: \n";
printArray(arr, n);
cout << endl;
timetaken = (double)(end - start) / CLOCKS_PER_SEC;
cout << "Time taken : " << fixed << timetaken << "s" << endl;
return 0;
}
*/
// MergeSort
/*
#include <ctime>
#include <iostream>
using namespace std;
void merge(int arr[], int l, int m, int r) {
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for (i = 0; i < n1; i++)
L[i] = arr[l + i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1 + j];
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
}
else {
arr[k] = R[j];
j++;
}
k++;
}
while (i < n1) {
arr[k] = L[i];
i++;
k++;
}
while (j < n2) {
arr[k] = R[j];
j++;
k++;
}
}
void mergeSort(int arr[], int l, int r) {
if (l < r) {
int m = l + (r - l) / 2;
mergeSort(arr, l, m);
mergeSort(arr, m + 1, r);
merge(arr, l, m, r);
}
}
int main() {
int n;
cout << "Enter the size of the array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int arr_size = sizeof(arr) / sizeof(arr[0]);
clock_t start;
clock_t end;
double timetaken;
start = clock();
mergeSort(arr, 0, arr_size - 1);
end = clock();
timetaken = (double)(end - start) / CLOCKS_PER_SEC;
.
program to check given number is perfect or not.
program to print perfect numbers between 1 to 500
program to convert decimal number into binary number.
program to convert decimal number into other number system.
program to print power of given number
This is my first translation, may be i have done some mistakes even though i took immence care to avoid mistake..
please let me know if anyone find some mistakes.
This presentation includes 7 programs, in which 5 are basic arithmatic (binary) operator overloading and 2 are the unary operators( increment and decrement) overloading.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Mission to Decommission: Importance of Decommissioning Products to Increase E...
Cpp programs
1. SOME INTERESTING C PLUS PLUS PROGRAMS.
Q1: COUNT TOTAL OCCURRENCE OF GIVEN NUMBER FROM THE RANGE (I TO 100 (user difened))
SOLUTION 1:
#include<iostream.h>
#include<conio.h>
void main()
{
int i,count=0,n,que,rem,temp,lb,ub;
clrscr();
cout<<"Enter value of n:";
cin>>n;
cout<<"Enter lower bound (must be greater than 1) ";
cin>>lb;
cout<<"n Enter upper bound (must be less than 100) ";
cin>>ub;
if(n==0) //if the number to be searched is 0 then start search from 10 other wise it will count 01,02,..09
{
lb=10;
}
for(i=lb;i<=ub;i++)
{
que=i/10;
rem=i%10;
if((rem==n)&&(que==n))
{
count=count+2;
cout<<"n"<<i;
}
else if((rem==n)||(que==n))
{
count++;
cout<<"n"<<i;
}
}
cout<<"n => Total number of "<<n<<" Between"<<lb<<"and"<<ub<<"are :"<<count;
getch();
}
OUTPUT (QUESTION NO - 1)
2.
3. Q2: WAP to print roman value of a given number.
Solution2:
#include<iostream.h>
#include<conio.h>
void calculate(int temp)
{
int a;
a=temp;
switch(a)
{
case 1:
cout<<"I";
break;
case 2:
cout<<"II";
break;
case 3:
cout<<"III";
break;
case 4:
cout<<"IV";
break;
case 5:
cout<<"V";
break;
case 6:
cout<<"VI";
break;
case 7:
cout<<"VII";
break;
case 8:
cout<<"VIII";
break;
case 9:
cout<<"IX";
break;
}
}
void main()
{
int number,n,rem,bal;
clrscr();
cout<<"enter any number:";
cin>>number;
cout<<"The Roman equivalent of "<<number<<"is:";
n=number;
rem=n%10;
bal=n-rem;
if(bal==10)
5. OUTPUT (QUESTION NO - 2)
Q3: Program to print the prime numbers, sum of which is a given number.
For ex: Given number is 45. It is a sum of prime numbers 2 and 43
Solution 3:
#include<iostream.h>
#include<conio.h>
int check(int temp)
{
int n =temp;
if((n==0)||(n==1)||(n==2))
return 1;
else if((n%2==0)||(n%3==0)||(n%5==0)) //if it is divisible by 2,3,5 it is not a prime number.
{
return 0;
}
else
{
return 1;
}
}
void main()
{
int a,i,bal;
7. for(j=0;j<=1;j++) To get the elements of 1st
matrix (00,01,10,11)
{
cout<<"Enter "<<i<<j<<"element: ";
cin>>mat1[i][j];
}
}
cout<<"n ENTER THE ELEMENTS OF 2nd MATRIX: n ";
for(i=0;i<=1;i++)
{
for(j=0;j<=1;j++)
{ To get the elements of 2nd matrix (00,01,10,11)
cout<<"n Enter "<<i<<j<<"element: ";
cin>>mat2[i][j];
}
}
for(i=0;i<=1;i++) //for comparing each element of matrix1 and matrix2 ie a[0][0] == b[0][0]
{
for(j=0;j<=1;j++)
{
if(mat1[i][j] == mat2[i][j])
{
count++; //count will set to 4 if all the elements are same ie 00,01,10,11, it will increment each time.
}
}
}
if(count==4)
{
cout<<"MATRICES ARE EQUAL";
}
else
{
cout<<"MATRICES ARE UNEQUAL";
}
getch();
}
OUTPUT (QUESTION NO - 4)
8. Q5: WAP in cpp that contains 3 arrays, where the size of first two arrays is n and the size of third array is 2n. get
the values of two array from the user and show all the values of array1 and array2 in array3.
Solution:
#include<iostream.h>
#include<conio.h>
void main()
{
int a[3],b[3],c[6],i;
clrscr();
cout<<"ENTER ELEMENTS OF ARRAY 1 n";
for(i=0;i<=2;i++)
{
cout<<"enter"<<i<<"element:";
cin>>a[i];
//cin>>c[i];
}
cout<<"ENTER ELEMENTS OF ARRAY 2 n";
for(i=0;i<=2;i++)