Mtech First Year Content

Hi , Guys this is Hem Chandra Joshi . I had opted M Tech AI in 2018 . In this page you will get subject wise book details , previous year questions papers ( minor , majors ) .

Actually M Tech AI guys can opted one elective in first semester . I had taken Neural Network .  We have 5 Subjects and 2 Labs .

I start with Algorithm .

Subject 1. Algorithm

Book to Follow
Follow Cormen (It is best ones ) , Horowitz .

Previous year question
(Oops, I don't have of it . They will ask algorithms and its implementation )


Subject 2.PSM  ( Problem Solving Method )
It is very important subject for future purpose .Please read it carefully .  Dr Atul Negi taught us .

Book to Follow

1. Artificial Intelligence: A Modern Approach

( Russell and Norvig , 3rd Edition )

2 . A First Course in Artificial Intelligence

 ( Deepak Khemani ,IIT Madras )

Both are available in UOH Library .

For PSM Course material and Previous Year Paper visit 

Click Below For Notes and previous year questions papers of PSM

https://hemchandralive.blogspot.com/2018/12/problem-solving-method-psm-notes-and.html



Subject 3. KRR (Knowledge Representation and Reasoning )

You will learn prolog here . Carefully read it . I gave supply here ;) ( Not because what are  you thinking but I had an interview in IIT Hyderabad on exam day that's why )

PDF Provided by Below link is sufficient to Clear the exam .
Notes and previous year questions papers

https://hemchandralive.blogspot.com/2019/01/krr-notes-with-previous-year-question.html 

Book to Follow

1. Artificial Intelligence: A Modern Approach

( Russell and Norvig , 3rd Edition )
Check chapter 6,7 I guess .


Subject 4:  NN (Neural Network)

I found quite interesting when I started reading it ,else lot boring . Dr. Bappi Raju sir taught us ( he is one of best faculty in UOH ) .

Course material , previous year question papers all available on below link .

https://drive.google.com/open?id=1ydxpD7ec52p84qEc9Q7kXZnNQGhe5vhU
Btw sir notes are sufficient , for reading 

Book to follow
1. (Deep Learning )Ian Goodfellow
2. Simon Hayking

Subject 5 :AOS(Advance Operating System)

Start with galvin , end with crowley  :) .
Crowley link is available here .

https://drive.google.com/open?id=15QvA2ijE40ivcfms2YoOmF2L9olF94mk


---------
Now Lab time

We had two labs DSP(Data Structure and Programming Lab ) and IT lab (Information Technology ).

IT lab has weightage  of  AOS and Algorithms .

I have collected DSP Problem Statements below .
https://hemchandralive.blogspot.com/2018/10/dst-lab-all-questions-with-solutions.html

Guys if you like this information go to mine youtube channel and subscribe it .
It contains UOH Campus Events .

Follow me on Facebook

https://www.facebook.com/hemchandralive/ 

Problem Solving Method (PSM) Notes and previous year question papers

Hey , Get the previous year solved questions and psm notes

PSM Notes :
https://drive.google.com/file/d/1CpqKqPlhy7OGOCustTeMefRmOaWSAtyB/view?usp=sharing

Recommended Books

Russell And Norvig (3rd Edition )

Previous Year Papers

https://drive.google.com/open?id=1xerk0jfvnigEvfz3BeQV7y1bppzgNbxU

If you are facing any problem or you want to send us content
plz write to hemjoshi745@gmail.com

Download File without using the torrent | Direct Download

 

Can you download Movies without torrent or VPN ?

Yes it is possible . By using the google special keywords you can directly download the files ( movies , doc etc ) .

This method generally work on all files except new content .

Let you want to download edward scissorhands movie .

Step 1 : Go to google.com

Step 2: Use keyword index of (Put space between index and of)

index of edward scissorhands (Hit google search button)

Step 3: Go to links available and direct click on links and download will start .
(If first link is not working , try another link ) .

Guide , How to access classroom program and submission of Assignment | Mtech 2018

Hi , Just go to below link

https://classroom.google.com/

Login with your google account .
Note : You need gmail account to access classroom services .

 After successfully log in you will get below screen .

Click on + icon , on right .

Go to option join course .
Put below course id .

course id is : avofmiw


