Scribd
Upload
17 views2 pages

Data Structures, SQL, and OOP Concepts

The document outlines key concepts in Data Structures and Algorithms (DSA), SQL, and Object-Oriented Programming (OOP). It covers topics such as types of data structures, sorting algorithms, SQL properties, and OOP principles like inheritance and access modifiers. Each section poses questions that highlight important theoretical and practical aspects of these programming paradigms.

Uploaded by

vylavoly
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
17 views2 pages

Data Structures, SQL, and OOP Concepts

The document outlines key concepts in Data Structures and Algorithms (DSA), SQL, and Object-Oriented Programming (OOP). It covers topics such as types of data structures, sorting algorithms, SQL properties, and OOP principles like inheritance and access modifiers. Each section poses questions that highlight important theoretical and practical aspects of these programming paradigms.

Uploaded by

vylavoly
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

DSA:

● Linear vs Non-Linear Data-Structures


● What is Contagious Memory? And which data structures are implemented on it.
● What is Peek operation in Stack?
● Which we will prefer Array or LinkedList for insert and search operation?.Explain
● What are AVL and BST Trees?
● In which scenarios DFS is not a good approach
● Different types of Linked List.
● From which end do we insert and delete in both queues and stacks?
● Why Hashing is preferred and what are its disadvantages?
● What sorting algorithm do you prefer and why?
● Which data structures can be used to implement stack and queues?
● Which Data structure do we use in BFS and DFS and why?
● How will you find a central node in a linked list in O(n) time complexity?
● What are in place algorithms? Give some examples
● What is dynamic programming and its difference with Divide and Conquer Approach?
● Different types of algorithms.
● Construction and Deletion in Heaps.
● What is the best sorting algorithm in time complexity? Explain it.

SQL:

● Difference between SQL and NoSQL Databases


● What are Acid Properties
● What are indexes and what are their different types?
● Different types of Aggregate Functions.
● Difference between Having and Where
● What are correlated subqueries and how do they differ from simple subqueries
● What are limit and offset keywords?
● What are stored procedures and Triggers?
● What are different types of anomalies and how do we avoid them?
● Explain Normalization types.
● Minus Operation in SQL.
● Why do we use subqueries rather than using Joins
● Any idea about Cube and Rollup?
● What is Full Outer Join?
● What is the Like keyword used for?
● Disadvantages of Indexing
● Create an ERD (given scenario)
● Write subquery (given scenario)

OOP:

● What are Pillars of OOP?


● What are members of the Class?
● What is Dangling Pointer?
● Association relationships and its types?
● What is Multiple Inheritance?
● What is Diamond Problem and describe its solution?
● What are Deconstructors ?
● Friends concept in OOP
● Can we access protected members of the parent class from another package in a
subclass of another package?
● What is Down Casting vs Up Casting?
● What is implicit and explicit typecasting?
● What are default access modifiers in Interaface?
● What are concrete functions and in which pillar we cant create them
● What are pure virtual functions and what does the virtual keyword represents?
● What if the subclass of the abstract class has not driven all methods of a parent abstract
class. Can we create an object of this subclass?
● What is Operator Overloading?
● What is late and early binding? And what are its different names?
● Describe different access modifiers and their scope?

You might also like