Skip to main content

Newgen Software Campus Placement(Paper) HBTI Kanpur 2014-15

Newzen Campus Placement In the second week of November 2014 Newgen software visited our campus.There were various rounds in the selection process.I am sharing here all necessary information and details regarding the whole placement procedure.

Criteria: 60% 10th,12th and B.Tech

CTC: 3.75 LPA

Profile: Software Devloper

Branch: CS,IT and MCA


Selection Procedure

Round 1: The first process was written test and it was a pen-paper round. There were tow seprate papers and the details of both papers are below.

Paper A (Aptitude,Logical Reasoning,English)

In this paper the questions of Aptitude,LR and English were in almost equal proportion and the level of question was not quite easy,So try your hand on some good questions before the test.

Paper B (Technical)

The second paper was technical.I am giving the Questions and details of that paper.

Time: 35 minutes

No. of Questions: 25


The question will go here
Q. 1) What will be output of the following program?

    #include<stdio.h>
    #include<string.h>
    
    int main()
    {
        union a{
        struct abc
        {
            char name[10];
            int age;
        }p;

        union xyz
        {
            struct sort
            {
                char c[5];
                float y;

            }r;
            char f[5];
        }q;

        }z;

        strcpy(z.q.f,"A");
        printf("%s",z.p.name);
        return 0;
    }
                
A)A
B)a
C)Garbage Value
D)Runtime Error
Q. 2) What will be output of the following program?

    #include<stdio.h>
    #include<string.h>
    #include<stdlib.h>
    void string(int,char*);

    int main()
    {
        int a=2364;
        char *str1;
        str1=(char *)malloc(6);
        string(a,str1);
        printf("%s",str1);
        free(str1);
        return 0;
    }

    void string(int val,char *str)
    {
        int i;
        for(i=0;val!=0;i++,val/=10)
            str[i]=(val%10)+'0';
        if(i==0)
        str[i++]='0';
        str[i]='\0';
        strrev(str);
        return;

    }

                
A)4632
B)2364
C)Garbage Value
D)Runtime Error
Q. 3) What will be output of the following program?

   
        #include<stdio.h>
        int main()
        {
            char *c[]={"ENTER",
                        "NEW",
                        "POINTER",
                        "FIRST"
                        };
            char **cp[]={c+3,c+2,c+1,c};
            char ***cpp=cp;
            printf("%s",**++cpp);
            printf("%s",*--*++cpp+3);
            printf("%s",*cpp[-2]+3);
            printf("%s",cpp[-1][-1]+1);
            return 0;
        }
                
A)POINTERFIRST
B)POINTERERSTEW
C)POINTERENSTEN
D)POINTNEWENTR
Q. 4) Rgegarding the difference between a declaration and dfinition of a variable which of the below statements are true? I) A dfinition allocates memory space for a variable II) A declaration allocates memory space for avariable III) A definition can occur multiple times IV) A declaration can occur multiple times
A)(I) and (III) only
B)(I) and (IV) only
C)(II) and (III) only
D)(II) and (IV) only
Q. 5) What will be output of the following program?

    #include<stdio.h>

    int main()
    {
        int m=5;
        fun(m++,&m);
        printf("%d %d",m++,fun(5,&m));
        return 0;
    }
    fun(int t,int *m)
    {
        *m %=(t-=3);
        if(!(t>0))
        fun(t,m);
        return *m;
    }

                
A)0 2
B)1 3
C)2 4
D)0 0
Q. 6) What will be output of the following program?

           void main(void)
        {

            int i;
            for(i=0;i<5 code="" d="" i="" printf="">
A)5
B)1
C)0
D)Compilation Error
Q. 7) What will be output of the following program?

        #include<iostream>
        #include<malloc.h>
        using namespace std;

        int main()
        {
            union test
            {
                int i;
                float f;
                char c;
            };
            union test *t;
            t=(union test*)malloc(sizeof(union test));
            t->f = 10.10f;
            cout<<t->f;
            return 0;
        }
                
A)12.1
B)10.1
C)7.1
D)10
Q. 8) Which one of the following statements is correct?
A)The base class pointer can not contain the address of the derived class object.
B)The base class pointer can contain the address of the derived class object.
C)Derived class can contain the address of the base class object.
D)Derived class can contain the address of the base class object only if derived class is inherited publicly.
Q. 9) What will be output of the following program?

 #include<iostream>
using namespace std;

class C
{
 static void f()
 {
  cout<<i<<" ";
 }
 static int i;
 int j;
 public:
  C(int firstj):j(firstj){}
  void printall();
  
};

void C::printall()
{
 cout<<this->j <<" ";
 this->f();
}

int C::i=3;
int main()
{
 C obj_C(1);
 obj_C.printall();
 return 0;
}
                
