GCET EXAM | GCET MATERIAL | COMMON ENTERENCE TEST | GCET Preparation

Unique Philosophy - foresight school is the only training institute in Gujarat which is dedicated exclusively to GCET preparation. We are a specialized institute that caters only to those students who are preparing for GCET (MBA & MCA). We understand that students from Gujarat have different learning needs and our content and delivery are designed to fulfil these needs. Expert Faculty - Every student at foresight school is taught by a team of dedicated professionals who have topped GCET exam in recent years. We do not have any visiting faculties and all the sessions are conducted by Mr. Mikin Shah (GCET Rank 1 - 2004, 2009 & 2010) and Mr. Manan Shah (GCET Rank 24 - 2004). The students are continuously moulded to develop key skills that are required to excel at GCET. Content...

Read more »

Downloads

Google Chrome (.exe File)Turbo CAPACHE TOMCAT 7.08 for  32 BIT OSAPACHE TOMCAT 7.08 for 64 BIT OSWinzipWinRARCobol...

Read more »

IMPORTANT SQL QUESTIONS

1)      List various data types available in oracle. Explain it.2)      What is constraint? List various constraints. Explain Primary Key.3)      Explain referential integrity constraint. (F.K.)4)      Explain business constraint.( check constraint )5)      Explain various types of joins in oracle.6)      Explain index and its types in detail.7)      What is view? Explain views in detail.8)      Explain sequence with example.9)      Explain synonym.10)  Explain group by and having with example.11)  Explain union, intersect and minus.12)  List various types...

Read more »

IMPORTANT PL/SQL QUESTIONS

1)      Explain the PL/SQL block structure.2)      Explain advantages of PL/SQL.3)      List the special data types of PL/SQL and explain it. (%TYPE & %ROWTYPE)4)      What is cursor? Explain in detail.5)      Explain parameterized cursor.6)      Explicit cursor handling using for loop.7)      Advantages of using procedure and function.8)      Explain procedure with example.9)      Explain function with example.10)  Explain trigger in detail.11)  Explain types of triggers.12)  Explain package.13)  Explain error handling in PL/SQL.14)  Explain...

Read more »

ORACLE ARCHITECTURE

1)      State E.F.Codds’s 12 rules of RDBMS.2)      What is database? Explain processes.3)      Explain database support processes (or server processes).4)      List and explain oracle background processes.5)      Define blocks, segments and extents.6)      Explain control files and redo log files.7)      Explain types of tablespace in oracle.8)      Explain initialization parameter (or init.ora) file.9)      The logical and physical structure of oracle database. 10)  List and explain responsibilities of DBA.11)  Explain oracle instance.12)  Explain oracle...

Read more »

gtu syllabus for 1st semester Books Online pdf | Download Free gtu ...

Posted by http://pdf-free-download.com/gtu-syllabus-for-1st-semester.pdf| 2011-01-10 00:00:48 gtu syllabus for 1st semester Books Online : Download gtu syllabus for 1st semester Online Pdf ... MCA 1st Semester MCA 3rd Semester Network Management. MCA-505. 19060. Note: 2- 3- MCA ......

Read more »

gtu mca syllabus

Posted by http://www.resultsof.com/gtu-mca-syllabus| 2011-01-25 00:01:23 gtu mca syllabus ... Gujarat Technological University Assessment Module for MCA : Assessment Module for MBA : Syllabus for MBA Programme effective ......

Read more »

Mca Syllabus Timeline

Posted by http://www.dipity.com/timeline/Mca-Syllabus/| 2011-01-25 00:01:23 Mca Syllabus has no followers yet. Be the first one to follow. ... Welcome to GTU-MCA family This site is developed only for sharing knowledge....

Read more »

MCA Sem-II Object oriented Concepts & Programming January 2011 GTU Question paper for Object oriented Concepts & Programming ; GTU question paper for MCA 2011 ; GTU questionbank 2011

Seat No.: _____ Enrolment No.______GUJARAT TECHNOLOGICAL UNIVERSITYMCA. Sem-II Remedial Examination December 2010Subject code: 620003Subject Name: Object oriented Concepts & ProgrammingDate:18 /12 /2010 Time: 10.30 am – 01.00 pmTotal Marks: 70Instructions:1. Attempt all questions.2. Make suitable assumptions wherever necessary.3. Figures to the right indicate full marks.Q.1 (a) 1. Write the different ways of writing function prototypes. Find errors, if any in thedeclaration - int mul(int a,b);032. What is the use of parameterized constructor? Define dynamic constructor. Whatis the difference between following two statements if integer is a class andinteger(int x, int y) is the constructor method. integer int1 = integer(0,100);integer int1(0,100);04(b) 1. What is operator overloading? What...

Read more »

MCA Sem-II Computer Oriented Numerical Methods January 2011 GTU Question paper for Computer Oriented Numerical Methods ; GTU question paper for MCA 2011 ; GTU questionbank 2011

