Scribd
Upload
11 views

Juspay pyq

The document outlines three questions related to directed graphs: the first involves deleting nodes to eliminate connections between a follower and a following node; the second checks for a connection between the two nodes; and the third calculates the minimum cost to reach from the follower to the following node in a weighted graph. Additionally, it lists various aptitude and technical questions, including topics like data structures, algorithms, and operating systems. The document serves as a guide for problem-solving in graph theory and related technical subjects.

Uploaded by

rohanrathod134
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
11 views

Juspay pyq

The document outlines three questions related to directed graphs: the first involves deleting nodes to eliminate connections between a follower and a following node; the second checks for a connection between the two nodes; and the third calculates the minimum cost to reach from the follower to the following node in a weighted graph. Additionally, it lists various aptitude and technical questions, including topics like data structures, algorithms, and operating systems. The document serves as a guide for problem-solving in graph theory and related technical subjects.

Uploaded by

rohanrathod134
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
You are on page 1/ 3

First Question:

There will be a directed graph, a follower node and following node. Both nodes belongs to
given directed graph. Task is to delete minimum no of nodes so that there will be no
connection between follower and following node. We have to print all those nodes which
will be deleted.

Second Question :

A
There will be a directed graph, a follower node and following node. Both nodes belongs to
given directed graph. Task is to find whether there is a connection between these two nodes

N
or not. If there is a connection print ‘1’ else print ‘0’

SA
Third Question :

There will be a weighted directed graph, a follower node and following node. Both nodes
belongs to given directed graph. Task is based on weights we have to find minimum cost for

PA
reaching from follower node to following node. Print total amount of minimum weight.
U
CHECK THIS VIDEO (NO MOTIVE OF PROMOTING CHEATING, GOT THIS FROM QUORA)
https://www.youtube.com/watch?v=00AsbYJnmdk
H
IT

1.1 Aptitude-based — 20 Question


W

1. Order and Ranking — 3 Question​

2. Encoding and Decoding — 2 Question​


H

3. Direction Test — 2 question​


C

4. Blood Relation — 3 Question​


TE

5. Seating Arrangement ( linear and Circular) — 3 Question​

6. Puzzle (Floor Puzzle) — 2 Question​

7. Statement based( Sufficient/Insufficient) — 2 Question​

8. Series Based — 3 Question


1.2 Technical Based — 10 Question

DSA Based​

1. Array​

2. Linked list​

3. Complexity based (Space Complexity)​

A
4. BST​

N
5. AVL Tree​

SA
6. Dynamic Programming ( BFS )​

7. Graph​

PA
8. Heap
U
C++ Code Based​
H

1. Code Output​
IT

2. Fill in the blank ( Function syntax)


W

Algorithm-Based:
H
C

1.​ Huffman Coding


TE

2.​ Traveling Salesman Problem

3.​ 0/1 Knapsack Problem

4.​ Hashing

5.​ Floyd-warshall
6.​ Residual graph ford Fulkerson

7.​ Euclidean algorithm

OS (Operating System Based):​

1. Distributed OS examples​

A
2. OS ( Windows/MacOS/Linux)​

N
3. Fragmentation​

SA
4. File System​

PA
5. CPU Scheduling​

6. BIOS System
U
H
Scenario Based
IT
W

1.​ Database Security Related

2.​ Deadlock Detection


H
C
TE

You might also like