VLIW ARCHITECTURE

                                   VLIW ARCHITECTURE

• Very long instruction word (VLIW) architecture is another architecture used for P-DSP's (Example:TMS320C6X).
• The VLIW processor consists of architecture that reads a relatively large group of instructions and executes them at the same time.
• These P-DSP's have a number of processing units (data paths).
• In other words, they have a number of ALU's, MAC units, shifters etc.
• The VLIW is accessed from memory and is used to specify the operands and operations to be performed by each of the data paths.
• The VLIW processing increases the number of instructions that are processed per cycle. The multiple functional units share a common multi-ported register file for fetching the operands and storing the results.
• The read/write cross bar provides parallel random access by multiple functional units to the multi-ported  register file.
• Execution of the operations in the functional units is carried out concurrently with the load/store operation of data between a RAM and the register file.
• The performance gains that can be achieved with VLIW architecture depends on the degree of parallelism in the algorithm selected for a DSP application and the number of functional units.
• The through put will be higher only if the algorithm involves execution of independent operations
• For example by using eight functional units, the time required for convolution can be reduced by a factor of 8 compared to the case where a single functional unit is used.
• However, it may not always be possible to have independent stream of data for processing.
• Further the number of functional units is also limited by the hardware cost for the multi-ported register file and cross bar switch.

FPGA Design Flow

 

DSP IMPORTANT QUESTIONS

                                               UNIT-1

• 1..Define periodic signal and illustrate problems ?
• 2   Find the step response of a discrete-time LTI system whose difference equation is given by

              y(n)=y(n-1)+0.5y(n-2)+x(n)+x(n-1)

• 3.    Define and explain the following systems with an example: (i) Causual and non-causual   (ii) Time-invarient and time-varient
• 4.    Find the magnitude and phase response of the LTI system with

   h(n)=x(n)-x(n-1)

• 5.    Determine the causality and stability  of the following systems with impulse response (i). h(n)=3ⁿu(-n)   (ii). E²ⁿu(n-1)
• 6.    Define and explain the following discrete-time signals with necessary mathematical expressions :(i) periodic and aperiodic    (ii) Energy and power
• 7.    State and prove the frequency shifting property of DTFT.
• 8. Explain the digital signal processing &block diagram and classify  their signals?
• 9.   Discuss the frequency domain representation of linear time-in variant systems?
• 10.Determine the all systems with illustrate problems ?

                         

                                               UNIT-2

• 11Find the DFT of the following sequence using DIF FFT  x(n)={1,2,3,5,5,3,2,1}
• 12.  Find the inverse FFT of x[k]=[10,-2+j2,4,-2-2j]
• 13.Compute the DFTS of the sequence x(n)=2^-n where N=8 using DIT algorithm ?
• 14.  State and prove any four properties of  discrete fourier series (DFS) ?
• 15. Explain the significance of FFT algorithms. Draw the basic butterfly diagram for radix-2 DIT FFT ?
• 16. Find the linear convolution of the sequence x(n)={1,4,0,9,5} and h(n)={-3,-4,5,6,8} and related problems
• 17.State and prove the convolution properties of DFT ?
• 18.  How FFT algorithm improves the speed of computation? Explain with an example ?
• 19. Find the 4-point DFT of the sequence x(n)={2,1,3,4} by using DIF FFT algorithm ? also, plot its magnitude and phase spectra ?
• 20. Explain the procedure to compute 8-point DFT using DIT FFT algorithm ?
• 21. Distinguish between linear convolution and circular convolution ?
• 22. Develop a radix-2  DIT FFT algorithm for evaluating 4-point DFT . also draw its flow diagram ?

 

                                         UNIT-3

• 23. Explain Transposed Forms ?
• 24.Obtain the direct form I and direct form II and cascade form realization of the following system functions
•     y(n)=0.1y(n-1)+0.2y(n-2)+3x(n)+3.6x(n-1)+0.6x(n-2)  model problems ?

• 25.Obtain the parallel form realization for the IIR system described by the transfer function

   H(z)=3+3.6z^-1+0.6z^-3/1+0.1z^-1-0.2z^-2