Seat No.: _____ Enrolment No.______GUJARAT TECHNOLOGICAL UNIVERSITYMCA. Sem-II Remedial Examination December 2010Subject code: 620005Subject Name: Computer Oriented Numerical MethodsDate: 20 /12 /2010 Time: 10.30 am – 01.00 pmTotal Marks: 70Follow the link to download free MCA Sem-II Computer Oriented Numerical Methods January 2011 GTU Question paper for Computer Oriented Numerical Methods  question paper:- Downl...

Read more »

GTU MCA ASSIGNMENT AND MATERIAL

GTU MCA ASSIGNMENT AND MATERIAL - 2 visits - 11 Feb24 Sep 2010 ... Copyright 2010GTU ASSIGNMENT All rights reserved. GTU MCA ASSIGNMENT AND MATERIAL Powered by GTU MCA ASSIGNMENT AND MATERIAL.gtuassignment.blogspot.com/ - CachedGTU MATERIAL: MCA FOP Assignment - 39 Dec 2010 ... Get GTU all year question papers online on the blog, Search GTU question paper online, GTU,GTU question paper, GTU question paper 2010, ...gtu-mca1.blogspot.com/2010/12/mca-fop-assignment-3.html - CachedGTU MATERIAL: Assignment – I29 Nov 2010 ... Assignment - 5 Relational Algebra · Assignment – 7 (Introduction to other Databases) · Most Important Questions...

Read more »

GTU C PROGRAMS | HEAP SORT PROGRAM

C: ------------------------------------------------------------------------- /* HEAP SORT */ /* HEAP.C */ # include<stdio.h> void  heap_sort(int *, int ); void create_heap(int *, int); void display(int *, int); /*  Definition of the function */ void create_heap(int list[], int n ) {  int k, j, i, temp;  for(k = 2 ; k <= n;  ++k)  {   i = k ;   temp = list[k];   j = i / 2 ;   while((i > 1) && (temp > list[j]))   {    list[i] = list[j];    i = j ;    j = i / 2 ;    if ( j < 1 )     j = 1 ;   }   list[i] = temp ;  } } /* End of heap creation function */ /* Definition of the function */ void...

Read more »

GTU C PROGRAMS | SHELL SORT PROGRAM

C : ------------------------------------------------------------------------- /* shell.c */ /* shell sort */ #include <stdio.h> #include <stdlib.h> void shell_sort(int array[], int size) {  int temp, gap, i, exchange_occurred;  gap = size / 2;  do {   do {    exchange_occurred = 0;    for (i = 0; i < size - gap; i++)     if (array[i] > array[i + gap])     {      temp = array[i];      array[i] = array[i + gap];      array[i + gap] = temp;      exchange_occurred = 1;     }   } while (exchange_occurred);  } while (gap == gap / 2); } void main(void) {  int...

Read more »

GTU C PROGRAMS | RADIX SORT PROGRAM

C : -------------------------------------------------------------------------- /* RADIX SORT */ /* RADIX.C*/ # include<stdio.h> # include<malloc.h> # include<stdlib.h> struct node {  int data ;  struct node *next; }; typedef struct node node1; node1 *first; node1 *pocket[100], *pocket1[100]; void create_node(node1 *, int); void display(node1 *); node1 *radix_sort(node1 *); int large(node1 * ); int numdig(int ); int digit(int , int); void update(int, node1 *); node1 *Make_link(int, node1 *); /* This function create nodes and take input data */ void  create_node(node1 *rec, int n) {  int i, j, k;  for(i = 0 ; i< n; i++)  {   rec->next = (node1 *) malloc(sizeof(node1));   printf("\n First node value: %d: ", i);   scanf("%d",...

Read more »

GTU C PROGRAMS | QUICK SORT PROGRAM

C : /* quick.c */ #include <stdio.h> #include <stdlib.h> void quick_sort(int array[], int first, int last) {  int temp, low, high, list_separator,i;  low = first;  high = last;  list_separator = array[(first + last) / 2];  do {   while (array[low] < list_separator)    low++;   while (array[high] > list_separator)    high--;   if (low <= high)   {    temp = array[low];    array[low++] = array[high];    array[high--] = temp;   }  } while (low <= high);  for (i = 0; i < 11; i++)   printf("%d ", array[i]);  printf("\n");  getch();  if (first < high)   quick_sort(array, first,...

Read more »

GTU C PROGRAMS MATERIAL | BUBBLE SORT PROGRAM

C : /* bubble.c */ #include <stdio.h> #include <stdlib.h> void bubble_sort(int array[], int size) {  int temp, i, j;  for (i = 0; i < size; i++)   for (j = 0; j < size; j++)    if (array[i] < array[j])    {     temp = array[i];     array[i] = array[j];     array[j] = temp;    } } void main(void) {  int values[30], i;  printf("\n Unsorted list is as follows\n");  for (i = 0; i < 10; i++)  {   values[i] = rand() % 100;   printf(" %d", rand()%100);  }  bubble_sort(values, 10);  printf("\n Sorted list is as follows\n");  for (i = 0; i < 10; i++)   printf("%d ", values[i]); } ------------------------------------------------------------ C++  //...

Read more »