Skip to main content

Posts

Showing posts from 2019

Latex Templates

Sample Draft Article in Word Format https://drive.google.com/open?id=1vGFoD1Eevr_YWqt1Wyh9xFDB6kG-Cg8y SPRINGER TEMPLATE FOR BOOK CHAPTER OR CONFERENCE OR JOURNAL https://www.springer.com/gp/ computer-science/lncs/ conference-proceedings- guidelines ACM TEMPLATE FOR CONFERENCE OR JOURNAL https://www.acm.org/publications/proceedings-template IEEE LATEX TEMPLATE LINK https://www.ieee.org/conferences/publishing/templates.html CV Template https://drive.google.com/open?id=1O01hgeMaxlGTseSGt7H5jLH4fA34iCKE ZIP link ;  https://drive.google.com/open?id=1mRn2K2T9Ucj1bs0V1-lFlUfuVtjmj4kh TEST DURATION : 25 Mins Test Question 1: Create Equation Text in any publication template.  Click here for equation Test Question 2: Create Equation Text in any publication template.   Click here for equation Test Question 3: Draw the flowchart and include in LaTeX : click here for flowchart Test Question 4:  Create a table and include in LaTeX: cl...

Quick Sort Program - C Source Code

#include<stdio.h> int partition(int a[25],int first,int last) { int i, j, pivot, temp; if(first<last) {   pivot=a[first];   i=first;   j=last;   while(i<j)   {      while(a[i]<=pivot&&i<last)     i++;      while(a[j]>pivot)     j--;      if(i<j)      {     temp=a[i];     a[i]=a[j];     a[j]=temp;      }   }   temp=a[first];   a[first]=a[j];   a[j]=temp; }   return(j); } void quicksort(int a[25],int first,int last) { int j; if(first<last) { j=partition(a,first,last); quicksort(a,first,j-1); quicksort(a,j+1,last); } } int main(){ int i, count, a[25]; clrscr(); printf("Enter some elements (Max. - 25): "); scanf("%d",&count); printf("Enter %d elements: ", count); for(i=0;i<count;i...