• 26. Realize H(z)=1+0.6z^-2+0.2z^-1/3+5z^-1+4z^-2 using Direct form I and Direct form II structures
• 27. Compare Chebyshev filter and Butterworth filter
• 28.Obtain the cascade form realization for the recursive IIR system described by the transfer function H(z)=3+3.6z^-1+0.6z^-2/1+0.1z^-1-0.2z^-2
• 29.Explain the analog filter to Digital filter?
• 30.  Obtain the 4^th order transfer function of normalized Butterworth low pass filter ?
• 31.List out the requriements for conversion of stable analog filter into stable digital response ?
• 32. Find H(z),for a 3^rd order Butterworth filter using impulse invariant transformation method . Assume T=1 sec .

                                           UNIT-4

• 33.  Explain FIR filter design using windowing method
• 34.  Comparision of IIR & FIR filters ?
• 35.  Explain the need for the use of  window sequence in the design FIR filter. Describe the window sequence generally used and comparable properties ?
• 36.Write the characteristics of FIR Digital filters ?
• 37.Explain about  the basic structure of FIR system ?

• 38.Design of FIR Digital filters using window technique and frequency sampling  tech wave?

                                            UNIT-5

• 39.Explain different pipeline programming models that are adapted in DSP processor ?
• 40.Explain the cortex-M3 and cortex-M4 processors architecture and draw their block diagram ?
• 41. Explain memory access schemes in DSPs ?
• 42. Explain the memory interface block diagram for the TMS320C5X processor ?
• 43.What are the various addressing modes used in the TMS320C5X processor ?
• 44.  With examples explain the different addressing formats supported by DSP processor for various signal processing applications ?
• 45.Explain the following i) on-chip peripherals   ii)VLIW architecture    iii) special addressing modes
•  

IMPORTANT QUESTIONS

 

         VLSI  IMPORTANT QUESTIONS

                              UNIT - 1

1. 1)  Derive the relationship between drain and source current Ids versus drain to source voltage Vds in a non-saturation and saturation region?

• 2)   What are the involved in the given fabrication process? Explain with neat sketch  i)nmos  ii)pmos  iii)cmos
• 3)   Compare Bicmos technology with other technologies?
• 4)   Design a stick diagram for  i)nmos logic Y=(A+B+C)whole bar   ii)for cmos logic Y=(A+B+C)whole bar?
• 5)   Explain with suitable examples how to design the layout of a epte to maximum performance and minimize area?
• 6)   Compare the relative merits of three different forms of pull-up for an inverter circuit? What is the best choice  for  realization in nmos and cmos technology?
• 7)   Explain the concept of VLSI design flow and flowchart of VLSIdesign flows & write the domain of VLSI  design flow and Y chart of design flow?
• 8)   What is a stick diagram? Draw the stick diagram and layout for cmos inverter?
• 9)   Derive an expression for transconductance of an n-channel enhancement MOSFET  operating in active region ?
• 10)  Explain about 2micrometer CMOS design rules and discuss with layout examples ?

      

                           UNIT -2

• 11) What is meant by sheet resistance (Rs) ? Explain the concept of Rs applied to the  mos Transistors ?
• 12) What is  inverter delay? How delay is calculated for multiple stages ? Explain ?
• 13)Calculate on resistance of an inverter from Vdd to GND?( Illustrate Problems)
• 14)Explain the issues involved in driving large capacitor loads in VLSI circuit regions ?
• 15)Explain the scaling models & factors for device parameters?
• 16) Explain the limits on logic levels and supply voltage due to noise and current density ?
• 17) Explain the driving large capacitive loads & propagation delays and  of layers ?
• 18)Design a 2-input Ex-OR using CMOS Transmission gate ?
• 19) Discuss about choice of fan-in and fan-out selection in gate level design ?

 

                                 UNIT – 3

• 20)  Explain about regions of operations of MOSFET & modelling of transistor ?
• 21)Explain how MOSFET  acts as a current sources & current sintcs ?
• 22) Explain the operation of common source MOSFET amplifier  with  diode connected load & resistive load ?
• 23) With a neat sketch explain the operation of CS stage  with current source load . Also derive its voltage gain ?
• 24)With a neat sketch describes the operation of common gate amplifier. Also derive its voltage gain ?
• 25) Describe the operation of source follow (common drain). What are the merits and demerits ?
• 26)  What is current mirror ? Explain the general properties of current mirror with block diagram ?
• 27) Explain the operation of single stage amplifier with resistive load ?

 

                              UNIT – 4

