Cocubes Syllabus 2018

Cocubes Exam 2018

CoCubes scores are valid for just 1 year, therefore, they  constantly make changes in its syllabus every year. The latest changes were made in March 2018. Most of the websites do not pay attention to this and continuously sell their materials without updating them. We always make sure to provide the best and updated material to our aspiring candidates. We almost make updates in our syllabus, such as adding new questions within every 3-4 days, which is why we rank the highest in India for Placements. Below you will find the updated latest Cocubes syllabus for 2018 year.

 

Cocubes Latest Online Test Syllabus

If the CoCubes Test is being conducted in your college, then there are four mandatory sections which are common in off and on campus, Quants, Logical Resoning and Data Interpretation, Verbal, and Computer Programming. 

If the applicant has applied for a particular company, then there are one more section added which are MCQ/ Pseudo Code Test. To confirm ehether the company you are applying for conducts the Pseudo code round or the MCQ, you need to visit the dashboard of the Cocubes website. 

Cocubes Syllabus 2018 Detailed Overwiew

Cocubes Syllabus 2018No. of QuestionsTime(min)DifficultyNegative MarkingComments
Aptitude Module45 45MediumNoCompulsory
Computer Fundamentals1515MediumNoCompulsory for CS/IT
Psychometric Module5012NANoOnly, If college is conducting mass Cocubes
Domain Module2020HighNoDepending on your branch
Coding Module330Medium – HighNoIf you clear Compulsory round IT company with package > 4 LPA
Written English Test (Essay)125 MediumNoOnly asked for Capgemini and Wipro

Cocubes Modules (Compulsary)

Syllabus for Quants in Cocubes

  • Algebra
  • Progressions
  • Geometry
  • Equations
  • Time & Work
  • Profit & Loss
  • Ratios
  • Speed & Distance
  • Averages
  • Data Interpretation

Syllabus for Logical Reasoning in CoCubes

  • Visual Reasoning
  • Statement & Conclusions
  • Relationships
  • Logical Reasoning
  • Attention to Details
  • Flowcharts

English Verbal Syllabus for Cocubes

  • Idioms and Phrases
  • Articles
  • Prepositions
  • Sentence Correction
  • Speech, Tenses
  • Reading Comprehension Synonyms
  • Antonym
  • Spellings

Computer Fundamentals Syllabus for CoCubes

  • Basics of C/C++/OOPS
  • Basics of Data Structures
  • Basics of Computer Architecture
  • Digital Logic(not asked anymore)
  • Networking Concepts
  • Common Applications such as MS Office
  • General Awareness about input/output devices

Coding Syllabus for Cocubes

There is no specific syllabus for this, but generally questions like LCM and HCF of three numbers and pattern based programs like priting trapezium pattern are asked.

Coding Languages – C, C++, C#, Java

COCUBES Domain MODULES

Below you will find the syllabus for Domain Test for specific branches. All of these have 20 questions. Time allotted is also 20 mins.

COCUBES UPDATED SYLLABUS FOR COMPUTER SCIENCE

  • C
  • C++
  • OOPS
  • Data Structures
  • DBMS Concepts
  • Operating System Concepts
  • Design and Analysis of Algorithms
  • Networking Concepts
  • Computer Architecture

CIVIL ENGINEERING SYLLABUS FOR COCUBES

  • Building Materials
  • RCC Design
  • Theory of Design & Structures
  • Soil Mechanics & Foundation
  • Construction Scheduling
  • Water Resource Engineering / Hydrology
  • Geotechnical Engineering and Environmental Engineering

ELECTRICAL SYLLABUS

  • Electrical Machines
  • EMMI
  • Network Analysis and Synthesis
  • Control Systems
  • Digital Electronics
  • Power Electronics
  • Power System and Instrumentation
  • Micro-controller and Microprocessor

ELECTRONICS SYLLABUS FOR COCUBES

  • Electronic Devices & EMMI
  • Network Analysis and Synthesis
  • Microprocessor & Microcontrollers
  • Digital Electronics
  • Communication System
  • Control System

