0% found this document useful (0 votes)
32 views5 pages

Persistent Aptitude Test Overview

The document provides an overview of the sections and topics covered in an aptitude test for a software engineering role. It includes the following sections: 1. Quantitative aptitude, verbal/English, reasoning, technical skills, coding, essay writing, and group discussion sections with allocated times. 2. C, C++, Java, DBMS, networking, operating systems, software engineering, and coding questions that may be asked. 3. HR questions related to relocation, hobbies, work experience, problem solving, and puzzles that could be posed in an interview.

Uploaded by

nitish kumar
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
32 views5 pages

Persistent Aptitude Test Overview

The document provides an overview of the sections and topics covered in an aptitude test for a software engineering role. It includes the following sections: 1. Quantitative aptitude, verbal/English, reasoning, technical skills, coding, essay writing, and group discussion sections with allocated times. 2. C, C++, Java, DBMS, networking, operating systems, software engineering, and coding questions that may be asked. 3. HR questions related to relocation, hobbies, work experience, problem solving, and puzzles that could be posed in an interview.

Uploaded by

nitish kumar
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Aptitude

1. Quantitative Aptitude (Time, Distance, Work, Allegation, Interest Calculation,


Relative speed, circular motion, average, profit and loss, pipes and cisterns) (5)
2. Verbal Ability/ English (Basic, Prepositions and Articles)
3. Reasoning (Decision making using some data given)(5)
4. Technical (50)
5. Coding (Language not specified) (1)
6. Essay Writing(1) Holiday planning, about yourself
7. GD (1)(Demonetization, online transaction, digital India, Village or city, They will
give a word you have to say something related to that, Convince me, rapid fire )

Time
Quantitative Aptitude+ Technical+ English=60ins
Coding: 20mins
Essay Writing: 10mins
GD: 10mins
C
1. What is dynamic memory allocation?
2. Write a c program for Pascal triangle.
3. Write a C program to find the smallest and second smallest number in an array in a
single loop
4. Write a C a program to read a file containing C code and correct the indentation.
5. Say a string abbcccdddd… is given as input; write a code to print it in the form
1a2b3c4d…
6. Write a c program find root of a cubic equation
7. Write a Program to generate Fibonacci series recursively.
8. What are the difference between calloc () and malloc()
9. Write a C code to print Floyd’s triangle.
10. Write a C code to convert Hex character to an integer.
11. Write a Fibonacci series up to n term. Try to decrease the complexity of the code.
12. Write a C program to remove redundant spaces from a file
13. Write a C program to remove comments from a C source file
14. Write a program to convert hex to decimal
15. Pointer questions

DS & ALGO
1. Linked Lists: Creation, Insertion, Reversing
2. Checking whether a list is circular in between.
3. How can we implement stack using two queues. Explain.

1
4. Explain Insertion sort algorithm.
5. Double Linked List.
6. How will you find 2nd last node in a linked list if no. of nodes is not known?
7. What is an array?
8. What is linked list?
9. Write a program to count the number of nodes in a linked list(recursive)
10. Write a program to delete the nth last node of a SLL.
11. What is tree?
12. Given a set of elements, construct a BST.
13. Deletion operation in BST.
14. What is Hashing?
15. Why we use hashing?
16. What is Time Complexity? What is O-Notation?
17. Flyod warshall
18. Trie data structure
19. Bellman ford
20. Dikstra's algo
21. Binary search
22. Complexity calculation

C++
1. C++ code snippets

JAVA
1. What is overloading? Explain with example.
2. What is polymorphism? What are different types of polymorphism? Explain with
example.
3. What is overriding .explain with example?
4. Write a JAVA program to print words from a string in reverse order.
5. What are the differences between method Overloading and method Overriding.
6. What is the difference between Process and Threads.
7. Give an example of Run time polymorphism example using code.
8. OOPS concepts with real life examples.
9. MVC architecture.
10. JAVA vs. C
11. interface and abstract classes
12. Does java support multiple inheritance and how
13. Java code snippets
14. Lambda function

2
Advanced JAVA
1. Define Servlet.
2. JSP vs. HTML page.
3. get vs. post
4. Database connectivity code

DBMS
1. Normalization in DBMS(1NF, 2NF, 3NF, BCNF), problems with unnormalized relation
(with examples)
2. SQL queries
3. Difference between 3 NF and 3.5 NF
4. Terms like entities, relation etc.
5. SQL queries to find 22nd highest salary
6. ACID props.

NETWORKING
1. WHAT IS DNS?
2. What actually happens when you write [Link] in a browser?
3. Difference between IPv4 and IPv6. Draw the header of IPv4.
4. Write down the OSI model
5. Explain functions of each layer of OSI model
6. Write down TCP/IP Model

OS
1. PRACTICAL APPLICATION OF OF ROUND ROBIN ALGO.
2. Deadlock(Necessary and sufficient condition for deadlock), What causes deadlock
.Thrashing
3. Semaphore.
4. Basic commands used in LINUX along with their uses
5. What is paging?

Software Engineering
1. What are the different types of testing?
2. sdlc

Others
1. Difference between Windows and Linux.

3
Coding
1. Sum of Digits
2. First occurrence of a negative number in all subsequence of k size in an array of size n
3. Finding the substring and replace it
4. BUBBLIE SORT OF STRING USING MALLOC
5. File related program
6. Comments removal
7. Code alignment
8. Arrange k elements of the array in ascending and the remaining elements in descending
order.
9. An array is given and a discount rate is given. We need to count the number of elements
by which the discount rate is divisible.
10. Two strings taken as input, check if string1 can be formed by right shifting string 2. If yes
print 1, if no print -1. Constraints - all alphabets must be of lowercase
11. Print the words which occur more than one time in a sentence.
12. Count the occurrence of the second string in the first string.

