Pijush Kanti Kumar is presently working as Asst. Prof in Information Technology in Govt. College of Engineering and Textile Technology, Serampore, Hooghly. He completed his M.Tech in Computer Science
International Journal of Computer Science and Mobile Computing, 2022
Data is the new fuel. With the expansion of the global technology, the in-creasing standards of l... more Data is the new fuel. With the expansion of the global technology, the in-creasing standards of living and with modernization, data values have caught a great height. Now a days, nearly all top MNCs feed on data. Now, to store all this data is a prime concern for all of them, which is relieved by the Data Structures, the systematic way of storing data. Now, once these data are stored and charged in secure vaults, it’s time to utilize them in the most efficient way. Now, there are a lot of operations that needs to be performed on these massive chunks of data, like searching, sorting, inserting, deleting, merging and so more. In this paper, we would be comparing all the major sorting algorithms that have prevailed till date. Further, work have been done and an inequality in dimension of time between the four Sorting algorithms, Bubble, Selection, Insertion, Merge, that have been discussed in the paper have been proposed.
International Journal of Computer Science and Mobile Computing
Shortest path algorithm. Graphs are an example of non-linear data structure. A graph is a collect... more Shortest path algorithm. Graphs are an example of non-linear data structure. A graph is a collection of nodes which are connected by edges. The definition of graph G = (V, E) is basically a collection of vertices and edges. Graphs can be classified on the basis of types of edges. Directed graphs have each of the edges directed which means the edges connecting the two nodes defines the way it is connected from and to. On the other side, undirected graphs have edges which have no direction. The edges of a graph have weights which are associated with it. The weight of an edge can be thought as the cost of the edge. Let’s assume there are two vertices representing two cities, then the weight of the edge between the vertices may represent the distance between the cities. Given a given graph and a particular node, we can find a path of least total weight from that node to other vertices of the graph. The total weight of the path will be the sum of the weights of the edges. Graphs can be u...
An inspection method based on binary image processing technique has been developed in an effort t... more An inspection method based on binary image processing technique has been developed in an effort to obtain lousiness profile of silk fabric. The image data are used in the mathematical morphology and the back propagation neural network (BPNN) for evaluation. Maximum ...
International Journal of Computer Science and Mobile Computing
Insertion and deletion in linked lists. Linked lists are an example of linear data structures. Th... more Insertion and deletion in linked lists. Linked lists are an example of linear data structures. They are made up of nodes which are connected to each other. The data can be accessed by sequential manner. In this paper we will create an abstract model of linked list where the creation of a linked list of n nodes will take a time complexity of O(n) and the insertion and deletion will take a time complexity of O(1) or constant time at the tail position and head position and also reduce the runtime of insertion and deletion at middle or any index in between to some extent. This abstract model of the linked list can also be used as a stack and a queue because it will contain all properties of stack and queue data structures.
Data is the new fuel. With the expansion of the global technology, the in-creasing standards of l... more Data is the new fuel. With the expansion of the global technology, the in-creasing standards of living and with modernization, data values have caught a great height. Now a days, nearly all top MNCs feed on data. Now, to store all this data is a prime concern for all of them, which is relieved by the Data Structures, the systematic way of storing data. Now, once these data are stored and charged in secure vaults, it’s time to utilize them in the most efficient way. Now, there are a lot of operations that needs to be performed on these massive chunks of data, like searching, sorting, inserting, deleting, merging and so more. In this paper, we would be comparing all the major sorting algorithms that have prevailed till date. Further, work have been done and an inequality in dimension of time between the four Sorting algorithms, Bubble, Selection, Insertion, Merge, that have been discussed in the paper have been proposed.
International Journal of Computer Science and Mobile Computing, 2022
Data is the new fuel. With the expansion of the global technology, the increasing standards of li... more Data is the new fuel. With the expansion of the global technology, the increasing standards of living and with modernization, data values have caught a great height. Now a days, nearly all top MNCs feed on data. Now, to store all this data is a prime concern for all of them, which is relieved by the Data Structures, the systematic way of storing data. Now, once these data are stored and charged in secure vaults, it's time to utilize them in the most efficient way. Now, there are a lot of operations that needs to be performed on these massive chunks of data, like searching, sorting, inserting, deleting, merging and so more. In this paper, we would be comparing all the major sorting algorithms that have prevailed till date. Further, work have been done and an inequality in dimension of time between the four Sorting algorithms, Bubble, Selection, Insertion, Merge, that have been discussed in the paper have been proposed.
International Journal of Computer Science and Mobile Computing, 2022
Data is the new fuel. With the expansion of the global technology, the in-creasing standards of l... more Data is the new fuel. With the expansion of the global technology, the in-creasing standards of living and with modernization, data values have caught a great height. Now a days, nearly all top MNCs feed on data. Now, to store all this data is a prime concern for all of them, which is relieved by the Data Structures, the systematic way of storing data. Now, once these data are stored and charged in secure vaults, it’s time to utilize them in the most efficient way. Now, there are a lot of operations that needs to be performed on these massive chunks of data, like searching, sorting, inserting, deleting, merging and so more. In this paper, we would be comparing all the major sorting algorithms that have prevailed till date. Further, work have been done and an inequality in dimension of time between the four Sorting algorithms, Bubble, Selection, Insertion, Merge, that have been discussed in the paper have been proposed.
International Journal of Computer Science and Mobile Computing
Shortest path algorithm. Graphs are an example of non-linear data structure. A graph is a collect... more Shortest path algorithm. Graphs are an example of non-linear data structure. A graph is a collection of nodes which are connected by edges. The definition of graph G = (V, E) is basically a collection of vertices and edges. Graphs can be classified on the basis of types of edges. Directed graphs have each of the edges directed which means the edges connecting the two nodes defines the way it is connected from and to. On the other side, undirected graphs have edges which have no direction. The edges of a graph have weights which are associated with it. The weight of an edge can be thought as the cost of the edge. Let’s assume there are two vertices representing two cities, then the weight of the edge between the vertices may represent the distance between the cities. Given a given graph and a particular node, we can find a path of least total weight from that node to other vertices of the graph. The total weight of the path will be the sum of the weights of the edges. Graphs can be u...
An inspection method based on binary image processing technique has been developed in an effort t... more An inspection method based on binary image processing technique has been developed in an effort to obtain lousiness profile of silk fabric. The image data are used in the mathematical morphology and the back propagation neural network (BPNN) for evaluation. Maximum ...
International Journal of Computer Science and Mobile Computing
Insertion and deletion in linked lists. Linked lists are an example of linear data structures. Th... more Insertion and deletion in linked lists. Linked lists are an example of linear data structures. They are made up of nodes which are connected to each other. The data can be accessed by sequential manner. In this paper we will create an abstract model of linked list where the creation of a linked list of n nodes will take a time complexity of O(n) and the insertion and deletion will take a time complexity of O(1) or constant time at the tail position and head position and also reduce the runtime of insertion and deletion at middle or any index in between to some extent. This abstract model of the linked list can also be used as a stack and a queue because it will contain all properties of stack and queue data structures.
Data is the new fuel. With the expansion of the global technology, the in-creasing standards of l... more Data is the new fuel. With the expansion of the global technology, the in-creasing standards of living and with modernization, data values have caught a great height. Now a days, nearly all top MNCs feed on data. Now, to store all this data is a prime concern for all of them, which is relieved by the Data Structures, the systematic way of storing data. Now, once these data are stored and charged in secure vaults, it’s time to utilize them in the most efficient way. Now, there are a lot of operations that needs to be performed on these massive chunks of data, like searching, sorting, inserting, deleting, merging and so more. In this paper, we would be comparing all the major sorting algorithms that have prevailed till date. Further, work have been done and an inequality in dimension of time between the four Sorting algorithms, Bubble, Selection, Insertion, Merge, that have been discussed in the paper have been proposed.
International Journal of Computer Science and Mobile Computing, 2022
Data is the new fuel. With the expansion of the global technology, the increasing standards of li... more Data is the new fuel. With the expansion of the global technology, the increasing standards of living and with modernization, data values have caught a great height. Now a days, nearly all top MNCs feed on data. Now, to store all this data is a prime concern for all of them, which is relieved by the Data Structures, the systematic way of storing data. Now, once these data are stored and charged in secure vaults, it's time to utilize them in the most efficient way. Now, there are a lot of operations that needs to be performed on these massive chunks of data, like searching, sorting, inserting, deleting, merging and so more. In this paper, we would be comparing all the major sorting algorithms that have prevailed till date. Further, work have been done and an inequality in dimension of time between the four Sorting algorithms, Bubble, Selection, Insertion, Merge, that have been discussed in the paper have been proposed.
Uploads
Papers by pijush kumar