Data Structure: Basics - Online Test
Test Difficulty Level: Medium
Syllabus of Test
Sample Question from this online test:
Question: Which one is not divide and conquer algorithm
Option A: Merge sort
Option B: Quick sort
Option C: Heap sort
Option D: None of the above
To answer, click the "Start This Test" button below.
Start this Test
Related Online Tests:
Comments
![]() | divyesh dwivedi on 2009-03-16 16:32:29 wrote, Its a very good online test as per as BASICS of DS is concerned. But the level of questions is EASY. It should be at TYPICAL Level if one should go for a PSU Exam. I point I also want to add that the total number of question it contains does not cover the whole topics of Data Structure. Well its a nice stuff for Begineers and to Boost the confidence level. |
![]() | Prashant Gaur on 2009-03-16 16:42:11 wrote, @divyesh dwivedi, |
![]() | Rahul jha on 2009-08-25 09:42:22 wrote, stack and quee are liniear data structure... |
![]() | bharadwaj a.s.n.s on 2009-09-13 04:43:44 wrote, its a vesy good inline test. but the stacks and queues are linear linked lists I think so. So, please check wether my answer for the 12th question is correct or not. |
![]() | janardhan reddy on 2009-11-08 17:18:35 wrote, stack&queue are linear data structures..... |
![]() | Swati Gangwani on 2009-11-11 07:12:06 wrote, stack and queues are linear data structures....please consult it |
![]() | mayank singh on 2010-02-17 12:24:01 wrote, some answers are incorrect |
![]() | Neeraj Kumar Pandey on 2010-08-20 04:02:08 wrote, Its a very good online test as per as BASICS of DS is concerned. But the level of questions is EASY. It should be at TYPICAL Level if one should go for a PSU Exam. I point I also want to add that the total number of question it contains does not cover the whole topics of Data Structure. Well its a nice stuff for Begineers and to Boost the confidence level. |
![]() | aditya awasthi on 2010-10-06 00:29:15 wrote, A Table ts always a two dimensional array of same data type--->Option A: TrueStacks and queues are Option B: Non-primitive data structures |
![]() | vikash lohiya on 2010-11-18 01:43:29 wrote, stack and queue are linear data structure.please check it. |
![]() | anil gagan1 on 2010-11-18 01:49:22 wrote, ok |
![]() | asheesh kumar singh on 2010-12-07 08:29:02 wrote, some ansswers are wrong in this.... |
![]() | rakesh prasad on 2011-01-31 21:53:48 wrote, A bit logical..it was.. |
![]() | rani mehta on 2011-02-04 04:52:29 wrote, stacks and queues are linear and non-primitive data structures |
![]() | vipin verma on 2011-02-17 22:10:34 wrote, very good test--------- |
![]() | mrityunjay singh on 2011-02-18 01:35:45 wrote, bahut maza aaya |
![]() | yashi chauhan on 2011-02-21 13:51:34 wrote, stacks and queue are non primitive linear data structures |
![]() | yashi chauhan on 2011-02-21 13:51:36 wrote, stacks and queue are non primitive linear data structures |
![]() | preethi selvakumar on 2011-03-05 15:37:59 wrote, basics help a lot 2 recall |
![]() | pushpendra kuntal on 2011-03-14 05:26:07 wrote, It was good...but very less number of questions... We shoild have atleast 100 question to attempt if we really want to learn something or want to check out perfrmance... |
![]() | ganesh pahade on 2011-04-13 14:05:44 wrote, i like this qustion tub some qustion are not understand and i am not the carrect answer so i will be trying to this qustion crecked..thanks |
![]() | vickal gupta on 2011-04-15 06:21:50 wrote, its good but there is some incorrect ans. |
![]() | tushar joshi on 2011-04-21 04:29:00 wrote, data structure test is good |
![]() | prathap dudvat on 2011-04-24 11:32:46 wrote, question 12 stack and queue are linear datastructure |
![]() | indira priyadharsini on 2011-05-20 01:15:10 wrote, its a very useful for beginners. |
![]() | masthanaiah masthanaiah on 2011-06-06 04:31:38 wrote, it's verry good |
![]() | jaya talreja on 2011-06-11 00:23:00 wrote, heyy.. Ques 2. ans will be false b'coz indore traversal gives the elements in ascending order and not descending order in BST. |
![]() | jaya talreja on 2011-06-11 00:23:28 wrote, heyy.. Ques 2. ans will be false b'coz inorder traversal gives the elements in ascending order and not descending order in BST. |
![]() | swopna soundar on 2011-06-11 05:20:15 wrote, very good test. |
![]() | Rahul jain on 2011-06-12 04:45:32 wrote, This is a good test for learning |
![]() | praveen kumar on 2011-06-13 03:27:33 wrote, worst test which is not helpful |
![]() | mohammad Shaidhoom on 2011-06-13 06:12:40 wrote, Its Great to Improve Technical Knowledge On Data Structures ... |
![]() | Datastructure r on 2011-06-13 06:27:18 wrote, K |
![]() | nagesh bandi on 2011-06-14 04:48:42 wrote, hiiiiiiiii........... |
![]() | sukanya cu on 2011-06-15 09:18:09 wrote, very nice test.helps to improve the knowledge about data structure. |
![]() | harshit omar on 2011-06-19 06:46:21 wrote, i topped in it |
![]() | Sweety Agrawal on 2011-06-21 08:29:19 wrote, Some answers are incorrect. Pls. check them. |
![]() | sharwan saini on 2011-06-21 12:05:22 wrote, check questions............dude,, |
![]() | tushar joshi on 2011-07-02 03:56:43 wrote, it very easy |
![]() | tushar joshi on 2011-07-02 03:59:39 wrote, very good |
![]() | tushar joshi on 2011-07-07 06:01:47 wrote, it is very helpful |
![]() | tushar joshi on 2011-07-16 06:06:11 wrote, good |
![]() | Raja Gopal on 2011-07-16 06:33:23 wrote, its awesome;-) |
![]() | tushar joshi on 2011-07-20 01:20:21 wrote, good |
![]() | pusp joshi on 2011-07-20 04:56:37 wrote, Nice test thanks |
![]() | GANESH ANNAMALAI on 2011-07-20 13:07:26 wrote, basically fine |
![]() | Pass W on 2011-07-24 07:11:32 wrote, Check out the answers, I think some are wrong |
![]() | Atul Badjatya on 2011-08-02 01:39:19 wrote, GOOD ONE...THNXX |
![]() | happy tandan on 2011-08-03 04:28:30 wrote, ITS INTERESTING BUDDY |
![]() | KHUSHI MATHUR on 2011-08-09 07:35:41 wrote, GUD QUESTIONS...!!! |
![]() | sanjay bajaj on 2011-08-12 04:19:38 wrote, stack and quee are liniear data structure. |
![]() | tushar joshi on 2011-08-26 04:38:05 wrote, very good |
![]() | Amrit Singh on 2011-10-07 11:21:12 wrote, nice test for DS beginners |
![]() | dharmendra sharma on 2011-10-10 23:40:37 wrote, superb bro....... |
![]() | swathi kulasekar on 2011-11-01 03:50:18 wrote, nice:-) |
![]() | tushar joshi on 2011-11-09 00:13:14 wrote, good |
![]() | geetam jain on 2011-12-04 06:55:52 wrote, nice |
![]() | geetam jain on 2011-12-04 06:55:53 wrote, nice |
![]() | geetam jain on 2011-12-04 06:55:56 wrote, nice |
![]() | piyush dubey on 2011-12-11 22:10:13 wrote, qusestion tuff diya karo |
![]() | sanjay choudhary on 2012-01-02 23:25:11 wrote, me always frist in this exam |
![]() | Lokesh Kumar on 2012-01-19 11:05:08 wrote, inorder traversal of a bst gives no's in ascending order not in descending so ans for Q 2 is wrong and also a constructor is for initialization of variables in a class ... not 4 creating an object..!! |
![]() | Amit kumar Daksh on 2012-01-20 08:19:27 wrote, Good |
![]() | Yogita Ghotkar on 2012-03-04 20:54:13 wrote, Nice questions. |
![]() | Saqib Ali on 2012-03-05 01:28:22 wrote, nice question..... |
![]() | Chowdary Naveen on 2012-03-12 03:49:28 wrote, good documentation and presentation, provide a back button similar to NEXT |
![]() | Santosh Sunagar on 2012-04-10 04:25:21 wrote, good |
![]() | prateek KAPOOR on 2012-04-12 04:54:58 wrote, An inorder traversal of BST always visits keys in ascending order. |
![]() | WAHAB UDDIN ABBASI on 2012-05-06 11:15:11 wrote, Some answers are wrong............i.e. u need to check ur answers |