Now successfully , you will access the course .
Updates will available on this site .

Assignment File
https://drive.google.com/open?id=1vTx0xDKACUklh6PECgad_yRIWWddQ3bc

Guidelines to Submit the assignments:

1. Create a folder for each problem you solve and put the following in the folder:
(a) All the programs related to the problem
(b) README file which contains information on how to compile and run the program.

2. Create pdf file containing the following:
(a) Details of each problem, problem statement and a brief description on how you solved it
(b) Proof of submission to CodeChef

3. Create a directory with your roll number and put all the folders you created in step 1. and put the pdf you created in step 2.

4. Create a tar.gz file, name the compressed file with your roll number.

5. Submit the compressed file in google classroom.

Checking OF Palindrome Enter Using Stack And Queue (Linked List)

Here in this program we are checking , whether we have enter Palindrome or not .
We are using stack and queue .

Algorithm :

1. Enter the each element and store it in linkedlist.
2. After Entering the element we are passing the linkedlist to stack and queue .

At each iteration we

 We are popping element deqeuing the element from linkedlist .

For even length number we are doing till linkedlist is not empty.
For odd length number we are doing till one element is not remain .

#include<stdio.h>
#include<stdlib.h>

void performoperation();
int stackdelete();
int queuedelete();

int count=0;

struct node
{
  struct node *next;
  int num;
};
struct node *head=NULL;

void create();

int main()
{
int choice;

while(1)
{
  printf("For termination type 1 :: Else Other ");
  scanf("%d",&choice);
  if(choice==1)
  break;
  create();
}
performoperation();


return 1;
}


void create()
{
  struct node *temp,*trav;

  count++;

  temp=(struct node*)malloc(sizeof(struct node));
  temp->next=NULL;

  printf("Enter the item ");
  scanf("%d",&temp->num);

  if(head==NULL)
  head=temp;
  else
  {
    trav=head;
    while(trav->next!=NULL)
    {
      trav=trav->next;
    }
    trav->next=temp;
  }
  printf("\n");
}

int stackdelete()
{
  struct node *temp,*pre;
  temp=head;
  count--;
  while(temp->next!=NULL)
  {
    pre=temp;
    temp=temp->next;
  }
   pre->next=NULL;
   return (temp->num);

}

int queuedelete()
{
  struct node *temp,*pre;
    count--;
    temp=head;
    head=head->next;
   return (temp->num);

}


void performoperation()
{
struct node *trav;
trav=head;

int flag=0;

printf("Palindrome Length %d \n", count);

if(head==NULL)
printf("Nothing Enter");
else if(head->next==NULL)
printf("Palindrom Enter \n");
else
{
if(count%2==1)
{
  while(count!=1)
  {
  if(stackdelete()!=queuedelete())
  {
    flag=1;
    break;
  }
  }
}
else
{
while(count!=0)
{
if(stackdelete()!=queuedelete())
{
  flag=1;
  break;
}
}
}

if(flag==1)
printf("Not a Palindrome \n");
else
printf("Palindrome Enter \n");
}
}
 

Short Overview About Library Use In Neural Network

Context

Python is frequently used for high-performance scientific applications. It is widely used in academia and scientific projects because it is easy to write and performs well.
Due to its high performance nature, scientific computing in Python often utilizes external libraries, typically written in faster languages (like C, or FORTRAN for matrix operations). The main libraries used are NumPy, SciPyand Matplotlib. A comprehensive introduction to the scientific Python ecosystem can be found in the Python Scientific Lecture Notes

Tools

IPython

IPython is an enhanced version of Python interpreter, which provides features of great interest to scientists. The inline modeallows graphics and plots to be displayed in the terminal (Qt based version). Moreover, the notebook mode supports literate programming and reproducible science generating a web-based Python notebook. This notebook allows you to store chunks of Python code along side the results and additional comments (HTML, LaTeX, Markdown). The notebook can then be shared and exported in various file formats.

Libraries

NumPy

NumPy is a low level library written in C (and FORTRAN) for high level mathematical functions. NumPy cleverly overcomes the problem of running slower algorithms on Python by using multidimensional arrays and functions that operate on arrays. Any algorithm can then be expressed as a function on arrays, allowing the algorithms to be run quickly.
NumPy is part of the SciPy project, and is released as a separate library so people who only need the basic requirements can use it without installing the rest of SciPy.
NumPy is compatible with Python versions 2.4 through to 2.7.2 and 3.1+.

