Cocubes Syllabus 2018

Cocubes Exam 2018

CoCubes constantly makes changes in its syllabus every year. The latest changes were made in March 2018. Most of the websites don’t update the Syllabus except us. We make updates within every 1 – 2 days, which is why we rank the highest in India for Placements. Below you will find the updated latest Cocubes syllabus for 2018 year.

Name of ExamCoCubes
Mode ConductedOnline
Cost of ExamRs.1000
DurationVaries
Total Marks1000
Typenon – Adaptive
Negative MarkingNo
Score Card Validity1 Years

Companies Related With Cocubes

The following companies use Cocubes testing platform to Hire eligible candidates directly by giving the Cocubes online test :

  • Bosch
  • Tata
  • Capgemini
  • Zs Associates
  • Huawie
  • Samsung
  • Adobe
  • Microsoft
  • Cocubes Renault Nissan
  • Mahindra & Mahindra.
  • Ericsson.
  • Aon Hewitt.
  • Samsung.
  • CGI.
  • Jindal Steels and Power.
  • UST Global.
  • Think Analytics.
  • etc

Cocubes Latest Online Test Syllabus

If your college is conducting the test then it will cover questions from topics such as Quants, Logical, English and Computer Programming.

If you are appearing for a specific company, you will have to give MCQ/Pseudo Code Test. For this, you should go to that company’s specific dashboard on Cocubes website. Here you will find the dedicated syllabus for that company. 

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 Detailed Syllabus for 2018 

Cocubes Syllabus 2018No. of QuestionsTime(min)DifficultyNegative MarkingComments
Aptitude Module4545MediumNoCompulsory
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 Domain MODULES

Below you will find the syllabus for Domain Test for specific branches. All of these have 20 questions. Time allotted for this module is 30 minutes.

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
Cocubes Syllabus 2018 MyGeekMonkey

Interview Experiences

Name: Naina Verma

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 mygeekmonkey 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 Kolkata.

Name: Sonia Mehta

College: National Institute of Technology, Bhopal

Branch: Computer Science

Type of interview: ON-Campus Interview

Student Interview

I was very excited when our Training Placement Officer announced that the placement drives for the final year would begin from next month. This year along with the most reputed firms, Microsoft will also conduct a recruitment drive for the SDE (Software Design Engineer) position in our college. It had always been my dream to be a part of the Microsoft Family. Therefore I started preparing for the drive seriously. I practiced all the solved and unsolved questions available on mygeekmonkey. I cleared my programming basics through online tutorials and lectures available on the web. I didn’t want to leave any straw to miss this golden opportunity.

CoCubes Online Round

On the day of the interview, 700 students enrolled for the Microsoft drive. In the first round, there were 3 Coding questions which were To find the lowest common ancestor in a BST, and Convert the given Binary tree into its mirror, and Boolean String Value function Out of the three codes, my first two codes were executed perfectly but due to some logical error, the third code was partially executed. Still, I managed to clear this round and was shortlisted for the Group Fly Round.

Group Fly Round (Onsite)

In this round, all the shortlisted students were divided in a group of 6-7 along with one mentor for each group. There were two coding questions and the time frame was of 20 minutes, i.e., 10 minutes for 1 question. All the group members were given the same set of questions. We had to solve these questions individually and then explain our approach to the mentor of our group. Only 2-3 students were selected from every group. Therefore I tried my best to be one of those three form my group. The first question was Given a function that takes a binary string. Return the longest size of contiguous substring containing only ‘1’, and How to print each subsequence of size n/2 from an array of size n? I explained my logic for both the codes to our mentor, and he was quite impressed with my approach followed. The results of this round were declared within 30 minutes, and I was selected for the personal interviews.

Face to Face Interview

This round was followed by three personal interviews, Technical Round 1, Technical Round 2, and HR Round.

Technical Round 1 (Duration 30 minutes)

All the selected students accumulated in front of the seminar hall for the personal interviews. My name was called, and I entered the hall for my first interview. The interviewer asked me to introduce myself till then he went through my CV. Then he moved to the technical questions. He asked me to write the code for finding the minimum element in a linked list. Then he asked me a various set of questions such as,

  • Explain a Dequeue.
  • What do you know about the MSN Framework?
  • How do you validate an IP address?
  • Is there any difference between JDK, JRE, and JVM?
  • What is a JIT?
  • Does SQL support programming?

At last, he asked me about Time complexities of some codes, and then the interview ended.

Technical Round 2 (Duration 45 minutes)

The interviewer in this round was quite lenient. He asked me how my previous round went. Then he asked me about my final year project and asked me to explain it. Then he moved to the questions. He gave me the code for a Breadth First Search and asked to find and correct the error in the code. There was an error in the calling function and some syntax errors. Then he asked some SQL queries, and questions on the database,

  • What is the difference between a primary key and a unique key?
  • Difference between where and having clause.
  • How will you print duplicate rows in a table?
  • What is a view in SQL?

Then he asked me about the difference between java and c++. This was the last question. Then I left.

HR Round (Duration 30 minutes)

 The HR was seated in the director’s cabin. The HR asked me to introduce myself. Then she began to ask me general questions, about my career goals, interests, hobbies, etc. Then she moved towards some technical questions, Suppose we have a certain problem in the company and cannot meet to the client’s requirements on time. Then how will you deal with the client? She asked me many problems of such hypothetical situations. Then she asked me if I had any questions, to which I replied no. Then the interview ended, and I had to wait for the results till all the interviews were over. I had to wait till 5 in the evening as all the interviews were over by then. Then the HR came out and called the names of 7 students, luckily I was one of them and handed us the offer letters by saying welcome to the Microsoft family. I cannot express in words how happy I was as I couldn’t believe that I was selected for the post of Software Design Engineer at Microsoft.

Summary
Review Date
Reviewed Item
CoCubes Syllabus for 2018
Author Rating
51star1star1star1star1star