Sign up now
to enroll in courses, follow best educators, interact with the community and track your progress.
Download
Data Structures : PYQ (in Hindi)
53 plays

More
In this lesson , I have discussed DSSSB Computer Teacher - Subject - wise Previous Year Questions With Detailed Analysis.

Sweta Kumari
YouTuber (channel : GATE NoteBook) | Verified Educator | 2+ year Online Teaching Experience

Unacademy user
copied all notes from lakshmikant...we cannot note this ramayana
  1. educator 017 Sweta Kuma INDIA'S LARGEST LEARNING PLATFORM unacademy un academy Sweta Kuman 7


  2. ABOUT ME Sweta Kumari Done B.TECH (CSE) From GGSIPUI Software Engineer | Online Educator at Unacademy for Empowering Technical Programming in Students Sweta Kumari Unscademy Top Educator 2017 Sweta Kumari top educator Learning is Earning - The more you learn, The more you Earn. 2017 FOLLOW M FOLLhtips:/unacademy.com/user/hellosonu


  3. DSSSB COMPUTER TEACHER PREVIOUS YEAR PAPER COMPUTER ORGANIZATION & ARCHITECTURE, 0 92 0s SYLLABUS DATABASE, OPERATING SYSTEM DATA STRUCTURES, COMPUTER NETWORK 7


  4. DATA STRUCTURES PREVIOUS YEAR PAPER 09 7


  5. 1. Which of the following correctly declares an array? A. int anarray[10]; B. int anarray; C. anarrayf10); D. array anarray[10]; 7


  6. DECLARATION data_type array_name[array_size]; 7


  7. 2. What is the index number of the last element of an array with 29 elements? A. 29 B. 28 C. Programmer-defined D. 0 7


  8. 3.Which of the following accesses the seventh element stored in array? A. array[6]; B. array[7]; C. array(7); D. D. array; 7


  9. 4. What is a array? A. An array is a series of elements of the same type in contiguous memory locations B. An array is a series of element C. An array is a series of elements of the same type placed in non- contiguous memory location:s D. None of the mentioned 7


  10. 5. Which of the following operations is performed more efficiently by doubly linked list than by singly linked list? a) Deleting a node whose location in given b) Searching of an unsorted list for a given item c) Inverting a node after the node with given location d) Traversing a list to process each node 7


  11. 7. In doubly linked lists, traversal can be performed? a) Only in forward direction b) Only in reverse direction c) In both directions d) None 7


  12. Which Quick Sort, Heap Sort etc., can be made stable by also taking the position of the elements into consideration. This change may be done in a way which does not compromise a lot on the performance and takes some extra space, possibly sorting algorithms are unstable? 7


  13. RATE REVIEW Loved it Liked it It was ok ! Disliked it Hated it FOLLOW COMMENT COMMENTS RECOMMEND


  14. DATA STRUCTURES PREVIOUS YEAR PAPER 09 7


  15. educator 017 Sweta Kuma INDIA'S LARGEST LEARNING PLATFORM unacademy un academy Sweta Kuman 7