.
  Vyom World.com . Let's Touch the Sky Together!  
.

Home
VyomWorld.com Home
Interview Questions
VyomLinks.com Home
JobsAssist.com Home
Vyom Network
Contact Us
Jobs & Careers
Resume Submitter
Placement Papers
IT Companies Directory
Computer Jobs
Interview Questions
Online Exams
Vyom Career eMag.
Fun
Send FREE SMS!
SMS Jokes
Source Codes Library
Source Codes Home
ASP Source Codes
C Source Codes
C++ Source Codes
COBOL Source Codes
Java Source Codes
Pascal Source Codes
Submit Source Codes
GATE
GATE an Overview
GATE Preparation
Study Materal
GRE
GRE an Overview
GRE Questions
GRE Preparation
GRE Universities
TOEFL Preparation
TOEFL Resources
GMAT Preparation
GMAT Resources
MBA Preparation
MBA Resources
Networking Concepts
Networking Concepts
Testing Preparation
Testing Resources
Webmasters
Free Traffic Builder
Webmaster Articles
Web Hosting
Tutorials
Hardware Tutorial
1500 Free eBooks New!


Home » Placement Papers » Mascot Placement Papers » Mascot Previous Year Placement Paper

 

Mascot Placement Paper -: Data Structure Questions And Answers


Advertisements
Advertisements




Mascot Previous Years Solved Sample Placement Papers

  1. Minimum number of fields in each node of a doubly linked list is ____

    a) 2

    b) 3

    c) 4

    d) None of the above

    Answer: b) 3
  2. A graph in which all vertices have equal degree is known as ____

    a) Complete graph

    b) Regular graph

    c) Multi graph

    d) Simple graph

    Answer: a) Complete graph
  3. A vertex of in-degree zero in a directed graph is called a/an ____

    a) Root vertex

    b) Isolated vertex

    c) Sink

    d) Articulation point

    Answer: c) Sink
  4. A graph is a tree if and only if graph is ____

    a) Directed graph

    b) Contains no cycles

    c) Planar

    d) Completely connected

    Answer: b) Contains no cycles
  5. The elements of a linked list are stored ____

    a) In a structure

    b) In an array

    c) Anywhere the computer has space for them

    d) In contiguous memory locations

    Answer: c) Anywhere the computer has space for them
  6. A parentheses checker program would be best implemented using ____

    a) List

    b) Queue

    c) Stack

    d) Any of the above

    Answer: c) Stack
  7. To perform level-order traversal on a binary tree, which of the following data structure will be required?

    a) Hash table

    b) Queue

    c) Binary search tree

    d) Stack

    Answer: b) Queue
  8. Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation?

    a) Queue

    b) Linked list

    c) Binary search tree

    d) None of the above

    Answer: d) None of the above
  9. A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child, it will be its left child. Name the tree.

    a) Threaded tree

    b) Complete binary tree

    c) M-way search tree

    d) Full binary tree

    Answer: b) Complete binary tree
  10. Which of the following data structure is more appropriate for implementing quick sort iteratively?

    a) Deque

    b) Queue

    c) Stack

    d) Priority queue

    Answer: c) Stack
  11. The number of edges in a complete graph of n vertices is ____

    a) n(n+1)/2

    b) n(n-1)/2

    c) n²/2

    d) n

    Answer: b) n(n-1)/2
  12. If two trees have the same structure but different node content, then they are called ____

    a) Synonyms trees

    b) Joint trees

    c) Equivalent trees

    d) Similar trees

    Answer: d) Similar trees
  13. A static data member is given a value

    A: Within the class definition

    B: Outside the class definition

    C: When the program is executed

    D: Never

    Ans: D
  14. In a class specifier, data or function designated private are accessible

    A: To any function in the program

    B: Only if you know the password

    C: To member functions of that class

    D: Only to public members of the class

    Ans: C
  15. Which of the statements are true?

    I. Function overloading is done at compile time.

    II. Protected members are accessible to the member of derived class.

    III. A derived class inherits constructors and destructors.

    IV. A friend function can be called like a normal function.

    V. Nested class is a derived class.

    A: I, II, III

    B: II, III, V

    C: III, IV, V

    D: I, II, IV

    Ans: D
  16. Runtime polymorphism is achieved by

    A: Friend function

    B: Virtual function

    C: Operator overloading

    D: Function overloading

    Ans: B
  17. Access to private data

    A: Restricted to methods of the same class

    B: Restricted to methods of other classes

    C: Available to methods of the same class and other classes

    D: Not an issue because the program will not compile

    Ans: B
  18. Additional information sent when an exception is thrown may be placed in

    A: The throw keyword

    B: The function that caused the error

    C: The catch block

    D: An object of the exception class

    Ans: C




 


.

Recently Updated: New Placement Papers added.
Vyom Network : Web Hosting | Dedicated Server | Free SMS, GRE, GMAT, MBA | Online Exams | Freshers Jobs | Software Downloads | Programming & Source Codes | GRE Preparation | Jobs, Discussions | Software Listing | Free eBooks | Free eBooks | Free Business Info | Interview Questions | Free Tutorials | International Business Information | IAS Preparation | Jokes, Songs, Fun | Free Classifieds | Free Recipes | FAQs | Free Downloads | Bangalore Info | Tech Solutions | Project Outsourcing, Web Hosting | GATE Preparation | MBA Preparation | SAP Info | Excellent Mobiles | Software Testing | Interview Questions | Freshers Jobs | Server Insiders | File Extension Directory

Copyright ©2003-2024 Vyom Technosoft Pvt. Ltd., All Rights Reserved. Read our Privacy Policy