• 28) Explain  the concept of complementary cmos gates have static properties ?
• 29) Explain Master-Slove Edge-Triggered register & bistability principle?
• 30) Explain the operation of an SR lacth using NAND gates. Implement it with cmos design ?
• 31)What are the problems occurred in ultra deep submicron(USDM) technology at analog circuit design ? Hoe they overcome ?
• 32) Explain the issuses in dynamic design & cascading  dynamic gates ?
• 33)Write short notes on the issues of capacitive coupling in dynamic design?
• 34) Implement the register of question 8 using cmos logic & explain how 0-0 and 1-1 overlap of clock signal are eliminated ?
• 35) Explain about dynamic power consumption for cmos gate &dissipation due to direct path currents ?
• 36)  Write a short note on i)Ratioed circuits  ii)Dynamic circuits

• 37) Describe pass transistor briefly with examples ?
• 38) Explain the following  i)Static power dissipation  ii) Dynamic power dissipation ?

 

                                     UNIT – 5

• 39)  Explain the FPGA design flow & FPGA architecture ?
• 40)  Explain the FPGA technologies & introduction FPGA families ?
• 41)  Explain the giga scale dilemma ?
• 42 )Explain about short channel effects ?
• 43) Explain (or) Write a short note on a FINFET & TFET ?
• 44)Explain the high -K/ Metal technology ?
• 45) What are FPGAs? Explain the principle and operation/
• 46) List out the important features of Altera Flex 8000FPGA ?                 

 

 

 

Benefits Of IEEE

IEEE  stands  for Institute of Electrical  and Electronics  Engineers

                       Benefits of IEEE Membership 

 Core Benefits :- 

                   IEEE is the world's largest technical society, bringing Members access to the industry's most essential technical Information, networking opportunities, career development tools, and many other exclusive benefits.

Knowledge - Staying current with the fast-changing world of technology...

 • IEEE Spectrum Magazine - 12 monthly issues (print) and online 

• The Institute Newsletter - 12 monthly issues (4 print, 8 online)

 • IEEE Potentials Magazine - 6 issues (online)

 • IEEE Xplore - table-of-content and abstract access to 1.2-million documents 

• What's New @ IEEE - produced monthly, electronic newsletters on technical topics (10 topics to choose from)

Community - Belong to the network and buying power of 365,000 members in 150 countries...

• IEEE Sections - network with others in the local member community, and participate in local educational events 

• Technical Chapters - engage with others through informative technical meetings

 • IEEE e-mail alias - with virus protection and spam filtering 

• ShopIEEE discounts - membership paying for itself, with as much as 50% off IEEE products IEEE Conference registration discounts 

• Volunteering - opportunities that build leadership skills and networking opportunities 

• myIEEE - members-only personalized gateway into IEEE membership 

Profession - Empowering members to build and own their careers, and venues to give back to society...  

IEEE Job Site - locate career opportunities easily and confidentially 

• Career Alert - a weekly email newsletter containing career advice plus the job of the week from the IEEE Job Site

 • Continuing Education Partners Program - up to a 10% discount on online degree programs

 • Awards - recognize the accomplishments of technologists and engineers worldwide 

• Scholarships - enhance your resume with an IEEE scholarship 

• Consultants Database - a service available for matching technical consultants with clients 

• Today's Engineer - monthly webzine devoted to the issues affecting IEEE members' careers

Add-On Benefits

 IEEE Member Digital Library - access up to 25 articles a month from any IEEE publication or conference proceeding 

• Proceedings of the IEEE - leading authoritative resource for in-depth research coverage, tutorial information and reviews 

• Insurance Services - customized selection of insurance products, designed for the professional engineer 

• Financial Services - receive discounts on financial services from our partnering companies 

• Home & Office Services - substantial discounts on products and services for your home and office 

• Travel Services - enhancing the overall travel experience for IEEE members and their families 

Additional Memberships

• IEEE Society Membership - expands the scope and depth of your technical knowledge, expanded networks 

• IEEE Standards Membership - influence the direction and application of standards development

 • IEEE Women in Engineering Membership - promotes the entry into and retention of women in engineering programs 

Responding to Objections

My company will not pay for my dues:

We're grateful that some employers reimburse for IEEE membership dues, but IEEE membership is about individuals who desire to take ownership of their career, regardless of an employer's willingness to reimburse dues. Individuals who belong to IEEE take personal responsibility for their careers.  

