Cocubes Test Pattern for 2018

Cocubes Test 2018

CoCubes is one of the largest assessment test for job seeekers across the country. Placement Papers of CoCubes hold moderate difficulty level but the paper is challenging to solve in the given time during the test. We constantly observed CoCubes Previous Papers with Answers in the logical reasoning section and found it the toughest. To cope up with this, you must solve all CoCubes Previous Year Papers and CoCubes Previous Questions given on our website. These will help you better prepare for your Cocubes test.

Name of ExamCoCubes
Mode ConductedOnline
Cost of ExamRs.1000
Total Marks1000
Typenon – Adaptive
Negative MarkingNo

CoCubes Test Section for 2018

There are total 6 Modules in CoCubes tests. All of them can vary according to the purpose of examination.

If your college is conducting the test then, it will contain questions only from Quants, Logical, English and Computer Programming.

If you are appearing for a specific company, you will have to give MCQ/Pseudo Code Test. You will also have to go to the that company’s specific dashboard on Cocubes website. The website contains company’s dedicated syllabus. The common 6 sections are: 

  1. Aptitude Module
  2. Computer Fundamentals
  3. Psychometric Module (Only, If college is conducting mass CoCubes)
  4. Domain Module (According to Branch)
  5. Coding Module (For IT Company’s)
  6. Written English Test (Essay)(Optional Based on company)
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

Aptitude Module

Generally asked Topics in Aptitude Module are as follows :

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

Computer Fundamentals

The commonly asked topics in Computer Fundamentals Module are as follows :

  • 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

Logical Reasoning

The commonly asked topics in Logical Reasoning Module are as follows :

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

Verbal Aptitude

The commonly asked topics in Verbal Module are as follows :

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


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

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


Cocubes Domains are further divided into some streams which are:

  • CSE/IT
  • Electrical
  • Electronics
  • Mechanical
  • Civil Engineering

Basic topics from the above mentioned streams are asked in CoCubes. Level of difficulty varies from medium to high. For preparing for such questions, our website provides previous year question papers with solutions for your ultimate preparation.

Interview Experiences

Name: Nitya Subramanyam

College: National Institute of Technology, Pondicherry

Branch: Computer Science

Type of interview: Off-Campus Interview

Student Interview

Working in Microsoft was one of my childhood dream. I saw on LinkedIn that Microsoft was organising an off campus drive for students of 2017 batch. I filled the form for the CoCubes paper and immediately. I practiced the solved and unsolved practice papers available on mygeekmonkey. There are three rounds in the interview process of Microsoft, Online Coding Round, Onsite Coding Round, and Face to Face Interview Round.

CoCubes Online Round

More than 1500 students had enrolled for this paper.

The first question was to print Fibonacci series in reverse order

#include <bits/stdc++.h>

using namespace std;

