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

 

TISL Placement Paper -: DATA STRUCTURES Questions And Answers


Advertisements
Advertisements




TISL Previous Years Solved Sample Placement Papers

  1. Example for infix expression

    a) +ab

    b) a+b

    c) ab+

    d) none

    Answer: b) a+b
  2. The condition top=-1 in stack indicates

    a) stack is full

    b) stack has one element

    c) stack overflow

    d) stack is empty

    Answer: d) stack is empty
  3. What would be the Prefix notation for the given equation? (A*B)+(C*D)
    (a) +*AB*CD
    (b) *+AB*CD
    (c) **AB+CD
    (d) +*BA*CD
    Answer: (a)
    Explanation: Reverse the equation or scan from right to left. Apply the infix-to-postfix algorithm. Brackets evaluate to DC* and BA*, resulting in +*AB*CD after reversal.

  4. What would be the Prefix notation for the given equation? A+B*C^D
    (a) +A*B^CD
    (b) +A^B*CD
    (c) *A+B^CD
    (d) ^A*B+CD
    Answer: (a)
    Explanation: Reverse the equation or scan from right to left. Apply the infix-to-prefix algorithm. The order of precedence is +* and ^. The reversed expression evaluates to +A*B^CD.

  5. Out of the following operators (^, *, +, &, $), the one having the highest priority is?
    (a) +
    (b) $
    (c) ^
    (d) &
    Answer: (c)
    Explanation: According to the infix-to-prefix algorithm, exponentiation (^) has the highest priority among the given operators.

  6. Out of the following operators (|, *, +, &, $), the one having the lowest priority is?
    (a) +
    (b) $
    (c) |
    (d) &
    Answer: (c)
    Explanation: Logical OR (|) has the lowest precedence among the given operators, as defined in the infix-to-prefix algorithm.

  7. The process of copying data from a memory location is called?

    A) reading (Ans)

    B) writing

    C) controlling

    D) booting

  8. A list of instructions used by a computer is called?

    A) program (Ans)

    B) CPU

    C) text

    D) output

  9. The CPU consists of?

    A) input, output and processing

    B) control unit, primary storage and secondary storage

    C) control unit, arithmetic logic unit and primary storage (Ans)

    D) input, processing and storage

  10. Which of the following is true about primary storage?

    A) It is a part of the CPU

    B) It allows very fast access to data

    C) It is relatively more expensive

    D) all of the above (Ans)

  11. Linked list is considered as an example of ___________ type of memory allocation.

    a) Dynamic

    b) Static

    c) Compile time

    d) Heap

    Answer: a

    Explanation: As memory is allocated at the run time.

  12. In Linked List implementation, a node carries information regarding ___________

    a) Data

    b) Link

    c) Data and Link

    d) Node

    Answer: b

    Explanation: A linked list is a collection of objects linked together by references from an object to another object. By convention these objects are named as nodes. Linked list consists of nodes where each node contains one or more data fields and a reference (link) to the next node.

  13. Linked list data structure offers considerable saving in _____________

    a) Computational Time

    b) Space Utilization

    c) Space Utilization and Computational Time

    d) Speed Utilization

    Answer: c

    Explanation: Linked lists save both space and time.

  14. Which of the following points is/are not true about Linked List data structure when it is compared with an array?

    a) Arrays have better cache locality that can make them better in terms of performance

    b) It is easy to insert and delete elements in Linked List

    c) Random access is not allowed in a typical implementation of Linked Lists

    d) Access of elements in linked list takes less time than compared to arrays

    Answer: d

    Explanation: To access an element in a linked list, we need to traverse every element until we reach the desired element. This will take more time than arrays as arrays provide random access to its elements.




 


.

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