Advance Coding:
1. Given a square matrix we need to sort the diagonal elements and print the modified matrix
2. A problem based on the concept of disjoint set.
3. Number of ways to get the longest sub-segment of ‘1’s formed by changing at most k ‘0’s
in a string.
4. To calculate the number of straight lines required so that all the given co-ordinates will be
traversed from a given starting point.
5. Minimum number of rotations required (either left or right) to obtain the longest common
prefix between two given strings. Only 1 string can be rotated.

Project
1. Final year project basic ideas

HR

1. Are you OK in relocating, What will be your criteria for selecting a company if you
get job in two companies
2. What was the last movie you watched, What was the movie about, What was the
last book you read, What was the story about. fav movie
3. INTRODUCE YOURSELF? DO YOU HAVE ANY LOCATION PREFERENCE
Which one u prefer most READING BOOKS OR WATCHING MOVIES?
4. If you are placed in some other company in Kolkata itself, what would you do?

4
5. About yourself, about your family, why Persistent, why CSE, why you so passionate
about coding,
6. How will you manage in a totally new place
7. if I'm allowed to hire only one person then whom should I hire?(there was 3
candidates in the room)why should I reject them?, tell me about yourself?, why
persistent?, family background? about hobbies, about native place.
8. Tell me about yourself, hobbies, book you read, describe it, how was your day?
9. Stress interview - 3 at once - Tell me why I should reject the other two candidates
10. Movie/Book ?Had to tell him a short synopsis of our favorite Movie/Book
11. Tell me something about your family
12. Why should I hire you?
13. What is the meaning of your name?

PUZZLE

1. What is the meaning of your name?


2. Only one person can enter the room.
3. a puzzle on river crossing as in there are 4 persons and a boat only 2 of them can to
calculate the time required to take them on the other side.

Common questions

Powered by AI

The OSI model consists of seven layers: Physical, Data Link, Network, Transport, Session, Presentation, and Application. Each layer has a specific function, from physical transmission (Physical Layer) to data format translation (Presentation Layer) and service provision to applications (Application Layer). Data encapsulation occurs as data moves from the Application Layer, receiving protocol-specific headers at each subsequent layer, to the Physical Layer for transmission and is de-encapsulated in reverse upon receipt .

A stack can be implemented using two queues by maintaining two queues: one for normal insertions and one for reversing order during pop operations. This approach allows FIFO behavior of queues to simulate LIFO stack behavior. During push, elements are enqueued into the first queue. For pop, elements are dequeued from the first queue and enqueued into the second queue until one element is left, which is dequeued as the stack's top element. This simulation addresses limitations of direct stack data handling where lack of native stack support requires using basic operations instead .

Converting a linked list to a BST poses challenges due to the linear nature of lists and hierarchical tree requirements. An efficient method involves finding the middle element to serve as the root, recursively applying this logic to the sublists (left and right) to balance the BST. This approach leverages the sorted nature of lists to directly translate node positions into tree levels, optimizing both the conversion time (O(n)) and ensuring balanced height, crucial for performance .

Hashing is significant in data structures for enabling efficient data retrieval through an index. By converting a key into a hash value which serves as an index to access the data, hashing facilitates operations like search, insert, and delete with average time complexity approaching O(1), making it ideal for applications requiring high-speed retrieval of stored information, such as databases and caches .

Method polymorphism in Java, through overloading and overriding, greatly enhances code maintainability and flexibility. By allowing methods to function differently based on input parameters (overloading) and enabling subclasses to define specific behaviors (overriding), polymorphism supports extensible and adaptable code. For instance, a Shape class could have an overridden draw() method, allowing for specific rendering code per shape subclass. This flexibility reduces the need for conditional statements, making code easier to understand and maintain .

ACID properties—Atomicity, Consistency, Isolation, Durability—ensure reliable database transactions. Atomicity guarantees transactions are fully completed or not executed at all. Consistency ensures data integrity by transitioning from one valid state to another. Isolation prevents concurrent transactions from interfering with each other, and Durability ensures that once a transaction is committed, it remains so even in case of a system failure. These properties collectively maintain data integrity and reliability .

Deadlock in operating systems is a state where a set of processes are unable to proceed because each process is waiting for resources held by another. Necessary conditions include mutual exclusion (only one process can use a resource at a time), hold and wait (processes holding resources can request additional resources), no preemption (resources cannot be forcibly taken from processes), and circular wait (a closed chain of resource-dependent processes exists).

IPv4 and IPv6 are IP addressing protocols differing mainly in address length—IPv4 is a 32-bit address system allowing around 4.3 billion addresses, while IPv6 uses a 128-bit system, vastly increasing address space. IPv6 provides simplified packet headers, improved security features, and better support for mobile and wireless devices. However, compatibility issues and transition complexities remain drawbacks, especially in regions where IPv4 infrastructure is deeply embedded .

calloc() and malloc() are both used for memory allocation in C, but differ in how they initialize memory. malloc() allocates a block of memory of a specified size but does not initialize it. This means the memory contains garbage values. In contrast, calloc() allocates memory for an array of elements, initializes all bits to zero, making it suitable for applications where zero-initialization is needed, such as initializing arrays of structs .

Method overloading in Java occurs when multiple methods share the same name with different parameters within the same class, enabling compile-time polymorphism. For instance, a Print class could have overloaded print methods accepting different data types. Method overriding involves redefining a parent class method in its subclass, supporting runtime polymorphism—useful in scenarios where subclass-specific behavior is required, as in GUI event handling .

You might also like