IEEE membership is too expensive:

The cost of IEEE membership compared to most professional associations is significantly lower, as much as 30%, compared to organizations such as the National Society of Professional Engineers, American Medical Association, and the American Bar Association. When you really think about it, IEEE membership dues are quite reasonable when you consider the quantity and quality of benefits offered to members. Also, IEEE membership often pays for itself. The discounts members receive on IEEE products or attending a conference makes membership a good return-on-investment. 

The value of IEEE membership does not justify the cost:

IEEE membership offers an array of benefits that may be of interest to you. Perhaps you are unaware of the some of these benefits. They include Access to technical publications; Professional and educational development; Unique networking venues; Discounts on conference attendance, insurance programs, IEEE products. And every member has their own, personalized gateway into IEEE membership via myIEEE. 

I have no time to read the publications:

It's a constant challenge between finding the time to be informed, and one day discovering that you're not technically current. Our members tell us that reading IEEE publications saves them time, as they do not need to "reinvent-the-wheel" at work. IEEE publications are the world's best collection of technical information. Taking the time to read this information keeps you technically current. Investing 30 minutes with one publication could save you 40 hours of research at work. I can find all this information on Google-what's the value of membership? 

There's a lot of information to be found on Google, but IEEE publications are not available for free on Google. Moreover, the quality of technical information found via Google is random, and doesn't adhere to any consistent standards of technical excellence. Did you know that 60,000 patents cite IEEE information? - These patents cite IEEE, not Google. IEEE membership is much more than access to information. It's about networking, professional development, and you taking personal responsibility for your career. Membership is about meeting new colleagues, and coming into contact with really great people-individuals who join IEEE form friendships that last a lifetime. You wouldn't meet these people on Google.  

I can get all of the information through my employer, so why should I belong? 

Yes, organizations worldwide rely upon IEEE information to be technically current and competitive-it speaks to IEEE's quality. IEEE membership is more than access to information. IEEE membership is about you being competitive and taking personal responsibility for your career. IEEE's benefits include venues and tools for members to network, build valuable professional connections, and hone leadership skills. These are essential for managing your career. Membership is about meeting new colleagues, and coming into contact with really great peopleindividuals who join IEEE form friendships that last a lifetime. IEEE membership is more than what you receive-it's also about what you're giving back. When you belong to IEEE, you are supporting a much larger mission-your membership enables initiatives such as public information and policy efforts, affordable student membership, and the introduction of technology careers to young people worldwide. 

I've recently been unemployed, and can no longer afford the dues:

IEEE will help you during these times. IEEE has a reduced-dues program for unemployed members, which allows you to keep your benefits, which are very helpful for finding a new job-for example, networking at local Section and Chapter meetings, uploading your resume to the IEEE Job Site, engaging the career navigator.  

C PROGRAMS-1

 1.   Program which separates odd and even integers in separate arrays

       #include<stdio.h>

void main()

 {

   int a[10],e[10],o[10];

   int i,even=0,odd=0;

   clrscr();

   printf("Initialize the array\n");

   for(i=0;i<10;i++)

    {

      printf("Enter an integer ");

      scanf("%d",&a[i]);

      if(a[i]%2==0)

       e[even++]=a[i];

      else

       o[odd++]=a[i];

    }

   printf("\nOdd integers in the array\n");

   for(i=0;i<odd;i++)

    printf("%d ",o[i]);

   printf("\nEven integers in the array\n");

   for(i=0;i<even;i++)

    printf("%d ",e[i]);

   getch();

 }

2. Program which sort elements of array in ascending order

      #include<stdio.h>

void main()

 {

   int i,j,t,arr[8];

   clrscr();

   printf("Sorting array elements in ascending order\n\n");

   printf("Initialize the array\n\n");

   for(i=0;i<8;i++)

    {

      printf("Enter an integer ");

      scanf("%d",&arr[i]);

    }

   printf("\nArray before Sorting\n\n");

   for(i=0;i<8;i++)

    printf("%d ",arr[i]);

   for(i=0;i<8-1;i++)

    for(j=0;j<8-1-i;j++)

     {

       if(arr[j]>arr[j+1])

{

t=arr[j];

    arr[j]=arr[j+1];

  arr[j+1]=t;

}

      }

   printf("\n\nArray after Sorting\n\n");

   for(i=0;i<8;i++)

    printf("%d ",arr[i]);

   getch();

 }