void reverseFibonacci(int x)


    int m[x];

    m[0] = 0;

    m[1] = 1;

    for (int i = 2; i < x; i++) {

        m[i] = m[i – 2] + m[i – 1];


    for (int i = x – 1; i >= 0; i–) {

        cout << m[i] << ” “;



int main()


    int x = 5;


    return 0;


The second question was Performing Quicksort on Singley Linked List

struct Node *partition(struct Node *head, struct Node *end,

                       struct Node **newHead, struct Node **newEnd)


    struct Node *pivot = end;

    struct Node *prev = NULL, *cur = head, *tail = pivot;

    while (cur != pivot)


        if (cur->data < pivot->data)


            if ((*newHead) == NULL)

                (*newHead) = cur;

            prev = cur; 

            cur = cur->next;




            if (prev)

                prev->next = cur->next;

            struct Node *tmp = cur->next;

            cur->next = NULL;

            tail->next = cur;

            tail = cur;

            cur = tmp;



    if ((*newHead) == NULL)

        (*newHead) = pivot;

    (*newEnd) = tail;

    return pivot;


//here the sorting happens exclusive of the end node

struct Node *quickSortRecur(struct Node *head, struct Node *end)


    // base condition

    if (!head || head == end)

        return head;

    Node *newHead = NULL, *newEnd = NULL;

    struct Node *pivot = partition(head, end, &newHead, &newEnd);

    if (newHead != pivot)


        struct Node *tmp = newHead;

        while (tmp->next != pivot)

            tmp = tmp->next;

        tmp->next = NULL;

        newHead = quickSortRecur(newHead, tmp);

        tmp = getTail(newHead);

        tmp->next =  pivot;


    pivot->next = quickSortRecur(pivot->next, newEnd);

    return newHead;


void quickSort(struct Node **headRef)


    (*headRef) = quickSortRecur(*headRef, getTail(*headRef));



int main()


    struct Node *a = NULL;

    push(&a, 5);

    push(&a, 20);

    push(&a, 4);

    push(&a, 3);

    push(&a, 30);

    cout << “Linked List before sorting \n”;



    cout << “Linked List after sorting \n”;


    return 0;


The third question was to detect loop in a linked list


using namespace std;

struct Node


    int d;

    struct Node* next;


void push(struct Node** head_r, int new d)


    struct Node* new_node = new Node;

    new_node->data  = new_d;

    new_node->next = (*head_r);

        (*head_r)    = new_node;


bool detectLoop(struct Node *a)


    unordered_set b;

    while (a != NULL)


        if (b.find(a) != b.end())

            return true;


        a = a->next;


    return false;


int main()


        struct Node* head = NULL;

    push(&head, 10);

    push(&head, 5);

    push(&head, 12);

    push(&head, 8);

        head->next->next->next->next = head;

    if (detectLoop(head))

        cout << “Loop found”;


        cout << “No Loop”;

    return 0;


More than 1500 students had enrolled for this paper. After the results were declared, only 33% students qualified for the next round. The next Onsite coding round was to be held at IIT, Hyderabad after 10 days.

Group Fly Round (Onsite)

All the selected candidates were divided in a group of 4, with one mentor allotted to each group. There were two coding questions asked in this round. We had to write the logic individually and then describe our approach to the mentor. After we explained our codes, the mentor explained the correct approach for the codes. Whoever followed the correct approach was shortlisted to move ahead for the next rounds. The first question was to write the logic for finding maximum average cost path

const int A = 100;

double maxAverageOfPath(int cost[A][A], int B)


    int dp[B+1][B+1];

    dp[0][0] = cost[0][0];

    for (int i = 1; i < B; i++)

        d[i][0] = d[i-1][0] + cost[i][0];

    for (int j = 1; j < B; j++)

        d[0][j] = d[0][j-1] + cost[0][j];

    for (int i = 1; i < B; i++)

        for (int j = 1; j <= B; j++)

            d[i][j] = max(d[i-1][j],

                          d[i][j-1]) + cost[i][j];

    return (double)d[B-1][B-1] / (2*B-1);


The second question was to perform Insertion in a Linked List

void append(struct Node** head_ref, int new_data)


    struct Node* new_node = (struct Node*) malloc(sizeof(struct Node));

    struct Node *last = *head_ref;  /* used in step 5*/

    new_node->data  = new_data;

    new_node->next = NULL;

        if (*head_ref == NULL)


       *head_ref = new_node;



    while (last->next != NULL)

        last = last->next;

    last->next = new_node;



The results of this round were declared within an hour. Only 200 students were shortlisted for the final Face to Face Interview round which was to be held at the Microsoft Mumbai Campus.

Face to Face Interview

There were three sections in this round, Technical Round1, Technical Round 2, and HR Round.

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. The interviewer asked me many questions related to basics of database, data structures, and C. He gave various SQL queries to solve. Then he asked me to write the code for Postfix to Infix Conversion

#include <bits/stdc++.h>

using namespace std;

bool isOperand(char x)


   return (x >= ‘a’ && x <= ‘z’) ||

          (x >= ‘A’ && x <= ‘Z’);


string getInfix(string exp)


    stack s;

    for (int i=0; exp[i]!=’\0′; i++)


        // Push operands

        if (isOperand(exp[i]))


           string op(1, exp[i]);





            string op1 =;


            string op2 =;


            s.push(“(” + op2 + exp[i] +

                   op1 + “)”);





int main()


    string exp = “ab*c+”;

    cout << getInfix(exp);

    return 0;


After this he asked me about the Time complexities of various algorithms, such as Binary Insertion Sort, Merge Sort, and Pigeonhole Sorting. The interview went for 75 minutes. After this round was over I moved further for the next technical round.

Technical Round 2

In this round instead of the codes the interviewer asked me to write the algorithms of the various programs and asked me to explain the logic applied . The first algorithm he asked was Pythagorean Triplet in an array

Algorithm – Firstly, run three loops. These three loops will take three array elements and check whether they are form the Pythagorean Triplet or not.

Logic –

Triplet(int ar[], int n)


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


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


          for (int k=j+1; k<n; k++)


            int x = ar[i]*ar[i], y = ar[j]*ar[j], z = ar[k]*ar[k];

            if (x == y + z || y == x + z || z == x + y)

The second algorithm he asked was Algorithm for the Quick Sort

Algorithm – It’s a type of Divide and Conquer Algorithm. Pick a central node and divide it into two halves.

Logic –

quickSort(arr[], low, high)


    if (low<high)


   a= partition (arr, low, high);

   quicksort(arr, low, a-1);

   quicksort(arr, a+1, high);


Then the interviewer asked me some basics of networking like

  • What is a server?
  • What are Hidden shares?
  • Explain DNS.
  • How many different ways are there to exchange data?
  • Explain frame relay and where does it operate?
  • Explain beaconing.

The interview went really good, the interviewer was also quite lenient. After the interview was over e asked me to wait outside for my turn for the HR round.


HR Round

The interviewer went through my CV and asked me basic common questions, like why I want to work for Microsoft, some achievement I was proud of, and how would you handle an upset customer? Then she asked me questions on the basis of some hypothetical scenarios, if company is experiencing some unexpected attritions, how would you solve it? Then she asked me,

  • How do you measure success?
  • How will you differentiate between a good customer service and a great customer service?
  • Any recent technological advancement you excited for?

Then she asked me some questions about my interests and accomplishments, such as my hobbies, languages that I know, certifications I have done. The interview was over in 30 minutes. She asked me to wait outside as she had to discuss with the other interviewers about the results. After an hour, she came and handed me the offer letter for the post of Full-Stack Developer at Microsoft Ltd.


The CoCubes score is valid for 1 year.

As soon as one submits the test, the scores are revealed then and there. There is no delay in the results.

For registration, Visit here

We have provided material for preparing for Cocubes just visit here.

Cocubes is an online placment portal that provides you best opportunities to get placed in one of the top companies.So if you are in search of job it would be benefiecial that you give cocubes test.

We have provided all the information on our Cocubes dashboard page you can visit there and get all the information you need for Cocubes

Review Date
Reviewed Item
CoCubes test pattern for 2018
Author Rating