I have studied data structure and algorithms in C . but i have to know 1 OOP language ... i know the basic in java , so can i start attempting the competitive coding questions in java , or again i have to learn all data structures and algorithms part from java start from beginning..?
Hi there,
As you have mentioned that you have studied data structures and algorithms in c language. See, to be honest c language is the foundational language for any programming language. Also you have mentioned that you know Java language, then for sure go for it. Eventually it will help you in getting good understanding and also Java is very much in demand these days so definitely go for it. It will help you for sure.
Donot directly jump into competitive programming first learn basics of daallsa and improve your concepts while learnig and solving problems.
Hope this answer will helpyou.
Thank you:)
which one is better site to learn programming data structures and algorithms for engineering graduate pursuing student.
Hi there,
Programming and DSA are one of those things that will let you become a nice engineer. Sice both of these things are the most crucial in for getting a decent job it is must to have a strong grip over them. Talking about which platform will be better for you to learn DSA nad Programming but it is you who has to learn . No course guarantees full assurance of understanding each topic in the programming.
There are a lot of courses that you can follow to become a proficient coder. Several sites such as coursera, YouTube, Udemy and geeks for geeks.
Once you learn the concepts after that you practise various questions related to the topics you have learnt.
For udemy j would prefer you to go for Abdul bari courses for DSA. it is kne of the best courses on DSA ever made.
Hope this information helps you.
Thank you and good luck:)
heap in data structures and algorithms
Dear,
A heap is a complete binary tree, and the binary tree is a tree in which the node can have utmost two children. Before knowing more about the heap data structure, you should know about the complete binary tree. A complete binary tree is a binary tree in which all the levels except the last level, i.e., leaf node should be completely filled, and all the nodes should be left-justified. There are two types of the heap:
- Min Heap
- Max heap
The value of the parent node should be less than or equal to either of its children. In other words, the min-heap can be defined as, for every node i, the value of node i is greater than or equal to its parent value except the root node. Mathematically, it can be defined as:
A[Parent(i)] <= A[i]
A heap is a tree-based data structure in which all the nodes of the tree are in a specific order. You can read certain articles on GeeksForGeeks for better understanding.
Hope this helps!
hashimg in data structures and algorithms
Hashing is the process of mapping large amount of data item to smaller table with the help of hashing function(A fixed process converts a key to a hash key is known as a hash function).Hashing is also known as Hashing algorithm or message digest function.It is a technique to convert a range of key values into a range of indexes of an array.It is used to facilitate the next level searching method when compared with the linear or binary search.Hashing allows to update and retrieve any data entry in a constant time O(1).Constant time O(1) means the operation does not depend on the size of the data.Hasing is used with database to enable items to be retrieved more quickly.It is used in the encryption and decryption of digital signatures.
mtarix in data structures and algorithms
Matrix is a way to store data in an organized form in the form of rows and columns.Mtrices are usually used in computer graphics to project 3 dimensional space onto a 2 dimensional screen.Matrices in the form of arrays are used to store data in an organized form.A matrix is a representation of certain rows and columns,to persist homogeneous data.It can also be called as double dimensioned array.The uses of matrix are to represent class hierarchy using Boolean square matrix,for data encryption and decryption,To represent traffic flow and plumbing in a network,to implement graph theory of node representation.
graphs in data structures and algorithms
A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph.Graphs are used to solve many real-life problems. Graphs are used to represent networks. The networks may include paths in a city or telephone network or circuit network. Graphs are also used in social networks like linkedIn, Facebook. For example, in Facebook, each person is represented with a vertex(or node). Each node is a structure and contains information like person id, name, gender, locale etc.
trees in data structures and algorithms
In computer science, a tree is a widely used abstract data type that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes. A tree data structure can be defined recursively as a collection of nodes (starting at a root node), where each node is a data structure consisting of a value, together with a list of references to nodes (the "children"), with the constraints that no reference is duplicated, and none points to the root. Alternatively, a tree can be defined abstractly as a whole (globally) as an ordered tree, with a value assigned to each node. Both these perspectives are useful: while a tree can be analyzed mathematically as a whole, when actually represented as a data structure it is usually represented and worked with separately by node (rather than as a set of nodes and an adjacency list of edges between nodes, as one may represent a digraph, for instance). For example, looking at a tree as a whole, one can talk about "the parent node" of a given node, but in general, as a data structure, a given node only contains the list of its children but does not contain a reference to its parent (if any).
Hello Everyone I am a first year B.Sc Mathematical Sciences student from Du. Should I learn Data Structures and Algorithms and Competitive programming. Bcz I want to become Data Scientist but wants a job after graduation also. So , Please tell me what to do ?
Hi Aspirant,
BSc in Mathematical Science is a great step for your journey as Data Scientist.It will also be a great step to learn Data Structures and do competitive programming. Now keeping it short let me tell what is needed to be a Data Scientist:
Data Scientist = Mathematics + Statistics + Programming language + Machine Learning and AI + Analytical Skills.
And for jobs in the current scenario, a lot of software engineers and mathematicians have self-taught themselves to fit into the role of data scientist. Many companies including big firms and startups are coming up with the openings of data science, and this seems to be the right time to dive into the field.
For more information on Data scientist, you can refer the link below
https://www.careers360.com/careers/data-scientist
Hope this helps.
Good luck!!!
What is the difference between Bsc data science and BSc IT (data science) in terms of curriculum? Which is more useful?
So you can have a rough idea about the two courses but which one is better is something only you can decide as you will know better which subject interests you more.