Numba

Numba is a NumPy aware Python compiler (just-in-time (JIT) specializing compiler) which compiles annotated Python (and NumPy) code to LLVM (Low Level Virtual Machine) through special decorators. Briefly, Numba uses a system that compiles Python code with LLVM to code which can be natively executed at runtime.

SciPy

SciPy is a library that uses NumPy for more mathematical functions. SciPy uses NumPy arrays as the basic data structure, and comes with modules for various commonly used tasks in scientific programming, including linear algebra, integration (calculus), ordinary differential equation solving and signal processing.

Matplotlib

Matplotlib is a flexible plotting library for creating interactive 2D and 3D plots that can also be saved as manuscript-quality figures. The API in many ways reflects that of MATLAB, easing transition of MATLAB users to Python. Many examples, along with the source code to re-create them, are available in the matplotlib gallery.

Pandas

Pandas is data manipulation library based on Numpy which provides many useful functions for accessing, indexing, merging and grouping data easily. The main data structure (DataFrame) is close to what could be found in the R statistical package; that is, heterogeneous data tables with name indexing, time series operations and auto-alignment of data.

Rpy2

Rpy2 is a Python binding for the R statistical package allowing the execution of R functions from Python and passing data back and forth between the two environments. Rpy2 is the object oriented implementation of the Rpybindings.

PsychoPy

PsychoPy is a library for cognitive scientists allowing the creation of cognitive psychology and neuroscience experiments. The library handles presentation of stimuli, scripting of experimental design and data collection.

Resources

Installation of scientific Python packages can be troublesome, as many of these packages are implemented as Python C extensions which need to be compiled. This section lists various so-called scientific Python distributions which provide precompiled and easy-to-install collections of scientific Python packages.

Unofficial Windows Binaries for Python Extension Packages

Many people who do scientific computing are on Windows, yet many of the scientific computing packages are notoriously difficult to build and install on this platform. Christoph Gohlkehowever, has compiled a list of Windows binaries for many useful Python packages. The list of packages has grown from a mainly scientific Python resource to a more general list. If you’re on Windows, you may want to check it out.

Anaconda

Continuum Analytics offers the Anaconda Python Distribution which includes all the common scientific Python packages as well as many packages related to data analytics and big data. Anaconda itself is free, and Continuum sells a number of proprietary add-ons. Free licenses for the add-ons are available for academics and researchers.

Canopy

Canopy is another scientific Python distribution, produced by Enthought. A limited ‘Canopy Express’ variant is available for free, but Enthought charges for the full distribution. Free licenses are available for academics

Converting A Number To String Format In C Language

Algorithm

1. It is taking input from keyboard .
2. According to size of number , passing to function
3. From their , it is calling recursive to other functions



#include<stdio.h>
void onedigit(int num);
void twodigit(int num);
void threedigit(int num);
void fourdigit(int num);
void fivedigit(int num);
int main()
{
    int number;
    int copy;
    int increment=0;
    printf("Enter a number \n");
    scanf("%d",&number);
    copy=number;
    while(copy!=0)
    {
        increment++;
        copy/=10;
    }

    if(increment<0||increment>999999)
    {
        printf("Please enter positive or less than six digit number");
    }

    else
    {

    if(increment==0)
    printf("zero enter");
    else if(increment==1)
     onedigit(number);
    else if(increment==2)
     twodigit(number);
    else if(increment==3)
    threedigit(number);
    else if(increment==4)
    fourdigit(number);
    else if(increment==5)
    fivedigit(number);
}
}


void onedigit(int number)
{
    switch(number)
    {
        case 1:
            printf("One");break;
            case 2:
                printf("Two");break;
                case 3:
                    printf("Three");break;
                    case 4:
                        printf("Four");break;
                        case 5:
                            printf("Five");break;
                            case 6:
                                printf("Six");break;
                                case 7:
                                    printf("Seven");break;
                                    case 8:
                                        printf("Eight");break;
                                        case 9:
                                            printf("Nine");break;
    }
}

