.
  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 STRUCTURES Questions And Answers


Advertisements
Advertisements




Mascot Previous Years Solved Sample Placement Papers

  1. is a set of vertices and edges

    a) tree

    b) graph

    c) queue

    d) stack

    Answer: b) graph
  2. Which node is farthest node from root node

    a) child node

    b) top node

    c) leaf node

    d) middle node

    Answer: c) leaf node
  3. list in linked list contains unused nodes

    a) Avail

    b) head

    c) null

    d) start

    Answer: a) Avail
  4. Dynamic memory is allocated using operator

    a) create

    b) null

    c) new

    d) pointer

    Answer: c) new
  5. In which linked list it is not possible to access preceding nodes

    a) singly

    b) doubly

    c) circular

    d) all of these

    Answer: a) singly
  6. A text can be reversed using

    a) tree

    b) graph

    c) queue

    d) stack

    Answer: d) stack
  7. The root node in a tree is at position:

    A: Top

    B: Bottom

    C: Middle

    D: Right

    Ans: A
  8. From which node do all operations commence in a tree?

    A: Leaf

    B: Child

    C: Root

    D: Internal

    Ans: C
  9. The edges in a graph having directions are called:

    A: Undirected graph

    B: Arcs

    C: Digraph

    D: All of the above

    Ans: C
  10. Prefix expression of (A + B) * (C + D) is:

    A: *+AB+CD

    B: +AB*+CD

    C: AB+CD+*

    D: +*AB+CD

    Ans: A




 


.

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