Cognizant GenC Interview Questions, Process, and Tips

I am comfortable in multiple programming languages including Python, Java, and C++.

• Python

• Java

• C++

Recursion is a process in which a function calls itself as a subroutine.

• Recursion is used to solve problems that can be broken down into smaller, simpler problems.

• It involves a base case and a recursive case.

• Examples include factorial, Fibonacci sequence, and binary search.

• Recursion can be memory-intensive and may cause stack overflow if not implemented properly.

Recursion is a process in which a function calls itself as a subroutine.

• Recursion can be used to solve problems that can be broken down into smaller sub-problems of the same type.

• It is important to have a base case to prevent infinite recursion.

• Examples of recursive functions include factorial, Fibonacci sequence, and binary search.

• Recursion can also be used to traverse data structures such as trees and graphs.

Infix notation is a mathematical notation where operators are placed between operands.

• Infix notation is the most commonly used notation in mathematics.

• In infix notation, operators are placed between operands.

• Infix notation is used in programming languages like C, Java, and Python.

• Examples of infix notation include 2 + 3, 4 * 5, and 6 / 2.

Prefix notation is a way of writing mathematical expressions where the operator comes before the operands.

• Also known as Polish notation

• Example: + 2 3 is equivalent to 2 + 3

• Useful in computer science for evaluating expressions

• Requires less parentheses than infix notation

Converting infix expression to prefix notation.

• Reverse the infix expression

• Replace '(' with ')' and vice versa

• Apply postfix to the modified infix expression

• Reverse the postfix expression to get prefix expression

Arrays are contiguous blocks of memory while linked lists are nodes linked by pointers.

• Arrays have fixed size while linked lists can grow dynamically.

• Insertion and deletion are faster in linked lists than in arrays.

• Arrays have direct access to elements while linked lists need to traverse from the beginning.

• Arrays are better for random access while linked lists are better for sequential access.

• Examples of arrays: int[] ...read more

The OSI model has 7 layers that define how data is transmitted over a network.

• The layers are: Physical, Data Link, Network, Transport, Session, Presentation, and Application.

• Each layer has a specific function and communicates with the layers above and below it.

• For example, the Physical layer deals with the physical transmission of data, while the Application layer deals with user interfaces and applications.

• The OSI mod...read more

TCP/IP model is a networking protocol that defines how data is transmitted over the internet.

• TCP/IP model has four layers: application, transport, internet, and network access.

• Each layer has its own set of protocols and functions.

• TCP/IP model is used for communication between devices on the internet.

• Examples of protocols used in TCP/IP model include HTTP, FTP, TCP, and IP.

Operator overloading is the ability to redefine operators for custom classes.

• Allows operators to be used with custom classes

• Enables the use of familiar operators with custom classes

• Can improve code readability and reduce complexity

• Example: overloading the + operator for a custom Vector class to add two vectors

Program to find the maximum value from an array of strings.

• Convert the array elements to integers using parseInt()

• Use Math.max() to find the maximum value

• Handle empty arrays

Arrays are fixed in size and hold elements of the same data type, while lists are dynamic and can hold elements of different data types.

• Arrays are declared with a fixed size, while lists can grow or shrink dynamically.

• Arrays can only hold elements of the same data type, while lists can hold elements of different data types.

• Arrays are accessed using an index, while lists are accessed using an iterator.

• Example: int[] arr