.
  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 » Texas Placement Papers » Texas Previous Year Placement Paper

 

Texas Placement Paper -: DATA STRUCTURES Questions And Answers


Advertisements
Advertisements




Texas Previous Years Solved Sample Placement Papers

  1. Pointer = new type[number_of_elements] is syntax for:

    A: Pointer declaration

    B: Allocate memory for a single element

    C: Allocate memory for a block of elements

    D: Structure

    Ans: C
  2. In which data structure is each node connected to several other nodes?

    A: Non-linear

    B: Linear

    C: Stack

    D: Queue

    Ans: A
  3. Which data structure represents a hierarchical relationship?

    A: Non-linear

    B: Linear

    C: Stack

    D: Queue

    Ans: A
  4. Each node in a tree has a child node:

    A: Zero

    B: More

    C: Both A and B

    D: No

    Ans: C
  5. The condition top=n-1 in stack indicates

    a) stack is full

    b) stack has one element

    c) stack underflow

    d) stack is empty

    Answer: a) stack is full
  6. In which data structure addition of new element and removal of element takes place at different end

    a) non linear

    b) linear

    c) stack

    d) queue

    Answer: d) queue
  7. In Queue items are inserted at end

    a) Top

    b) front

    c) rear

    d) bottom

    Answer: c) rear
  8. In queue items are removed at end

    a) Top

    b) front

    c) rear

    d) bottom

    Answer: b) front
  9. In queue we remove the element which is

    a) least recently added

    b) most recently added

    c) both a and b

    d) none

    Answer: a) least recently added
  10. Queue is also called as

    a) last in first out

    b) first in last out

    c) first in first out

    d) first in first in

    Answer: c) first in first out
  11. In queue which operation is generally called as push

    a) enqueue

    b) dequeue

    c) push

    d) pop

    Answer: a) enqueue
  12. Consider the following class definitions:

        class a {
        };
        class b : protected a {
        };
        

    What happens when we try to compile this class?

    A: Will not compile because the class body of a is not defined.

    B: Will not compile because the class body of b is not defined.

    C: Will not compile because class a is not publicly inherited.

    D: Will compile successfully.

    Ans: D
  13. Which of the following statements are true in C++?

    A: Classes cannot have data as public members.

    B: Structures cannot have functions as members.

    C: Class members are public by default.

    D: None of these.

    Ans: B
  14. Why is the implementation of stack operations on queues not feasible for a large dataset (Assume the number of elements in the stack to be n)?

    A) Because of its time complexity O(n) (Ans)

    B) Because of its time complexity O(log(n))

    C) Extra memory is not required

    D) There are no problems

  15. Consider yourself to be on a planet where the computational power of chips is slow. You have an array of size 10. You want to enqueue some elements into this array. Push and pop operations both take 1 second respectively. The total time required to perform an enqueue operation is:

    A) 20

    B) 40

    C) 42

    D) 43 (Ans)

  16. Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?

    a) Operand is always placed in the output

    b) Operator is placed in the stack when the stack operator has lower precedence

    c) Parenthesis are included in the output

    d) Higher and equal priority operators follow the same condition

    Answer: c

    Explanation: Parentheses are not included in the output. They are placed in the operator stack and then discarded.

  17. In infix to postfix conversion algorithm, the operators are associated from?

    a) Right to left

    b) Left to right

    c) Centre to left

    d) Centre to right

    Answer: b

    Explanation: In infix, prefix and postfix expressions, the operators are associated from left to right.




 


.

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