3. Program which multiplies two square matrices

     #include<stdio.h>

void main()

 {

   int i,j,k,a[2][2],b[2][2],c[2][2]={0};

   clrscr();

   printf("Matrix multiplication\n");

   printf("\nInitialize first matrix\n\n");

   for(i=0;i<2;i++)

    for(j=0;j<2;j++)

     {

       printf("Enter an integer ");

       scanf("%d",&a[i][j]);

     }

   printf("\nInitialize second matrix\n\n");

   for(i=0;i<2;i++)

    for(j=0;j<2;j++)

     {

       printf("Enter an integer ");

       scanf("%d",&b[i][j]);

     }

   for(i=0;i<2;i++)

    for(j=0;j<2;j++)

     for(k=0;k<2;k++)

      c[i][j]=c[i][j]+a[i][k]*b[k][j];

   printf("\nFirst matrix\n\n");

   for(i=0;i<2;i++)

    {

     for(j=0;j<2;j++)

      printf("%d ",a[i][j]);

     printf("\n\n");

    }

   printf("\nSecond matrix\n\n");

   for(i=0;i<2;i++)

    {

     for(j=0;j<2;j++)

      printf("%d ",b[i][j]);

     printf("\n\n");

    }

   printf("\nProduct matrix\n\n");

   for(i=0;i<2;i++)

    {

     for(j=0;j<2;j++)

      printf("%d ",c[i][j]);

     printf("\n\n");

    }

   getch();

 }

4.  Program which displays transpose of a matrix

     #include<stdio.h>

void main()

 {

   int a[3][2],t[2][3],i,j;

   clrscr();

   printf("Initialize the matrix\n");

   for(i=0;i<3;i++)

    for(j=0;j<2;j++)

     {

       printf("Enter an integer ");

       scanf("%d",&a[i][j]);

       t[j][i]=a[i][j];

     }

   printf("\nMatrix is\n\n");

   for(i=0;i<3;i++)

    {

      for(j=0;j<2;j++)

       printf("%d ",a[i][j]);

      printf("\n\n");

    }

   printf("\nTranspose Matrix is\n\n");

   for(i=0;i<2;i++)

    {

      for(j=0;j<3;j++)

       printf("%d ",t[i][j]);

      printf("\n\n");

    }

   getch();

 }

5.   Program which searchs an element in a row & column wise

       #include <stdio.h>

int search(int mat[4][4],int n,int x)

 {

   int smallest=mat[0][0],largest=mat[n - 1][n - 1];

   int i=0,j=n - 1;

   if(n==0)

     return -1;

   if(x<smallest || x>largest)

     return -1;

   while(i<n && j>=0)

    {

      if(x==mat[i][j])

       {

printf("\n Found at %d, %d", i+1, j+1);

return 1;

       }

      if(x<mat[i][j])

j--;

      else

i++;

    }

   printf("\n Element not found");

   return 0;

 }

void main()

 {

   int mat[4][4] = {

{ 10, 20, 30, 40 },

{ 15, 25, 35, 45 },

{ 27, 29, 37, 48 },

{ 32, 33, 39, 50 },

    };

   clrscr();

   search(mat, 4, 29);

   getch();

}

6. Program which prints individual characters of string in reverse order

#include<stdio.h>

void main()

 {

   char ch,str[25];

   int i=0;

   clrscr();

   printf("Enter a string ");

   while( (ch=getchar())!='\n' )

    {

      str[i]=ch;

      i++;

    }

   i--;

   printf("\nString in reverse order is\n\n");

   for(;i>=0;i--)

    putchar(str[i]);

   getch();

 }

7. Program which compare two strings without using string library functions

#include<stdio.h>

void maissn()

 {

   char ch,str1[25],str2[25];

   int i=0,len1,len2;

   clrscr();

   printf("Enter first string ");

   gets(str1);

   for(i=0;str1[i]!='\0';i++);

   len1=i;

   printf("Enter second string ");

   gets(str2);

   for(i=0;str2[i]!='\0';i++);

   len2=i;

   if(len1==len2)

    {

      for(i=0;i<len1;i++)

       {

if(str1[i]!=str2[i])

  break;

       }

      if(i==len1)

       printf("Strings are equal");

      else

       printf("Strings are not equal");

    }

   else

    printf("Strings are not equal");

   getch();

 }

