Posts

Machine Learning Course

                      Machine Learning Course Because of new computing technologies, machine learning today is not like machine learning of the past. It was born from pattern recognition and the theory that computers can learn without being programmed to perform specific tasks; researchers interested in artificial intelligence wanted to see if computers could learn from data. The iterative aspect of machine learning is important because as models are exposed to new data, they are able to independently adapt. They learn from previous computations to produce reliable, repeatable decisions and results. It’s a science that’s not new – but one that has gained fresh momentum. While many machine learning algorithms have been around for a long time, the ability to automatically apply complex mathematical calculations to big data – over and over, faster and faster – is a recent development. Here are a few widely publicized examples of machine learning applications you may be familiar with: The
Post a Comment
Read more

Data Structures and Algorithms

              Data Structures and Algorithms Array, Linked List, Stack, Queues, Searching, Sorting, Tree, Graph… Hi Friends, Do you have questions that why should I study all the above-complicated stuff if it has absolutely no use in real life?? Why companies ask questions related to data structures and algorithms if it’s not useful in a daily job?? A lot of beginners and experienced programmers avoid learning  Data Structures and Algorithms  because it’s complicated and they think that there is no use of all the above stuff in real life. So before we discuss the topic we are going to throw a simple problem at you and you need to find the solution for that. Here Is the Link for Data Structures and Algorithms Material - Click Here Data structures and algorithms play a major role in implementing software and in the hiring process as well. A lot of students and professionals have this question that why these companies’ interviews are focused on DSA instead of language/frameworks/tools spe
Post a Comment
Read more

WIPRO TECHNICAL PAPER

              WIPRO TECHNICAL PAPER Program 1: Sub Topic: Arrays Sliding Window Given an array of numbers and a window of size k. Print the maximum of numbers inside the window for each step as the window moves from the beginning of the array. Input Format Input contains the array size , no of elements and the window size Output Format print the maximum of numbers Constraints 1 <= size <= 1000                     Sample Input 1 8 1 3 5 2 1 8 6 9 3 Sample Output 1 5 5 5 8 8 9 Solution: #include<stdio.h> #include<limits.h> int main() {    int size , arr[1000],ws,ctr,max = INT_MIN,ctr1;    scanf("%d",&size);    for( ctr = 0 ; ctr< size ; ctr++)       scanf("%d ",&arr[ctr]);   scanf("%d",&ws);   for( ctr = 0 ; ctr<= size - ws ; ctr++)      {           for( ctr1 = 0 ; ctr1 < ws ; ctr1++)           {                if( max < arr[ctr+ctr1])                  
Post a Comment
Read more