void twodigit(int num)
{

    if(num>10 && num<20)
    {
        switch (num)
            {
                case 11:
                    printf("Eleven");break;
                    case 12:
                        printf("Twelve");break;
                        case 13:
                            printf("Thirteen");break;
                            case 14:
                                printf("Fourteen");break;
                                case 15:
                                    printf("Fifteen");break;
                                    case 16:
                                        printf("Sixteen");break;
                                        case 17:
                                            printf("Seventeen");break;
                                            case 18:
                                                printf("Eighteen");break;
                                                case 19:
                                                    printf("Ninteen");break;

            }
    }
    else
    {

        if(num>=90)
        {
            printf("Ninty ");
        }
        else if(num>=80)
        {
            printf("Eighty ");
        }
            else if(num>=70)
        {
            printf("Seventy ");
        }
            else if(num>=60)
        {
            printf("Sixty ");
        }
            else if(num>=50)
        {
            printf("Fifty ");
        }
            else if(num>=40)
        {
            printf("Fourty ");
        }
            else if(num>=30)
        {
            printf("Thirty ");
        }
            else if(num>=20)
        {
            printf("Twenty ");
        }
            else if (num>=10)
        {
            printf("Ten ");
        }
        onedigit(num%10);
    }
    }


    void threedigit(int num)
    {
        if(num>=900)
        {
            printf("Nine Hundred ");
        }
        else if(num>=800)
        {
            printf("Eight Hundred ");
        }
            else if(num>=700)
        {
            printf("Seven Hundred ");
        }
            else if(num>=600)
        {
            printf("Six Hundred ");
        }
            else if(num>=500)
        {
            printf("Five Hundred ");
        }
            else if(num>=400)
        {
            printf("Four Hundred ");
        }
            else if(num>=300)
        {
            printf("Three Hundred ");
        }
            else if(num>=200)
        {
            printf("Two Hundred ");
        }
            else if (num>=100)
        {
            printf("One Hundred ");
        }
        twodigit(num%100);
    }





void fourdigit(int num)
{

    if(num>=9000)
        {

            printf("Nine Thousand ");
        }
        else if(num>=8000)
        {
            printf("Eight Thousand ");
        }
            else if(num>=7000)
        {
            printf("Seven Thousand ");
        }
            else if(num>=6000)
        {
            printf("Six Thousand ");
        }
            else if(num>=5000)
        {
            printf("Five Thousand ");
        }
            else if(num>=4000)
        {
            printf("Four Thousand ");
        }
            else if(num>=3000)
        {
            printf("Three Thousand ");
        }
            else if(num>=2000)
        {
            printf("Two Thousand ");
        }
            else if (num>=1000)
        {
            printf("One Thousand ");
        }
        threedigit(num%1000);
    }


    void fivedigit(int num)
    {
        int flag=0;
        int copy;

        copy=num;

            if(num>=90000)
        {
            if(num==90000)
            printf("Ninty Thousand ");
            else
            printf("Ninty ");
        }
        else if(num>=80000)
        {
            if(num==80000)
            printf("Eighty Thousand ");
            else
            printf("Eighty ");
        }
            else if(num>=70000)
        {
            if(num==70000)
            printf("Seventy Thousand");
            else
            printf("Seventy ");
        }
            else if(num>=60000)
        {
            if(num==60000)
            printf(" Sixty Thousand");
            else
            printf("Sixty ");
        }
            else if(num>=50000)
        {

            if(num==50000)
            printf(" Fifty Thousand");
            else
            printf("Fifty ");
        }
            else if(num>=40000)
        {

            if(num==40000)
            printf(" Fourty Thousand ");
            else
            printf("Fourty ");
        }
            else if(num>=30000)
        {
            if(num==30000)
            printf("Thirty Thousand");
            else
            printf("Thirty ");
        }
            else if(num>=20000)
        {

            if(num==20000)
            printf(" Twenty Thousand");
            else
            printf("Twenty ");
        }
            else if (num>=10000)
        {

            if(num==10000)
            printf(" Ten Thousand");
            else
            {
                copy=num/1000;
                twodigit(copy);
                printf(" Thousand ");
                flag=1;
                threedigit(num%1000);
            }

        }
    if(flag==0)
        fourdigit(num%10000);
    }