MECHANICAL SYLLABUS

  • Thermodynamics
  • Design of Machine Members
  • IC Engines and Compressors
  • Theory of Machine
  • Engineering Material / Meteorology
  • Strength of Materials
  • Fluid Mechanics
  • Manufacturing Process

Companies Hiring With Cocubes

The following companies use Cocubes Test Platform to hire eligible candidates directly based on their Cocubes score :

  • Cocubes Renault Nissan
  • Mahindra & Mahindra
  • Ericsson
  • Aon Hewitt
  • Samsung
  • CG
  • UST Global
  • Jindal Steels and Power
  • Capgemini       
  • Zs Associates
  • Huawie
  • Samsung
  • Adobe
  • Microsoft

Name: Renuka Acharya

College: Indian Institute of Technology, Chennai

Branch: Computer Science

Type of interview: Off-Campus Interview

Student Interview

I applied for the Microsoft off campus drive through referral code. My elder brother is working in Microsoft Corporation India Pvt. Ltd. Mumbai as a Software Developer. I asked him to send me a referral code for which I had to submit the scanned copy of my resume and other important documents. As I fulfilled the eligibility criteria of Microsoft, he sent me the referral code for my CoCubes Online Round. He suggested me to visit geekplacement to get the idea about the type of questions that will be asked in the Online Coding Round.

 CoCubes Online Round

Almost 550 students applied for the paper. There was a choice for the online test that we can give from home or at the center. I chose to give the paper from home. The only requirement was the screen, and the audio jack will stay ON, to avoid any forgery. In this round, there were three coding questions and the time limit was 75 minutes. The only requirement was at least two questions should be fully executed. The 1st question was to sort a string in alphabetic order using pointers.

#include

#include

#include

Void sort_string(char*);

Int main()

{

char string[100];

printf (“ Enter the string\n”);

gets(string);

sort string(string);

printf (“%s \n”, string);

return 0;

}

void sort_string (char*s)

{

 int a, b=0, length;

 char *pointer, *result, ch;

length = strlen(s);

result = (char*)malloc(length+1);

pointer =s;

for (ch = ‘a’; ch<= ‘z’; ch++)

{

  for (c = 0; c < length ; c++)

    {

         if (*pointer == ch)

        {

             *(result+d) = *pointer;

               ++d;

                  }

          pointer++;

       }

 pointer = s;

}

*(result+d) = ‘\0’;

strcpy (s, result);

free (result);

}

  2nd question was based on implementing queue using stacks.

#include

#include

struct sNode

{

    int data;

    struct sNode *next;

};

void push(struct sNode** top_ref, int new_data);

int pop(struct sNode** top_ref);

struct queue

{

    struct sNode *stack1;

    struct sNode *stack2;

};

void enQueue(struct queue *q, int x)

{

    push(&q->stack1, x);

}

int deQueue(struct queue *q)

{

    int x;

    if(q->stack1 == NULL && q->stack2 == NULL)

    {

        printf(“Q is empty”);

        getchar();

        exit(0);

    }

if(q->stack2 == NULL)

{

    while(q->stack1 != NULL)

    {

        x = pop(&q->stack1);

        push(&q->stack2, x);

    }

}

x = pop(&q->stack2);

return x;

}

void push(struct sNode** top_ref, int new_data)

{

    struct sNode* new_node =

        (struct sNode*) malloc(sizeof(struct sNode));

        if(new_node == NULL)

        {

            printf(“Stack overflow \n”);

            getchar();

            exit(0);

        }

new_node->data = new_data;

new_node->next = (*top_ref);

 (*top_ref) = new_node;

}

int pop(struct sNode** top_ref)

{

    int res;

    struct sNode *top;

    /*If stack is empty then error */

    if(*top_ref == NULL)

    {

        printf(“Stack underflow \n”);

        getchar();

        exit(0);

    }

    else

    {

        top = *top_ref;

        res = top->data;

        *top_ref = top->next;

        free(top);

        return res;

    }

}

int main()