A)0 3
B)1 3
C)Garbage Value
D)Runtime Error
Q. 10) What will be output of the following program?

#include<iostream>
using namespace std;

int main()
{
 const volatile int display(const volatile int a);
 const volatile int a=10;
 cout<<a<<" ";
 display(a);
 cout<<a<<" ";
 return 0; 
}

const volatile int display(const volatile int a)
{
 cout<<a<<" ";
}
                
A)10 10 10
B)10 0 0
C)0 0 0
D)Garbage Value
Q. 11) What will be output of the following program if value entered is 10?

#include<iostream>
using namespace std;

class baseA
{
 friend class derivedB;
 protected:
  int value;
 public:
  baseA()
  {
   cout<<"Enter a number: ";
   cin>>value;
  }
};

class derivedB:public baseA
{
 public:
  void display()
  {
   ++value;
   cout<<value<<endl;
  }
};

class derivedC:public derivedB
{
 public:
  void display()
  {
   ++value;
   cout<<value;
  }
};
int main()
{
 derivedC objC;
 objC.display();
 return 0; 
}


                
A)10
B)11
C)12
D)Compile time error
Q. 12) What will be output of the following program?

#include<iostream>
using namespace std;

class A
{
 public:
  int i,j;
  A(int a=2,int b=6)
  {
   i=2;
   j= ++b;
  }
  void show(void)
  {
   cout<<++j;
  }
  ~A(){}
}a;

class A1:public A
{
 public:
  void fun()
  {
   j--;
  }
  void show()
  {
   cout<< ++j;
  }
};

int main()
{
 A1 a1;
 a1.fun();
 a1.show();
 return 0; 
}


                
A)2
B)4
C)5
D)7
Q. 13) A queue Q of size 3 is used to take input from user and stack S is used to store the input values. The process takes place in such a way that for every new element to be added in the queue system checks if queue is full all the elements of queue are moved in stack and the new element will take first position in th queue. What will be the state of stack, S after the beolw operations?
Enqueue: 2 3 4, Delete top of S, Enqueue: 5 6
A)2 3 5 6
B)2 3
C)2 3 5
D)2 3 4
Q. 14) The pre-order traversal of a binary tree gives nodes with keys: A B C D E F G H. It's in-order traversal gives keys: C B D A E F H G. What is the post-order traversal?
A)C D B H G F E A
B)C D B G H E F A
C)C B D H G F E A
D)B C D G H E F A
Q. 15) Given two sorted list of size 'm' and 'n' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be.
A)m*n
B)max(m,n)
C)min(m,n)
D)m+n-1
Q. 16) A queue has been implemented with a linked list, keeping track of a front node and a rear node with two reference varables. Which of these reference variables will change durung an insertion into a NONEMPTY queue?
A)Only front changes
B)Only rear changes
C)Both changes
D)None of them changes
Q. 17) The main memory of a system is addressable by 32 bit address and the cache memory is consist of 512 blocks of 32 words each, for a total of 4K words. Then how many bits are there in TAG field?
A)14 bits
B)15 bits
C)16 bits
D)18 bits
Q. 18) For a system that uses FIFO page replacement policy, it has 4 page frames with no pages initially. The 50 distinct pages are first accessed in some order and then in its reverse order. How many page fault it will occur?
A)42
B)50
C)96
D)100
Q. 19) What is the maximum page fault rate for an effective access time of 400 nanoseconds, assuming that a dirty-page write occurs on 60 percent of all page faults? Considering usage of demand -paged virtual memory with a memory access time of 100 nanoseconds, and it takes 25 milliseconds to service a page fault with a dirty-page write and 10 milliseconds without a dirty-page write.
A)0.0025%
B)0.0020%
C)0.0031%
D)0.031%
Q. 20) Two fuctions CS_Entry() and CS_Exit() used to implement critical section of a process are realised using test-and-set instructions as follows:

void CS_Entry(X)
{
    while(test-and-set(X));
}
And

void CS_Exit(X)
{
    X=0;
}
Here X is a memory location associated with the CS.
Then, which one of the following statement is true?
A)It is a starvation free solution
B)It is a deadlock free solution
C)FIFO is used to enter the processes
D)Two processes can simultaneously enter the CS
Q. 21) Which of the following matching option is correct for the given table?
Port NumberDescription
I. 801. FTP
II. 1612. SNTP
III. 213. Telnet
IV. 234. HTTP
A)I-3,II-2,III-1,IV-4
B)I-1,II-3,III-4,IV-2
C)I-2,II-4,III-1,IV-3
D)I-4,II-2,III-1,IV-3
Q. 22) What is the name of the network topology in which there are bi-directional links between each possible node?
A)Ring
B)Star
C)Tree
D)Mesh
Q. 23) A network disigner wants to connect 5 routers as point-to-point simplex line.Then the total number of lines required would be.
A)5
B)10
C)20
D)32
Q. 24) Which of the following statements is/are false about the UNION?
A)The UNION operator sorts the selected result set.
B)The UNION operator behaves the same as the JOIN SQL clause.
C)The UNION operator cobines the results of two or more queries into a one result that include all the rows from the queries in the union.
D)All of the above.
Q. 25) Given:
Employee
EnoEnameJobCommSal
7788RajManger2008000
7369RamSalesman1005000
7521DeppakAnalyst506000
7892RahulManager3006000
Which of the following queries will result in the same output?

