SOUMEN ATTA
UNIVERSITY OF KALYANI
Followers: 0 Following: 0
Statistics
RANK
12,557
of 300,853
REPUTATION
2
CONTRIBUTIONS
4 Questions
1 Answer
ANSWER ACCEPTANCE
25.0%
VOTES RECEIVED
1
RANK
of 21,094
REPUTATION
N/A
AVERAGE RATING
0.00
CONTRIBUTIONS
0 Files
DOWNLOADS
0
ALL TIME DOWNLOADS
0
RANK
of 171,319
CONTRIBUTIONS
0 Problems
0 Solutions
SCORE
0
NUMBER OF BADGES
0
CONTRIBUTIONS
0 Posts
CONTRIBUTIONS
0 Public Channels
AVERAGE RATING
CONTRIBUTIONS
0 Discussions
AVERAGE NO. OF LIKES
Feeds
Given a=[1 2 3 4 5], generate m=[2 1 3 4 5; 2 3 1 4 5; 2 3 4 1 5; 2 3 4 5 1; 1 3 2 4 5; 1 3 4 2 5; 1 3 4 5 2; 1 2 4 3 5; 1 2 4 5 3; 1 2 3 5 4].
Please find the answer of the question asked by me. Given a=[1 2 3 4 5], generate m=[2 1 3 4 5; 2 3 1 4 5; 2 3 4 1 5; 2 3 4 ...
10 years ago | 1
| accepted
Question
Given a=[1 2 3 4 5], generate m=[2 1 3 4 5; 2 3 1 4 5; 2 3 4 1 5; 2 3 4 5 1; 1 3 2 4 5; 1 3 4 2 5; 1 3 4 5 2; 1 2 4 3 5; 1 2 4 5 3; 1 2 3 5 4].
Given a=[1 2 3 4 5], generate m=[2 1 3 4 5; 2 3 1 4 5; 2 3 4 1 5; 2 3 4 5 1; 1 3 2 4 5; 1 3 ...
10 years ago | 1 answer | 0
1
answerQuestion
Find the longest path in a graph?
Adjacency matrix of graph is given to us. Now we need to find out the longest path between two nodes. Input: Adjacency matrix ...
13 years ago | 2 answers | 0
2
answersQuestion
Identification of Row-wise bi-cluster
The row wise bi-clusters are stored in a vector. Each location of a vector represents a bi-cluster having the information of c...
14 years ago | 0 answers | 0
0
answersQuestion
BiSim Algorithm Implementation
I need BiSim Algorithm implementation...
14 years ago | 0 answers | 0
