Cognizant Interview Questions: Click Here
Cognizant Interview Questions: Click Here
© Copyright by Interviewbit
Contents
An applicant must have more than 60% marks in 10th and 12th (or diploma).
An applicant must have a minimum of 60% marks in graduation.
A er HSC(12th), but not a er SSC(10th), or between semesters of graduation, a
maximum interval of one year is permitted.
Graduation and post-graduation in BE, B Tech, ME, M Tech, MCA
At the time of the Cognizant selection process, a candidate should not have any
pending backlogs.
2. Interview rounds.
Section Topics
Based on their performances in skill-based assessment tests and interviews, one will
be selected for GENC NEXT, GENC ELEVATE, or GEN PRO profiles. Candidates should
have at least basic hands-on programming skills to qualify for the GenC Elevate
assessment, which should be substantiated by proof submitted during the self-
profiling procedure.
A er getting the required cut-off in the aptitude test/skill-based assessment test, the
candidates are selected for the technical interview round.
This is the most important round of the interview process. During this round, many
in-tenders are rejected. The goal is to maintain a pleasant and confident demeanor.
Interviews can be long and tedious, so remember to smile!
During the HR phase, the interview panel will ask you questions about your
personality, family background, education, interests, internships, work experience (if
applicable), and other topics. Make preparations to answer questions on internships,
projects, volunteerism, and extracurricular activities mentioned in your CV. There can
be questions related to the company - what are the products/services the company
offers, what are its core values, when it was formed, its organizational structure, and
so on.
You can never be too prepared when it comes to HR interview questions and
responses. The greatest thing you can do is develop a list of the most popular HR
interview questions and practice answering them. You should have the answers to
these questions at your fingertips. Another crucial thing to keep in mind while going
for an interview is to look and behave confidently. Keep in mind that you should not
lie or be overconfident. Having excellent body language can make all the difference.
Cognizant Company HR interview questions For Freshers and Experienced-
#include <iostream>
using namespace std;
int main()
{
char str[100];
int len = 0;
cout << "Enter a string: ";
cin >> str;
while(str[len] != '\0')
{
len++;
}
cout << "Length of the given string is: " << len;
cout << endl;
return 0;
}
#include <stdio.h>
int main(void)
{
// declaring the variables
int x;
float y;
char z;
printf("Address of x: %p\n", &x);
printf("Address of y: %p\n", &y);
printf("Address of z: %p\n", &z);
return 0;
}
Proactive Updates: These changes are made to the database before it is put
into use in the real-world environment.
Retroactive Updates: These updates are applied to a database a er it has been
operational in the real-world environment.
Simultaneous Updates: These updates are applied to the database at the same
moment as they become functional in the real-world environment.
GENERALIZATION SPECIALIZATION
The size of the schema gets The size of the schema gets
reduced in Generalization. increased in Specialization.
In Generalization, in order to
form a higher entity, the
In Specialization, lower
differences and similarities
entities are formed by
between lower entities are
splitting higher entities.
ignored and their union is
considered.
In the above queries, Column1, Column2, .. ColumnN denotes the name of the
columns to be added or updated. View_Name denotes the name of the view created
and Table_name denotes the name of the current table.
SJF is a non-preemptive
SRTF is a preemptive algorithm.
algorithm.
SJF results in
SRTF results in increased
comparatively lower
throughput as execution is faster.
throughput.
SJF reduces the average SRTF may or may not reduce the
waiting time for each average waiting time for each
process. process.
In dynamic loading, a routine is not loaded until it is called. This strategy is very
effective when dealing with vast quantities of code, such as error routines, that occur
infrequently. All routines are saved in a relocatable load format on the disk. The main
program is executed a er it has been loaded into memory. When a routine requires
to call another routine, the calling routine checks to verify if the other routine is
loaded first. If this is not the case, the relocatable linking loader is used to load the
requested routine into memory and update the program's address tables. The newly
loaded routine is then given control. In this way, dynamic loading helps in better
memory space utilization.
Caching is a technique for saving numerous copies of the most frequently used data
in a temporary storage area (or cache) so that they can be accessed more quickly. It
keeps data in a temporary format for so ware applications, servers, and web
browsers, so users don't have to download information every time they visit a
website or use an application.
Cached data works by saving data in a device's memory for later access. The data is
kept in the memory of a computer, directly below the central processing unit (CPU).
The primary cache level is incorporated into a device's microprocessor chip, followed
by two more secondary cache levels that feed the primary level. This information is
kept until the content's time to live (TTL), which specifies how long it should be
cached, expires or the device's disc or hard drive cache fills up.
Data is usually cached in one of two ways: browser or memory caching (data stored
locally on the computer) or Content Delivery Networks (data stored in geographically
distributed locations).
Plumbing/ Piping refers to the technique of using one program's output as an input
to another. For instance, Instead of delivering a folder or drive listing to the main
screen, it can be piped and delivered to a file, or sent to the printer to print a hard
copy.
A pipe is a type of redirection (the transfer of standard output to another location)
used in Linux and other Unix-like operating systems to transport the output of one
command/program/process to another for additional processing. The Unix/Linux
systems allow a command's stdout to be connected to another command's stdin.
The pipe character ‘|' can be used to do this.
Translation TLB (Transaction Look-aside Buffer) is a particular cache that keeps track
of recently used transactions. The TLB includes the most recently used page table
entries. The CPU analyses the TLB when given a virtual address. The frame number is
retrieved and the real address is created if a page table entry (TLB hit) is present. If a
page table entry is missing from the TLB (TLB miss), the page number is used as an
index while processing the page table. The TLB first checks if the page is already in
main memory; if it isn't, a page fault is generated, and the TLB is then modified to
incorporate the new page entry.
RSA DSA
DSA is slower in
RSA is faster in encryption but
encryption but faster in
slower in decryption as
decryption as compared
compared to DSA.
to RSA.
For routable protocols, brouters function at the network layer, while for non-routable
protocols, they operate at the data link layer. Brouters operate as routers for
routable protocols and bridges for non-routable protocols, handling both routable
and non-routable characteristics. Brouters are connecting devices in networking
systems that serve as both a network bridge and a router in the internetwork.
The Hamming code is a set of error-correction codes that can be used to detect and
fix errors that can arise when data is transferred or stored from one source to
another. Redundant bits are extra binary bits that are created and added to the data
transfer's information-carrying bits to ensure that no bits are lost during the data
transfer. A parity bit is a bit that is appended to binary data to verify that the total
number of 1s is even or odd. Error detection is done with parity bits. The Hamming
Code is essentially the use of additional parity bits to allow for error detection.
import java.io.*;
import java.util.*;
// Constructor
public InterviewBit(int num)
{
return "Element("
+ "number = " + num + ')';
}
public static void main(String[] args)
throws InterruptedException
{
Output:
Explanation:
The finalize method adds the items to the collection once and then resurrects them.
They have been marked as finalized and will not be queued again when they are
collected a second time.
# m.py
class A:
def func(self):
print ("func() is called")
In the code below, we use the above module (m) to change the behavior of func() at
runtime by assigning a new value.
import m
def monkey_func(self):
print ("monkey_func() is called")
Output:
monkey_func() is called
Explanation:
We have assigned the monkey_func to the address of “func” of class A. Thus, when
we call the “func” function of “ob”, the monkey function is called.
33. Write the code to add two numbers without using arithmetic
operators.
The sum of two bits can be found by executing an XOR (^) operation on the two bits. A
carry bit can be obtained by performing AND (&) on the two bits.
The logic shown below is a simple Half Adder that may be used to add two single bits.
This logic can be extended to integers. If there are no set bits at the same position(s)
in a and b, bitwise XOR (^) of a and b yields the sum of a and b. Bitwise AND (&) is used
to include common set bits as well. All carry bits are obtained by bitwise AND of a and
b. To acquire the needed result, we compute (a & b) << 1 and add it to a ^ b.
a = a ^ b;
#include <iostream>
using namespace std;
template<int n>
class PrintZeroToN
{
public:
static void display()
{
PrintZeroToN<n-1>::display(); // this should not be mistaken for recursion
cout << n << endl;
}
};
template<>
class PrintZeroToN<0>
{
public:
static void display()
{
cout << 0 << endl;
}
};
int main()
{
const int n = 100;
PrintZeroToN<n>::display();
return 0;
}
Explanation:
N is passed as a value rather than a data type in the above program. For each
parameter, a new instance of a generic class is constructed, and these classes are
created at compile time. When the compiler encounters the line
“PrintZeroToN<>::print()” with N = 100, it produces an instance PrintZeroToN<100>.
Another function PrintZeroToN<99>::print() is called in function
PrintZeroToN<100>::print(), resulting in the creation of an instance
PrintZeroToN<99>. All instances from PrintZeroToN<100> to PrintZeroToN<1> are
created in the same way. The function PrintZeroToN<0>::print() already exists and
prints 0. The PrintZeroToN<1> function prints 1 and so on. As a result, all numbers
from 0 to N are printed on the screen.
Css Interview Questions Laravel Interview Questions Asp Net Interview Questions