The document is a past exam paper for an Advanced Data Structures course. It contains 8 questions related to various data structures and algorithms topics. Students are instructed to answer any 5 of the 8 questions, which are worth 16 marks each. The questions cover topics such as templates, exception handling, linked lists, hash tables, binary search trees, and string matching algorithms.
Building Ontologies from Multiple Information SourcesRaji Ghawi
This is the powerpoint presentation of my paper: "Building Ontologies from Multiple Information Sources", presented at IT2009 conference in Kaunas, Lithuania, 23/04/2009.
Building Ontologies from Multiple Information SourcesRaji Ghawi
This is the powerpoint presentation of my paper: "Building Ontologies from Multiple Information Sources", presented at IT2009 conference in Kaunas, Lithuania, 23/04/2009.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
GridMate - End to end testing is a critical piece to ensure quality and avoid...ThomasParaiso2
End to end testing is a critical piece to ensure quality and avoid regressions. In this session, we share our journey building an E2E testing pipeline for GridMate components (LWC and Aura) using Cypress, JSForce, FakerJS…
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Dr. Sean Tan, Head of Data Science, Changi Airport Group
Discover how Changi Airport Group (CAG) leverages graph technologies and generative AI to revolutionize their search capabilities. This session delves into the unique search needs of CAG’s diverse passengers and customers, showcasing how graph data structures enhance the accuracy and relevance of AI-generated search results, mitigating the risk of “hallucinations” and improving the overall customer journey.
GraphSummit Singapore | The Art of the Possible with Graph - Q2 2024Neo4j
Neha Bajwa, Vice President of Product Marketing, Neo4j
Join us as we explore breakthrough innovations enabled by interconnected data and AI. Discover firsthand how organizations use relationships in data to uncover contextual insights and solve our most pressing challenges – from optimizing supply chains, detecting fraud, and improving customer experiences to accelerating drug discoveries.
Climate Impact of Software Testing at Nordic Testing DaysKari Kakkonen
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
Communications Mining Series - Zero to Hero - Session 1DianaGray10
This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered:
• Communication Mining Overview
• Why is it important?
• How can it help today’s business and the benefits
• Phases in Communication Mining
• Demo on Platform overview
• Q/A
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Maruthi Prithivirajan, Head of ASEAN & IN Solution Architecture, Neo4j
Get an inside look at the latest Neo4j innovations that enable relationship-driven intelligence at scale. Learn more about the newest cloud integrations and product enhancements that make Neo4j an essential choice for developers building apps with interconnected data and generative AI.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfMalak Abu Hammad
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AIVladimir Iglovikov, Ph.D.
Presented by Vladimir Iglovikov:
- https://www.linkedin.com/in/iglovikov/
- https://x.com/viglovikov
- https://www.instagram.com/ternaus/
This presentation delves into the journey of Albumentations.ai, a highly successful open-source library for data augmentation.
Created out of a necessity for superior performance in Kaggle competitions, Albumentations has grown to become a widely used tool among data scientists and machine learning practitioners.
This case study covers various aspects, including:
People: The contributors and community that have supported Albumentations.
Metrics: The success indicators such as downloads, daily active users, GitHub stars, and financial contributions.
Challenges: The hurdles in monetizing open-source projects and measuring user engagement.
Development Practices: Best practices for creating, maintaining, and scaling open-source libraries, including code hygiene, CI/CD, and fast iteration.
Community Building: Strategies for making adoption easy, iterating quickly, and fostering a vibrant, engaged community.
Marketing: Both online and offline marketing tactics, focusing on real, impactful interactions and collaborations.
Mental Health: Maintaining balance and not feeling pressured by user demands.
Key insights include the importance of automation, making the adoption process seamless, and leveraging offline interactions for marketing. The presentation also emphasizes the need for continuous small improvements and building a friendly, inclusive community that contributes to the project's growth.
Vladimir Iglovikov brings his extensive experience as a Kaggle Grandmaster, ex-Staff ML Engineer at Lyft, sharing valuable lessons and practical advice for anyone looking to enhance the adoption of their open-source projects.
Explore more about Albumentations and join the community at:
GitHub: https://github.com/albumentations-team/albumentations
Website: https://albumentations.ai/
LinkedIn: https://www.linkedin.com/company/100504475
Twitter: https://x.com/albumentations
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Ads
1. www.studentyogi.com www.studentyogi.com
Code No: R05210503
Set No. 1
II B.Tech I Semester Supplimentary Examinations, November 2008
ADVANCED DATA STRUCTURE
( Common to Computer Science & Engineering and Electronics &
Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
1. (a) Can you think of a situation where your program would crash without reaching
the breakpoint which you set at the beginning of main()?
(b) When are copy constructors called?
(c) Can a copy constructor accept an object of the same class as parameter,
instead of reference of the object? [5+5+6]
m
2. What is template? Explain about function templates and class templates with
suitable examples. [16]
co
3. (a) What are some ways try / catch / throw can improve software quality?
(b) How can we handle a constructor that fails?
(c) How can we handle a destructor that fails. [5+5+6]
gi.
4. (a) De ne a sparse matrix? Explain its representation? Write the program that
gives the header for the class sparse Matrix which uses row major mapping of
a sparse matrix into an arrayList.
omyo
(b) Write the methods get (theRow, the Column) and set (theRow, theCol-
umn, theValue) for a sparse matrix. [10+6]
5. (a) What is Linear Probing? Write a C++ program that gives the data members
t
and constructors for the hash table class that uses linear probing.
i.cen
(b) Write the C++ program that gives the metho d search of a hash table. [8+8]
6. De ne a Red-Black tree? Write the procedures to perform insertion, deletion in a
Red-Black tree? [16]
otgud
7. (a) Describe deletion operation of a B-tree with an example.
(b) Prove that the height of a red black tree storing n items is O(logn). [8+8]
8. (a) Describe about search engine and inverted les.
nty.s
(b) Explain the main features of Boyer-Moore algorithm. [10+6]
de w
w
1 of 1
stuw
www.studentyogi.com www.studentyogi.com
w.
ww
2. www.studentyogi.com www.studentyogi.com
Code No: R05210503
Set No. 2
II B.Tech I Semester Supplimentary Examinations, November 2008
ADVANCED DATA STRUCTURE
( Common to Computer Science & Engineering and Electronics &
Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
1. (a) What do you mean by Data abstraction?
(b) Di erence between “C structure” and “C++ structure”.
(c) Di rence between a “assignment operator” and a “copy constructor”.
(d) What is the di erence between ‘overloading’ and “overridding”? [4+4+4+4]
m
2. What is template? Explain about function templates and class templates with
suitable examples. [16]
o
3. (a) Explain about the formatted I/O in C++.
(b) Explain about the console I/O in C++. [8+8]
i.c
4. De ne the Abstract data type for Stack. Write a C ++ program to implement
stack ADT using linked list. [16]
class for the dictionary? og
5. (a) What is a dictionary? De ne the abstract data type for it? Write the abstract
(b) Give the applications of dictionary or dictionary with duplicates in which
sequential access is desired. [8+8]
nty
6. De ne a class called binarySearchTree to represent a Binary search tree. Extend
this class by adding a public method outputInRange (Low,High) that outputs,
in ascending order of key, all elements in a binary search tree whose key lies between
Low and High. Use recursion and avoid entering sub trees that cannot possibly
contain any elements with keys in desired range. [16]
de
7. (a) Describe deletion operation of a B-tree with an example.
(b) Prove that the height of a red black tree storing n items is O(logn). [8+8]
stu
8. (a) Explain the boyar Moore algorithm with an example.
(b) What are the advantages and disadvantages of tries with respect to binary
search tree. [10+6]
w.
ww
1 of 1
www.studentyogi.com www.studentyogi.com
3. www.studentyogi.com www.studentyogi.com
Code No: R05210503
Set No. 3
II B.Tech I Semester Supplimentary Examinations, November 2008
ADVANCED DATA STRUCTURE
( Common to Computer Science & Engineering and Electronics &
Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
1. (a) What is a friend function? Explain the advantages and disadvantages of it?
(b) What is static member function? Explain it’s limitations. [8+8]
2. (a) What is Hybrid inheritance? Write a program to illustrate the concept of
Hybrid Inheritance.
(b) What is single inheritance? Write a program to illustrate the concept of single
m
Inheritance. [8+8]
3. (a) Explain about try, catch, throw keywords in C++?
o
(b) Write a program to illustrate the exception handling mechanism in C++.
[8+8]
i.c
4. What is a linked list / chain.. Write the program which gives the constructor and
destructor for . [16]
5. Develop a class for hash table using linear probing and neverUsed concept to handle
og
an erase operation. Write complete C++ code for all the methods. Include a
method to reorganize the table when (say) 60% of the empty buckets have never
used equal to false. The reorganization should move pairs around as necessary and
leave a properly con gured hash table in which neverUsed is true for every empty
nty
bucket. [16]
6. (a) What is a Binary search tree? De ne a C++ abstract class that corresponds
to this ADT.
(b) Write a method to search for an element of a Binary Search Tree? What is
de
its time complexity? [8+8]
7. (a) Write deletion algorithm of red black tree.
(b) Describe the operations of Splay tree. [8+8]
stu
8. Give the fail indexes used by the KMP algorithm for the following patterns.
(a) AAAB
(b) AABAACAABABA
(c) ABRACADABRA
w.
(d) ASTRACASTRA. [16]
ww
1 of 1
www.studentyogi.com www.studentyogi.com
4. www.studentyogi.com www.studentyogi.com
Code No: R05210503
Set No. 4
II B.Tech I Semester Supplimentary Examinations, November 2008
ADVANCED DATA STRUCTURE
( Common to Computer Science & Engineering and Electronics &
Computer Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
1. (a) What do you mean by Stack unwinding?
(b) What is the di erence between const char *myPointer and char *const my
pointer?
(c) De ne precondition and post-condition to a member function.
(d) What are the conditions that have to be met for a condition to be an invariant
m
of the class? [4+4+4+4]
2. What is template? Explain about function templates and class templates with
suitable examples. [16]
o
3. Create a program that opens a le (the rst argument on the command line) and
i.c
searches it for any one of a set of words (the remaining arguments on the command
line). Read the input a line at a time, and print out the lines (with line numbers)
that match. [16]
4. (a) Write the program which gives the Destructor for list/chain.
list/chain.
og
(b) Write a metho d to return the index of the rst o ccurrence of an element in a
[8+8]
5. (a) What is a dictionary? De ne the abstract data type for it? Write the abstract
nty
class for the dictionary?
(b) Give the applications of dictionary or dictionary with duplicates in which
sequential access is desired. [8+8]
6. (a) Explain about the LLr, LRr, LLb, LRb imbalances in a Red-Black tree with
de
example?
(b) Draw the sequence of rotations required to perform a single right rotation and
a double LR rotation in an AVL tree? [8+8]
7. (a) Write pseudo code procedure for insert operations in a red-black tree.
stu
(b) Write an algorithm for visualization of a key insertion algorithm in a B-tree.
[8+8]
8. (a) Write an algorithm for deleting a string from a compressed trie and also ana-
w.
lyze its complexity.
(b) Describe the characteristics of Boyer-Moore algorithm. [10+6]
ww
1 of 1
www.studentyogi.com www.studentyogi.com