{

        struct queue *q = (struct queue*)malloc(sizeof(struct queue));

    q->stack1 = NULL;

    q->stack2 = NULL;

    enQueue(q, 1);

    enQueue(q, 2);

    enQueue(q, 3);

    printf(“%d “, deQueue(q));

    printf(“%d “, deQueue(q));

    printf(“%d “, deQueue(q));

getchar();

}

 3rd question was based on merging two strings.

#include

int main()

{

   char s1[100], s2[100], m, n;

  printf (“ Enter first string:”);

  scanf (“%s” , s2);

  for (m=0 ;  s1[m] != ‘\0’ ; ++m);

 for (n=0 ; s2[n] != ‘\0’ ; ++n, ++m);

{

    s1[m] = s2[n];

}

s1[m] = ‘\0’;

printf (“ After merging the strings: %s, s1”);

return 0;

}

 My all three codes were executed perfectly. I received an email from CoCubes as I had qualified for the next round. The next round was to be held at JTU, Hyderabad after one week.

Group Fly Round (Onsite)

Total 550 students gave the Cocubes paper out of which, 250 students were eliminated in the 1st round. In the 2nd round, all the students were divided in a group of 10, and one mentor was allotted to every group. It was a written coding round. In this round, we were given a question to delete a node from the given linked list,

struct node

     int d;

      struct node *next;

};

int main()