I) SELECT * from Employee where(sal>2000) AND (job='manager');
II) SELECT * from Employee where(job='manager') AND (sal=5000);
III) SELECT * from Employee where(job='manager') IN (sal>5000);
IV) SELECT * from Employee where(job='manager') IN (sal<>5000);

A)I and II
B)I,II and III
C)IV and III
D)II and III
After the first round the eliminated nearly half of the students on the basis of cumulative marks of Paper A and Paper B.
Round 2: In the second round they took a psychometric test. It was a pen-paper round and they eliminate some students too.So be carefull in this round.
Round 3: It was a Technical Interview and they eliminated some students after this round.
In the technical interview they asked a common question to all.
Write any program? So already preapare a program like (quick sort, merge sort, bst traversal etc.) for good impression.
Round 4: This was the final HR Interview.

Comments

Popular posts from this blog

How to Create a Namespace in Aerospike Database

                      T his post is about creating a namespace in Aerospike. I could not find any concrete method to create a namespace like create database in MySQL and MongoDB. So I am suggesting a way to create a namespace in Aerospike Database. Step-1: Locate config file aerospike.conf and open it in your favorite editor and make sure you have permission to modify the file. In my system the path of file /etc/aerospike/aerospike.conf (Default in Ubuntu). Here the content of the file. # Aerospike database configuration file. service { user root group root paxos-single-replica-limit 1 # Number of nodes where the replica pidfile /var/run/aerospike/asd.pid service-threads 4 transaction-queues 4 transaction-threads-per-queue 4 proto-fd-max 15000 } logging { # Log file must be an absolute path. file /var/log/aerospike/aerospike.log { context any info } } network { service { address any port 3000 } heartbeat { mode multicast address 239.1.99.222 p

java.lang.IllegalArgumentException: Could not instantiate implementation: org.janusgraph.diskstorage.cassandra.thrift.CassandraThriftStoreManager

If you are trying to get started with Janus Graph with Apache Cassandra. You may get the following error. Caused by: org.janusgraph.diskstorage.TemporaryBackendException: Temporary failure in storage backend at org.janusgraph.diskstorage.cassandra.thrift.CassandraThriftStoreManager.getCassandraPartitioner(CassandraThriftStoreManager.java:219) ~[janusgraph-cassandra-0.2.0.jar:na] at org.janusgraph.diskstorage.cassandra.thrift.CassandraThriftStoreManager.<init>(CassandraThriftStoreManager.java:198) ~[janusgraph-cassandra-0.2.0.jar:na] ... 48 common frames omitted Caused by: org.apache.thrift.transport.TTransportException: java.net.ConnectException: Connection refused (Connection refused) at org.apache.thrift.transport.TSocket.open(TSocket.java:187) ~[libthrift-0.9.2.jar:0.9.2] at org.apache.thrift.transport.TFramedTransport.open(TFramedTransport.java:81) ~[libthrift-0.9.2.jar:0.9.2] at org.janusgraph.diskstorage.cassandra.thrift.thriftpool.CTConnectionFactory.makeR

com.mongodb.MongoCommandException: Command failed with error 18: 'Authentication failed.' on server

If you are trying to connect Mongo DB Server and it insanely throwing following error. com.mongodb.MongoTimeoutException : Timed out after 1000 ms while waiting for a server that matches ReadPreferenceServerSelector{readPreference=primary}. Client view of cluster state is {type=UNKNOWN, servers=[{address=192.168.1.10:27010, type=UNKNOWN, state=CONNECTING, exception={ com.mongodb.MongoSecurityException: Exception authenticating MongoCredential {mechanism=null, userName='user123', source='admin', password=<hidden>, mechanismProperties={}}}, caused by {com.mongodb.MongoCommandException: Command failed with error 18 : 'Authentication failed.' on server 192.168.1.10:27010 . The full response is { "ok" : 0.0, "code" : 18, "errmsg" : "Authentication failed." }}}] If you start looking the error content First you encounter with Timeout Exception which may mislead you. It is basically an authentication error. I