8. Program which copies one string to another string

     #include<stdio.h>

void main()

 {

   char str1[25],str2[25];

   int i;

   clrscr();

   printf("Enter a string ");

   gets(str1);

   for(i=0;str1[i]!='\0';i++)

    str2[i]=str1[i];

   str2[i]='\0';

   printf("\After string copying contents of str2 ");

   puts(str2);

   getch();

 }

9. Program to store info using structures with dynamically memory allocation

     #include<stdio.h>

#include<stdlib.h>

typedef struct

 {

   char id[11];

   char name[11];

   int maths,physics,chemistry;

 }STUDENT;

void main()

 {

   STUDENT* stud;

   int i,n;

   clrscr();

   printf("How many students info? ");

   scanf("%d",&n);

   stud=calloc(n,sizeof(STUDENT));

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

    {

      fflush(stdin);

      printf("\nEnter student %d information\n",i+1);

      printf("\nStudent Id ");

      gets(stud[i].id);

      printf("\nStudent Name ");

      gets(stud[i].name);

      printf("\nMarks in Maths ");

      scanf("%d",&stud[i].maths);

      printf("\nMarks in Physics ");

      scanf("%d",&stud[i].physics);

      printf("\nMarks in Chemistry ");

      scanf("%d",&stud[i].chemistry);

    }

   printf("\n\nStudents Details\n\n");

   printf("\nId         Name\t\tMaths\tPhysics\tChemistry\n\n");

   for(i=0;i<n;i++,stud++)

    {

       printf("%s %-10s\t%d\t%d\t%d\n\n",stud->id,stud->name,stud->maths,stud->physics,stud->chemistry);

    }

   free(stud);

   getch();

 }

10. Program which demonstrates pointers handling

      #include<stdio.h>

void main()

 {

   int i,arr[5]={3,-4,5,7,-8};

   int* ptr;

   clrscr();

   ptr=arr;

   printf("Accessing elements using pointer name as array name\n\n");

   for(i=0;i<5;i++)

     printf("ptr[%d] = %d\n",i,ptr[i]);

   printf("\n\nAccessing elements using indirection operator with pointer\n\n");

   for(i=0;i<5;i++)

     printf("*(ptr+%d) = %d\n",i,*(ptr+i));

   getch();

 }

11. Program which demonstrate the use of & (address of)  and * (value at address) operators

#include<stdio.h>

void main()

 {

   int a=10;

   int* p;

   clrscr();

   p=&a;

   printf("\nAddress of a i.e: &a = %u\n",&a);

   printf("\nAddress of p i.e: &p = %u\n",&p);

   printf("\nAddress stored in p i.e: p = %u\n",p);

   printf("\nValue of a i.e: a = %d\n",a);

   printf("\nValue at address p i.e: *p = %d\n",*p);

   getch();

 }

12. Program which adds two numbers using pointers

#include<stdio.h>

void main()

 {

   int a,b,sum;

   int *pa,*pb;

   clrscr();

   printf("Enter two integers ");

   scanf("%d %d",&a,&b);

   pa=&a;

   pb=&b;

   sum=*pa+*pb;

   printf("Sum is %d",sum);

   getch();

 }

13. Program which adds numbers using call by reference

#include<stdio.h>

int add(int*,int*); //function declaration

void main()

 {

   int a,b,sum;

   clrscr();

   printf("Enter two integers ");

   scanf("%d %d",&a,&b);

   sum=add(&a,&b); //function call by reference

   printf("Sum is %d",sum);

   getch();

 }

int add(int* p,int* q)  //function definition

 {

   return(*p+*q);

 }

14. Program which finds largest element using Dynamic Memory Allocation

#include<stdio.h>

#include<stdlib.h>

void main()

 {

   int *arr;

   int n,i,large;

   clrscr();

   printf("Enter the size of the list ");

   scanf("%d",&n);

   arr=malloc(n*sizeof(int));

   printf("\nInitialize the list\n\n");

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

    {

      printf("Enter an integer ");

      scanf("%d",&arr[i]);

    }

   large=arr[0];

   for(i=1;i<n;i++)

    if(arr[i]>large)

      large=arr[i];

   printf("\nLargest among the list is %d",large);

   free(arr);

   getch();

 }