The IBM placement exam is a test given to candidates who are applying for a job at IBM. It is a written test that assesses the candidate's knowledge and skills in various areas such as programming, data structures, algorithms, and logical reasoning.
Preparing for the IBM placement exam can be a daunting task, but with the right set of preparation tips and strategies, you can ace the test with ease. To prepare for the exam, it is important to have complete guidelines and a solid plan in place. You should start by familiarizing yourself with the format of the test and the types of questions that will be asked.
In addition to this, it is advisable to practice with placement exam practice questions that are similar to those that will appear on the actual exam. This will help you to build your confidence and improve your performance.
To crack the IBM placement exam, it is also important to focus on best practices that are proven to be effective. This includes developing a study schedule that allows you to cover all the topics in the syllabus and allocating enough time for revision. Additionally, seeking advice from experts who have successfully passed the exam can provide valuable insights and tips for your preparation.
When registering for the IBM placement exam, it is important to follow the registration process carefully and ensure that all necessary information is provided accurately. Cheating in the placement exam is not only unethical but also a violation of the company's policies. It is important to approach the exam with integrity and demonstrate your skills and knowledge with honesty. By following these tips and strategies, you can increase your chances of cracking the IBM placement exam and securing a rewarding career at this globally renowned technology company.
1.Access to job opportunities with IBM, a globally recognized and respected technology company.
2.The opportunity to showcase your coding and problem-solving abilities to a reputable organization and gain recognition in the industry.
3.Hands-on experience in a competitive and high-pressure environment, which can help to develop skills and enhance your resume.
4.A chance to kick-start a successful career in the technology industry by joining IBM.
5.Networking opportunities with industry professionals and experts from IBM, who can provide valuable guidance and advice on your career journey.
6.The ability to stay current with the latest technologies and techniques used in the industry by learning from IBM's experts.
7.The opportunity to benchmark yourself against other talented and motivated individuals from around the world.
8.The potential to enhance your critical thinking and problem-solving skills in a real-world setting.
9.The ability to gain a competitive edge when applying for jobs or internships at other companies by having IBM on your resume.Eligibility criteria for IBM Exam
•Class 10th standard: Candidates must have a minimum of 60% or above in their class 10th exams.
•Graduation: Candidates must have a minimum of 65% or above in their graduation degree or a minimum of 6.5 CGPA.
•Year of passing: The candidate should have passed their graduation in the year 2023 or later.
•Qualification Required: The candidate should possess a Bachelor's or Master's degree in Engineering (B.E./B.Tech./M.E./M.Tech.), Computer Applications (BCA/MCA), or Science (BSC/MSC).
It is important to note that the above-mentioned criteria are the minimum requirements and meeting them does not guarantee a candidate's selection. Candidates are also subject to clear other selection rounds like aptitude test, Technical test, Group Discussion, and Personal Interview.
IBM is known for hiring the best and the brightest talent. The eligibility criteria for the IBM placement exam are designed to ensure that only the most qualified and motivated candidates are considered for the job. By adhering to the above criteria, candidates can ensure that they have a strong chance of success in the IBM placement exam.
Cognitive Ability Games:
1. Assess Problem Solving
2. Shortcuts
3. Gridlock
4. Resemble
Assess Numerical Reasoning
1. Tally Up
2. Numbubbles
Assess Verbal knowledge
1. Proof it
Psychometric Test
You have to Answer questions as-
Strongly Agree
Agree
Neutral
Disagree
Strongly Disagree
No. of Questions: 50
Total Time Limit: 30 Min
English Language Test
Questions on Active/Passive Voice
Questions on Fill in The Blanks
Spotting Error
Spelling
Synonyms
Antonyms
Preposition and Conjunctions
Tenses and Articles
Total Number of Questions: 10
Total Time: 10 Min
Coding
DBMS
OS
OOPS
Programming Etc
Number of Question: 6
Time Limit : 30 min
The IBM Exam Pattern for both profiles includes an interview round as the final stage of the selection process. This round is a combination of technical and HR questions and may include coding questions as well. Candidates who have cleared the written test and other rounds are eligible to appear for the interview round.
The interview round is divided into two parts:
#Question 1
Explain function overloading and function overriding in the context of C++ programming language. Differentiate between them.
#Question 1
Given an array of integers, find the pair of integers that have the smallest absolute difference between them. For example, given the array [1, 3, 15, 11, 2], the pair (1, 2) has the smallest absolute difference of 1.
#Solution 1
```sh
def smallest_difference(arr):
arr.sort()
min_diff = float(‘inf’)
min_pair = None
for i in range(len(arr) - 1):
diff = abs(arr[i] - arr[i + 1])
if diff < min_diff:
min_diff = diff
min_pair = (arr[i], arr[i + 1])
return min_pair
print(smallest_difference([1, 3, 15, 11, 2])) # (1, 2)
```
#Question 2
What do you know about the ACID properties of a transaction in the context of a database management system?
#Question 2
Given a binary tree, write a function to check whether it is a binary search tree.
#Solution 2
```sh
class Node:
def init(self, data):
self.data = data
self.left = None
self.right = None
def is_bst(node, left=None, right=None):
if node is None:
return True
if left is not None and node.data <= left.data:
return False
if right is not None and node.data >= right.data:
return False
return is_bst(node.left, left, node) and is_bst(node.right, node, right)
root = Node(5)
root.left = Node(3)
root.right = Node(7)
root.right.left = Node(6)
root.right.right = Node(8)
print(is_bst(root)) # True
```
#Question 3
Explain various types of LOCK used in Informatica MDM 10.1?
#Question 3
Given a string, write a function to check if it is a permutation of a palindrome.
#Answer 3
```sh
def is_palindrome_permutation(s):
s = s.replace(" ", “”)
s = s.lower()
char_count = {}
for c in s:
if c in char_count:
char_count[c] += 1
else:
char_count[c] = 1
odd_count = 0
for count in char_count.values():
if count % 2 == 1:
odd_count += 1
return odd_count <= 1
print(is_palindrome_permutation(“Tact Coa”)) # True
```
#Question 4
Given a list of integers, write a function that returns the largest sum of non-adjacent numbers. For example, [2, 4, 6, 2, 5] should return 13, since we pick 2, 6, 5.
#Answer 4
```sh
def largest_sum(arr):
if not arr:
return 0
if len(arr) == 1:
return arr[0]
previous_max = arr[0]
current_max = max(arr[0], arr[1])
for i in range(2, len(arr)):
temp = current_max
current_max = max(previous_max + arr[i], current_max)
previous_max = temp
return current_max
print(largest_sum([2, 4,
```
#Question 5
Given a 2D matrix of integers, write a function that rotates the matrix by 90 degrees clockwise.
#Solution 5
```sh
def rotate_matrix(matrix):
n = len(matrix)
for i in range(n // 2):
for j in range(i, n - i - 1):
temp = matrix[i][j]
matrix[i][j] = matrix[n - 1 - j][i]
matrix[n - 1 - j][i] = matrix[n - 1 - i][n - 1 - j]
matrix[n - 1 - i][n - 1 - j] = matrix[j][n - 1 - i]
matrix[j][n - 1 - i] = temp
return matrix
matrix = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
rotated_matrix = rotate_matrix(matrix)
for row in rotated_matrix:
print(row)
```
```sh
Output:
[7, 4, 1]
[8, 5, 2]
[9, 6, 3]
```
Note: The above function assumes that the matrix is square and not empty.
#Question 1
Explain function overloading and function overriding in the context of C++ programming language. Differentiate between them.
#Question 1
Given an array of integers, find the pair of integers that have the smallest absolute difference between them. For example, given the array [1, 3, 15, 11, 2], the pair (1, 2) has the smallest absolute difference of 1.
#Solution 1
```sh
def smallest_difference(arr):
arr.sort()
min_diff = float(‘inf’)
min_pair = None
for i in range(len(arr) - 1):
diff = abs(arr[i] - arr[i + 1])
if diff < min_diff:
min_diff = diff
min_pair = (arr[i], arr[i + 1])
return min_pair
print(smallest_difference([1, 3, 15, 11, 2])) # (1, 2)
```
#Question 2
What do you know about the ACID properties of a transaction in the context of a database management system?
#Question 2
Given a binary tree, write a function to check whether it is a binary search tree.
#Solution 2
```sh
class Node:
def init(self, data):
self.data = data
self.left = None
self.right = None
def is_bst(node, left=None, right=None):
if node is None:
return True
if left is not None and node.data <= left.data:
return False
if right is not None and node.data >= right.data:
return False
return is_bst(node.left, left, node) and is_bst(node.right, node, right)
root = Node(5)
root.left = Node(3)
root.right = Node(7)
root.right.left = Node(6)
root.right.right = Node(8)
print(is_bst(root)) # True
```
#Question 3
Explain various types of LOCK used in Informatica MDM 10.1?
#Question 3
Given a string, write a function to check if it is a permutation of a palindrome.
#Answer 3
```sh
def is_palindrome_permutation(s):
s = s.replace(" ", “”)
s = s.lower()
char_count = {}
for c in s:
if c in char_count:
char_count[c] += 1
else:
char_count[c] = 1
odd_count = 0
for count in char_count.values():
if count % 2 == 1:
odd_count += 1
return odd_count <= 1
print(is_palindrome_permutation(“Tact Coa”)) # True
```
#Question 4
Given a list of integers, write a function that returns the largest sum of non-adjacent numbers. For example, [2, 4, 6, 2, 5] should return 13, since we pick 2, 6, 5.
#Answer 4
```sh
def largest_sum(arr):
if not arr:
return 0
if len(arr) == 1:
return arr[0]
previous_max = arr[0]
current_max = max(arr[0], arr[1])
for i in range(2, len(arr)):
temp = current_max
current_max = max(previous_max + arr[i], current_max)
previous_max = temp
return current_max
print(largest_sum([2, 4,
```
#Question 5
Given a 2D matrix of integers, write a function that rotates the matrix by 90 degrees clockwise.
#Solution 5
```sh
def rotate_matrix(matrix):
n = len(matrix)
for i in range(n // 2):
for j in range(i, n - i - 1):
temp = matrix[i][j]
matrix[i][j] = matrix[n - 1 - j][i]
matrix[n - 1 - j][i] = matrix[n - 1 - i][n - 1 - j]
matrix[n - 1 - i][n - 1 - j] = matrix[j][n - 1 - i]
matrix[j][n - 1 - i] = temp
return matrix
matrix = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
rotated_matrix = rotate_matrix(matrix)
for row in rotated_matrix:
print(row)
```
```sh
Output:
[7, 4, 1]
[8, 5, 2]
[9, 6, 3]
```
Note: The above function assumes that the matrix is square and not empty.
I started practising on Edyst platform since my 3rd year of college focused on placements & always liked the way they helped us when we were stuck at a particular problem.
Thank you, Edyst for all the assistance and amazing support!
Being a mechanical student and getting into an IT company is very tough. One of the main reason I could able to crack TCS CodeVita is because of Edyst.
Aneeq sir, your doubt clearing sessions, daily assignments & incredible mentors support really brushed up my skills.
When I joined the Edyst courses I received personalized mentoring on how to crack coding rounds of different companies. Through a combination of coding skills and great projects, I received multiple offers above 6+ lakhs per annum. Finally I joined for 8+ Lakhs package. Thanks for all the support, from Edyst Team.
Edyst's training style completely resonated with me. I approached programming as more than a subject. Thanks to Edyst team for the guidance!
#Question 1
Explain function overloading and function overriding in the context of C++ programming language. Differentiate between them.
#Question 1
Given an array of integers, find the pair of integers that have the smallest absolute difference between them. For example, given the array [1, 3, 15, 11, 2], the pair (1, 2) has the smallest absolute difference of 1.
#Solution 1
```sh
def smallest_difference(arr):
arr.sort()
min_diff = float(‘inf’)
min_pair = None
for i in range(len(arr) - 1):
diff = abs(arr[i] - arr[i + 1])
if diff < min_diff:
min_diff = diff
min_pair = (arr[i], arr[i + 1])
return min_pair
print(smallest_difference([1, 3, 15, 11, 2])) # (1, 2)
```
#Question 2
What do you know about the ACID properties of a transaction in the context of a database management system?
#Question 2
Given a binary tree, write a function to check whether it is a binary search tree.
#Solution 2
```sh
class Node:
def init(self, data):
self.data = data
self.left = None
self.right = None
def is_bst(node, left=None, right=None):
if node is None:
return True
if left is not None and node.data <= left.data:
return False
if right is not None and node.data >= right.data:
return False
return is_bst(node.left, left, node) and is_bst(node.right, node, right)
root = Node(5)
root.left = Node(3)
root.right = Node(7)
root.right.left = Node(6)
root.right.right = Node(8)
print(is_bst(root)) # True
```
#Question 3
Explain various types of LOCK used in Informatica MDM 10.1?
#Question 3
Given a string, write a function to check if it is a permutation of a palindrome.
#Answer 3
```sh
def is_palindrome_permutation(s):
s = s.replace(" ", “”)
s = s.lower()
char_count = {}
for c in s:
if c in char_count:
char_count[c] += 1
else:
char_count[c] = 1
odd_count = 0
for count in char_count.values():
if count % 2 == 1:
odd_count += 1
return odd_count <= 1
print(is_palindrome_permutation(“Tact Coa”)) # True
```
#Question 4
Given a list of integers, write a function that returns the largest sum of non-adjacent numbers. For example, [2, 4, 6, 2, 5] should return 13, since we pick 2, 6, 5.
#Answer 4
```sh
def largest_sum(arr):
if not arr:
return 0
if len(arr) == 1:
return arr[0]
previous_max = arr[0]
current_max = max(arr[0], arr[1])
for i in range(2, len(arr)):
temp = current_max
current_max = max(previous_max + arr[i], current_max)
previous_max = temp
return current_max
print(largest_sum([2, 4,
```
#Question 5
Given a 2D matrix of integers, write a function that rotates the matrix by 90 degrees clockwise.
#Solution 5
```sh
def rotate_matrix(matrix):
n = len(matrix)
for i in range(n // 2):
for j in range(i, n - i - 1):
temp = matrix[i][j]
matrix[i][j] = matrix[n - 1 - j][i]
matrix[n - 1 - j][i] = matrix[n - 1 - i][n - 1 - j]
matrix[n - 1 - i][n - 1 - j] = matrix[j][n - 1 - i]
matrix[j][n - 1 - i] = temp
return matrix
matrix = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
rotated_matrix = rotate_matrix(matrix)
for row in rotated_matrix:
print(row)
```
```sh
Output:
[7, 4, 1]
[8, 5, 2]
[9, 6, 3]
```
Note: The above function assumes that the matrix is square and not empty.