{

  struct node *prev, *head, *p;

  int q, r ;

  printf ( “ number of elements:”);

  scanf (“%d” , &q);

  head = NULL;

 for (r=0 ; r

 {

     p=malloc(sizeof(struct node));

      scanf(“%d” ,&p->data);

     p-> next =NULL;

     if(head== NULL)

               head=p;

   else

           prev-> next=p;

           prev=p;

      }

 return0;

}

 After 10 minutes each of us had to explain the logic and our approach to the mentor. After the discussion for that question was over, the second question was given to us. It was based on selection sort,

int main()

{

  int array[100], p, q, r, position, swap;

 printf(“Enter the number of elements”);

 scanf( “%d , &p);

printf(“ Enter %d integers”, p);

for (q= 0; q < p; q++)

scanf (“%d”, &array[q ]);

for( q=0; q < ( p-1) ; q++)

{

   position= q;

for (r= q+1 ; r < p ; r++)

{

   if ( array[position] > array [r] )

  position  = r;

}

 If (position != q)

{

  swap = array [q];

  array[q] = array [position];

array[position] = swap;

   }

}

printf (“Sorted list in ascending order is”);

for( q=0; q

  printf (“%d” , array [q]);

  return 0;

}

Again a time frame of 10 minutes was allotted, and the same process was repeated. The results for this round were declared within 30 minutes. Only 87 students were shortlisted for face to face round.

Face to Face Interview

This round was held at the Microsoft campus Chennai. This round had three sections, Two Technical and One HR.

Technical Round 1

This round was quite more prolonged than the usual technical interview rounds. For the first 10-20 minutes, the interviewer went thoroughly with my CV. After that, he began to ask me some questions related to my major project like,

  • Why did you use Master Page for your website creation?
  • If you add an event who all will be able to access and change the data in your website?

Then he asked me to write the logic of to find the longest common substring

int min(int a, int b);

int longestUniqueSubsttr(char *str)

{

    int n = strlen(str);

    int cur_len = 1;    

 int max_len = 1; 

    int prev_index;  //  previous index

    int i;

    int *visited = (int *)malloc(sizeof(int)*NO_OF_CHARS);

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

        visited[i] = -1;

    visited[str[0]] = 0;

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

    {

        prev_index =  visited[str[i]];

        if (prev_index == -1 || i – cur_len > prev_index)

            cur_len++;

        else

        {

            if (cur_len > max_len)

                max_len = cur_len;

            cur_len = i – prev_index;

        }

        visited[str[i]] = i;

    }

    if (cur_len > max_len)

        max_len = cur_len;

    free(visited);

    return max_len;

}

 Following this, he asked me to write an SQL query to fetch the number of employees working on a project,

SELECT COUNT(*)  FROM E_Salary WHERE Project =’E1’;

 After this round was over, I was asked to move to the adjacent cabin for the Technical Round 2.

Technical Round 2

In this round as well, the interviewer took 15 minutes to go through my CV thoroughly. The interviewer asked me questions related to networking.

  • Draw the OSI model
  • Explain the Handshake procedure, and what is the role of acknowledgment in it?
  • Explain all the layers from top to bottom.

After the interview was over, I was asked to wait outside. The results were declared for the Technical Round. I was selected to move forward for the HR Round

HR Round

There were no technical questions asked in this round. The HR asked me simple questions related to my interests. In the end, he just asked me the difference between a front-end developer and back-end developer. The interview went quite well. The joining letter was delivered at my residence, along with the designation of the Front-end designer at Microsoft Kolkatta.

along with the designation of the Front-end designer at Microsoft Kolkata.

Name: Ritu Mehra

College: Indian Institute of Technology, Hyderabad

Branch: Computer Science

Type of interview: Off-Campus Interview

Student Interview

I came to know about the Microsoft off- campus drive through LinkedIn. I applied for the Online test through which I can apply for the drive. I referred to PrepInsta while preparing for the drive. There was one coding round, one group fly round followed by three personal interviews in the off-campus interview process.

 CoCubes Online Round

More than 1500 students enrolled for the drive. In this round, there were three coding questions of medium to high difficulty level. The paper was of 75 minutes in which two questions should be executed perfectly, and one partially. The three coding question were Delete leaf nodes with a value of k; Given a Binary tree with next sibling, pointer populate next sibling using constant space without using a queue; and The trapping Rainwater Problem. The results were declared within 10 days. I scored an 89 percentile and was eligible to apply for the Microsoft drive. On the basis of my percentile I received an email from Microsoft that I was shortlisted for the further rounds which were to be held at Xavier’s Mumbai.

Group Fly Round (Onsite)

 This was a written coding round. Here the students were divided in a group of 6 with one mentor allotted to each group. We had to write the logic for the codes and explain our approach to the mentor of our group. 2-3 students were selected from each group by their approach followed. The first question was to Rotate an n*n array by 90 degrees and Calculate the sum of two non-negative numbers X and Y. If the number of digits in sum is equal to the number of digits in X, then print sum, else print X. The results for this round were declared within 30 minutes. The shortlisted candidates were offered the hall ticket for the face to face interview which was to be held at Microsoft Gurugram.

Face to Face Interview

There were three personal interviews in this round, which were Technical round 1, Technical round 2, and HR round.

Technical Round 1 (Duration 1 hour)

I was seated at the reception when my name was called for the first round. I entered the cabin, and there were two interviewers there. They went through my CV before the interview began. After some time one interviewer left. The interviewer asked me to introduce myself and explain my final year project. After this, he moved to the technical questions. He asked me array, linked list related codes. He gave me a code to perform the union of two strings and asked me to optimize it. After viewing my code, he gave few scenarios where my code would fail. He did this intentionally to confuse me; he was checking my confidence and ability to handle the problem. I explained the scenarios he raised with full confidence to which he seemed quite impressed. Then he asked me some database queries and few questions on multi-threading. Then he asked me to wait outside.

Technical Round 2 (Duration 1 hour)

After five minutes my name was called again for the next round. The interviewer straight moved to the questions. He asked me questions related to JAVA, linked list, arrays, strings, and networking. He asked me to write the approach for solving a Binary Search Tree and then asked me to write the code for it. At last he asked me some questions related to my final year project.

HR Round (Duration 30 minutes)

I was told that the next round would be held after the lunch, so I went to the canteen and had my lunch. I was sitting at the reception when a lady came and asked me to follow her. I went into her cabin for the interview. She asked me how my previous interviews went. She asked me some basic questions about my hobbies and interests. Then she moved to the questions,

  • Why do you want to join Microsoft?
  • What do you know about MSN?
  • What are your career goals?
  • How will you be productive for our company?

At last, she asked me if I had any questions related to the company and work procedure, I asked few questions and then left. The HR asked me to wait outside. After 15 minutes she handed me the offer letter and said Welcome to Microsoft. That was the best day of my life.